|
428
|
1 /* Primitive operations on Lisp data types for XEmacs Lisp interpreter.
|
|
|
2 Copyright (C) 1985, 1986, 1988, 1992, 1993, 1994, 1995
|
|
|
3 Free Software Foundation, Inc.
|
|
793
|
4 Copyright (C) 2000, 2001, 2002 Ben Wing.
|
|
428
|
5
|
|
|
6 This file is part of XEmacs.
|
|
|
7
|
|
|
8 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
9 under the terms of the GNU General Public License as published by the
|
|
|
10 Free Software Foundation; either version 2, or (at your option) any
|
|
|
11 later version.
|
|
|
12
|
|
|
13 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
16 for more details.
|
|
|
17
|
|
|
18 You should have received a copy of the GNU General Public License
|
|
|
19 along with XEmacs; see the file COPYING. If not, write to
|
|
|
20 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
21 Boston, MA 02111-1307, USA. */
|
|
|
22
|
|
|
23 /* Synched up with: Mule 2.0, FSF 19.30. Some of FSF's data.c is in
|
|
|
24 XEmacs' symbols.c. */
|
|
|
25
|
|
|
26 /* This file has been Mule-ized. */
|
|
|
27
|
|
|
28 #include <config.h>
|
|
|
29 #include "lisp.h"
|
|
|
30
|
|
|
31 #include "buffer.h"
|
|
|
32 #include "bytecode.h"
|
|
|
33 #include "syssignal.h"
|
|
771
|
34 #include "sysfloat.h"
|
|
428
|
35
|
|
|
36 Lisp_Object Qnil, Qt, Qquote, Qlambda, Qunbound;
|
|
|
37 Lisp_Object Qerror_conditions, Qerror_message;
|
|
442
|
38 Lisp_Object Qerror, Qquit, Qsyntax_error, Qinvalid_read_syntax;
|
|
563
|
39 Lisp_Object Qlist_formation_error, Qstructure_formation_error;
|
|
442
|
40 Lisp_Object Qmalformed_list, Qmalformed_property_list;
|
|
|
41 Lisp_Object Qcircular_list, Qcircular_property_list;
|
|
563
|
42 Lisp_Object Qinvalid_argument, Qinvalid_constant, Qwrong_type_argument;
|
|
|
43 Lisp_Object Qargs_out_of_range;
|
|
442
|
44 Lisp_Object Qwrong_number_of_arguments, Qinvalid_function, Qno_catch;
|
|
563
|
45 Lisp_Object Qinternal_error, Qinvalid_state, Qstack_overflow, Qout_of_memory;
|
|
428
|
46 Lisp_Object Qvoid_variable, Qcyclic_variable_indirection;
|
|
|
47 Lisp_Object Qvoid_function, Qcyclic_function_indirection;
|
|
563
|
48 Lisp_Object Qinvalid_operation, Qinvalid_change, Qprinting_unreadable_object;
|
|
442
|
49 Lisp_Object Qsetting_constant;
|
|
|
50 Lisp_Object Qediting_error;
|
|
|
51 Lisp_Object Qbeginning_of_buffer, Qend_of_buffer, Qbuffer_read_only;
|
|
563
|
52 Lisp_Object Qio_error, Qfile_error, Qconversion_error, Qend_of_file;
|
|
580
|
53 Lisp_Object Qtext_conversion_error;
|
|
428
|
54 Lisp_Object Qarith_error, Qrange_error, Qdomain_error;
|
|
|
55 Lisp_Object Qsingularity_error, Qoverflow_error, Qunderflow_error;
|
|
|
56 Lisp_Object Qintegerp, Qnatnump, Qsymbolp;
|
|
|
57 Lisp_Object Qlistp, Qtrue_list_p, Qweak_listp;
|
|
|
58 Lisp_Object Qconsp, Qsubrp;
|
|
|
59 Lisp_Object Qcharacterp, Qstringp, Qarrayp, Qsequencep, Qvectorp;
|
|
|
60 Lisp_Object Qchar_or_string_p, Qmarkerp, Qinteger_or_marker_p, Qbufferp;
|
|
|
61 Lisp_Object Qinteger_or_char_p, Qinteger_char_or_marker_p;
|
|
|
62 Lisp_Object Qnumberp, Qnumber_char_or_marker_p;
|
|
|
63 Lisp_Object Qbit_vectorp, Qbitp, Qcdr;
|
|
|
64
|
|
563
|
65 Lisp_Object Qerror_lacks_explanatory_string;
|
|
428
|
66 Lisp_Object Qfloatp;
|
|
|
67
|
|
|
68 #ifdef DEBUG_XEMACS
|
|
|
69
|
|
|
70 int debug_issue_ebola_notices;
|
|
|
71
|
|
458
|
72 Fixnum debug_ebola_backtrace_length;
|
|
428
|
73
|
|
|
74 int
|
|
|
75 eq_with_ebola_notice (Lisp_Object obj1, Lisp_Object obj2)
|
|
|
76 {
|
|
|
77 if (debug_issue_ebola_notices
|
|
|
78 && ((CHARP (obj1) && INTP (obj2)) || (CHARP (obj2) && INTP (obj1))))
|
|
|
79 {
|
|
|
80 /* #### It would be really nice if this were a proper warning
|
|
|
81 instead of brain-dead print ro Qexternal_debugging_output. */
|
|
826
|
82 write_c_string
|
|
|
83 (Qexternal_debugging_output,
|
|
|
84 "Comparison between integer and character is constant nil (");
|
|
428
|
85 Fprinc (obj1, Qexternal_debugging_output);
|
|
826
|
86 write_c_string (Qexternal_debugging_output, " and ");
|
|
428
|
87 Fprinc (obj2, Qexternal_debugging_output);
|
|
826
|
88 write_c_string (Qexternal_debugging_output, ")\n");
|
|
428
|
89 debug_short_backtrace (debug_ebola_backtrace_length);
|
|
|
90 }
|
|
|
91 return EQ (obj1, obj2);
|
|
|
92 }
|
|
|
93
|
|
|
94 #endif /* DEBUG_XEMACS */
|
|
|
95
|
|
|
96
|
|
|
97
|
|
|
98 Lisp_Object
|
|
|
99 wrong_type_argument (Lisp_Object predicate, Lisp_Object value)
|
|
|
100 {
|
|
|
101 /* This function can GC */
|
|
|
102 REGISTER Lisp_Object tem;
|
|
|
103 do
|
|
|
104 {
|
|
|
105 value = Fsignal (Qwrong_type_argument, list2 (predicate, value));
|
|
|
106 tem = call1 (predicate, value);
|
|
|
107 }
|
|
|
108 while (NILP (tem));
|
|
|
109 return value;
|
|
|
110 }
|
|
|
111
|
|
|
112 DOESNT_RETURN
|
|
|
113 dead_wrong_type_argument (Lisp_Object predicate, Lisp_Object value)
|
|
|
114 {
|
|
563
|
115 signal_error_1 (Qwrong_type_argument, list2 (predicate, value));
|
|
428
|
116 }
|
|
|
117
|
|
|
118 DEFUN ("wrong-type-argument", Fwrong_type_argument, 2, 2, 0, /*
|
|
|
119 Signal an error until the correct type value is given by the user.
|
|
|
120 This function loops, signalling a continuable `wrong-type-argument' error
|
|
|
121 with PREDICATE and VALUE as the data associated with the error and then
|
|
|
122 calling PREDICATE on the returned value, until the value gotten satisfies
|
|
|
123 PREDICATE. At that point, the gotten value is returned.
|
|
|
124 */
|
|
|
125 (predicate, value))
|
|
|
126 {
|
|
|
127 return wrong_type_argument (predicate, value);
|
|
|
128 }
|
|
|
129
|
|
|
130 DOESNT_RETURN
|
|
|
131 c_write_error (Lisp_Object obj)
|
|
|
132 {
|
|
563
|
133 signal_error (Qsetting_constant,
|
|
|
134 "Attempt to modify read-only object (c)", obj);
|
|
428
|
135 }
|
|
|
136
|
|
|
137 DOESNT_RETURN
|
|
|
138 lisp_write_error (Lisp_Object obj)
|
|
|
139 {
|
|
563
|
140 signal_error (Qsetting_constant,
|
|
|
141 "Attempt to modify read-only object (lisp)", obj);
|
|
428
|
142 }
|
|
|
143
|
|
|
144 DOESNT_RETURN
|
|
|
145 args_out_of_range (Lisp_Object a1, Lisp_Object a2)
|
|
|
146 {
|
|
563
|
147 signal_error_1 (Qargs_out_of_range, list2 (a1, a2));
|
|
428
|
148 }
|
|
|
149
|
|
|
150 DOESNT_RETURN
|
|
|
151 args_out_of_range_3 (Lisp_Object a1, Lisp_Object a2, Lisp_Object a3)
|
|
|
152 {
|
|
563
|
153 signal_error_1 (Qargs_out_of_range, list3 (a1, a2, a3));
|
|
428
|
154 }
|
|
|
155
|
|
|
156 void
|
|
|
157 check_int_range (EMACS_INT val, EMACS_INT min, EMACS_INT max)
|
|
|
158 {
|
|
|
159 if (val < min || val > max)
|
|
|
160 args_out_of_range_3 (make_int (val), make_int (min), make_int (max));
|
|
|
161 }
|
|
|
162
|
|
|
163 /* On some machines, XINT needs a temporary location.
|
|
|
164 Here it is, in case it is needed. */
|
|
|
165
|
|
|
166 EMACS_INT sign_extend_temp;
|
|
|
167
|
|
|
168 /* On a few machines, XINT can only be done by calling this. */
|
|
|
169 /* XEmacs: only used by m/convex.h */
|
|
|
170 EMACS_INT sign_extend_lisp_int (EMACS_INT num);
|
|
|
171 EMACS_INT
|
|
|
172 sign_extend_lisp_int (EMACS_INT num)
|
|
|
173 {
|
|
|
174 if (num & (1L << (VALBITS - 1)))
|
|
|
175 return num | ((-1L) << VALBITS);
|
|
|
176 else
|
|
|
177 return num & ((1L << VALBITS) - 1);
|
|
|
178 }
|
|
|
179
|
|
|
180
|
|
|
181 /* Data type predicates */
|
|
|
182
|
|
|
183 DEFUN ("eq", Feq, 2, 2, 0, /*
|
|
|
184 Return t if the two args are the same Lisp object.
|
|
|
185 */
|
|
444
|
186 (object1, object2))
|
|
428
|
187 {
|
|
444
|
188 return EQ_WITH_EBOLA_NOTICE (object1, object2) ? Qt : Qnil;
|
|
428
|
189 }
|
|
|
190
|
|
|
191 DEFUN ("old-eq", Fold_eq, 2, 2, 0, /*
|
|
|
192 Return t if the two args are (in most cases) the same Lisp object.
|
|
|
193
|
|
|
194 Special kludge: A character is considered `old-eq' to its equivalent integer
|
|
|
195 even though they are not the same object and are in fact of different
|
|
|
196 types. This is ABSOLUTELY AND UTTERLY HORRENDOUS but is necessary to
|
|
|
197 preserve byte-code compatibility with v19. This kludge is known as the
|
|
|
198 \"char-int confoundance disease\" and appears in a number of other
|
|
|
199 functions with `old-foo' equivalents.
|
|
|
200
|
|
|
201 Do not use this function!
|
|
|
202 */
|
|
444
|
203 (object1, object2))
|
|
428
|
204 {
|
|
|
205 /* #### blasphemy */
|
|
444
|
206 return HACKEQ_UNSAFE (object1, object2) ? Qt : Qnil;
|
|
428
|
207 }
|
|
|
208
|
|
|
209 DEFUN ("null", Fnull, 1, 1, 0, /*
|
|
|
210 Return t if OBJECT is nil.
|
|
|
211 */
|
|
|
212 (object))
|
|
|
213 {
|
|
|
214 return NILP (object) ? Qt : Qnil;
|
|
|
215 }
|
|
|
216
|
|
|
217 DEFUN ("consp", Fconsp, 1, 1, 0, /*
|
|
|
218 Return t if OBJECT is a cons cell. `nil' is not a cons cell.
|
|
|
219 */
|
|
|
220 (object))
|
|
|
221 {
|
|
|
222 return CONSP (object) ? Qt : Qnil;
|
|
|
223 }
|
|
|
224
|
|
|
225 DEFUN ("atom", Fatom, 1, 1, 0, /*
|
|
|
226 Return t if OBJECT is not a cons cell. `nil' is not a cons cell.
|
|
|
227 */
|
|
|
228 (object))
|
|
|
229 {
|
|
|
230 return CONSP (object) ? Qnil : Qt;
|
|
|
231 }
|
|
|
232
|
|
|
233 DEFUN ("listp", Flistp, 1, 1, 0, /*
|
|
|
234 Return t if OBJECT is a list. `nil' is a list.
|
|
|
235 */
|
|
|
236 (object))
|
|
|
237 {
|
|
|
238 return LISTP (object) ? Qt : Qnil;
|
|
|
239 }
|
|
|
240
|
|
|
241 DEFUN ("nlistp", Fnlistp, 1, 1, 0, /*
|
|
|
242 Return t if OBJECT is not a list. `nil' is a list.
|
|
|
243 */
|
|
|
244 (object))
|
|
|
245 {
|
|
|
246 return LISTP (object) ? Qnil : Qt;
|
|
|
247 }
|
|
|
248
|
|
|
249 DEFUN ("true-list-p", Ftrue_list_p, 1, 1, 0, /*
|
|
|
250 Return t if OBJECT is a non-dotted, i.e. nil-terminated, list.
|
|
|
251 */
|
|
|
252 (object))
|
|
|
253 {
|
|
|
254 return TRUE_LIST_P (object) ? Qt : Qnil;
|
|
|
255 }
|
|
|
256
|
|
|
257 DEFUN ("symbolp", Fsymbolp, 1, 1, 0, /*
|
|
|
258 Return t if OBJECT is a symbol.
|
|
|
259 */
|
|
|
260 (object))
|
|
|
261 {
|
|
|
262 return SYMBOLP (object) ? Qt : Qnil;
|
|
|
263 }
|
|
|
264
|
|
|
265 DEFUN ("keywordp", Fkeywordp, 1, 1, 0, /*
|
|
|
266 Return t if OBJECT is a keyword.
|
|
|
267 */
|
|
|
268 (object))
|
|
|
269 {
|
|
|
270 return KEYWORDP (object) ? Qt : Qnil;
|
|
|
271 }
|
|
|
272
|
|
|
273 DEFUN ("vectorp", Fvectorp, 1, 1, 0, /*
|
|
|
274 Return t if OBJECT is a vector.
|
|
|
275 */
|
|
|
276 (object))
|
|
|
277 {
|
|
|
278 return VECTORP (object) ? Qt : Qnil;
|
|
|
279 }
|
|
|
280
|
|
|
281 DEFUN ("bit-vector-p", Fbit_vector_p, 1, 1, 0, /*
|
|
|
282 Return t if OBJECT is a bit vector.
|
|
|
283 */
|
|
|
284 (object))
|
|
|
285 {
|
|
|
286 return BIT_VECTORP (object) ? Qt : Qnil;
|
|
|
287 }
|
|
|
288
|
|
|
289 DEFUN ("stringp", Fstringp, 1, 1, 0, /*
|
|
|
290 Return t if OBJECT is a string.
|
|
|
291 */
|
|
|
292 (object))
|
|
|
293 {
|
|
|
294 return STRINGP (object) ? Qt : Qnil;
|
|
|
295 }
|
|
|
296
|
|
|
297 DEFUN ("arrayp", Farrayp, 1, 1, 0, /*
|
|
|
298 Return t if OBJECT is an array (string, vector, or bit vector).
|
|
|
299 */
|
|
|
300 (object))
|
|
|
301 {
|
|
|
302 return (VECTORP (object) ||
|
|
|
303 STRINGP (object) ||
|
|
|
304 BIT_VECTORP (object))
|
|
|
305 ? Qt : Qnil;
|
|
|
306 }
|
|
|
307
|
|
|
308 DEFUN ("sequencep", Fsequencep, 1, 1, 0, /*
|
|
|
309 Return t if OBJECT is a sequence (list or array).
|
|
|
310 */
|
|
|
311 (object))
|
|
|
312 {
|
|
|
313 return (LISTP (object) ||
|
|
|
314 VECTORP (object) ||
|
|
|
315 STRINGP (object) ||
|
|
|
316 BIT_VECTORP (object))
|
|
|
317 ? Qt : Qnil;
|
|
|
318 }
|
|
|
319
|
|
|
320 DEFUN ("markerp", Fmarkerp, 1, 1, 0, /*
|
|
|
321 Return t if OBJECT is a marker (editor pointer).
|
|
|
322 */
|
|
|
323 (object))
|
|
|
324 {
|
|
|
325 return MARKERP (object) ? Qt : Qnil;
|
|
|
326 }
|
|
|
327
|
|
|
328 DEFUN ("subrp", Fsubrp, 1, 1, 0, /*
|
|
|
329 Return t if OBJECT is a built-in function.
|
|
|
330 */
|
|
|
331 (object))
|
|
|
332 {
|
|
|
333 return SUBRP (object) ? Qt : Qnil;
|
|
|
334 }
|
|
|
335
|
|
|
336 DEFUN ("subr-min-args", Fsubr_min_args, 1, 1, 0, /*
|
|
|
337 Return minimum number of args built-in function SUBR may be called with.
|
|
|
338 */
|
|
|
339 (subr))
|
|
|
340 {
|
|
|
341 CHECK_SUBR (subr);
|
|
|
342 return make_int (XSUBR (subr)->min_args);
|
|
|
343 }
|
|
|
344
|
|
|
345 DEFUN ("subr-max-args", Fsubr_max_args, 1, 1, 0, /*
|
|
|
346 Return maximum number of args built-in function SUBR may be called with,
|
|
|
347 or nil if it takes an arbitrary number of arguments or is a special form.
|
|
|
348 */
|
|
|
349 (subr))
|
|
|
350 {
|
|
|
351 int nargs;
|
|
|
352 CHECK_SUBR (subr);
|
|
|
353 nargs = XSUBR (subr)->max_args;
|
|
|
354 if (nargs == MANY || nargs == UNEVALLED)
|
|
|
355 return Qnil;
|
|
|
356 else
|
|
|
357 return make_int (nargs);
|
|
|
358 }
|
|
|
359
|
|
|
360 DEFUN ("subr-interactive", Fsubr_interactive, 1, 1, 0, /*
|
|
444
|
361 Return the interactive spec of the subr object SUBR, or nil.
|
|
428
|
362 If non-nil, the return value will be a list whose first element is
|
|
|
363 `interactive' and whose second element is the interactive spec.
|
|
|
364 */
|
|
|
365 (subr))
|
|
|
366 {
|
|
867
|
367 const CIbyte *prompt;
|
|
428
|
368 CHECK_SUBR (subr);
|
|
|
369 prompt = XSUBR (subr)->prompt;
|
|
771
|
370 return prompt ? list2 (Qinteractive, build_msg_string (prompt)) : Qnil;
|
|
428
|
371 }
|
|
|
372
|
|
|
373
|
|
|
374 DEFUN ("characterp", Fcharacterp, 1, 1, 0, /*
|
|
|
375 Return t if OBJECT is a character.
|
|
|
376 Unlike in XEmacs v19 and FSF Emacs, a character is its own primitive type.
|
|
|
377 Any character can be converted into an equivalent integer using
|
|
|
378 `char-int'. To convert the other way, use `int-char'; however,
|
|
|
379 only some integers can be converted into characters. Such an integer
|
|
|
380 is called a `char-int'; see `char-int-p'.
|
|
|
381
|
|
|
382 Some functions that work on integers (e.g. the comparison functions
|
|
|
383 <, <=, =, /=, etc. and the arithmetic functions +, -, *, etc.)
|
|
|
384 accept characters and implicitly convert them into integers. In
|
|
|
385 general, functions that work on characters also accept char-ints and
|
|
|
386 implicitly convert them into characters. WARNING: Neither of these
|
|
|
387 behaviors is very desirable, and they are maintained for backward
|
|
|
388 compatibility with old E-Lisp programs that confounded characters and
|
|
|
389 integers willy-nilly. These behaviors may change in the future; therefore,
|
|
|
390 do not rely on them. Instead, use the character-specific functions such
|
|
|
391 as `char='.
|
|
|
392 */
|
|
|
393 (object))
|
|
|
394 {
|
|
|
395 return CHARP (object) ? Qt : Qnil;
|
|
|
396 }
|
|
|
397
|
|
|
398 DEFUN ("char-to-int", Fchar_to_int, 1, 1, 0, /*
|
|
444
|
399 Convert CHARACTER into an equivalent integer.
|
|
428
|
400 The resulting integer will always be non-negative. The integers in
|
|
|
401 the range 0 - 255 map to characters as follows:
|
|
|
402
|
|
|
403 0 - 31 Control set 0
|
|
|
404 32 - 127 ASCII
|
|
|
405 128 - 159 Control set 1
|
|
|
406 160 - 255 Right half of ISO-8859-1
|
|
|
407
|
|
|
408 If support for Mule does not exist, these are the only valid character
|
|
|
409 values. When Mule support exists, the values assigned to other characters
|
|
|
410 may vary depending on the particular version of XEmacs, the order in which
|
|
|
411 character sets were loaded, etc., and you should not depend on them.
|
|
|
412 */
|
|
444
|
413 (character))
|
|
428
|
414 {
|
|
444
|
415 CHECK_CHAR (character);
|
|
|
416 return make_int (XCHAR (character));
|
|
428
|
417 }
|
|
|
418
|
|
|
419 DEFUN ("int-to-char", Fint_to_char, 1, 1, 0, /*
|
|
444
|
420 Convert integer INTEGER into the equivalent character.
|
|
428
|
421 Not all integers correspond to valid characters; use `char-int-p' to
|
|
|
422 determine whether this is the case. If the integer cannot be converted,
|
|
|
423 nil is returned.
|
|
|
424 */
|
|
|
425 (integer))
|
|
|
426 {
|
|
|
427 CHECK_INT (integer);
|
|
|
428 if (CHAR_INTP (integer))
|
|
|
429 return make_char (XINT (integer));
|
|
|
430 else
|
|
|
431 return Qnil;
|
|
|
432 }
|
|
|
433
|
|
|
434 DEFUN ("char-int-p", Fchar_int_p, 1, 1, 0, /*
|
|
|
435 Return t if OBJECT is an integer that can be converted into a character.
|
|
|
436 See `char-int'.
|
|
|
437 */
|
|
|
438 (object))
|
|
|
439 {
|
|
|
440 return CHAR_INTP (object) ? Qt : Qnil;
|
|
|
441 }
|
|
|
442
|
|
|
443 DEFUN ("char-or-char-int-p", Fchar_or_char_int_p, 1, 1, 0, /*
|
|
|
444 Return t if OBJECT is a character or an integer that can be converted into one.
|
|
|
445 */
|
|
|
446 (object))
|
|
|
447 {
|
|
|
448 return CHAR_OR_CHAR_INTP (object) ? Qt : Qnil;
|
|
|
449 }
|
|
|
450
|
|
|
451 DEFUN ("char-or-string-p", Fchar_or_string_p, 1, 1, 0, /*
|
|
|
452 Return t if OBJECT is a character (or a char-int) or a string.
|
|
|
453 It is semi-hateful that we allow a char-int here, as it goes against
|
|
|
454 the name of this function, but it makes the most sense considering the
|
|
|
455 other steps we take to maintain compatibility with the old character/integer
|
|
|
456 confoundedness in older versions of E-Lisp.
|
|
|
457 */
|
|
|
458 (object))
|
|
|
459 {
|
|
|
460 return CHAR_OR_CHAR_INTP (object) || STRINGP (object) ? Qt : Qnil;
|
|
|
461 }
|
|
|
462
|
|
|
463 DEFUN ("integerp", Fintegerp, 1, 1, 0, /*
|
|
|
464 Return t if OBJECT is an integer.
|
|
|
465 */
|
|
|
466 (object))
|
|
|
467 {
|
|
|
468 return INTP (object) ? Qt : Qnil;
|
|
|
469 }
|
|
|
470
|
|
|
471 DEFUN ("integer-or-marker-p", Finteger_or_marker_p, 1, 1, 0, /*
|
|
|
472 Return t if OBJECT is an integer or a marker (editor pointer).
|
|
|
473 */
|
|
|
474 (object))
|
|
|
475 {
|
|
|
476 return INTP (object) || MARKERP (object) ? Qt : Qnil;
|
|
|
477 }
|
|
|
478
|
|
|
479 DEFUN ("integer-or-char-p", Finteger_or_char_p, 1, 1, 0, /*
|
|
|
480 Return t if OBJECT is an integer or a character.
|
|
|
481 */
|
|
|
482 (object))
|
|
|
483 {
|
|
|
484 return INTP (object) || CHARP (object) ? Qt : Qnil;
|
|
|
485 }
|
|
|
486
|
|
|
487 DEFUN ("integer-char-or-marker-p", Finteger_char_or_marker_p, 1, 1, 0, /*
|
|
|
488 Return t if OBJECT is an integer, character or a marker (editor pointer).
|
|
|
489 */
|
|
|
490 (object))
|
|
|
491 {
|
|
|
492 return INTP (object) || CHARP (object) || MARKERP (object) ? Qt : Qnil;
|
|
|
493 }
|
|
|
494
|
|
|
495 DEFUN ("natnump", Fnatnump, 1, 1, 0, /*
|
|
|
496 Return t if OBJECT is a nonnegative integer.
|
|
|
497 */
|
|
|
498 (object))
|
|
|
499 {
|
|
|
500 return NATNUMP (object) ? Qt : Qnil;
|
|
|
501 }
|
|
|
502
|
|
|
503 DEFUN ("bitp", Fbitp, 1, 1, 0, /*
|
|
|
504 Return t if OBJECT is a bit (0 or 1).
|
|
|
505 */
|
|
|
506 (object))
|
|
|
507 {
|
|
|
508 return BITP (object) ? Qt : Qnil;
|
|
|
509 }
|
|
|
510
|
|
|
511 DEFUN ("numberp", Fnumberp, 1, 1, 0, /*
|
|
|
512 Return t if OBJECT is a number (floating point or integer).
|
|
|
513 */
|
|
|
514 (object))
|
|
|
515 {
|
|
|
516 return INT_OR_FLOATP (object) ? Qt : Qnil;
|
|
|
517 }
|
|
|
518
|
|
|
519 DEFUN ("number-or-marker-p", Fnumber_or_marker_p, 1, 1, 0, /*
|
|
|
520 Return t if OBJECT is a number or a marker.
|
|
|
521 */
|
|
|
522 (object))
|
|
|
523 {
|
|
|
524 return INT_OR_FLOATP (object) || MARKERP (object) ? Qt : Qnil;
|
|
|
525 }
|
|
|
526
|
|
|
527 DEFUN ("number-char-or-marker-p", Fnumber_char_or_marker_p, 1, 1, 0, /*
|
|
|
528 Return t if OBJECT is a number, character or a marker.
|
|
|
529 */
|
|
|
530 (object))
|
|
|
531 {
|
|
|
532 return (INT_OR_FLOATP (object) ||
|
|
|
533 CHARP (object) ||
|
|
|
534 MARKERP (object))
|
|
|
535 ? Qt : Qnil;
|
|
|
536 }
|
|
|
537
|
|
|
538 #ifdef LISP_FLOAT_TYPE
|
|
|
539 DEFUN ("floatp", Ffloatp, 1, 1, 0, /*
|
|
|
540 Return t if OBJECT is a floating point number.
|
|
|
541 */
|
|
|
542 (object))
|
|
|
543 {
|
|
|
544 return FLOATP (object) ? Qt : Qnil;
|
|
|
545 }
|
|
|
546 #endif /* LISP_FLOAT_TYPE */
|
|
|
547
|
|
|
548 DEFUN ("type-of", Ftype_of, 1, 1, 0, /*
|
|
|
549 Return a symbol representing the type of OBJECT.
|
|
|
550 */
|
|
|
551 (object))
|
|
|
552 {
|
|
|
553 switch (XTYPE (object))
|
|
|
554 {
|
|
|
555 case Lisp_Type_Record:
|
|
|
556 return intern (XRECORD_LHEADER_IMPLEMENTATION (object)->name);
|
|
|
557
|
|
|
558 case Lisp_Type_Char: return Qcharacter;
|
|
|
559
|
|
|
560 default: return Qinteger;
|
|
|
561 }
|
|
|
562 }
|
|
|
563
|
|
|
564
|
|
|
565 /* Extract and set components of lists */
|
|
|
566
|
|
|
567 DEFUN ("car", Fcar, 1, 1, 0, /*
|
|
|
568 Return the car of LIST. If arg is nil, return nil.
|
|
|
569 Error if arg is not nil and not a cons cell. See also `car-safe'.
|
|
|
570 */
|
|
|
571 (list))
|
|
|
572 {
|
|
|
573 while (1)
|
|
|
574 {
|
|
|
575 if (CONSP (list))
|
|
|
576 return XCAR (list);
|
|
|
577 else if (NILP (list))
|
|
|
578 return Qnil;
|
|
|
579 else
|
|
|
580 list = wrong_type_argument (Qlistp, list);
|
|
|
581 }
|
|
|
582 }
|
|
|
583
|
|
|
584 DEFUN ("car-safe", Fcar_safe, 1, 1, 0, /*
|
|
|
585 Return the car of OBJECT if it is a cons cell, or else nil.
|
|
|
586 */
|
|
|
587 (object))
|
|
|
588 {
|
|
|
589 return CONSP (object) ? XCAR (object) : Qnil;
|
|
|
590 }
|
|
|
591
|
|
|
592 DEFUN ("cdr", Fcdr, 1, 1, 0, /*
|
|
|
593 Return the cdr of LIST. If arg is nil, return nil.
|
|
|
594 Error if arg is not nil and not a cons cell. See also `cdr-safe'.
|
|
|
595 */
|
|
|
596 (list))
|
|
|
597 {
|
|
|
598 while (1)
|
|
|
599 {
|
|
|
600 if (CONSP (list))
|
|
|
601 return XCDR (list);
|
|
|
602 else if (NILP (list))
|
|
|
603 return Qnil;
|
|
|
604 else
|
|
|
605 list = wrong_type_argument (Qlistp, list);
|
|
|
606 }
|
|
|
607 }
|
|
|
608
|
|
|
609 DEFUN ("cdr-safe", Fcdr_safe, 1, 1, 0, /*
|
|
|
610 Return the cdr of OBJECT if it is a cons cell, else nil.
|
|
|
611 */
|
|
|
612 (object))
|
|
|
613 {
|
|
|
614 return CONSP (object) ? XCDR (object) : Qnil;
|
|
|
615 }
|
|
|
616
|
|
|
617 DEFUN ("setcar", Fsetcar, 2, 2, 0, /*
|
|
444
|
618 Set the car of CONS-CELL to be NEWCAR. Return NEWCAR.
|
|
428
|
619 */
|
|
444
|
620 (cons_cell, newcar))
|
|
428
|
621 {
|
|
444
|
622 if (!CONSP (cons_cell))
|
|
|
623 cons_cell = wrong_type_argument (Qconsp, cons_cell);
|
|
428
|
624
|
|
444
|
625 XCAR (cons_cell) = newcar;
|
|
428
|
626 return newcar;
|
|
|
627 }
|
|
|
628
|
|
|
629 DEFUN ("setcdr", Fsetcdr, 2, 2, 0, /*
|
|
444
|
630 Set the cdr of CONS-CELL to be NEWCDR. Return NEWCDR.
|
|
428
|
631 */
|
|
444
|
632 (cons_cell, newcdr))
|
|
428
|
633 {
|
|
444
|
634 if (!CONSP (cons_cell))
|
|
|
635 cons_cell = wrong_type_argument (Qconsp, cons_cell);
|
|
428
|
636
|
|
444
|
637 XCDR (cons_cell) = newcdr;
|
|
428
|
638 return newcdr;
|
|
|
639 }
|
|
|
640
|
|
|
641 /* Find the function at the end of a chain of symbol function indirections.
|
|
|
642
|
|
|
643 If OBJECT is a symbol, find the end of its function chain and
|
|
|
644 return the value found there. If OBJECT is not a symbol, just
|
|
|
645 return it. If there is a cycle in the function chain, signal a
|
|
|
646 cyclic-function-indirection error.
|
|
|
647
|
|
442
|
648 This is like Findirect_function when VOID_FUNCTION_ERRORP is true.
|
|
|
649 When VOID_FUNCTION_ERRORP is false, no error is signaled if the end
|
|
|
650 of the chain ends up being Qunbound. */
|
|
428
|
651 Lisp_Object
|
|
442
|
652 indirect_function (Lisp_Object object, int void_function_errorp)
|
|
428
|
653 {
|
|
|
654 #define FUNCTION_INDIRECTION_SUSPICION_LENGTH 16
|
|
|
655 Lisp_Object tortoise, hare;
|
|
|
656 int count;
|
|
|
657
|
|
|
658 for (hare = tortoise = object, count = 0;
|
|
|
659 SYMBOLP (hare);
|
|
|
660 hare = XSYMBOL (hare)->function, count++)
|
|
|
661 {
|
|
|
662 if (count < FUNCTION_INDIRECTION_SUSPICION_LENGTH) continue;
|
|
|
663
|
|
|
664 if (count & 1)
|
|
|
665 tortoise = XSYMBOL (tortoise)->function;
|
|
|
666 if (EQ (hare, tortoise))
|
|
|
667 return Fsignal (Qcyclic_function_indirection, list1 (object));
|
|
|
668 }
|
|
|
669
|
|
442
|
670 if (void_function_errorp && UNBOUNDP (hare))
|
|
436
|
671 return signal_void_function_error (object);
|
|
428
|
672
|
|
|
673 return hare;
|
|
|
674 }
|
|
|
675
|
|
|
676 DEFUN ("indirect-function", Findirect_function, 1, 1, 0, /*
|
|
|
677 Return the function at the end of OBJECT's function chain.
|
|
|
678 If OBJECT is a symbol, follow all function indirections and return
|
|
|
679 the final function binding.
|
|
|
680 If OBJECT is not a symbol, just return it.
|
|
|
681 Signal a void-function error if the final symbol is unbound.
|
|
|
682 Signal a cyclic-function-indirection error if there is a loop in the
|
|
|
683 function chain of symbols.
|
|
|
684 */
|
|
|
685 (object))
|
|
|
686 {
|
|
|
687 return indirect_function (object, 1);
|
|
|
688 }
|
|
|
689
|
|
|
690 /* Extract and set vector and string elements */
|
|
|
691
|
|
|
692 DEFUN ("aref", Faref, 2, 2, 0, /*
|
|
|
693 Return the element of ARRAY at index INDEX.
|
|
|
694 ARRAY may be a vector, bit vector, or string. INDEX starts at 0.
|
|
|
695 */
|
|
|
696 (array, index_))
|
|
|
697 {
|
|
|
698 EMACS_INT idx;
|
|
|
699
|
|
|
700 retry:
|
|
|
701
|
|
|
702 if (INTP (index_)) idx = XINT (index_);
|
|
|
703 else if (CHARP (index_)) idx = XCHAR (index_); /* yuck! */
|
|
|
704 else
|
|
|
705 {
|
|
|
706 index_ = wrong_type_argument (Qinteger_or_char_p, index_);
|
|
|
707 goto retry;
|
|
|
708 }
|
|
|
709
|
|
|
710 if (idx < 0) goto range_error;
|
|
|
711
|
|
|
712 if (VECTORP (array))
|
|
|
713 {
|
|
|
714 if (idx >= XVECTOR_LENGTH (array)) goto range_error;
|
|
|
715 return XVECTOR_DATA (array)[idx];
|
|
|
716 }
|
|
|
717 else if (BIT_VECTORP (array))
|
|
|
718 {
|
|
647
|
719 if (idx >= (EMACS_INT) bit_vector_length (XBIT_VECTOR (array)))
|
|
|
720 goto range_error;
|
|
428
|
721 return make_int (bit_vector_bit (XBIT_VECTOR (array), idx));
|
|
|
722 }
|
|
|
723 else if (STRINGP (array))
|
|
|
724 {
|
|
826
|
725 if (idx >= string_char_length (array)) goto range_error;
|
|
867
|
726 return make_char (string_ichar (array, idx));
|
|
428
|
727 }
|
|
|
728 #ifdef LOSING_BYTECODE
|
|
|
729 else if (COMPILED_FUNCTIONP (array))
|
|
|
730 {
|
|
|
731 /* Weird, gross compatibility kludge */
|
|
|
732 return Felt (array, index_);
|
|
|
733 }
|
|
|
734 #endif
|
|
|
735 else
|
|
|
736 {
|
|
|
737 check_losing_bytecode ("aref", array);
|
|
|
738 array = wrong_type_argument (Qarrayp, array);
|
|
|
739 goto retry;
|
|
|
740 }
|
|
|
741
|
|
|
742 range_error:
|
|
|
743 args_out_of_range (array, index_);
|
|
801
|
744 RETURN_NOT_REACHED (Qnil)
|
|
428
|
745 }
|
|
|
746
|
|
|
747 DEFUN ("aset", Faset, 3, 3, 0, /*
|
|
|
748 Store into the element of ARRAY at index INDEX the value NEWVAL.
|
|
|
749 ARRAY may be a vector, bit vector, or string. INDEX starts at 0.
|
|
|
750 */
|
|
|
751 (array, index_, newval))
|
|
|
752 {
|
|
|
753 EMACS_INT idx;
|
|
|
754
|
|
|
755 retry:
|
|
|
756
|
|
|
757 if (INTP (index_)) idx = XINT (index_);
|
|
|
758 else if (CHARP (index_)) idx = XCHAR (index_); /* yuck! */
|
|
|
759 else
|
|
|
760 {
|
|
|
761 index_ = wrong_type_argument (Qinteger_or_char_p, index_);
|
|
|
762 goto retry;
|
|
|
763 }
|
|
|
764
|
|
|
765 if (idx < 0) goto range_error;
|
|
|
766
|
|
771
|
767 CHECK_LISP_WRITEABLE (array);
|
|
428
|
768 if (VECTORP (array))
|
|
|
769 {
|
|
|
770 if (idx >= XVECTOR_LENGTH (array)) goto range_error;
|
|
|
771 XVECTOR_DATA (array)[idx] = newval;
|
|
|
772 }
|
|
|
773 else if (BIT_VECTORP (array))
|
|
|
774 {
|
|
647
|
775 if (idx >= (EMACS_INT) bit_vector_length (XBIT_VECTOR (array)))
|
|
|
776 goto range_error;
|
|
428
|
777 CHECK_BIT (newval);
|
|
|
778 set_bit_vector_bit (XBIT_VECTOR (array), idx, !ZEROP (newval));
|
|
|
779 }
|
|
|
780 else if (STRINGP (array))
|
|
|
781 {
|
|
|
782 CHECK_CHAR_COERCE_INT (newval);
|
|
826
|
783 if (idx >= string_char_length (array)) goto range_error;
|
|
793
|
784 set_string_char (array, idx, XCHAR (newval));
|
|
428
|
785 bump_string_modiff (array);
|
|
|
786 }
|
|
|
787 else
|
|
|
788 {
|
|
|
789 array = wrong_type_argument (Qarrayp, array);
|
|
|
790 goto retry;
|
|
|
791 }
|
|
|
792
|
|
|
793 return newval;
|
|
|
794
|
|
|
795 range_error:
|
|
|
796 args_out_of_range (array, index_);
|
|
801
|
797 RETURN_NOT_REACHED (Qnil)
|
|
428
|
798 }
|
|
|
799
|
|
|
800
|
|
|
801 /**********************************************************************/
|
|
|
802 /* Arithmetic functions */
|
|
|
803 /**********************************************************************/
|
|
|
804 typedef struct
|
|
|
805 {
|
|
|
806 int int_p;
|
|
|
807 union
|
|
|
808 {
|
|
|
809 EMACS_INT ival;
|
|
|
810 double dval;
|
|
|
811 } c;
|
|
|
812 } int_or_double;
|
|
|
813
|
|
|
814 static void
|
|
|
815 number_char_or_marker_to_int_or_double (Lisp_Object obj, int_or_double *p)
|
|
|
816 {
|
|
|
817 retry:
|
|
|
818 p->int_p = 1;
|
|
|
819 if (INTP (obj)) p->c.ival = XINT (obj);
|
|
|
820 else if (CHARP (obj)) p->c.ival = XCHAR (obj);
|
|
|
821 else if (MARKERP (obj)) p->c.ival = marker_position (obj);
|
|
|
822 #ifdef LISP_FLOAT_TYPE
|
|
|
823 else if (FLOATP (obj)) p->c.dval = XFLOAT_DATA (obj), p->int_p = 0;
|
|
|
824 #endif
|
|
|
825 else
|
|
|
826 {
|
|
|
827 obj = wrong_type_argument (Qnumber_char_or_marker_p, obj);
|
|
|
828 goto retry;
|
|
|
829 }
|
|
|
830 }
|
|
|
831
|
|
|
832 static double
|
|
|
833 number_char_or_marker_to_double (Lisp_Object obj)
|
|
|
834 {
|
|
|
835 retry:
|
|
|
836 if (INTP (obj)) return (double) XINT (obj);
|
|
|
837 else if (CHARP (obj)) return (double) XCHAR (obj);
|
|
|
838 else if (MARKERP (obj)) return (double) marker_position (obj);
|
|
|
839 #ifdef LISP_FLOAT_TYPE
|
|
|
840 else if (FLOATP (obj)) return XFLOAT_DATA (obj);
|
|
|
841 #endif
|
|
|
842 else
|
|
|
843 {
|
|
|
844 obj = wrong_type_argument (Qnumber_char_or_marker_p, obj);
|
|
|
845 goto retry;
|
|
|
846 }
|
|
|
847 }
|
|
|
848
|
|
|
849 static EMACS_INT
|
|
|
850 integer_char_or_marker_to_int (Lisp_Object obj)
|
|
|
851 {
|
|
|
852 retry:
|
|
|
853 if (INTP (obj)) return XINT (obj);
|
|
|
854 else if (CHARP (obj)) return XCHAR (obj);
|
|
|
855 else if (MARKERP (obj)) return marker_position (obj);
|
|
|
856 else
|
|
|
857 {
|
|
|
858 obj = wrong_type_argument (Qinteger_char_or_marker_p, obj);
|
|
|
859 goto retry;
|
|
|
860 }
|
|
|
861 }
|
|
|
862
|
|
|
863 #define ARITHCOMPARE_MANY(op) \
|
|
|
864 { \
|
|
|
865 int_or_double iod1, iod2, *p = &iod1, *q = &iod2; \
|
|
|
866 Lisp_Object *args_end = args + nargs; \
|
|
|
867 \
|
|
|
868 number_char_or_marker_to_int_or_double (*args++, p); \
|
|
|
869 \
|
|
|
870 while (args < args_end) \
|
|
|
871 { \
|
|
|
872 number_char_or_marker_to_int_or_double (*args++, q); \
|
|
|
873 \
|
|
|
874 if (!((p->int_p && q->int_p) ? \
|
|
|
875 (p->c.ival op q->c.ival) : \
|
|
|
876 ((p->int_p ? (double) p->c.ival : p->c.dval) op \
|
|
|
877 (q->int_p ? (double) q->c.ival : q->c.dval)))) \
|
|
|
878 return Qnil; \
|
|
|
879 \
|
|
|
880 { /* swap */ int_or_double *r = p; p = q; q = r; } \
|
|
|
881 } \
|
|
|
882 return Qt; \
|
|
|
883 }
|
|
|
884
|
|
|
885 DEFUN ("=", Feqlsign, 1, MANY, 0, /*
|
|
|
886 Return t if all the arguments are numerically equal.
|
|
|
887 The arguments may be numbers, characters or markers.
|
|
|
888 */
|
|
|
889 (int nargs, Lisp_Object *args))
|
|
|
890 {
|
|
|
891 ARITHCOMPARE_MANY (==)
|
|
|
892 }
|
|
|
893
|
|
|
894 DEFUN ("<", Flss, 1, MANY, 0, /*
|
|
|
895 Return t if the sequence of arguments is monotonically increasing.
|
|
|
896 The arguments may be numbers, characters or markers.
|
|
|
897 */
|
|
|
898 (int nargs, Lisp_Object *args))
|
|
|
899 {
|
|
|
900 ARITHCOMPARE_MANY (<)
|
|
|
901 }
|
|
|
902
|
|
|
903 DEFUN (">", Fgtr, 1, MANY, 0, /*
|
|
|
904 Return t if the sequence of arguments is monotonically decreasing.
|
|
|
905 The arguments may be numbers, characters or markers.
|
|
|
906 */
|
|
|
907 (int nargs, Lisp_Object *args))
|
|
|
908 {
|
|
|
909 ARITHCOMPARE_MANY (>)
|
|
|
910 }
|
|
|
911
|
|
|
912 DEFUN ("<=", Fleq, 1, MANY, 0, /*
|
|
|
913 Return t if the sequence of arguments is monotonically nondecreasing.
|
|
|
914 The arguments may be numbers, characters or markers.
|
|
|
915 */
|
|
|
916 (int nargs, Lisp_Object *args))
|
|
|
917 {
|
|
|
918 ARITHCOMPARE_MANY (<=)
|
|
|
919 }
|
|
|
920
|
|
|
921 DEFUN (">=", Fgeq, 1, MANY, 0, /*
|
|
|
922 Return t if the sequence of arguments is monotonically nonincreasing.
|
|
|
923 The arguments may be numbers, characters or markers.
|
|
|
924 */
|
|
|
925 (int nargs, Lisp_Object *args))
|
|
|
926 {
|
|
|
927 ARITHCOMPARE_MANY (>=)
|
|
|
928 }
|
|
|
929
|
|
|
930 DEFUN ("/=", Fneq, 1, MANY, 0, /*
|
|
|
931 Return t if no two arguments are numerically equal.
|
|
|
932 The arguments may be numbers, characters or markers.
|
|
|
933 */
|
|
|
934 (int nargs, Lisp_Object *args))
|
|
|
935 {
|
|
|
936 Lisp_Object *args_end = args + nargs;
|
|
|
937 Lisp_Object *p, *q;
|
|
|
938
|
|
|
939 /* Unlike all the other comparisons, this is an N*N algorithm.
|
|
|
940 We could use a hash table for nargs > 50 to make this linear. */
|
|
|
941 for (p = args; p < args_end; p++)
|
|
|
942 {
|
|
|
943 int_or_double iod1, iod2;
|
|
|
944 number_char_or_marker_to_int_or_double (*p, &iod1);
|
|
|
945
|
|
|
946 for (q = p + 1; q < args_end; q++)
|
|
|
947 {
|
|
|
948 number_char_or_marker_to_int_or_double (*q, &iod2);
|
|
|
949
|
|
|
950 if (!((iod1.int_p && iod2.int_p) ?
|
|
|
951 (iod1.c.ival != iod2.c.ival) :
|
|
|
952 ((iod1.int_p ? (double) iod1.c.ival : iod1.c.dval) !=
|
|
|
953 (iod2.int_p ? (double) iod2.c.ival : iod2.c.dval))))
|
|
|
954 return Qnil;
|
|
|
955 }
|
|
|
956 }
|
|
|
957 return Qt;
|
|
|
958 }
|
|
|
959
|
|
|
960 DEFUN ("zerop", Fzerop, 1, 1, 0, /*
|
|
|
961 Return t if NUMBER is zero.
|
|
|
962 */
|
|
|
963 (number))
|
|
|
964 {
|
|
|
965 retry:
|
|
|
966 if (INTP (number))
|
|
|
967 return EQ (number, Qzero) ? Qt : Qnil;
|
|
|
968 #ifdef LISP_FLOAT_TYPE
|
|
|
969 else if (FLOATP (number))
|
|
|
970 return XFLOAT_DATA (number) == 0.0 ? Qt : Qnil;
|
|
|
971 #endif /* LISP_FLOAT_TYPE */
|
|
|
972 else
|
|
|
973 {
|
|
|
974 number = wrong_type_argument (Qnumberp, number);
|
|
|
975 goto retry;
|
|
|
976 }
|
|
|
977 }
|
|
|
978
|
|
|
979 /* Convert between a 32-bit value and a cons of two 16-bit values.
|
|
|
980 This is used to pass 32-bit integers to and from the user.
|
|
|
981 Use time_to_lisp() and lisp_to_time() for time values.
|
|
|
982
|
|
|
983 If you're thinking of using this to store a pointer into a Lisp Object
|
|
|
984 for internal purposes (such as when calling record_unwind_protect()),
|
|
|
985 try using make_opaque_ptr()/get_opaque_ptr() instead. */
|
|
|
986 Lisp_Object
|
|
|
987 word_to_lisp (unsigned int item)
|
|
|
988 {
|
|
|
989 return Fcons (make_int (item >> 16), make_int (item & 0xffff));
|
|
|
990 }
|
|
|
991
|
|
|
992 unsigned int
|
|
|
993 lisp_to_word (Lisp_Object item)
|
|
|
994 {
|
|
|
995 if (INTP (item))
|
|
|
996 return XINT (item);
|
|
|
997 else
|
|
|
998 {
|
|
|
999 Lisp_Object top = Fcar (item);
|
|
|
1000 Lisp_Object bot = Fcdr (item);
|
|
|
1001 CHECK_INT (top);
|
|
|
1002 CHECK_INT (bot);
|
|
|
1003 return (XINT (top) << 16) | (XINT (bot) & 0xffff);
|
|
|
1004 }
|
|
|
1005 }
|
|
|
1006
|
|
|
1007
|
|
|
1008 DEFUN ("number-to-string", Fnumber_to_string, 1, 1, 0, /*
|
|
444
|
1009 Convert NUMBER to a string by printing it in decimal.
|
|
428
|
1010 Uses a minus sign if negative.
|
|
444
|
1011 NUMBER may be an integer or a floating point number.
|
|
428
|
1012 */
|
|
444
|
1013 (number))
|
|
428
|
1014 {
|
|
444
|
1015 CHECK_INT_OR_FLOAT (number);
|
|
428
|
1016
|
|
|
1017 #ifdef LISP_FLOAT_TYPE
|
|
444
|
1018 if (FLOATP (number))
|
|
428
|
1019 {
|
|
|
1020 char pigbuf[350]; /* see comments in float_to_string */
|
|
|
1021
|
|
444
|
1022 float_to_string (pigbuf, XFLOAT_DATA (number));
|
|
428
|
1023 return build_string (pigbuf);
|
|
|
1024 }
|
|
|
1025 #endif /* LISP_FLOAT_TYPE */
|
|
|
1026
|
|
603
|
1027 {
|
|
|
1028 char buffer[DECIMAL_PRINT_SIZE (long)];
|
|
|
1029
|
|
|
1030 long_to_string (buffer, XINT (number));
|
|
|
1031 return build_string (buffer);
|
|
|
1032 }
|
|
428
|
1033 }
|
|
|
1034
|
|
|
1035 static int
|
|
|
1036 digit_to_number (int character, int base)
|
|
|
1037 {
|
|
|
1038 /* Assumes ASCII */
|
|
|
1039 int digit = ((character >= '0' && character <= '9') ? character - '0' :
|
|
|
1040 (character >= 'a' && character <= 'z') ? character - 'a' + 10 :
|
|
|
1041 (character >= 'A' && character <= 'Z') ? character - 'A' + 10 :
|
|
|
1042 -1);
|
|
|
1043
|
|
|
1044 return digit >= base ? -1 : digit;
|
|
|
1045 }
|
|
|
1046
|
|
|
1047 DEFUN ("string-to-number", Fstring_to_number, 1, 2, 0, /*
|
|
444
|
1048 Convert STRING to a number by parsing it as a number in base BASE.
|
|
428
|
1049 This parses both integers and floating point numbers.
|
|
|
1050 It ignores leading spaces and tabs.
|
|
|
1051
|
|
444
|
1052 If BASE is nil or omitted, base 10 is used.
|
|
|
1053 BASE must be an integer between 2 and 16 (inclusive).
|
|
428
|
1054 Floating point numbers always use base 10.
|
|
|
1055 */
|
|
|
1056 (string, base))
|
|
|
1057 {
|
|
|
1058 char *p;
|
|
|
1059 int b;
|
|
|
1060
|
|
|
1061 CHECK_STRING (string);
|
|
|
1062
|
|
|
1063 if (NILP (base))
|
|
|
1064 b = 10;
|
|
|
1065 else
|
|
|
1066 {
|
|
|
1067 CHECK_INT (base);
|
|
|
1068 b = XINT (base);
|
|
|
1069 check_int_range (b, 2, 16);
|
|
|
1070 }
|
|
|
1071
|
|
|
1072 p = (char *) XSTRING_DATA (string);
|
|
|
1073
|
|
|
1074 /* Skip any whitespace at the front of the number. Some versions of
|
|
|
1075 atoi do this anyway, so we might as well make Emacs lisp consistent. */
|
|
|
1076 while (*p == ' ' || *p == '\t')
|
|
|
1077 p++;
|
|
|
1078
|
|
|
1079 #ifdef LISP_FLOAT_TYPE
|
|
442
|
1080 if (isfloat_string (p) && b == 10)
|
|
428
|
1081 return make_float (atof (p));
|
|
|
1082 #endif /* LISP_FLOAT_TYPE */
|
|
|
1083
|
|
|
1084 if (b == 10)
|
|
|
1085 {
|
|
|
1086 /* Use the system-provided functions for base 10. */
|
|
|
1087 #if SIZEOF_EMACS_INT == SIZEOF_INT
|
|
|
1088 return make_int (atoi (p));
|
|
|
1089 #elif SIZEOF_EMACS_INT == SIZEOF_LONG
|
|
|
1090 return make_int (atol (p));
|
|
|
1091 #elif SIZEOF_EMACS_INT == SIZEOF_LONG_LONG
|
|
|
1092 return make_int (atoll (p));
|
|
|
1093 #endif
|
|
|
1094 }
|
|
|
1095 else
|
|
|
1096 {
|
|
444
|
1097 int negative = 1;
|
|
428
|
1098 EMACS_INT v = 0;
|
|
|
1099
|
|
|
1100 if (*p == '-')
|
|
|
1101 {
|
|
|
1102 negative = -1;
|
|
|
1103 p++;
|
|
|
1104 }
|
|
|
1105 else if (*p == '+')
|
|
|
1106 p++;
|
|
|
1107 while (1)
|
|
|
1108 {
|
|
444
|
1109 int digit = digit_to_number (*p++, b);
|
|
428
|
1110 if (digit < 0)
|
|
|
1111 break;
|
|
|
1112 v = v * b + digit;
|
|
|
1113 }
|
|
|
1114 return make_int (negative * v);
|
|
|
1115 }
|
|
|
1116 }
|
|
|
1117
|
|
|
1118
|
|
|
1119 DEFUN ("+", Fplus, 0, MANY, 0, /*
|
|
|
1120 Return sum of any number of arguments.
|
|
|
1121 The arguments should all be numbers, characters or markers.
|
|
|
1122 */
|
|
|
1123 (int nargs, Lisp_Object *args))
|
|
|
1124 {
|
|
|
1125 EMACS_INT iaccum = 0;
|
|
|
1126 Lisp_Object *args_end = args + nargs;
|
|
|
1127
|
|
|
1128 while (args < args_end)
|
|
|
1129 {
|
|
|
1130 int_or_double iod;
|
|
|
1131 number_char_or_marker_to_int_or_double (*args++, &iod);
|
|
|
1132 if (iod.int_p)
|
|
|
1133 iaccum += iod.c.ival;
|
|
|
1134 else
|
|
|
1135 {
|
|
|
1136 double daccum = (double) iaccum + iod.c.dval;
|
|
|
1137 while (args < args_end)
|
|
|
1138 daccum += number_char_or_marker_to_double (*args++);
|
|
|
1139 return make_float (daccum);
|
|
|
1140 }
|
|
|
1141 }
|
|
|
1142
|
|
|
1143 return make_int (iaccum);
|
|
|
1144 }
|
|
|
1145
|
|
|
1146 DEFUN ("-", Fminus, 1, MANY, 0, /*
|
|
|
1147 Negate number or subtract numbers, characters or markers.
|
|
|
1148 With one arg, negates it. With more than one arg,
|
|
|
1149 subtracts all but the first from the first.
|
|
|
1150 */
|
|
|
1151 (int nargs, Lisp_Object *args))
|
|
|
1152 {
|
|
|
1153 EMACS_INT iaccum;
|
|
|
1154 double daccum;
|
|
|
1155 Lisp_Object *args_end = args + nargs;
|
|
|
1156 int_or_double iod;
|
|
|
1157
|
|
|
1158 number_char_or_marker_to_int_or_double (*args++, &iod);
|
|
|
1159 if (iod.int_p)
|
|
|
1160 iaccum = nargs > 1 ? iod.c.ival : - iod.c.ival;
|
|
|
1161 else
|
|
|
1162 {
|
|
|
1163 daccum = nargs > 1 ? iod.c.dval : - iod.c.dval;
|
|
|
1164 goto do_float;
|
|
|
1165 }
|
|
|
1166
|
|
|
1167 while (args < args_end)
|
|
|
1168 {
|
|
|
1169 number_char_or_marker_to_int_or_double (*args++, &iod);
|
|
|
1170 if (iod.int_p)
|
|
|
1171 iaccum -= iod.c.ival;
|
|
|
1172 else
|
|
|
1173 {
|
|
|
1174 daccum = (double) iaccum - iod.c.dval;
|
|
|
1175 goto do_float;
|
|
|
1176 }
|
|
|
1177 }
|
|
|
1178
|
|
|
1179 return make_int (iaccum);
|
|
|
1180
|
|
|
1181 do_float:
|
|
|
1182 for (; args < args_end; args++)
|
|
|
1183 daccum -= number_char_or_marker_to_double (*args);
|
|
|
1184 return make_float (daccum);
|
|
|
1185 }
|
|
|
1186
|
|
|
1187 DEFUN ("*", Ftimes, 0, MANY, 0, /*
|
|
|
1188 Return product of any number of arguments.
|
|
|
1189 The arguments should all be numbers, characters or markers.
|
|
|
1190 */
|
|
|
1191 (int nargs, Lisp_Object *args))
|
|
|
1192 {
|
|
|
1193 EMACS_INT iaccum = 1;
|
|
|
1194 Lisp_Object *args_end = args + nargs;
|
|
|
1195
|
|
|
1196 while (args < args_end)
|
|
|
1197 {
|
|
|
1198 int_or_double iod;
|
|
|
1199 number_char_or_marker_to_int_or_double (*args++, &iod);
|
|
|
1200 if (iod.int_p)
|
|
|
1201 iaccum *= iod.c.ival;
|
|
|
1202 else
|
|
|
1203 {
|
|
|
1204 double daccum = (double) iaccum * iod.c.dval;
|
|
|
1205 while (args < args_end)
|
|
|
1206 daccum *= number_char_or_marker_to_double (*args++);
|
|
|
1207 return make_float (daccum);
|
|
|
1208 }
|
|
|
1209 }
|
|
|
1210
|
|
|
1211 return make_int (iaccum);
|
|
|
1212 }
|
|
|
1213
|
|
|
1214 DEFUN ("/", Fquo, 1, MANY, 0, /*
|
|
|
1215 Return first argument divided by all the remaining arguments.
|
|
|
1216 The arguments must be numbers, characters or markers.
|
|
|
1217 With one argument, reciprocates the argument.
|
|
|
1218 */
|
|
|
1219 (int nargs, Lisp_Object *args))
|
|
|
1220 {
|
|
|
1221 EMACS_INT iaccum;
|
|
|
1222 double daccum;
|
|
|
1223 Lisp_Object *args_end = args + nargs;
|
|
|
1224 int_or_double iod;
|
|
|
1225
|
|
|
1226 if (nargs == 1)
|
|
|
1227 iaccum = 1;
|
|
|
1228 else
|
|
|
1229 {
|
|
|
1230 number_char_or_marker_to_int_or_double (*args++, &iod);
|
|
|
1231 if (iod.int_p)
|
|
|
1232 iaccum = iod.c.ival;
|
|
|
1233 else
|
|
|
1234 {
|
|
|
1235 daccum = iod.c.dval;
|
|
|
1236 goto divide_floats;
|
|
|
1237 }
|
|
|
1238 }
|
|
|
1239
|
|
|
1240 while (args < args_end)
|
|
|
1241 {
|
|
|
1242 number_char_or_marker_to_int_or_double (*args++, &iod);
|
|
|
1243 if (iod.int_p)
|
|
|
1244 {
|
|
|
1245 if (iod.c.ival == 0) goto divide_by_zero;
|
|
|
1246 iaccum /= iod.c.ival;
|
|
|
1247 }
|
|
|
1248 else
|
|
|
1249 {
|
|
|
1250 if (iod.c.dval == 0) goto divide_by_zero;
|
|
|
1251 daccum = (double) iaccum / iod.c.dval;
|
|
|
1252 goto divide_floats;
|
|
|
1253 }
|
|
|
1254 }
|
|
|
1255
|
|
|
1256 return make_int (iaccum);
|
|
|
1257
|
|
|
1258 divide_floats:
|
|
|
1259 for (; args < args_end; args++)
|
|
|
1260 {
|
|
|
1261 double dval = number_char_or_marker_to_double (*args);
|
|
|
1262 if (dval == 0) goto divide_by_zero;
|
|
|
1263 daccum /= dval;
|
|
|
1264 }
|
|
|
1265 return make_float (daccum);
|
|
|
1266
|
|
|
1267 divide_by_zero:
|
|
|
1268 Fsignal (Qarith_error, Qnil);
|
|
801
|
1269 return Qnil; /* not (usually) reached */
|
|
428
|
1270 }
|
|
|
1271
|
|
|
1272 DEFUN ("max", Fmax, 1, MANY, 0, /*
|
|
|
1273 Return largest of all the arguments.
|
|
|
1274 All arguments must be numbers, characters or markers.
|
|
|
1275 The value is always a number; markers and characters are converted
|
|
|
1276 to numbers.
|
|
|
1277 */
|
|
|
1278 (int nargs, Lisp_Object *args))
|
|
|
1279 {
|
|
|
1280 EMACS_INT imax;
|
|
|
1281 double dmax;
|
|
|
1282 Lisp_Object *args_end = args + nargs;
|
|
|
1283 int_or_double iod;
|
|
|
1284
|
|
|
1285 number_char_or_marker_to_int_or_double (*args++, &iod);
|
|
|
1286 if (iod.int_p)
|
|
|
1287 imax = iod.c.ival;
|
|
|
1288 else
|
|
|
1289 {
|
|
|
1290 dmax = iod.c.dval;
|
|
|
1291 goto max_floats;
|
|
|
1292 }
|
|
|
1293
|
|
|
1294 while (args < args_end)
|
|
|
1295 {
|
|
|
1296 number_char_or_marker_to_int_or_double (*args++, &iod);
|
|
|
1297 if (iod.int_p)
|
|
|
1298 {
|
|
|
1299 if (imax < iod.c.ival) imax = iod.c.ival;
|
|
|
1300 }
|
|
|
1301 else
|
|
|
1302 {
|
|
|
1303 dmax = (double) imax;
|
|
|
1304 if (dmax < iod.c.dval) dmax = iod.c.dval;
|
|
|
1305 goto max_floats;
|
|
|
1306 }
|
|
|
1307 }
|
|
|
1308
|
|
|
1309 return make_int (imax);
|
|
|
1310
|
|
|
1311 max_floats:
|
|
|
1312 while (args < args_end)
|
|
|
1313 {
|
|
|
1314 double dval = number_char_or_marker_to_double (*args++);
|
|
|
1315 if (dmax < dval) dmax = dval;
|
|
|
1316 }
|
|
|
1317 return make_float (dmax);
|
|
|
1318 }
|
|
|
1319
|
|
|
1320 DEFUN ("min", Fmin, 1, MANY, 0, /*
|
|
|
1321 Return smallest of all the arguments.
|
|
|
1322 All arguments must be numbers, characters or markers.
|
|
|
1323 The value is always a number; markers and characters are converted
|
|
|
1324 to numbers.
|
|
|
1325 */
|
|
|
1326 (int nargs, Lisp_Object *args))
|
|
|
1327 {
|
|
|
1328 EMACS_INT imin;
|
|
|
1329 double dmin;
|
|
|
1330 Lisp_Object *args_end = args + nargs;
|
|
|
1331 int_or_double iod;
|
|
|
1332
|
|
|
1333 number_char_or_marker_to_int_or_double (*args++, &iod);
|
|
|
1334 if (iod.int_p)
|
|
|
1335 imin = iod.c.ival;
|
|
|
1336 else
|
|
|
1337 {
|
|
|
1338 dmin = iod.c.dval;
|
|
|
1339 goto min_floats;
|
|
|
1340 }
|
|
|
1341
|
|
|
1342 while (args < args_end)
|
|
|
1343 {
|
|
|
1344 number_char_or_marker_to_int_or_double (*args++, &iod);
|
|
|
1345 if (iod.int_p)
|
|
|
1346 {
|
|
|
1347 if (imin > iod.c.ival) imin = iod.c.ival;
|
|
|
1348 }
|
|
|
1349 else
|
|
|
1350 {
|
|
|
1351 dmin = (double) imin;
|
|
|
1352 if (dmin > iod.c.dval) dmin = iod.c.dval;
|
|
|
1353 goto min_floats;
|
|
|
1354 }
|
|
|
1355 }
|
|
|
1356
|
|
|
1357 return make_int (imin);
|
|
|
1358
|
|
|
1359 min_floats:
|
|
|
1360 while (args < args_end)
|
|
|
1361 {
|
|
|
1362 double dval = number_char_or_marker_to_double (*args++);
|
|
|
1363 if (dmin > dval) dmin = dval;
|
|
|
1364 }
|
|
|
1365 return make_float (dmin);
|
|
|
1366 }
|
|
|
1367
|
|
|
1368 DEFUN ("logand", Flogand, 0, MANY, 0, /*
|
|
|
1369 Return bitwise-and of all the arguments.
|
|
|
1370 Arguments may be integers, or markers or characters converted to integers.
|
|
|
1371 */
|
|
|
1372 (int nargs, Lisp_Object *args))
|
|
|
1373 {
|
|
|
1374 EMACS_INT bits = ~0;
|
|
|
1375 Lisp_Object *args_end = args + nargs;
|
|
|
1376
|
|
|
1377 while (args < args_end)
|
|
|
1378 bits &= integer_char_or_marker_to_int (*args++);
|
|
|
1379
|
|
|
1380 return make_int (bits);
|
|
|
1381 }
|
|
|
1382
|
|
|
1383 DEFUN ("logior", Flogior, 0, MANY, 0, /*
|
|
|
1384 Return bitwise-or of all the arguments.
|
|
|
1385 Arguments may be integers, or markers or characters converted to integers.
|
|
|
1386 */
|
|
|
1387 (int nargs, Lisp_Object *args))
|
|
|
1388 {
|
|
|
1389 EMACS_INT bits = 0;
|
|
|
1390 Lisp_Object *args_end = args + nargs;
|
|
|
1391
|
|
|
1392 while (args < args_end)
|
|
|
1393 bits |= integer_char_or_marker_to_int (*args++);
|
|
|
1394
|
|
|
1395 return make_int (bits);
|
|
|
1396 }
|
|
|
1397
|
|
|
1398 DEFUN ("logxor", Flogxor, 0, MANY, 0, /*
|
|
|
1399 Return bitwise-exclusive-or of all the arguments.
|
|
|
1400 Arguments may be integers, or markers or characters converted to integers.
|
|
|
1401 */
|
|
|
1402 (int nargs, Lisp_Object *args))
|
|
|
1403 {
|
|
|
1404 EMACS_INT bits = 0;
|
|
|
1405 Lisp_Object *args_end = args + nargs;
|
|
|
1406
|
|
|
1407 while (args < args_end)
|
|
|
1408 bits ^= integer_char_or_marker_to_int (*args++);
|
|
|
1409
|
|
|
1410 return make_int (bits);
|
|
|
1411 }
|
|
|
1412
|
|
|
1413 DEFUN ("lognot", Flognot, 1, 1, 0, /*
|
|
|
1414 Return the bitwise complement of NUMBER.
|
|
|
1415 NUMBER may be an integer, marker or character converted to integer.
|
|
|
1416 */
|
|
|
1417 (number))
|
|
|
1418 {
|
|
|
1419 return make_int (~ integer_char_or_marker_to_int (number));
|
|
|
1420 }
|
|
|
1421
|
|
|
1422 DEFUN ("%", Frem, 2, 2, 0, /*
|
|
|
1423 Return remainder of first arg divided by second.
|
|
|
1424 Both must be integers, characters or markers.
|
|
|
1425 */
|
|
444
|
1426 (number1, number2))
|
|
428
|
1427 {
|
|
444
|
1428 EMACS_INT ival1 = integer_char_or_marker_to_int (number1);
|
|
|
1429 EMACS_INT ival2 = integer_char_or_marker_to_int (number2);
|
|
428
|
1430
|
|
|
1431 if (ival2 == 0)
|
|
|
1432 Fsignal (Qarith_error, Qnil);
|
|
|
1433
|
|
|
1434 return make_int (ival1 % ival2);
|
|
|
1435 }
|
|
|
1436
|
|
|
1437 /* Note, ANSI *requires* the presence of the fmod() library routine.
|
|
|
1438 If your system doesn't have it, complain to your vendor, because
|
|
|
1439 that is a bug. */
|
|
|
1440
|
|
|
1441 #ifndef HAVE_FMOD
|
|
|
1442 double
|
|
|
1443 fmod (double f1, double f2)
|
|
|
1444 {
|
|
|
1445 if (f2 < 0.0)
|
|
|
1446 f2 = -f2;
|
|
|
1447 return f1 - f2 * floor (f1/f2);
|
|
|
1448 }
|
|
|
1449 #endif /* ! HAVE_FMOD */
|
|
|
1450
|
|
|
1451
|
|
|
1452 DEFUN ("mod", Fmod, 2, 2, 0, /*
|
|
|
1453 Return X modulo Y.
|
|
|
1454 The result falls between zero (inclusive) and Y (exclusive).
|
|
|
1455 Both X and Y must be numbers, characters or markers.
|
|
|
1456 If either argument is a float, a float will be returned.
|
|
|
1457 */
|
|
|
1458 (x, y))
|
|
|
1459 {
|
|
|
1460 int_or_double iod1, iod2;
|
|
|
1461 number_char_or_marker_to_int_or_double (x, &iod1);
|
|
|
1462 number_char_or_marker_to_int_or_double (y, &iod2);
|
|
|
1463
|
|
|
1464 #ifdef LISP_FLOAT_TYPE
|
|
|
1465 if (!iod1.int_p || !iod2.int_p)
|
|
|
1466 {
|
|
|
1467 double dval1 = iod1.int_p ? (double) iod1.c.ival : iod1.c.dval;
|
|
|
1468 double dval2 = iod2.int_p ? (double) iod2.c.ival : iod2.c.dval;
|
|
|
1469 if (dval2 == 0) goto divide_by_zero;
|
|
|
1470 dval1 = fmod (dval1, dval2);
|
|
|
1471
|
|
|
1472 /* If the "remainder" comes out with the wrong sign, fix it. */
|
|
|
1473 if (dval2 < 0 ? dval1 > 0 : dval1 < 0)
|
|
|
1474 dval1 += dval2;
|
|
|
1475
|
|
|
1476 return make_float (dval1);
|
|
|
1477 }
|
|
|
1478 #endif /* LISP_FLOAT_TYPE */
|
|
|
1479 {
|
|
|
1480 EMACS_INT ival;
|
|
|
1481 if (iod2.c.ival == 0) goto divide_by_zero;
|
|
|
1482
|
|
|
1483 ival = iod1.c.ival % iod2.c.ival;
|
|
|
1484
|
|
|
1485 /* If the "remainder" comes out with the wrong sign, fix it. */
|
|
|
1486 if (iod2.c.ival < 0 ? ival > 0 : ival < 0)
|
|
|
1487 ival += iod2.c.ival;
|
|
|
1488
|
|
|
1489 return make_int (ival);
|
|
|
1490 }
|
|
|
1491
|
|
|
1492 divide_by_zero:
|
|
|
1493 Fsignal (Qarith_error, Qnil);
|
|
801
|
1494 return Qnil; /* not (usually) reached */
|
|
428
|
1495 }
|
|
|
1496
|
|
|
1497 DEFUN ("ash", Fash, 2, 2, 0, /*
|
|
|
1498 Return VALUE with its bits shifted left by COUNT.
|
|
|
1499 If COUNT is negative, shifting is actually to the right.
|
|
|
1500 In this case, the sign bit is duplicated.
|
|
|
1501 */
|
|
|
1502 (value, count))
|
|
|
1503 {
|
|
|
1504 CHECK_INT_COERCE_CHAR (value);
|
|
|
1505 CONCHECK_INT (count);
|
|
|
1506
|
|
|
1507 return make_int (XINT (count) > 0 ?
|
|
|
1508 XINT (value) << XINT (count) :
|
|
|
1509 XINT (value) >> -XINT (count));
|
|
|
1510 }
|
|
|
1511
|
|
|
1512 DEFUN ("lsh", Flsh, 2, 2, 0, /*
|
|
|
1513 Return VALUE with its bits shifted left by COUNT.
|
|
|
1514 If COUNT is negative, shifting is actually to the right.
|
|
|
1515 In this case, zeros are shifted in on the left.
|
|
|
1516 */
|
|
|
1517 (value, count))
|
|
|
1518 {
|
|
|
1519 CHECK_INT_COERCE_CHAR (value);
|
|
|
1520 CONCHECK_INT (count);
|
|
|
1521
|
|
|
1522 return make_int (XINT (count) > 0 ?
|
|
|
1523 XUINT (value) << XINT (count) :
|
|
|
1524 XUINT (value) >> -XINT (count));
|
|
|
1525 }
|
|
|
1526
|
|
|
1527 DEFUN ("1+", Fadd1, 1, 1, 0, /*
|
|
|
1528 Return NUMBER plus one. NUMBER may be a number, character or marker.
|
|
|
1529 Markers and characters are converted to integers.
|
|
|
1530 */
|
|
|
1531 (number))
|
|
|
1532 {
|
|
|
1533 retry:
|
|
|
1534
|
|
|
1535 if (INTP (number)) return make_int (XINT (number) + 1);
|
|
|
1536 if (CHARP (number)) return make_int (XCHAR (number) + 1);
|
|
|
1537 if (MARKERP (number)) return make_int (marker_position (number) + 1);
|
|
|
1538 #ifdef LISP_FLOAT_TYPE
|
|
|
1539 if (FLOATP (number)) return make_float (XFLOAT_DATA (number) + 1.0);
|
|
|
1540 #endif /* LISP_FLOAT_TYPE */
|
|
|
1541
|
|
|
1542 number = wrong_type_argument (Qnumber_char_or_marker_p, number);
|
|
|
1543 goto retry;
|
|
|
1544 }
|
|
|
1545
|
|
|
1546 DEFUN ("1-", Fsub1, 1, 1, 0, /*
|
|
|
1547 Return NUMBER minus one. NUMBER may be a number, character or marker.
|
|
|
1548 Markers and characters are converted to integers.
|
|
|
1549 */
|
|
|
1550 (number))
|
|
|
1551 {
|
|
|
1552 retry:
|
|
|
1553
|
|
|
1554 if (INTP (number)) return make_int (XINT (number) - 1);
|
|
|
1555 if (CHARP (number)) return make_int (XCHAR (number) - 1);
|
|
|
1556 if (MARKERP (number)) return make_int (marker_position (number) - 1);
|
|
|
1557 #ifdef LISP_FLOAT_TYPE
|
|
|
1558 if (FLOATP (number)) return make_float (XFLOAT_DATA (number) - 1.0);
|
|
|
1559 #endif /* LISP_FLOAT_TYPE */
|
|
|
1560
|
|
|
1561 number = wrong_type_argument (Qnumber_char_or_marker_p, number);
|
|
|
1562 goto retry;
|
|
|
1563 }
|
|
|
1564
|
|
|
1565
|
|
|
1566 /************************************************************************/
|
|
|
1567 /* weak lists */
|
|
|
1568 /************************************************************************/
|
|
|
1569
|
|
|
1570 /* A weak list is like a normal list except that elements automatically
|
|
|
1571 disappear when no longer in use, i.e. when no longer GC-protected.
|
|
|
1572 The basic idea is that we don't mark the elements during GC, but
|
|
|
1573 wait for them to be marked elsewhere. If they're not marked, we
|
|
|
1574 remove them. This is analogous to weak hash tables; see the explanation
|
|
|
1575 there for more info. */
|
|
|
1576
|
|
|
1577 static Lisp_Object Vall_weak_lists; /* Gemarke es nicht!!! */
|
|
|
1578
|
|
|
1579 static Lisp_Object encode_weak_list_type (enum weak_list_type type);
|
|
|
1580
|
|
|
1581 static Lisp_Object
|
|
|
1582 mark_weak_list (Lisp_Object obj)
|
|
|
1583 {
|
|
|
1584 return Qnil; /* nichts ist gemarkt */
|
|
|
1585 }
|
|
|
1586
|
|
|
1587 static void
|
|
|
1588 print_weak_list (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag)
|
|
|
1589 {
|
|
|
1590 if (print_readably)
|
|
563
|
1591 printing_unreadable_object ("#<weak-list>");
|
|
428
|
1592
|
|
800
|
1593 write_fmt_string_lisp (printcharfun, "#<weak-list %s %S>", 2,
|
|
|
1594 encode_weak_list_type (XWEAK_LIST (obj)->type),
|
|
|
1595 XWEAK_LIST (obj)->list);
|
|
428
|
1596 }
|
|
|
1597
|
|
|
1598 static int
|
|
|
1599 weak_list_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
|
1600 {
|
|
|
1601 struct weak_list *w1 = XWEAK_LIST (obj1);
|
|
|
1602 struct weak_list *w2 = XWEAK_LIST (obj2);
|
|
|
1603
|
|
|
1604 return ((w1->type == w2->type) &&
|
|
|
1605 internal_equal (w1->list, w2->list, depth + 1));
|
|
|
1606 }
|
|
|
1607
|
|
665
|
1608 static Hashcode
|
|
428
|
1609 weak_list_hash (Lisp_Object obj, int depth)
|
|
|
1610 {
|
|
|
1611 struct weak_list *w = XWEAK_LIST (obj);
|
|
|
1612
|
|
665
|
1613 return HASH2 ((Hashcode) w->type,
|
|
428
|
1614 internal_hash (w->list, depth + 1));
|
|
|
1615 }
|
|
|
1616
|
|
|
1617 Lisp_Object
|
|
|
1618 make_weak_list (enum weak_list_type type)
|
|
|
1619 {
|
|
|
1620 Lisp_Object result;
|
|
|
1621 struct weak_list *wl =
|
|
|
1622 alloc_lcrecord_type (struct weak_list, &lrecord_weak_list);
|
|
|
1623
|
|
|
1624 wl->list = Qnil;
|
|
|
1625 wl->type = type;
|
|
793
|
1626 result = wrap_weak_list (wl);
|
|
428
|
1627 wl->next_weak = Vall_weak_lists;
|
|
|
1628 Vall_weak_lists = result;
|
|
|
1629 return result;
|
|
|
1630 }
|
|
|
1631
|
|
|
1632 static const struct lrecord_description weak_list_description[] = {
|
|
440
|
1633 { XD_LISP_OBJECT, offsetof (struct weak_list, list) },
|
|
|
1634 { XD_LO_LINK, offsetof (struct weak_list, next_weak) },
|
|
428
|
1635 { XD_END }
|
|
|
1636 };
|
|
|
1637
|
|
934
|
1638 #ifdef USE_KKCC
|
|
|
1639 DEFINE_LRECORD_IMPLEMENTATION ("weak-list", weak_list,
|
|
|
1640 1, /*dumpable-flag*/
|
|
|
1641 mark_weak_list, print_weak_list,
|
|
|
1642 0, weak_list_equal, weak_list_hash,
|
|
|
1643 weak_list_description,
|
|
|
1644 struct weak_list);
|
|
|
1645 #else /* not USE_KKCC */
|
|
428
|
1646 DEFINE_LRECORD_IMPLEMENTATION ("weak-list", weak_list,
|
|
|
1647 mark_weak_list, print_weak_list,
|
|
|
1648 0, weak_list_equal, weak_list_hash,
|
|
|
1649 weak_list_description,
|
|
|
1650 struct weak_list);
|
|
934
|
1651 #endif /* not USE_KKCC */
|
|
428
|
1652 /*
|
|
|
1653 -- we do not mark the list elements (either the elements themselves
|
|
|
1654 or the cons cells that hold them) in the normal marking phase.
|
|
|
1655 -- at the end of marking, we go through all weak lists that are
|
|
|
1656 marked, and mark the cons cells that hold all marked
|
|
|
1657 objects, and possibly parts of the objects themselves.
|
|
|
1658 (See alloc.c, "after-mark".)
|
|
|
1659 -- after that, we prune away all the cons cells that are not marked.
|
|
|
1660
|
|
|
1661 WARNING WARNING WARNING WARNING WARNING:
|
|
|
1662
|
|
|
1663 The code in the following two functions is *unbelievably* tricky.
|
|
|
1664 Don't mess with it. You'll be sorry.
|
|
|
1665
|
|
|
1666 Linked lists just majorly suck, d'ya know?
|
|
|
1667 */
|
|
|
1668
|
|
|
1669 int
|
|
|
1670 finish_marking_weak_lists (void)
|
|
|
1671 {
|
|
|
1672 Lisp_Object rest;
|
|
|
1673 int did_mark = 0;
|
|
|
1674
|
|
|
1675 for (rest = Vall_weak_lists;
|
|
|
1676 !NILP (rest);
|
|
|
1677 rest = XWEAK_LIST (rest)->next_weak)
|
|
|
1678 {
|
|
|
1679 Lisp_Object rest2;
|
|
|
1680 enum weak_list_type type = XWEAK_LIST (rest)->type;
|
|
|
1681
|
|
|
1682 if (! marked_p (rest))
|
|
|
1683 /* The weak list is probably garbage. Ignore it. */
|
|
|
1684 continue;
|
|
|
1685
|
|
|
1686 for (rest2 = XWEAK_LIST (rest)->list;
|
|
|
1687 /* We need to be trickier since we're inside of GC;
|
|
|
1688 use CONSP instead of !NILP in case of user-visible
|
|
|
1689 imperfect lists */
|
|
|
1690 CONSP (rest2);
|
|
|
1691 rest2 = XCDR (rest2))
|
|
|
1692 {
|
|
|
1693 Lisp_Object elem;
|
|
|
1694 /* If the element is "marked" (meaning depends on the type
|
|
|
1695 of weak list), we need to mark the cons containing the
|
|
|
1696 element, and maybe the element itself (if only some part
|
|
|
1697 was already marked). */
|
|
|
1698 int need_to_mark_cons = 0;
|
|
|
1699 int need_to_mark_elem = 0;
|
|
|
1700
|
|
|
1701 /* If a cons is already marked, then its car is already marked
|
|
|
1702 (either because of an external pointer or because of
|
|
|
1703 a previous call to this function), and likewise for all
|
|
|
1704 the rest of the elements in the list, so we can stop now. */
|
|
|
1705 if (marked_p (rest2))
|
|
|
1706 break;
|
|
|
1707
|
|
|
1708 elem = XCAR (rest2);
|
|
|
1709
|
|
|
1710 switch (type)
|
|
|
1711 {
|
|
|
1712 case WEAK_LIST_SIMPLE:
|
|
|
1713 if (marked_p (elem))
|
|
|
1714 need_to_mark_cons = 1;
|
|
|
1715 break;
|
|
|
1716
|
|
|
1717 case WEAK_LIST_ASSOC:
|
|
|
1718 if (!CONSP (elem))
|
|
|
1719 {
|
|
|
1720 /* just leave bogus elements there */
|
|
|
1721 need_to_mark_cons = 1;
|
|
|
1722 need_to_mark_elem = 1;
|
|
|
1723 }
|
|
|
1724 else if (marked_p (XCAR (elem)) &&
|
|
|
1725 marked_p (XCDR (elem)))
|
|
|
1726 {
|
|
|
1727 need_to_mark_cons = 1;
|
|
|
1728 /* We still need to mark elem, because it's
|
|
|
1729 probably not marked. */
|
|
|
1730 need_to_mark_elem = 1;
|
|
|
1731 }
|
|
|
1732 break;
|
|
|
1733
|
|
|
1734 case WEAK_LIST_KEY_ASSOC:
|
|
|
1735 if (!CONSP (elem))
|
|
|
1736 {
|
|
|
1737 /* just leave bogus elements there */
|
|
|
1738 need_to_mark_cons = 1;
|
|
|
1739 need_to_mark_elem = 1;
|
|
|
1740 }
|
|
|
1741 else if (marked_p (XCAR (elem)))
|
|
|
1742 {
|
|
|
1743 need_to_mark_cons = 1;
|
|
|
1744 /* We still need to mark elem and XCDR (elem);
|
|
|
1745 marking elem does both */
|
|
|
1746 need_to_mark_elem = 1;
|
|
|
1747 }
|
|
|
1748 break;
|
|
|
1749
|
|
|
1750 case WEAK_LIST_VALUE_ASSOC:
|
|
|
1751 if (!CONSP (elem))
|
|
|
1752 {
|
|
|
1753 /* just leave bogus elements there */
|
|
|
1754 need_to_mark_cons = 1;
|
|
|
1755 need_to_mark_elem = 1;
|
|
|
1756 }
|
|
|
1757 else if (marked_p (XCDR (elem)))
|
|
|
1758 {
|
|
|
1759 need_to_mark_cons = 1;
|
|
|
1760 /* We still need to mark elem and XCAR (elem);
|
|
|
1761 marking elem does both */
|
|
|
1762 need_to_mark_elem = 1;
|
|
|
1763 }
|
|
|
1764 break;
|
|
|
1765
|
|
442
|
1766 case WEAK_LIST_FULL_ASSOC:
|
|
|
1767 if (!CONSP (elem))
|
|
|
1768 {
|
|
|
1769 /* just leave bogus elements there */
|
|
|
1770 need_to_mark_cons = 1;
|
|
|
1771 need_to_mark_elem = 1;
|
|
|
1772 }
|
|
|
1773 else if (marked_p (XCAR (elem)) ||
|
|
|
1774 marked_p (XCDR (elem)))
|
|
|
1775 {
|
|
|
1776 need_to_mark_cons = 1;
|
|
|
1777 /* We still need to mark elem and XCAR (elem);
|
|
|
1778 marking elem does both */
|
|
|
1779 need_to_mark_elem = 1;
|
|
|
1780 }
|
|
|
1781 break;
|
|
|
1782
|
|
428
|
1783 default:
|
|
|
1784 abort ();
|
|
|
1785 }
|
|
|
1786
|
|
|
1787 if (need_to_mark_elem && ! marked_p (elem))
|
|
|
1788 {
|
|
|
1789 mark_object (elem);
|
|
|
1790 did_mark = 1;
|
|
|
1791 }
|
|
|
1792
|
|
|
1793 /* We also need to mark the cons that holds the elem or
|
|
|
1794 assoc-pair. We do *not* want to call (mark_object) here
|
|
|
1795 because that will mark the entire list; we just want to
|
|
|
1796 mark the cons itself.
|
|
|
1797 */
|
|
|
1798 if (need_to_mark_cons)
|
|
|
1799 {
|
|
|
1800 Lisp_Cons *c = XCONS (rest2);
|
|
|
1801 if (!CONS_MARKED_P (c))
|
|
|
1802 {
|
|
|
1803 MARK_CONS (c);
|
|
|
1804 did_mark = 1;
|
|
|
1805 }
|
|
|
1806 }
|
|
|
1807 }
|
|
|
1808
|
|
|
1809 /* In case of imperfect list, need to mark the final cons
|
|
|
1810 because we're not removing it */
|
|
|
1811 if (!NILP (rest2) && ! marked_p (rest2))
|
|
|
1812 {
|
|
|
1813 mark_object (rest2);
|
|
|
1814 did_mark = 1;
|
|
|
1815 }
|
|
|
1816 }
|
|
|
1817
|
|
|
1818 return did_mark;
|
|
|
1819 }
|
|
|
1820
|
|
|
1821 void
|
|
|
1822 prune_weak_lists (void)
|
|
|
1823 {
|
|
|
1824 Lisp_Object rest, prev = Qnil;
|
|
|
1825
|
|
|
1826 for (rest = Vall_weak_lists;
|
|
|
1827 !NILP (rest);
|
|
|
1828 rest = XWEAK_LIST (rest)->next_weak)
|
|
|
1829 {
|
|
|
1830 if (! (marked_p (rest)))
|
|
|
1831 {
|
|
|
1832 /* This weak list itself is garbage. Remove it from the list. */
|
|
|
1833 if (NILP (prev))
|
|
|
1834 Vall_weak_lists = XWEAK_LIST (rest)->next_weak;
|
|
|
1835 else
|
|
|
1836 XWEAK_LIST (prev)->next_weak =
|
|
|
1837 XWEAK_LIST (rest)->next_weak;
|
|
|
1838 }
|
|
|
1839 else
|
|
|
1840 {
|
|
|
1841 Lisp_Object rest2, prev2 = Qnil;
|
|
|
1842 Lisp_Object tortoise;
|
|
|
1843 int go_tortoise = 0;
|
|
|
1844
|
|
|
1845 for (rest2 = XWEAK_LIST (rest)->list, tortoise = rest2;
|
|
|
1846 /* We need to be trickier since we're inside of GC;
|
|
|
1847 use CONSP instead of !NILP in case of user-visible
|
|
|
1848 imperfect lists */
|
|
|
1849 CONSP (rest2);)
|
|
|
1850 {
|
|
|
1851 /* It suffices to check the cons for marking,
|
|
|
1852 regardless of the type of weak list:
|
|
|
1853
|
|
|
1854 -- if the cons is pointed to somewhere else,
|
|
|
1855 then it should stay around and will be marked.
|
|
|
1856 -- otherwise, if it should stay around, it will
|
|
|
1857 have been marked in finish_marking_weak_lists().
|
|
|
1858 -- otherwise, it's not marked and should disappear.
|
|
|
1859 */
|
|
|
1860 if (! marked_p (rest2))
|
|
|
1861 {
|
|
|
1862 /* bye bye :-( */
|
|
|
1863 if (NILP (prev2))
|
|
|
1864 XWEAK_LIST (rest)->list = XCDR (rest2);
|
|
|
1865 else
|
|
|
1866 XCDR (prev2) = XCDR (rest2);
|
|
|
1867 rest2 = XCDR (rest2);
|
|
|
1868 /* Ouch. Circularity checking is even trickier
|
|
|
1869 than I thought. When we cut out a link
|
|
|
1870 like this, we can't advance the turtle or
|
|
|
1871 it'll catch up to us. Imagine that we're
|
|
|
1872 standing on floor tiles and moving forward --
|
|
|
1873 what we just did here is as if the floor
|
|
|
1874 tile under us just disappeared and all the
|
|
|
1875 ones ahead of us slid one tile towards us.
|
|
|
1876 In other words, we didn't move at all;
|
|
|
1877 if the tortoise was one step behind us
|
|
|
1878 previously, it still is, and therefore
|
|
|
1879 it must not move. */
|
|
|
1880 }
|
|
|
1881 else
|
|
|
1882 {
|
|
|
1883 prev2 = rest2;
|
|
|
1884
|
|
|
1885 /* Implementing circularity checking is trickier here
|
|
|
1886 than in other places because we have to guarantee
|
|
|
1887 that we've processed all elements before exiting
|
|
|
1888 due to a circularity. (In most places, an error
|
|
|
1889 is issued upon encountering a circularity, so it
|
|
|
1890 doesn't really matter if all elements are processed.)
|
|
|
1891 The idea is that we process along with the hare
|
|
|
1892 rather than the tortoise. If at any point in
|
|
|
1893 our forward process we encounter the tortoise,
|
|
|
1894 we must have already visited the spot, so we exit.
|
|
|
1895 (If we process with the tortoise, we can fail to
|
|
|
1896 process cases where a cons points to itself, or
|
|
|
1897 where cons A points to cons B, which points to
|
|
|
1898 cons A.) */
|
|
|
1899
|
|
|
1900 rest2 = XCDR (rest2);
|
|
|
1901 if (go_tortoise)
|
|
|
1902 tortoise = XCDR (tortoise);
|
|
|
1903 go_tortoise = !go_tortoise;
|
|
|
1904 if (EQ (rest2, tortoise))
|
|
|
1905 break;
|
|
|
1906 }
|
|
|
1907 }
|
|
|
1908
|
|
|
1909 prev = rest;
|
|
|
1910 }
|
|
|
1911 }
|
|
|
1912 }
|
|
|
1913
|
|
|
1914 static enum weak_list_type
|
|
|
1915 decode_weak_list_type (Lisp_Object symbol)
|
|
|
1916 {
|
|
|
1917 CHECK_SYMBOL (symbol);
|
|
|
1918 if (EQ (symbol, Qsimple)) return WEAK_LIST_SIMPLE;
|
|
|
1919 if (EQ (symbol, Qassoc)) return WEAK_LIST_ASSOC;
|
|
|
1920 if (EQ (symbol, Qold_assoc)) return WEAK_LIST_ASSOC; /* EBOLA ALERT! */
|
|
|
1921 if (EQ (symbol, Qkey_assoc)) return WEAK_LIST_KEY_ASSOC;
|
|
|
1922 if (EQ (symbol, Qvalue_assoc)) return WEAK_LIST_VALUE_ASSOC;
|
|
442
|
1923 if (EQ (symbol, Qfull_assoc)) return WEAK_LIST_FULL_ASSOC;
|
|
428
|
1924
|
|
563
|
1925 invalid_constant ("Invalid weak list type", symbol);
|
|
801
|
1926 RETURN_NOT_REACHED (WEAK_LIST_SIMPLE)
|
|
428
|
1927 }
|
|
|
1928
|
|
|
1929 static Lisp_Object
|
|
|
1930 encode_weak_list_type (enum weak_list_type type)
|
|
|
1931 {
|
|
|
1932 switch (type)
|
|
|
1933 {
|
|
|
1934 case WEAK_LIST_SIMPLE: return Qsimple;
|
|
|
1935 case WEAK_LIST_ASSOC: return Qassoc;
|
|
|
1936 case WEAK_LIST_KEY_ASSOC: return Qkey_assoc;
|
|
|
1937 case WEAK_LIST_VALUE_ASSOC: return Qvalue_assoc;
|
|
442
|
1938 case WEAK_LIST_FULL_ASSOC: return Qfull_assoc;
|
|
428
|
1939 default:
|
|
|
1940 abort ();
|
|
|
1941 }
|
|
|
1942
|
|
801
|
1943 return Qnil; /* not (usually) reached */
|
|
428
|
1944 }
|
|
|
1945
|
|
|
1946 DEFUN ("weak-list-p", Fweak_list_p, 1, 1, 0, /*
|
|
|
1947 Return non-nil if OBJECT is a weak list.
|
|
|
1948 */
|
|
|
1949 (object))
|
|
|
1950 {
|
|
|
1951 return WEAK_LISTP (object) ? Qt : Qnil;
|
|
|
1952 }
|
|
|
1953
|
|
|
1954 DEFUN ("make-weak-list", Fmake_weak_list, 0, 1, 0, /*
|
|
|
1955 Return a new weak list object of type TYPE.
|
|
|
1956 A weak list object is an object that contains a list. This list behaves
|
|
|
1957 like any other list except that its elements do not count towards
|
|
456
|
1958 garbage collection -- if the only pointer to an object is inside a weak
|
|
428
|
1959 list (other than pointers in similar objects such as weak hash tables),
|
|
|
1960 the object is garbage collected and automatically removed from the list.
|
|
|
1961 This is used internally, for example, to manage the list holding the
|
|
|
1962 children of an extent -- an extent that is unused but has a parent will
|
|
|
1963 still be reclaimed, and will automatically be removed from its parent's
|
|
|
1964 list of children.
|
|
|
1965
|
|
|
1966 Optional argument TYPE specifies the type of the weak list, and defaults
|
|
|
1967 to `simple'. Recognized types are
|
|
|
1968
|
|
|
1969 `simple' Objects in the list disappear if not pointed to.
|
|
|
1970 `assoc' Objects in the list disappear if they are conses
|
|
|
1971 and either the car or the cdr of the cons is not
|
|
|
1972 pointed to.
|
|
|
1973 `key-assoc' Objects in the list disappear if they are conses
|
|
|
1974 and the car is not pointed to.
|
|
|
1975 `value-assoc' Objects in the list disappear if they are conses
|
|
|
1976 and the cdr is not pointed to.
|
|
442
|
1977 `full-assoc' Objects in the list disappear if they are conses
|
|
|
1978 and neither the car nor the cdr is pointed to.
|
|
428
|
1979 */
|
|
|
1980 (type))
|
|
|
1981 {
|
|
|
1982 if (NILP (type))
|
|
|
1983 type = Qsimple;
|
|
|
1984
|
|
|
1985 return make_weak_list (decode_weak_list_type (type));
|
|
|
1986 }
|
|
|
1987
|
|
|
1988 DEFUN ("weak-list-type", Fweak_list_type, 1, 1, 0, /*
|
|
|
1989 Return the type of the given weak-list object.
|
|
|
1990 */
|
|
|
1991 (weak))
|
|
|
1992 {
|
|
|
1993 CHECK_WEAK_LIST (weak);
|
|
|
1994 return encode_weak_list_type (XWEAK_LIST (weak)->type);
|
|
|
1995 }
|
|
|
1996
|
|
|
1997 DEFUN ("weak-list-list", Fweak_list_list, 1, 1, 0, /*
|
|
|
1998 Return the list contained in a weak-list object.
|
|
|
1999 */
|
|
|
2000 (weak))
|
|
|
2001 {
|
|
|
2002 CHECK_WEAK_LIST (weak);
|
|
|
2003 return XWEAK_LIST_LIST (weak);
|
|
|
2004 }
|
|
|
2005
|
|
|
2006 DEFUN ("set-weak-list-list", Fset_weak_list_list, 2, 2, 0, /*
|
|
|
2007 Change the list contained in a weak-list object.
|
|
|
2008 */
|
|
|
2009 (weak, new_list))
|
|
|
2010 {
|
|
|
2011 CHECK_WEAK_LIST (weak);
|
|
|
2012 XWEAK_LIST_LIST (weak) = new_list;
|
|
|
2013 return new_list;
|
|
|
2014 }
|
|
|
2015
|
|
888
|
2016
|
|
858
|
2017 /************************************************************************/
|
|
|
2018 /* weak boxes */
|
|
|
2019 /************************************************************************/
|
|
|
2020
|
|
|
2021 static Lisp_Object Vall_weak_boxes; /* Gemarke es niemals ever!!! */
|
|
|
2022
|
|
|
2023 void
|
|
|
2024 prune_weak_boxes (void)
|
|
|
2025 {
|
|
|
2026 Lisp_Object rest, prev = Qnil;
|
|
888
|
2027 int removep = 0;
|
|
858
|
2028
|
|
|
2029 for (rest = Vall_weak_boxes;
|
|
|
2030 !NILP(rest);
|
|
|
2031 rest = XWEAK_BOX (rest)->next_weak_box)
|
|
|
2032 {
|
|
|
2033 if (! (marked_p (rest)))
|
|
888
|
2034 /* This weak box itself is garbage. */
|
|
|
2035 removep = 1;
|
|
|
2036
|
|
|
2037 if (! marked_p (XWEAK_BOX (rest)->value))
|
|
|
2038 {
|
|
|
2039 XSET_WEAK_BOX (rest, Qnil);
|
|
|
2040 removep = 1;
|
|
|
2041 }
|
|
|
2042
|
|
|
2043 if (removep)
|
|
|
2044 {
|
|
|
2045 /* Remove weak box from list. */
|
|
|
2046 if (NILP (prev))
|
|
|
2047 Vall_weak_boxes = XWEAK_BOX (rest)->next_weak_box;
|
|
|
2048 else
|
|
|
2049 XWEAK_BOX (prev)->next_weak_box = XWEAK_BOX (rest)->next_weak_box;
|
|
|
2050 removep = 0;
|
|
|
2051 }
|
|
|
2052 else
|
|
|
2053 prev = rest;
|
|
858
|
2054 }
|
|
|
2055 }
|
|
|
2056
|
|
|
2057 static Lisp_Object
|
|
888
|
2058 mark_weak_box (Lisp_Object obj)
|
|
858
|
2059 {
|
|
|
2060 return Qnil;
|
|
|
2061 }
|
|
|
2062
|
|
|
2063 static void
|
|
|
2064 print_weak_box (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag)
|
|
|
2065 {
|
|
|
2066 if (print_readably)
|
|
|
2067 printing_unreadable_object ("#<weak_box>");
|
|
|
2068 write_fmt_string (printcharfun, "#<weak_box>");
|
|
|
2069 }
|
|
|
2070
|
|
|
2071 static int
|
|
|
2072 weak_box_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
|
2073 {
|
|
888
|
2074 struct weak_box *wb1 = XWEAK_BOX (obj1);
|
|
|
2075 struct weak_box *wb2 = XWEAK_BOX (obj2);
|
|
858
|
2076
|
|
888
|
2077 return (internal_equal (wb1->value, wb2->value, depth + 1));
|
|
858
|
2078 }
|
|
|
2079
|
|
|
2080 static Hashcode
|
|
|
2081 weak_box_hash (Lisp_Object obj, int depth)
|
|
|
2082 {
|
|
888
|
2083 struct weak_box *wb = XWEAK_BOX (obj);
|
|
858
|
2084
|
|
888
|
2085 return internal_hash (wb->value, depth + 1);
|
|
858
|
2086 }
|
|
|
2087
|
|
|
2088 Lisp_Object
|
|
|
2089 make_weak_box (Lisp_Object value)
|
|
|
2090 {
|
|
|
2091 Lisp_Object result;
|
|
|
2092
|
|
|
2093 struct weak_box *wb =
|
|
|
2094 alloc_lcrecord_type (struct weak_box, &lrecord_weak_box);
|
|
|
2095
|
|
|
2096 wb->value = value;
|
|
|
2097 result = wrap_weak_box (wb);
|
|
|
2098 wb->next_weak_box = Vall_weak_boxes;
|
|
|
2099 Vall_weak_boxes = result;
|
|
|
2100 return result;
|
|
|
2101 }
|
|
|
2102
|
|
888
|
2103 static const struct lrecord_description weak_box_description[] = {
|
|
858
|
2104 { XD_LO_LINK, offsetof (struct weak_box, value) },
|
|
888
|
2105 { XD_END}
|
|
858
|
2106 };
|
|
|
2107
|
|
934
|
2108 #ifdef USE_KKCC
|
|
|
2109 DEFINE_LRECORD_IMPLEMENTATION ("weak_box", weak_box,
|
|
|
2110 0, /*dumpable-flag*/
|
|
|
2111 mark_weak_box, print_weak_box,
|
|
|
2112 0, weak_box_equal, weak_box_hash,
|
|
|
2113 weak_box_description,
|
|
|
2114 struct weak_box);
|
|
|
2115 #else /* not USE_KKCC */
|
|
858
|
2116 DEFINE_LRECORD_IMPLEMENTATION ("weak_box", weak_box,
|
|
|
2117 mark_weak_box, print_weak_box,
|
|
|
2118 0, weak_box_equal, weak_box_hash,
|
|
|
2119 weak_box_description,
|
|
|
2120 struct weak_box);
|
|
934
|
2121 #endif /* not USE_KKCC */
|
|
858
|
2122
|
|
|
2123 DEFUN ("make-weak-box", Fmake_weak_box, 1, 1, 0, /*
|
|
|
2124 Return a new weak box from value CONTENTS.
|
|
|
2125 The weak box is a reference to CONTENTS which may be extracted with
|
|
|
2126 `weak-box-ref'. However, the weak box does not contribute to the
|
|
|
2127 reachability of CONTENTS. When CONTENTS is garbage-collected,
|
|
|
2128 `weak-box-ref' will return NIL.
|
|
|
2129 */
|
|
|
2130 (value))
|
|
|
2131 {
|
|
|
2132 return make_weak_box(value);
|
|
|
2133 }
|
|
|
2134
|
|
|
2135 DEFUN ("weak-box-ref", Fweak_box_ref, 1, 1, 0, /*
|
|
|
2136 Return the contents of weak box WEAK-BOX.
|
|
|
2137 If the contents have been GCed, return NIL.
|
|
|
2138 */
|
|
888
|
2139 (wb))
|
|
858
|
2140 {
|
|
888
|
2141 return XWEAK_BOX (wb)->value;
|
|
858
|
2142 }
|
|
|
2143
|
|
|
2144 DEFUN ("weak-box-p", Fweak_boxp, 1, 1, 0, /*
|
|
|
2145 Return non-nil if OBJECT is a weak box.
|
|
|
2146 */
|
|
|
2147 (object))
|
|
|
2148 {
|
|
|
2149 return WEAK_BOXP (object) ? Qt : Qnil;
|
|
|
2150 }
|
|
|
2151
|
|
888
|
2152 /************************************************************************/
|
|
|
2153 /* ephemerons */
|
|
|
2154 /************************************************************************/
|
|
|
2155
|
|
|
2156 static Lisp_Object Vall_ephemerons; /* Gemarke es niemals ever!!! */
|
|
|
2157 static Lisp_Object Vfinalize_list;
|
|
|
2158
|
|
|
2159 int
|
|
|
2160 finish_marking_ephemerons(void)
|
|
|
2161 {
|
|
|
2162 Lisp_Object rest;
|
|
|
2163 int did_mark = 0;
|
|
|
2164
|
|
|
2165 for (rest = Vall_ephemerons;
|
|
|
2166 !NILP (rest);
|
|
|
2167 rest = XEPHEMERON_NEXT (rest))
|
|
|
2168 {
|
|
|
2169 if (marked_p (rest) && ! marked_p (XEPHEMERON (rest)->cons_chain))
|
|
|
2170 {
|
|
|
2171 MARK_CONS (XCONS (XEPHEMERON (rest)->cons_chain));
|
|
|
2172 mark_object (XCAR (XEPHEMERON (rest)->cons_chain));
|
|
|
2173 did_mark = 1;
|
|
|
2174 }
|
|
|
2175 }
|
|
|
2176 return did_mark;
|
|
|
2177 }
|
|
|
2178
|
|
|
2179 void
|
|
|
2180 prune_ephemerons(void)
|
|
|
2181 {
|
|
|
2182 int removep = 0;
|
|
|
2183 Lisp_Object rest = Vall_ephemerons, next, prev = Qnil;
|
|
|
2184
|
|
|
2185 while (! NILP (rest))
|
|
|
2186 {
|
|
|
2187 next = XEPHEMERON_NEXT (rest);
|
|
|
2188
|
|
|
2189 if (marked_p (rest))
|
|
|
2190 /* The ephemeron itself is live ... */
|
|
|
2191 {
|
|
|
2192 if (! marked_p(XEPHEMERON (rest)->key))
|
|
|
2193 /* ... but its key is garbage */
|
|
|
2194 {
|
|
|
2195 removep = 1;
|
|
|
2196 XSET_EPHEMERON_VALUE (rest, Qnil);
|
|
|
2197 if (! NILP (XEPHEMERON_FINALIZER (rest)))
|
|
|
2198 /* Register the finalizer */
|
|
|
2199 {
|
|
|
2200 XSET_EPHEMERON_NEXT (rest, Vfinalize_list);
|
|
|
2201 Vfinalize_list = XEPHEMERON (rest)->cons_chain;
|
|
|
2202 }
|
|
|
2203 }
|
|
|
2204 }
|
|
|
2205 else
|
|
|
2206 /* The ephemeron itself is dead. */
|
|
|
2207 removep = 1;
|
|
|
2208
|
|
|
2209 if (removep)
|
|
|
2210 {
|
|
|
2211 /* Remove it from the list. */
|
|
|
2212 if (NILP (prev))
|
|
|
2213 Vall_ephemerons = next;
|
|
|
2214 else
|
|
|
2215 XSET_EPHEMERON_NEXT (prev, next);
|
|
|
2216 removep = 0;
|
|
|
2217 }
|
|
|
2218 else
|
|
|
2219 prev = rest;
|
|
|
2220
|
|
|
2221 rest = next;
|
|
|
2222 }
|
|
|
2223 }
|
|
|
2224
|
|
|
2225 Lisp_Object
|
|
|
2226 zap_finalize_list(void)
|
|
|
2227 {
|
|
|
2228 Lisp_Object finalizers = Vfinalize_list;
|
|
|
2229
|
|
|
2230 Vfinalize_list = Qnil;
|
|
|
2231
|
|
|
2232 return finalizers;
|
|
|
2233 }
|
|
|
2234
|
|
|
2235 static Lisp_Object
|
|
|
2236 mark_ephemeron (Lisp_Object obj)
|
|
|
2237 {
|
|
|
2238 return Qnil;
|
|
|
2239 }
|
|
|
2240
|
|
|
2241 static void
|
|
|
2242 print_ephemeron (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag)
|
|
|
2243 {
|
|
|
2244 if (print_readably)
|
|
|
2245 printing_unreadable_object ("#<ephemeron>");
|
|
|
2246 write_fmt_string (printcharfun, "#<ephemeron>");
|
|
|
2247 }
|
|
|
2248
|
|
|
2249 static int
|
|
|
2250 ephemeron_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
|
2251 {
|
|
|
2252 return
|
|
|
2253 internal_equal (XEPHEMERON_REF (obj1), XEPHEMERON_REF(obj2), depth + 1);
|
|
|
2254 }
|
|
|
2255
|
|
|
2256 static Hashcode
|
|
|
2257 ephemeron_hash(Lisp_Object obj, int depth)
|
|
|
2258 {
|
|
|
2259 return internal_hash (XEPHEMERON_REF (obj), depth + 1);
|
|
|
2260 }
|
|
|
2261
|
|
|
2262 Lisp_Object
|
|
|
2263 make_ephemeron(Lisp_Object key, Lisp_Object value, Lisp_Object finalizer)
|
|
|
2264 {
|
|
|
2265 Lisp_Object result, temp = Qnil;
|
|
|
2266 struct gcpro gcpro1, gcpro2;
|
|
|
2267
|
|
|
2268 struct ephemeron *eph =
|
|
|
2269 alloc_lcrecord_type (struct ephemeron, &lrecord_ephemeron);
|
|
|
2270
|
|
|
2271 eph->key = Qnil;
|
|
|
2272 eph->cons_chain = Qnil;
|
|
|
2273 eph->value = Qnil;
|
|
|
2274
|
|
|
2275 result = wrap_ephemeron(eph);
|
|
|
2276 GCPRO2 (result, temp);
|
|
|
2277
|
|
|
2278 eph->key = key;
|
|
|
2279 temp = Fcons(value, finalizer);
|
|
|
2280 eph->cons_chain = Fcons(temp, Vall_ephemerons);
|
|
|
2281 eph->value = value;
|
|
|
2282
|
|
|
2283 Vall_ephemerons = result;
|
|
|
2284
|
|
|
2285 UNGCPRO;
|
|
|
2286 return result;
|
|
|
2287 }
|
|
|
2288
|
|
|
2289 static const struct lrecord_description ephemeron_description[] = {
|
|
|
2290 { XD_LISP_OBJECT, offsetof(struct ephemeron, key)},
|
|
|
2291 { XD_LISP_OBJECT, offsetof(struct ephemeron, cons_chain)},
|
|
|
2292 { XD_LISP_OBJECT, offsetof(struct ephemeron, value)},
|
|
|
2293 { XD_END }
|
|
|
2294 };
|
|
|
2295
|
|
934
|
2296 #ifdef USE_KKCC
|
|
|
2297 DEFINE_LRECORD_IMPLEMENTATION ("ephemeron", ephemeron,
|
|
|
2298 0, /*dumpable-flag*/
|
|
|
2299 mark_ephemeron, print_ephemeron,
|
|
|
2300 0, ephemeron_equal, ephemeron_hash,
|
|
|
2301 ephemeron_description,
|
|
|
2302 struct ephemeron);
|
|
|
2303 #else /* not USE_KKCC */
|
|
888
|
2304 DEFINE_LRECORD_IMPLEMENTATION ("ephemeron", ephemeron,
|
|
|
2305 mark_ephemeron, print_ephemeron,
|
|
|
2306 0, ephemeron_equal, ephemeron_hash,
|
|
|
2307 ephemeron_description,
|
|
|
2308 struct ephemeron);
|
|
934
|
2309 #endif /* not USE_KKCC */
|
|
888
|
2310
|
|
|
2311 DEFUN ("make-ephemeron", Fmake_ephemeron, 2, 3, 0, /*
|
|
|
2312 Return a new ephemeron with key KEY, value CONTENTS, and finalizer FINALIZER.
|
|
|
2313 The ephemeron is a reference to CONTENTS which may be extracted with
|
|
|
2314 `ephemeron-ref'. CONTENTS is only reachable through the ephemeron as
|
|
|
2315 long as KEY is reachable; the ephemeron does not contribute to the
|
|
|
2316 reachability of KEY. When KEY becomes unreachable while the ephemeron
|
|
|
2317 itself is still reachable, CONTENTS is queued for finalization: FINALIZER
|
|
|
2318 will possibly be called on CONTENTS some time in the future. Moreover,
|
|
|
2319 future calls to `ephemeron-ref' will return NIL.
|
|
|
2320 */
|
|
|
2321 (key, value, finalizer))
|
|
|
2322 {
|
|
|
2323 return make_ephemeron(key, value, finalizer);
|
|
|
2324 }
|
|
|
2325
|
|
|
2326 DEFUN ("ephemeron-ref", Fephemeron_ref, 1, 1, 0, /*
|
|
|
2327 Return the contents of ephemeron EPHEMERON.
|
|
|
2328 If the contents have been GCed, return NIL.
|
|
|
2329 */
|
|
|
2330 (eph))
|
|
|
2331 {
|
|
|
2332 return XEPHEMERON_REF (eph);
|
|
|
2333 }
|
|
|
2334
|
|
|
2335 DEFUN ("ephemeron-p", Fephemeronp, 1, 1, 0, /*
|
|
|
2336 Return non-nil if OBJECT is an ephemeron.
|
|
|
2337 */
|
|
|
2338 (object))
|
|
|
2339 {
|
|
|
2340 return EPHEMERONP (object) ? Qt : Qnil;
|
|
|
2341 }
|
|
428
|
2342
|
|
|
2343 /************************************************************************/
|
|
|
2344 /* initialization */
|
|
|
2345 /************************************************************************/
|
|
|
2346
|
|
|
2347 static SIGTYPE
|
|
|
2348 arith_error (int signo)
|
|
|
2349 {
|
|
|
2350 EMACS_REESTABLISH_SIGNAL (signo, arith_error);
|
|
|
2351 EMACS_UNBLOCK_SIGNAL (signo);
|
|
563
|
2352 signal_error (Qarith_error, 0, Qunbound);
|
|
428
|
2353 }
|
|
|
2354
|
|
|
2355 void
|
|
|
2356 init_data_very_early (void)
|
|
|
2357 {
|
|
|
2358 /* Don't do this if just dumping out.
|
|
|
2359 We don't want to call `signal' in this case
|
|
|
2360 so that we don't have trouble with dumping
|
|
|
2361 signal-delivering routines in an inconsistent state. */
|
|
|
2362 #ifndef CANNOT_DUMP
|
|
|
2363 if (!initialized)
|
|
|
2364 return;
|
|
|
2365 #endif /* CANNOT_DUMP */
|
|
613
|
2366 EMACS_SIGNAL (SIGFPE, arith_error);
|
|
428
|
2367 #ifdef uts
|
|
613
|
2368 EMACS_SIGNAL (SIGEMT, arith_error);
|
|
428
|
2369 #endif /* uts */
|
|
|
2370 }
|
|
|
2371
|
|
|
2372 void
|
|
|
2373 init_errors_once_early (void)
|
|
|
2374 {
|
|
442
|
2375 DEFSYMBOL (Qerror_conditions);
|
|
|
2376 DEFSYMBOL (Qerror_message);
|
|
428
|
2377
|
|
|
2378 /* We declare the errors here because some other deferrors depend
|
|
|
2379 on some of the errors below. */
|
|
|
2380
|
|
|
2381 /* ERROR is used as a signaler for random errors for which nothing
|
|
|
2382 else is right */
|
|
|
2383
|
|
442
|
2384 DEFERROR (Qerror, "error", Qnil);
|
|
|
2385 DEFERROR_STANDARD (Qquit, Qnil);
|
|
428
|
2386
|
|
563
|
2387 DEFERROR_STANDARD (Qinvalid_argument, Qerror);
|
|
|
2388
|
|
|
2389 DEFERROR_STANDARD (Qsyntax_error, Qinvalid_argument);
|
|
442
|
2390 DEFERROR_STANDARD (Qinvalid_read_syntax, Qsyntax_error);
|
|
563
|
2391 DEFERROR_STANDARD (Qstructure_formation_error, Qsyntax_error);
|
|
|
2392 DEFERROR_STANDARD (Qlist_formation_error, Qstructure_formation_error);
|
|
442
|
2393 DEFERROR_STANDARD (Qmalformed_list, Qlist_formation_error);
|
|
|
2394 DEFERROR_STANDARD (Qmalformed_property_list, Qmalformed_list);
|
|
|
2395 DEFERROR_STANDARD (Qcircular_list, Qlist_formation_error);
|
|
|
2396 DEFERROR_STANDARD (Qcircular_property_list, Qcircular_list);
|
|
428
|
2397
|
|
442
|
2398 DEFERROR_STANDARD (Qwrong_type_argument, Qinvalid_argument);
|
|
|
2399 DEFERROR_STANDARD (Qargs_out_of_range, Qinvalid_argument);
|
|
|
2400 DEFERROR_STANDARD (Qwrong_number_of_arguments, Qinvalid_argument);
|
|
|
2401 DEFERROR_STANDARD (Qinvalid_function, Qinvalid_argument);
|
|
563
|
2402 DEFERROR_STANDARD (Qinvalid_constant, Qinvalid_argument);
|
|
442
|
2403 DEFERROR (Qno_catch, "No catch for tag", Qinvalid_argument);
|
|
|
2404
|
|
563
|
2405 DEFERROR_STANDARD (Qinvalid_state, Qerror);
|
|
442
|
2406 DEFERROR (Qvoid_function, "Symbol's function definition is void",
|
|
|
2407 Qinvalid_state);
|
|
|
2408 DEFERROR (Qcyclic_function_indirection,
|
|
|
2409 "Symbol's chain of function indirections contains a loop",
|
|
|
2410 Qinvalid_state);
|
|
|
2411 DEFERROR (Qvoid_variable, "Symbol's value as variable is void",
|
|
|
2412 Qinvalid_state);
|
|
|
2413 DEFERROR (Qcyclic_variable_indirection,
|
|
|
2414 "Symbol's chain of variable indirections contains a loop",
|
|
|
2415 Qinvalid_state);
|
|
563
|
2416 DEFERROR_STANDARD (Qstack_overflow, Qinvalid_state);
|
|
|
2417 DEFERROR_STANDARD (Qinternal_error, Qinvalid_state);
|
|
|
2418 DEFERROR_STANDARD (Qout_of_memory, Qinvalid_state);
|
|
428
|
2419
|
|
563
|
2420 DEFERROR_STANDARD (Qinvalid_operation, Qerror);
|
|
|
2421 DEFERROR_STANDARD (Qinvalid_change, Qinvalid_operation);
|
|
442
|
2422 DEFERROR (Qsetting_constant, "Attempt to set a constant symbol",
|
|
|
2423 Qinvalid_change);
|
|
563
|
2424 DEFERROR_STANDARD (Qprinting_unreadable_object, Qinvalid_operation);
|
|
|
2425 DEFERROR (Qunimplemented, "Feature not yet implemented", Qinvalid_operation);
|
|
442
|
2426
|
|
563
|
2427 DEFERROR_STANDARD (Qediting_error, Qinvalid_operation);
|
|
442
|
2428 DEFERROR_STANDARD (Qbeginning_of_buffer, Qediting_error);
|
|
|
2429 DEFERROR_STANDARD (Qend_of_buffer, Qediting_error);
|
|
|
2430 DEFERROR (Qbuffer_read_only, "Buffer is read-only", Qediting_error);
|
|
|
2431
|
|
|
2432 DEFERROR (Qio_error, "IO Error", Qinvalid_operation);
|
|
563
|
2433 DEFERROR_STANDARD (Qfile_error, Qio_error);
|
|
|
2434 DEFERROR (Qend_of_file, "End of file or stream", Qfile_error);
|
|
|
2435 DEFERROR_STANDARD (Qconversion_error, Qio_error);
|
|
580
|
2436 DEFERROR_STANDARD (Qtext_conversion_error, Qconversion_error);
|
|
442
|
2437
|
|
|
2438 DEFERROR (Qarith_error, "Arithmetic error", Qinvalid_operation);
|
|
|
2439 DEFERROR (Qrange_error, "Arithmetic range error", Qarith_error);
|
|
|
2440 DEFERROR (Qdomain_error, "Arithmetic domain error", Qarith_error);
|
|
|
2441 DEFERROR (Qsingularity_error, "Arithmetic singularity error", Qdomain_error);
|
|
|
2442 DEFERROR (Qoverflow_error, "Arithmetic overflow error", Qdomain_error);
|
|
|
2443 DEFERROR (Qunderflow_error, "Arithmetic underflow error", Qdomain_error);
|
|
428
|
2444 }
|
|
|
2445
|
|
|
2446 void
|
|
|
2447 syms_of_data (void)
|
|
|
2448 {
|
|
442
|
2449 INIT_LRECORD_IMPLEMENTATION (weak_list);
|
|
888
|
2450 INIT_LRECORD_IMPLEMENTATION (ephemeron);
|
|
858
|
2451 INIT_LRECORD_IMPLEMENTATION (weak_box);
|
|
442
|
2452
|
|
|
2453 DEFSYMBOL (Qquote);
|
|
|
2454 DEFSYMBOL (Qlambda);
|
|
|
2455 DEFSYMBOL (Qlistp);
|
|
|
2456 DEFSYMBOL (Qtrue_list_p);
|
|
|
2457 DEFSYMBOL (Qconsp);
|
|
|
2458 DEFSYMBOL (Qsubrp);
|
|
|
2459 DEFSYMBOL (Qsymbolp);
|
|
|
2460 DEFSYMBOL (Qintegerp);
|
|
|
2461 DEFSYMBOL (Qcharacterp);
|
|
|
2462 DEFSYMBOL (Qnatnump);
|
|
|
2463 DEFSYMBOL (Qstringp);
|
|
|
2464 DEFSYMBOL (Qarrayp);
|
|
|
2465 DEFSYMBOL (Qsequencep);
|
|
|
2466 DEFSYMBOL (Qbufferp);
|
|
|
2467 DEFSYMBOL (Qbitp);
|
|
|
2468 DEFSYMBOL_MULTIWORD_PREDICATE (Qbit_vectorp);
|
|
|
2469 DEFSYMBOL (Qvectorp);
|
|
|
2470 DEFSYMBOL (Qchar_or_string_p);
|
|
|
2471 DEFSYMBOL (Qmarkerp);
|
|
|
2472 DEFSYMBOL (Qinteger_or_marker_p);
|
|
|
2473 DEFSYMBOL (Qinteger_or_char_p);
|
|
|
2474 DEFSYMBOL (Qinteger_char_or_marker_p);
|
|
|
2475 DEFSYMBOL (Qnumberp);
|
|
|
2476 DEFSYMBOL (Qnumber_char_or_marker_p);
|
|
|
2477 DEFSYMBOL (Qcdr);
|
|
563
|
2478 DEFSYMBOL (Qerror_lacks_explanatory_string);
|
|
442
|
2479 DEFSYMBOL_MULTIWORD_PREDICATE (Qweak_listp);
|
|
428
|
2480
|
|
|
2481 #ifdef LISP_FLOAT_TYPE
|
|
442
|
2482 DEFSYMBOL (Qfloatp);
|
|
428
|
2483 #endif /* LISP_FLOAT_TYPE */
|
|
|
2484
|
|
|
2485 DEFSUBR (Fwrong_type_argument);
|
|
|
2486
|
|
|
2487 DEFSUBR (Feq);
|
|
|
2488 DEFSUBR (Fold_eq);
|
|
|
2489 DEFSUBR (Fnull);
|
|
|
2490 Ffset (intern ("not"), intern ("null"));
|
|
|
2491 DEFSUBR (Flistp);
|
|
|
2492 DEFSUBR (Fnlistp);
|
|
|
2493 DEFSUBR (Ftrue_list_p);
|
|
|
2494 DEFSUBR (Fconsp);
|
|
|
2495 DEFSUBR (Fatom);
|
|
|
2496 DEFSUBR (Fchar_or_string_p);
|
|
|
2497 DEFSUBR (Fcharacterp);
|
|
|
2498 DEFSUBR (Fchar_int_p);
|
|
|
2499 DEFSUBR (Fchar_to_int);
|
|
|
2500 DEFSUBR (Fint_to_char);
|
|
|
2501 DEFSUBR (Fchar_or_char_int_p);
|
|
|
2502 DEFSUBR (Fintegerp);
|
|
|
2503 DEFSUBR (Finteger_or_marker_p);
|
|
|
2504 DEFSUBR (Finteger_or_char_p);
|
|
|
2505 DEFSUBR (Finteger_char_or_marker_p);
|
|
|
2506 DEFSUBR (Fnumberp);
|
|
|
2507 DEFSUBR (Fnumber_or_marker_p);
|
|
|
2508 DEFSUBR (Fnumber_char_or_marker_p);
|
|
|
2509 #ifdef LISP_FLOAT_TYPE
|
|
|
2510 DEFSUBR (Ffloatp);
|
|
|
2511 #endif /* LISP_FLOAT_TYPE */
|
|
|
2512 DEFSUBR (Fnatnump);
|
|
|
2513 DEFSUBR (Fsymbolp);
|
|
|
2514 DEFSUBR (Fkeywordp);
|
|
|
2515 DEFSUBR (Fstringp);
|
|
|
2516 DEFSUBR (Fvectorp);
|
|
|
2517 DEFSUBR (Fbitp);
|
|
|
2518 DEFSUBR (Fbit_vector_p);
|
|
|
2519 DEFSUBR (Farrayp);
|
|
|
2520 DEFSUBR (Fsequencep);
|
|
|
2521 DEFSUBR (Fmarkerp);
|
|
|
2522 DEFSUBR (Fsubrp);
|
|
|
2523 DEFSUBR (Fsubr_min_args);
|
|
|
2524 DEFSUBR (Fsubr_max_args);
|
|
|
2525 DEFSUBR (Fsubr_interactive);
|
|
|
2526 DEFSUBR (Ftype_of);
|
|
|
2527 DEFSUBR (Fcar);
|
|
|
2528 DEFSUBR (Fcdr);
|
|
|
2529 DEFSUBR (Fcar_safe);
|
|
|
2530 DEFSUBR (Fcdr_safe);
|
|
|
2531 DEFSUBR (Fsetcar);
|
|
|
2532 DEFSUBR (Fsetcdr);
|
|
|
2533 DEFSUBR (Findirect_function);
|
|
|
2534 DEFSUBR (Faref);
|
|
|
2535 DEFSUBR (Faset);
|
|
|
2536
|
|
|
2537 DEFSUBR (Fnumber_to_string);
|
|
|
2538 DEFSUBR (Fstring_to_number);
|
|
|
2539 DEFSUBR (Feqlsign);
|
|
|
2540 DEFSUBR (Flss);
|
|
|
2541 DEFSUBR (Fgtr);
|
|
|
2542 DEFSUBR (Fleq);
|
|
|
2543 DEFSUBR (Fgeq);
|
|
|
2544 DEFSUBR (Fneq);
|
|
|
2545 DEFSUBR (Fzerop);
|
|
|
2546 DEFSUBR (Fplus);
|
|
|
2547 DEFSUBR (Fminus);
|
|
|
2548 DEFSUBR (Ftimes);
|
|
|
2549 DEFSUBR (Fquo);
|
|
|
2550 DEFSUBR (Frem);
|
|
|
2551 DEFSUBR (Fmod);
|
|
|
2552 DEFSUBR (Fmax);
|
|
|
2553 DEFSUBR (Fmin);
|
|
|
2554 DEFSUBR (Flogand);
|
|
|
2555 DEFSUBR (Flogior);
|
|
|
2556 DEFSUBR (Flogxor);
|
|
|
2557 DEFSUBR (Flsh);
|
|
|
2558 DEFSUBR (Fash);
|
|
|
2559 DEFSUBR (Fadd1);
|
|
|
2560 DEFSUBR (Fsub1);
|
|
|
2561 DEFSUBR (Flognot);
|
|
|
2562
|
|
|
2563 DEFSUBR (Fweak_list_p);
|
|
|
2564 DEFSUBR (Fmake_weak_list);
|
|
|
2565 DEFSUBR (Fweak_list_type);
|
|
|
2566 DEFSUBR (Fweak_list_list);
|
|
|
2567 DEFSUBR (Fset_weak_list_list);
|
|
858
|
2568
|
|
888
|
2569 DEFSUBR (Fmake_ephemeron);
|
|
|
2570 DEFSUBR (Fephemeron_ref);
|
|
|
2571 DEFSUBR (Fephemeronp);
|
|
858
|
2572 DEFSUBR (Fmake_weak_box);
|
|
|
2573 DEFSUBR (Fweak_box_ref);
|
|
|
2574 DEFSUBR (Fweak_boxp);
|
|
428
|
2575 }
|
|
|
2576
|
|
|
2577 void
|
|
|
2578 vars_of_data (void)
|
|
|
2579 {
|
|
|
2580 /* This must not be staticpro'd */
|
|
|
2581 Vall_weak_lists = Qnil;
|
|
452
|
2582 dump_add_weak_object_chain (&Vall_weak_lists);
|
|
428
|
2583
|
|
888
|
2584 Vall_ephemerons = Qnil;
|
|
|
2585 dump_add_weak_object_chain (&Vall_ephemerons);
|
|
|
2586
|
|
|
2587 Vfinalize_list = Qnil;
|
|
|
2588 staticpro (&Vfinalize_list);
|
|
|
2589
|
|
858
|
2590 Vall_weak_boxes = Qnil;
|
|
|
2591 dump_add_weak_object_chain (&Vall_weak_boxes);
|
|
|
2592
|
|
428
|
2593 #ifdef DEBUG_XEMACS
|
|
|
2594 DEFVAR_BOOL ("debug-issue-ebola-notices", &debug_issue_ebola_notices /*
|
|
|
2595 If non-zero, note when your code may be suffering from char-int confoundance.
|
|
|
2596 That is to say, if XEmacs encounters a usage of `eq', `memq', `equal',
|
|
|
2597 etc. where an int and a char with the same value are being compared,
|
|
|
2598 it will issue a notice on stderr to this effect, along with a backtrace.
|
|
|
2599 In such situations, the result would be different in XEmacs 19 versus
|
|
|
2600 XEmacs 20, and you probably don't want this.
|
|
|
2601
|
|
|
2602 Note that in order to see these notices, you have to byte compile your
|
|
|
2603 code under XEmacs 20 -- any code byte-compiled under XEmacs 19 will
|
|
|
2604 have its chars and ints all confounded in the byte code, making it
|
|
|
2605 impossible to accurately determine Ebola infection.
|
|
|
2606 */ );
|
|
|
2607
|
|
|
2608 debug_issue_ebola_notices = 0;
|
|
|
2609
|
|
|
2610 DEFVAR_INT ("debug-ebola-backtrace-length",
|
|
|
2611 &debug_ebola_backtrace_length /*
|
|
|
2612 Length (in stack frames) of short backtrace printed out in Ebola notices.
|
|
|
2613 See `debug-issue-ebola-notices'.
|
|
|
2614 */ );
|
|
|
2615 debug_ebola_backtrace_length = 32;
|
|
|
2616
|
|
|
2617 #endif /* DEBUG_XEMACS */
|
|
|
2618 }
|
