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