| 1 | /* Random utility Lisp functions. |
| 2 | Copyright (C) 1985, 86, 87, 93, 94, 95 Free Software Foundation, Inc. |
| 3 | |
| 4 | This file is part of GNU Emacs. |
| 5 | |
| 6 | GNU Emacs is free software; you can redistribute it and/or modify |
| 7 | it under the terms of the GNU General Public License as published by |
| 8 | the Free Software Foundation; either version 2, or (at your option) |
| 9 | any later version. |
| 10 | |
| 11 | GNU Emacs is distributed in the hope that it will be useful, |
| 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 | GNU General Public License for more details. |
| 15 | |
| 16 | You should have received a copy of the GNU General Public License |
| 17 | along with GNU Emacs; see the file COPYING. If not, write to |
| 18 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
| 19 | Boston, MA 02111-1307, USA. */ |
| 20 | |
| 21 | |
| 22 | #include <config.h> |
| 23 | |
| 24 | /* Note on some machines this defines `vector' as a typedef, |
| 25 | so make sure we don't use that name in this file. */ |
| 26 | #undef vector |
| 27 | #define vector ***** |
| 28 | |
| 29 | #include "lisp.h" |
| 30 | #include "commands.h" |
| 31 | #include "charset.h" |
| 32 | |
| 33 | #include "buffer.h" |
| 34 | #include "keyboard.h" |
| 35 | #include "intervals.h" |
| 36 | #include "frame.h" |
| 37 | #include "window.h" |
| 38 | |
| 39 | #ifndef NULL |
| 40 | #define NULL (void *)0 |
| 41 | #endif |
| 42 | |
| 43 | extern Lisp_Object Flookup_key (); |
| 44 | |
| 45 | extern int minibuffer_auto_raise; |
| 46 | extern Lisp_Object minibuf_window; |
| 47 | |
| 48 | Lisp_Object Qstring_lessp, Qprovide, Qrequire; |
| 49 | Lisp_Object Qyes_or_no_p_history; |
| 50 | Lisp_Object Qcursor_in_echo_area; |
| 51 | |
| 52 | static int internal_equal (); |
| 53 | \f |
| 54 | DEFUN ("identity", Fidentity, Sidentity, 1, 1, 0, |
| 55 | "Return the argument unchanged.") |
| 56 | (arg) |
| 57 | Lisp_Object arg; |
| 58 | { |
| 59 | return arg; |
| 60 | } |
| 61 | |
| 62 | extern long get_random (); |
| 63 | extern void seed_random (); |
| 64 | extern long time (); |
| 65 | |
| 66 | DEFUN ("random", Frandom, Srandom, 0, 1, 0, |
| 67 | "Return a pseudo-random number.\n\ |
| 68 | All integers representable in Lisp are equally likely.\n\ |
| 69 | On most systems, this is 28 bits' worth.\n\ |
| 70 | With positive integer argument N, return random number in interval [0,N).\n\ |
| 71 | With argument t, set the random number seed from the current time and pid.") |
| 72 | (n) |
| 73 | Lisp_Object n; |
| 74 | { |
| 75 | EMACS_INT val; |
| 76 | Lisp_Object lispy_val; |
| 77 | unsigned long denominator; |
| 78 | |
| 79 | if (EQ (n, Qt)) |
| 80 | seed_random (getpid () + time (NULL)); |
| 81 | if (NATNUMP (n) && XFASTINT (n) != 0) |
| 82 | { |
| 83 | /* Try to take our random number from the higher bits of VAL, |
| 84 | not the lower, since (says Gentzel) the low bits of `random' |
| 85 | are less random than the higher ones. We do this by using the |
| 86 | quotient rather than the remainder. At the high end of the RNG |
| 87 | it's possible to get a quotient larger than n; discarding |
| 88 | these values eliminates the bias that would otherwise appear |
| 89 | when using a large n. */ |
| 90 | denominator = ((unsigned long)1 << VALBITS) / XFASTINT (n); |
| 91 | do |
| 92 | val = get_random () / denominator; |
| 93 | while (val >= XFASTINT (n)); |
| 94 | } |
| 95 | else |
| 96 | val = get_random (); |
| 97 | XSETINT (lispy_val, val); |
| 98 | return lispy_val; |
| 99 | } |
| 100 | \f |
| 101 | /* Random data-structure functions */ |
| 102 | |
| 103 | DEFUN ("length", Flength, Slength, 1, 1, 0, |
| 104 | "Return the length of vector, list or string SEQUENCE.\n\ |
| 105 | A byte-code function object is also allowed.") |
| 106 | (sequence) |
| 107 | register Lisp_Object sequence; |
| 108 | { |
| 109 | register Lisp_Object tail, val; |
| 110 | register int i; |
| 111 | |
| 112 | retry: |
| 113 | if (STRINGP (sequence)) |
| 114 | XSETFASTINT (val, XSTRING (sequence)->size); |
| 115 | else if (VECTORP (sequence)) |
| 116 | XSETFASTINT (val, XVECTOR (sequence)->size); |
| 117 | else if (CHAR_TABLE_P (sequence)) |
| 118 | XSETFASTINT (val, CHAR_TABLE_ORDINARY_SLOTS); |
| 119 | else if (BOOL_VECTOR_P (sequence)) |
| 120 | XSETFASTINT (val, XBOOL_VECTOR (sequence)->size); |
| 121 | else if (COMPILEDP (sequence)) |
| 122 | XSETFASTINT (val, XVECTOR (sequence)->size & PSEUDOVECTOR_SIZE_MASK); |
| 123 | else if (CONSP (sequence)) |
| 124 | { |
| 125 | for (i = 0, tail = sequence; !NILP (tail); i++) |
| 126 | { |
| 127 | QUIT; |
| 128 | tail = Fcdr (tail); |
| 129 | } |
| 130 | |
| 131 | XSETFASTINT (val, i); |
| 132 | } |
| 133 | else if (NILP (sequence)) |
| 134 | XSETFASTINT (val, 0); |
| 135 | else |
| 136 | { |
| 137 | sequence = wrong_type_argument (Qsequencep, sequence); |
| 138 | goto retry; |
| 139 | } |
| 140 | return val; |
| 141 | } |
| 142 | |
| 143 | /* This does not check for quits. That is safe |
| 144 | since it must terminate. */ |
| 145 | |
| 146 | DEFUN ("safe-length", Fsafe_length, Ssafe_length, 1, 1, 0, |
| 147 | "Return the length of a list, but avoid error or infinite loop.\n\ |
| 148 | This function never gets an error. If LIST is not really a list,\n\ |
| 149 | it returns 0. If LIST is circular, it returns a finite value\n\ |
| 150 | which is at least the number of distinct elements.") |
| 151 | (list) |
| 152 | Lisp_Object list; |
| 153 | { |
| 154 | Lisp_Object tail, halftail, length; |
| 155 | int len = 0; |
| 156 | |
| 157 | /* halftail is used to detect circular lists. */ |
| 158 | halftail = list; |
| 159 | for (tail = list; CONSP (tail); tail = XCONS (tail)->cdr) |
| 160 | { |
| 161 | if (EQ (tail, halftail) && len != 0) |
| 162 | break; |
| 163 | len++; |
| 164 | if ((len & 1) == 0) |
| 165 | halftail = XCONS (halftail)->cdr; |
| 166 | } |
| 167 | |
| 168 | XSETINT (length, len); |
| 169 | return length; |
| 170 | } |
| 171 | |
| 172 | DEFUN ("string-equal", Fstring_equal, Sstring_equal, 2, 2, 0, |
| 173 | "T if two strings have identical contents.\n\ |
| 174 | Case is significant, but text properties are ignored.\n\ |
| 175 | Symbols are also allowed; their print names are used instead.") |
| 176 | (s1, s2) |
| 177 | register Lisp_Object s1, s2; |
| 178 | { |
| 179 | if (SYMBOLP (s1)) |
| 180 | XSETSTRING (s1, XSYMBOL (s1)->name); |
| 181 | if (SYMBOLP (s2)) |
| 182 | XSETSTRING (s2, XSYMBOL (s2)->name); |
| 183 | CHECK_STRING (s1, 0); |
| 184 | CHECK_STRING (s2, 1); |
| 185 | |
| 186 | if (XSTRING (s1)->size != XSTRING (s2)->size || |
| 187 | bcmp (XSTRING (s1)->data, XSTRING (s2)->data, XSTRING (s1)->size)) |
| 188 | return Qnil; |
| 189 | return Qt; |
| 190 | } |
| 191 | |
| 192 | DEFUN ("string-lessp", Fstring_lessp, Sstring_lessp, 2, 2, 0, |
| 193 | "T if first arg string is less than second in lexicographic order.\n\ |
| 194 | Case is significant.\n\ |
| 195 | Symbols are also allowed; their print names are used instead.") |
| 196 | (s1, s2) |
| 197 | register Lisp_Object s1, s2; |
| 198 | { |
| 199 | register int i; |
| 200 | register unsigned char *p1, *p2; |
| 201 | register int end; |
| 202 | |
| 203 | if (SYMBOLP (s1)) |
| 204 | XSETSTRING (s1, XSYMBOL (s1)->name); |
| 205 | if (SYMBOLP (s2)) |
| 206 | XSETSTRING (s2, XSYMBOL (s2)->name); |
| 207 | CHECK_STRING (s1, 0); |
| 208 | CHECK_STRING (s2, 1); |
| 209 | |
| 210 | p1 = XSTRING (s1)->data; |
| 211 | p2 = XSTRING (s2)->data; |
| 212 | end = XSTRING (s1)->size; |
| 213 | if (end > XSTRING (s2)->size) |
| 214 | end = XSTRING (s2)->size; |
| 215 | |
| 216 | for (i = 0; i < end; i++) |
| 217 | { |
| 218 | if (p1[i] != p2[i]) |
| 219 | return p1[i] < p2[i] ? Qt : Qnil; |
| 220 | } |
| 221 | return i < XSTRING (s2)->size ? Qt : Qnil; |
| 222 | } |
| 223 | \f |
| 224 | static Lisp_Object concat (); |
| 225 | |
| 226 | /* ARGSUSED */ |
| 227 | Lisp_Object |
| 228 | concat2 (s1, s2) |
| 229 | Lisp_Object s1, s2; |
| 230 | { |
| 231 | #ifdef NO_ARG_ARRAY |
| 232 | Lisp_Object args[2]; |
| 233 | args[0] = s1; |
| 234 | args[1] = s2; |
| 235 | return concat (2, args, Lisp_String, 0); |
| 236 | #else |
| 237 | return concat (2, &s1, Lisp_String, 0); |
| 238 | #endif /* NO_ARG_ARRAY */ |
| 239 | } |
| 240 | |
| 241 | /* ARGSUSED */ |
| 242 | Lisp_Object |
| 243 | concat3 (s1, s2, s3) |
| 244 | Lisp_Object s1, s2, s3; |
| 245 | { |
| 246 | #ifdef NO_ARG_ARRAY |
| 247 | Lisp_Object args[3]; |
| 248 | args[0] = s1; |
| 249 | args[1] = s2; |
| 250 | args[2] = s3; |
| 251 | return concat (3, args, Lisp_String, 0); |
| 252 | #else |
| 253 | return concat (3, &s1, Lisp_String, 0); |
| 254 | #endif /* NO_ARG_ARRAY */ |
| 255 | } |
| 256 | |
| 257 | DEFUN ("append", Fappend, Sappend, 0, MANY, 0, |
| 258 | "Concatenate all the arguments and make the result a list.\n\ |
| 259 | The result is a list whose elements are the elements of all the arguments.\n\ |
| 260 | Each argument may be a list, vector or string.\n\ |
| 261 | The last argument is not copied, just used as the tail of the new list.") |
| 262 | (nargs, args) |
| 263 | int nargs; |
| 264 | Lisp_Object *args; |
| 265 | { |
| 266 | return concat (nargs, args, Lisp_Cons, 1); |
| 267 | } |
| 268 | |
| 269 | DEFUN ("concat", Fconcat, Sconcat, 0, MANY, 0, |
| 270 | "Concatenate all the arguments and make the result a string.\n\ |
| 271 | The result is a string whose elements are the elements of all the arguments.\n\ |
| 272 | Each argument may be a string or a list or vector of characters (integers).\n\ |
| 273 | \n\ |
| 274 | Do not use individual integers as arguments!\n\ |
| 275 | The behavior of `concat' in that case will be changed later!\n\ |
| 276 | If your program passes an integer as an argument to `concat',\n\ |
| 277 | you should change it right away not to do so.") |
| 278 | (nargs, args) |
| 279 | int nargs; |
| 280 | Lisp_Object *args; |
| 281 | { |
| 282 | return concat (nargs, args, Lisp_String, 0); |
| 283 | } |
| 284 | |
| 285 | DEFUN ("vconcat", Fvconcat, Svconcat, 0, MANY, 0, |
| 286 | "Concatenate all the arguments and make the result a vector.\n\ |
| 287 | The result is a vector whose elements are the elements of all the arguments.\n\ |
| 288 | Each argument may be a list, vector or string.") |
| 289 | (nargs, args) |
| 290 | int nargs; |
| 291 | Lisp_Object *args; |
| 292 | { |
| 293 | return concat (nargs, args, Lisp_Vectorlike, 0); |
| 294 | } |
| 295 | |
| 296 | /* Retrun a copy of a sub char table ARG. The elements except for a |
| 297 | nested sub char table are not copied. */ |
| 298 | static Lisp_Object |
| 299 | copy_sub_char_table (arg) |
| 300 | Lisp_Object arg; |
| 301 | { |
| 302 | Lisp_Object copy = make_sub_char_table (XCHAR_TABLE (arg)->defalt); |
| 303 | int i; |
| 304 | |
| 305 | /* Copy all the contents. */ |
| 306 | bcopy (XCHAR_TABLE (arg)->contents, XCHAR_TABLE (copy)->contents, |
| 307 | SUB_CHAR_TABLE_ORDINARY_SLOTS * sizeof (Lisp_Object)); |
| 308 | /* Recursively copy any sub char-tables in the ordinary slots. */ |
| 309 | for (i = 32; i < SUB_CHAR_TABLE_ORDINARY_SLOTS; i++) |
| 310 | if (SUB_CHAR_TABLE_P (XCHAR_TABLE (arg)->contents[i])) |
| 311 | XCHAR_TABLE (copy)->contents[i] |
| 312 | = copy_sub_char_table (XCHAR_TABLE (copy)->contents[i]); |
| 313 | |
| 314 | return copy; |
| 315 | } |
| 316 | |
| 317 | |
| 318 | DEFUN ("copy-sequence", Fcopy_sequence, Scopy_sequence, 1, 1, 0, |
| 319 | "Return a copy of a list, vector or string.\n\ |
| 320 | The elements of a list or vector are not copied; they are shared\n\ |
| 321 | with the original.") |
| 322 | (arg) |
| 323 | Lisp_Object arg; |
| 324 | { |
| 325 | if (NILP (arg)) return arg; |
| 326 | |
| 327 | if (CHAR_TABLE_P (arg)) |
| 328 | { |
| 329 | int i; |
| 330 | Lisp_Object copy; |
| 331 | |
| 332 | copy = Fmake_char_table (XCHAR_TABLE (arg)->purpose, Qnil); |
| 333 | /* Copy all the slots, including the extra ones. */ |
| 334 | bcopy (XVECTOR (arg)->contents, XVECTOR (copy)->contents, |
| 335 | ((XCHAR_TABLE (arg)->size & PSEUDOVECTOR_SIZE_MASK) |
| 336 | * sizeof (Lisp_Object))); |
| 337 | |
| 338 | /* Recursively copy any sub char tables in the ordinary slots |
| 339 | for multibyte characters. */ |
| 340 | for (i = CHAR_TABLE_SINGLE_BYTE_SLOTS; |
| 341 | i < CHAR_TABLE_ORDINARY_SLOTS; i++) |
| 342 | if (SUB_CHAR_TABLE_P (XCHAR_TABLE (arg)->contents[i])) |
| 343 | XCHAR_TABLE (copy)->contents[i] |
| 344 | = copy_sub_char_table (XCHAR_TABLE (copy)->contents[i]); |
| 345 | |
| 346 | return copy; |
| 347 | } |
| 348 | |
| 349 | if (BOOL_VECTOR_P (arg)) |
| 350 | { |
| 351 | Lisp_Object val; |
| 352 | int size_in_chars |
| 353 | = (XBOOL_VECTOR (arg)->size + BITS_PER_CHAR - 1) / BITS_PER_CHAR; |
| 354 | |
| 355 | val = Fmake_bool_vector (Flength (arg), Qnil); |
| 356 | bcopy (XBOOL_VECTOR (arg)->data, XBOOL_VECTOR (val)->data, |
| 357 | size_in_chars); |
| 358 | return val; |
| 359 | } |
| 360 | |
| 361 | if (!CONSP (arg) && !VECTORP (arg) && !STRINGP (arg)) |
| 362 | arg = wrong_type_argument (Qsequencep, arg); |
| 363 | return concat (1, &arg, CONSP (arg) ? Lisp_Cons : XTYPE (arg), 0); |
| 364 | } |
| 365 | |
| 366 | static Lisp_Object |
| 367 | concat (nargs, args, target_type, last_special) |
| 368 | int nargs; |
| 369 | Lisp_Object *args; |
| 370 | enum Lisp_Type target_type; |
| 371 | int last_special; |
| 372 | { |
| 373 | Lisp_Object val; |
| 374 | Lisp_Object len; |
| 375 | register Lisp_Object tail; |
| 376 | register Lisp_Object this; |
| 377 | int toindex; |
| 378 | register int leni; |
| 379 | register int argnum; |
| 380 | Lisp_Object last_tail; |
| 381 | Lisp_Object prev; |
| 382 | |
| 383 | /* In append, the last arg isn't treated like the others */ |
| 384 | if (last_special && nargs > 0) |
| 385 | { |
| 386 | nargs--; |
| 387 | last_tail = args[nargs]; |
| 388 | } |
| 389 | else |
| 390 | last_tail = Qnil; |
| 391 | |
| 392 | for (argnum = 0; argnum < nargs; argnum++) |
| 393 | { |
| 394 | this = args[argnum]; |
| 395 | if (!(CONSP (this) || NILP (this) || VECTORP (this) || STRINGP (this) |
| 396 | || COMPILEDP (this) || BOOL_VECTOR_P (this))) |
| 397 | { |
| 398 | if (INTEGERP (this)) |
| 399 | args[argnum] = Fnumber_to_string (this); |
| 400 | else |
| 401 | args[argnum] = wrong_type_argument (Qsequencep, this); |
| 402 | } |
| 403 | } |
| 404 | |
| 405 | for (argnum = 0, leni = 0; argnum < nargs; argnum++) |
| 406 | { |
| 407 | this = args[argnum]; |
| 408 | len = Flength (this); |
| 409 | if (VECTORP (this) && target_type == Lisp_String) |
| 410 | { |
| 411 | /* We must pay attention to a multibyte character which |
| 412 | takes more than one byte in string. */ |
| 413 | int i; |
| 414 | Lisp_Object ch; |
| 415 | |
| 416 | for (i = 0; i < XFASTINT (len); i++) |
| 417 | { |
| 418 | ch = XVECTOR (this)->contents[i]; |
| 419 | if (! INTEGERP (ch)) |
| 420 | wrong_type_argument (Qintegerp, ch); |
| 421 | leni += Fchar_bytes (ch); |
| 422 | } |
| 423 | } |
| 424 | else |
| 425 | leni += XFASTINT (len); |
| 426 | } |
| 427 | |
| 428 | XSETFASTINT (len, leni); |
| 429 | |
| 430 | if (target_type == Lisp_Cons) |
| 431 | val = Fmake_list (len, Qnil); |
| 432 | else if (target_type == Lisp_Vectorlike) |
| 433 | val = Fmake_vector (len, Qnil); |
| 434 | else |
| 435 | val = Fmake_string (len, len); |
| 436 | |
| 437 | /* In append, if all but last arg are nil, return last arg */ |
| 438 | if (target_type == Lisp_Cons && EQ (val, Qnil)) |
| 439 | return last_tail; |
| 440 | |
| 441 | if (CONSP (val)) |
| 442 | tail = val, toindex = -1; /* -1 in toindex is flag we are making a list */ |
| 443 | else |
| 444 | toindex = 0; |
| 445 | |
| 446 | prev = Qnil; |
| 447 | |
| 448 | for (argnum = 0; argnum < nargs; argnum++) |
| 449 | { |
| 450 | Lisp_Object thislen; |
| 451 | int thisleni; |
| 452 | register unsigned int thisindex = 0; |
| 453 | |
| 454 | this = args[argnum]; |
| 455 | if (!CONSP (this)) |
| 456 | thislen = Flength (this), thisleni = XINT (thislen); |
| 457 | |
| 458 | if (STRINGP (this) && STRINGP (val) |
| 459 | && ! NULL_INTERVAL_P (XSTRING (this)->intervals)) |
| 460 | { |
| 461 | copy_text_properties (make_number (0), thislen, this, |
| 462 | make_number (toindex), val, Qnil); |
| 463 | } |
| 464 | |
| 465 | while (1) |
| 466 | { |
| 467 | register Lisp_Object elt; |
| 468 | |
| 469 | /* Fetch next element of `this' arg into `elt', or break if |
| 470 | `this' is exhausted. */ |
| 471 | if (NILP (this)) break; |
| 472 | if (CONSP (this)) |
| 473 | elt = Fcar (this), this = Fcdr (this); |
| 474 | else |
| 475 | { |
| 476 | if (thisindex >= thisleni) break; |
| 477 | if (STRINGP (this)) |
| 478 | XSETFASTINT (elt, XSTRING (this)->data[thisindex++]); |
| 479 | else if (BOOL_VECTOR_P (this)) |
| 480 | { |
| 481 | int size_in_chars |
| 482 | = ((XBOOL_VECTOR (this)->size + BITS_PER_CHAR - 1) |
| 483 | / BITS_PER_CHAR); |
| 484 | int byte; |
| 485 | byte = XBOOL_VECTOR (val)->data[thisindex / BITS_PER_CHAR]; |
| 486 | if (byte & (1 << (thisindex % BITS_PER_CHAR))) |
| 487 | elt = Qt; |
| 488 | else |
| 489 | elt = Qnil; |
| 490 | } |
| 491 | else |
| 492 | elt = XVECTOR (this)->contents[thisindex++]; |
| 493 | } |
| 494 | |
| 495 | /* Store into result */ |
| 496 | if (toindex < 0) |
| 497 | { |
| 498 | XCONS (tail)->car = elt; |
| 499 | prev = tail; |
| 500 | tail = XCONS (tail)->cdr; |
| 501 | } |
| 502 | else if (VECTORP (val)) |
| 503 | XVECTOR (val)->contents[toindex++] = elt; |
| 504 | else |
| 505 | { |
| 506 | while (!INTEGERP (elt)) |
| 507 | elt = wrong_type_argument (Qintegerp, elt); |
| 508 | { |
| 509 | int c = XINT (elt); |
| 510 | unsigned char work[4], *str; |
| 511 | int i = CHAR_STRING (c, work, str); |
| 512 | |
| 513 | #ifdef MASSC_REGISTER_BUG |
| 514 | /* Even removing all "register"s doesn't disable this bug! |
| 515 | Nothing simpler than this seems to work. */ |
| 516 | unsigned char *p = & XSTRING (val)->data[toindex]; |
| 517 | bcopy (str, p, i); |
| 518 | #else |
| 519 | bcopy (str, & XSTRING (val)->data[toindex], i); |
| 520 | #endif |
| 521 | toindex += i; |
| 522 | } |
| 523 | } |
| 524 | } |
| 525 | } |
| 526 | if (!NILP (prev)) |
| 527 | XCONS (prev)->cdr = last_tail; |
| 528 | |
| 529 | return val; |
| 530 | } |
| 531 | \f |
| 532 | DEFUN ("copy-alist", Fcopy_alist, Scopy_alist, 1, 1, 0, |
| 533 | "Return a copy of ALIST.\n\ |
| 534 | This is an alist which represents the same mapping from objects to objects,\n\ |
| 535 | but does not share the alist structure with ALIST.\n\ |
| 536 | The objects mapped (cars and cdrs of elements of the alist)\n\ |
| 537 | are shared, however.\n\ |
| 538 | Elements of ALIST that are not conses are also shared.") |
| 539 | (alist) |
| 540 | Lisp_Object alist; |
| 541 | { |
| 542 | register Lisp_Object tem; |
| 543 | |
| 544 | CHECK_LIST (alist, 0); |
| 545 | if (NILP (alist)) |
| 546 | return alist; |
| 547 | alist = concat (1, &alist, Lisp_Cons, 0); |
| 548 | for (tem = alist; CONSP (tem); tem = XCONS (tem)->cdr) |
| 549 | { |
| 550 | register Lisp_Object car; |
| 551 | car = XCONS (tem)->car; |
| 552 | |
| 553 | if (CONSP (car)) |
| 554 | XCONS (tem)->car = Fcons (XCONS (car)->car, XCONS (car)->cdr); |
| 555 | } |
| 556 | return alist; |
| 557 | } |
| 558 | |
| 559 | DEFUN ("substring", Fsubstring, Ssubstring, 2, 3, 0, |
| 560 | "Return a substring of STRING, starting at index FROM and ending before TO.\n\ |
| 561 | TO may be nil or omitted; then the substring runs to the end of STRING.\n\ |
| 562 | If FROM or TO is negative, it counts from the end.\n\ |
| 563 | \n\ |
| 564 | This function allows vectors as well as strings.") |
| 565 | (string, from, to) |
| 566 | Lisp_Object string; |
| 567 | register Lisp_Object from, to; |
| 568 | { |
| 569 | Lisp_Object res; |
| 570 | int size; |
| 571 | |
| 572 | if (! (STRINGP (string) || VECTORP (string))) |
| 573 | wrong_type_argument (Qarrayp, string); |
| 574 | |
| 575 | CHECK_NUMBER (from, 1); |
| 576 | |
| 577 | if (STRINGP (string)) |
| 578 | size = XSTRING (string)->size; |
| 579 | else |
| 580 | size = XVECTOR (string)->size; |
| 581 | |
| 582 | if (NILP (to)) |
| 583 | to = size; |
| 584 | else |
| 585 | CHECK_NUMBER (to, 2); |
| 586 | |
| 587 | if (XINT (from) < 0) |
| 588 | XSETINT (from, XINT (from) + size); |
| 589 | if (XINT (to) < 0) |
| 590 | XSETINT (to, XINT (to) + size); |
| 591 | if (!(0 <= XINT (from) && XINT (from) <= XINT (to) |
| 592 | && XINT (to) <= size)) |
| 593 | args_out_of_range_3 (string, from, to); |
| 594 | |
| 595 | if (STRINGP (string)) |
| 596 | { |
| 597 | res = make_string (XSTRING (string)->data + XINT (from), |
| 598 | XINT (to) - XINT (from)); |
| 599 | copy_text_properties (from, to, string, make_number (0), res, Qnil); |
| 600 | } |
| 601 | else |
| 602 | res = Fvector (XINT (to) - XINT (from), |
| 603 | XVECTOR (string)->contents + XINT (from)); |
| 604 | |
| 605 | return res; |
| 606 | } |
| 607 | \f |
| 608 | DEFUN ("nthcdr", Fnthcdr, Snthcdr, 2, 2, 0, |
| 609 | "Take cdr N times on LIST, returns the result.") |
| 610 | (n, list) |
| 611 | Lisp_Object n; |
| 612 | register Lisp_Object list; |
| 613 | { |
| 614 | register int i, num; |
| 615 | CHECK_NUMBER (n, 0); |
| 616 | num = XINT (n); |
| 617 | for (i = 0; i < num && !NILP (list); i++) |
| 618 | { |
| 619 | QUIT; |
| 620 | list = Fcdr (list); |
| 621 | } |
| 622 | return list; |
| 623 | } |
| 624 | |
| 625 | DEFUN ("nth", Fnth, Snth, 2, 2, 0, |
| 626 | "Return the Nth element of LIST.\n\ |
| 627 | N counts from zero. If LIST is not that long, nil is returned.") |
| 628 | (n, list) |
| 629 | Lisp_Object n, list; |
| 630 | { |
| 631 | return Fcar (Fnthcdr (n, list)); |
| 632 | } |
| 633 | |
| 634 | DEFUN ("elt", Felt, Selt, 2, 2, 0, |
| 635 | "Return element of SEQUENCE at index N.") |
| 636 | (sequence, n) |
| 637 | register Lisp_Object sequence, n; |
| 638 | { |
| 639 | CHECK_NUMBER (n, 0); |
| 640 | while (1) |
| 641 | { |
| 642 | if (CONSP (sequence) || NILP (sequence)) |
| 643 | return Fcar (Fnthcdr (n, sequence)); |
| 644 | else if (STRINGP (sequence) || VECTORP (sequence) |
| 645 | || BOOL_VECTOR_P (sequence) || CHAR_TABLE_P (sequence)) |
| 646 | return Faref (sequence, n); |
| 647 | else |
| 648 | sequence = wrong_type_argument (Qsequencep, sequence); |
| 649 | } |
| 650 | } |
| 651 | |
| 652 | DEFUN ("member", Fmember, Smember, 2, 2, 0, |
| 653 | "Return non-nil if ELT is an element of LIST. Comparison done with `equal'.\n\ |
| 654 | The value is actually the tail of LIST whose car is ELT.") |
| 655 | (elt, list) |
| 656 | register Lisp_Object elt; |
| 657 | Lisp_Object list; |
| 658 | { |
| 659 | register Lisp_Object tail; |
| 660 | for (tail = list; !NILP (tail); tail = Fcdr (tail)) |
| 661 | { |
| 662 | register Lisp_Object tem; |
| 663 | tem = Fcar (tail); |
| 664 | if (! NILP (Fequal (elt, tem))) |
| 665 | return tail; |
| 666 | QUIT; |
| 667 | } |
| 668 | return Qnil; |
| 669 | } |
| 670 | |
| 671 | DEFUN ("memq", Fmemq, Smemq, 2, 2, 0, |
| 672 | "Return non-nil if ELT is an element of LIST. Comparison done with EQ.\n\ |
| 673 | The value is actually the tail of LIST whose car is ELT.") |
| 674 | (elt, list) |
| 675 | register Lisp_Object elt; |
| 676 | Lisp_Object list; |
| 677 | { |
| 678 | register Lisp_Object tail; |
| 679 | for (tail = list; !NILP (tail); tail = Fcdr (tail)) |
| 680 | { |
| 681 | register Lisp_Object tem; |
| 682 | tem = Fcar (tail); |
| 683 | if (EQ (elt, tem)) return tail; |
| 684 | QUIT; |
| 685 | } |
| 686 | return Qnil; |
| 687 | } |
| 688 | |
| 689 | DEFUN ("assq", Fassq, Sassq, 2, 2, 0, |
| 690 | "Return non-nil if KEY is `eq' to the car of an element of LIST.\n\ |
| 691 | The value is actually the element of LIST whose car is KEY.\n\ |
| 692 | Elements of LIST that are not conses are ignored.") |
| 693 | (key, list) |
| 694 | register Lisp_Object key; |
| 695 | Lisp_Object list; |
| 696 | { |
| 697 | register Lisp_Object tail; |
| 698 | for (tail = list; !NILP (tail); tail = Fcdr (tail)) |
| 699 | { |
| 700 | register Lisp_Object elt, tem; |
| 701 | elt = Fcar (tail); |
| 702 | if (!CONSP (elt)) continue; |
| 703 | tem = Fcar (elt); |
| 704 | if (EQ (key, tem)) return elt; |
| 705 | QUIT; |
| 706 | } |
| 707 | return Qnil; |
| 708 | } |
| 709 | |
| 710 | /* Like Fassq but never report an error and do not allow quits. |
| 711 | Use only on lists known never to be circular. */ |
| 712 | |
| 713 | Lisp_Object |
| 714 | assq_no_quit (key, list) |
| 715 | register Lisp_Object key; |
| 716 | Lisp_Object list; |
| 717 | { |
| 718 | register Lisp_Object tail; |
| 719 | for (tail = list; CONSP (tail); tail = Fcdr (tail)) |
| 720 | { |
| 721 | register Lisp_Object elt, tem; |
| 722 | elt = Fcar (tail); |
| 723 | if (!CONSP (elt)) continue; |
| 724 | tem = Fcar (elt); |
| 725 | if (EQ (key, tem)) return elt; |
| 726 | } |
| 727 | return Qnil; |
| 728 | } |
| 729 | |
| 730 | DEFUN ("assoc", Fassoc, Sassoc, 2, 2, 0, |
| 731 | "Return non-nil if KEY is `equal' to the car of an element of LIST.\n\ |
| 732 | The value is actually the element of LIST whose car equals KEY.") |
| 733 | (key, list) |
| 734 | register Lisp_Object key; |
| 735 | Lisp_Object list; |
| 736 | { |
| 737 | register Lisp_Object tail; |
| 738 | for (tail = list; !NILP (tail); tail = Fcdr (tail)) |
| 739 | { |
| 740 | register Lisp_Object elt, tem; |
| 741 | elt = Fcar (tail); |
| 742 | if (!CONSP (elt)) continue; |
| 743 | tem = Fequal (Fcar (elt), key); |
| 744 | if (!NILP (tem)) return elt; |
| 745 | QUIT; |
| 746 | } |
| 747 | return Qnil; |
| 748 | } |
| 749 | |
| 750 | DEFUN ("rassq", Frassq, Srassq, 2, 2, 0, |
| 751 | "Return non-nil if ELT is `eq' to the cdr of an element of LIST.\n\ |
| 752 | The value is actually the element of LIST whose cdr is ELT.") |
| 753 | (key, list) |
| 754 | register Lisp_Object key; |
| 755 | Lisp_Object list; |
| 756 | { |
| 757 | register Lisp_Object tail; |
| 758 | for (tail = list; !NILP (tail); tail = Fcdr (tail)) |
| 759 | { |
| 760 | register Lisp_Object elt, tem; |
| 761 | elt = Fcar (tail); |
| 762 | if (!CONSP (elt)) continue; |
| 763 | tem = Fcdr (elt); |
| 764 | if (EQ (key, tem)) return elt; |
| 765 | QUIT; |
| 766 | } |
| 767 | return Qnil; |
| 768 | } |
| 769 | |
| 770 | DEFUN ("rassoc", Frassoc, Srassoc, 2, 2, 0, |
| 771 | "Return non-nil if KEY is `equal' to the cdr of an element of LIST.\n\ |
| 772 | The value is actually the element of LIST whose cdr equals KEY.") |
| 773 | (key, list) |
| 774 | register Lisp_Object key; |
| 775 | Lisp_Object list; |
| 776 | { |
| 777 | register Lisp_Object tail; |
| 778 | for (tail = list; !NILP (tail); tail = Fcdr (tail)) |
| 779 | { |
| 780 | register Lisp_Object elt, tem; |
| 781 | elt = Fcar (tail); |
| 782 | if (!CONSP (elt)) continue; |
| 783 | tem = Fequal (Fcdr (elt), key); |
| 784 | if (!NILP (tem)) return elt; |
| 785 | QUIT; |
| 786 | } |
| 787 | return Qnil; |
| 788 | } |
| 789 | \f |
| 790 | DEFUN ("delq", Fdelq, Sdelq, 2, 2, 0, |
| 791 | "Delete by side effect any occurrences of ELT as a member of LIST.\n\ |
| 792 | The modified LIST is returned. Comparison is done with `eq'.\n\ |
| 793 | If the first member of LIST is ELT, there is no way to remove it by side effect;\n\ |
| 794 | therefore, write `(setq foo (delq element foo))'\n\ |
| 795 | to be sure of changing the value of `foo'.") |
| 796 | (elt, list) |
| 797 | register Lisp_Object elt; |
| 798 | Lisp_Object list; |
| 799 | { |
| 800 | register Lisp_Object tail, prev; |
| 801 | register Lisp_Object tem; |
| 802 | |
| 803 | tail = list; |
| 804 | prev = Qnil; |
| 805 | while (!NILP (tail)) |
| 806 | { |
| 807 | tem = Fcar (tail); |
| 808 | if (EQ (elt, tem)) |
| 809 | { |
| 810 | if (NILP (prev)) |
| 811 | list = Fcdr (tail); |
| 812 | else |
| 813 | Fsetcdr (prev, Fcdr (tail)); |
| 814 | } |
| 815 | else |
| 816 | prev = tail; |
| 817 | tail = Fcdr (tail); |
| 818 | QUIT; |
| 819 | } |
| 820 | return list; |
| 821 | } |
| 822 | |
| 823 | DEFUN ("delete", Fdelete, Sdelete, 2, 2, 0, |
| 824 | "Delete by side effect any occurrences of ELT as a member of LIST.\n\ |
| 825 | The modified LIST is returned. Comparison is done with `equal'.\n\ |
| 826 | If the first member of LIST is ELT, deleting it is not a side effect;\n\ |
| 827 | it is simply using a different list.\n\ |
| 828 | Therefore, write `(setq foo (delete element foo))'\n\ |
| 829 | to be sure of changing the value of `foo'.") |
| 830 | (elt, list) |
| 831 | register Lisp_Object elt; |
| 832 | Lisp_Object list; |
| 833 | { |
| 834 | register Lisp_Object tail, prev; |
| 835 | register Lisp_Object tem; |
| 836 | |
| 837 | tail = list; |
| 838 | prev = Qnil; |
| 839 | while (!NILP (tail)) |
| 840 | { |
| 841 | tem = Fcar (tail); |
| 842 | if (! NILP (Fequal (elt, tem))) |
| 843 | { |
| 844 | if (NILP (prev)) |
| 845 | list = Fcdr (tail); |
| 846 | else |
| 847 | Fsetcdr (prev, Fcdr (tail)); |
| 848 | } |
| 849 | else |
| 850 | prev = tail; |
| 851 | tail = Fcdr (tail); |
| 852 | QUIT; |
| 853 | } |
| 854 | return list; |
| 855 | } |
| 856 | |
| 857 | DEFUN ("nreverse", Fnreverse, Snreverse, 1, 1, 0, |
| 858 | "Reverse LIST by modifying cdr pointers.\n\ |
| 859 | Returns the beginning of the reversed list.") |
| 860 | (list) |
| 861 | Lisp_Object list; |
| 862 | { |
| 863 | register Lisp_Object prev, tail, next; |
| 864 | |
| 865 | if (NILP (list)) return list; |
| 866 | prev = Qnil; |
| 867 | tail = list; |
| 868 | while (!NILP (tail)) |
| 869 | { |
| 870 | QUIT; |
| 871 | next = Fcdr (tail); |
| 872 | Fsetcdr (tail, prev); |
| 873 | prev = tail; |
| 874 | tail = next; |
| 875 | } |
| 876 | return prev; |
| 877 | } |
| 878 | |
| 879 | DEFUN ("reverse", Freverse, Sreverse, 1, 1, 0, |
| 880 | "Reverse LIST, copying. Returns the beginning of the reversed list.\n\ |
| 881 | See also the function `nreverse', which is used more often.") |
| 882 | (list) |
| 883 | Lisp_Object list; |
| 884 | { |
| 885 | Lisp_Object length; |
| 886 | register Lisp_Object *vec; |
| 887 | register Lisp_Object tail; |
| 888 | register int i; |
| 889 | |
| 890 | length = Flength (list); |
| 891 | vec = (Lisp_Object *) alloca (XINT (length) * sizeof (Lisp_Object)); |
| 892 | for (i = XINT (length) - 1, tail = list; i >= 0; i--, tail = Fcdr (tail)) |
| 893 | vec[i] = Fcar (tail); |
| 894 | |
| 895 | return Flist (XINT (length), vec); |
| 896 | } |
| 897 | \f |
| 898 | Lisp_Object merge (); |
| 899 | |
| 900 | DEFUN ("sort", Fsort, Ssort, 2, 2, 0, |
| 901 | "Sort LIST, stably, comparing elements using PREDICATE.\n\ |
| 902 | Returns the sorted list. LIST is modified by side effects.\n\ |
| 903 | PREDICATE is called with two elements of LIST, and should return T\n\ |
| 904 | if the first element is \"less\" than the second.") |
| 905 | (list, predicate) |
| 906 | Lisp_Object list, predicate; |
| 907 | { |
| 908 | Lisp_Object front, back; |
| 909 | register Lisp_Object len, tem; |
| 910 | struct gcpro gcpro1, gcpro2; |
| 911 | register int length; |
| 912 | |
| 913 | front = list; |
| 914 | len = Flength (list); |
| 915 | length = XINT (len); |
| 916 | if (length < 2) |
| 917 | return list; |
| 918 | |
| 919 | XSETINT (len, (length / 2) - 1); |
| 920 | tem = Fnthcdr (len, list); |
| 921 | back = Fcdr (tem); |
| 922 | Fsetcdr (tem, Qnil); |
| 923 | |
| 924 | GCPRO2 (front, back); |
| 925 | front = Fsort (front, predicate); |
| 926 | back = Fsort (back, predicate); |
| 927 | UNGCPRO; |
| 928 | return merge (front, back, predicate); |
| 929 | } |
| 930 | |
| 931 | Lisp_Object |
| 932 | merge (org_l1, org_l2, pred) |
| 933 | Lisp_Object org_l1, org_l2; |
| 934 | Lisp_Object pred; |
| 935 | { |
| 936 | Lisp_Object value; |
| 937 | register Lisp_Object tail; |
| 938 | Lisp_Object tem; |
| 939 | register Lisp_Object l1, l2; |
| 940 | struct gcpro gcpro1, gcpro2, gcpro3, gcpro4; |
| 941 | |
| 942 | l1 = org_l1; |
| 943 | l2 = org_l2; |
| 944 | tail = Qnil; |
| 945 | value = Qnil; |
| 946 | |
| 947 | /* It is sufficient to protect org_l1 and org_l2. |
| 948 | When l1 and l2 are updated, we copy the new values |
| 949 | back into the org_ vars. */ |
| 950 | GCPRO4 (org_l1, org_l2, pred, value); |
| 951 | |
| 952 | while (1) |
| 953 | { |
| 954 | if (NILP (l1)) |
| 955 | { |
| 956 | UNGCPRO; |
| 957 | if (NILP (tail)) |
| 958 | return l2; |
| 959 | Fsetcdr (tail, l2); |
| 960 | return value; |
| 961 | } |
| 962 | if (NILP (l2)) |
| 963 | { |
| 964 | UNGCPRO; |
| 965 | if (NILP (tail)) |
| 966 | return l1; |
| 967 | Fsetcdr (tail, l1); |
| 968 | return value; |
| 969 | } |
| 970 | tem = call2 (pred, Fcar (l2), Fcar (l1)); |
| 971 | if (NILP (tem)) |
| 972 | { |
| 973 | tem = l1; |
| 974 | l1 = Fcdr (l1); |
| 975 | org_l1 = l1; |
| 976 | } |
| 977 | else |
| 978 | { |
| 979 | tem = l2; |
| 980 | l2 = Fcdr (l2); |
| 981 | org_l2 = l2; |
| 982 | } |
| 983 | if (NILP (tail)) |
| 984 | value = tem; |
| 985 | else |
| 986 | Fsetcdr (tail, tem); |
| 987 | tail = tem; |
| 988 | } |
| 989 | } |
| 990 | \f |
| 991 | |
| 992 | DEFUN ("plist-get", Fplist_get, Splist_get, 2, 2, 0, |
| 993 | "Extract a value from a property list.\n\ |
| 994 | PLIST is a property list, which is a list of the form\n\ |
| 995 | \(PROP1 VALUE1 PROP2 VALUE2...). This function returns the value\n\ |
| 996 | corresponding to the given PROP, or nil if PROP is not\n\ |
| 997 | one of the properties on the list.") |
| 998 | (plist, prop) |
| 999 | Lisp_Object plist; |
| 1000 | register Lisp_Object prop; |
| 1001 | { |
| 1002 | register Lisp_Object tail; |
| 1003 | for (tail = plist; !NILP (tail); tail = Fcdr (Fcdr (tail))) |
| 1004 | { |
| 1005 | register Lisp_Object tem; |
| 1006 | tem = Fcar (tail); |
| 1007 | if (EQ (prop, tem)) |
| 1008 | return Fcar (Fcdr (tail)); |
| 1009 | } |
| 1010 | return Qnil; |
| 1011 | } |
| 1012 | |
| 1013 | DEFUN ("get", Fget, Sget, 2, 2, 0, |
| 1014 | "Return the value of SYMBOL's PROPNAME property.\n\ |
| 1015 | This is the last value stored with `(put SYMBOL PROPNAME VALUE)'.") |
| 1016 | (symbol, propname) |
| 1017 | Lisp_Object symbol, propname; |
| 1018 | { |
| 1019 | CHECK_SYMBOL (symbol, 0); |
| 1020 | return Fplist_get (XSYMBOL (symbol)->plist, propname); |
| 1021 | } |
| 1022 | |
| 1023 | DEFUN ("plist-put", Fplist_put, Splist_put, 3, 3, 0, |
| 1024 | "Change value in PLIST of PROP to VAL.\n\ |
| 1025 | PLIST is a property list, which is a list of the form\n\ |
| 1026 | \(PROP1 VALUE1 PROP2 VALUE2 ...). PROP is a symbol and VAL is any object.\n\ |
| 1027 | If PROP is already a property on the list, its value is set to VAL,\n\ |
| 1028 | otherwise the new PROP VAL pair is added. The new plist is returned;\n\ |
| 1029 | use `(setq x (plist-put x prop val))' to be sure to use the new value.\n\ |
| 1030 | The PLIST is modified by side effects.") |
| 1031 | (plist, prop, val) |
| 1032 | Lisp_Object plist; |
| 1033 | register Lisp_Object prop; |
| 1034 | Lisp_Object val; |
| 1035 | { |
| 1036 | register Lisp_Object tail, prev; |
| 1037 | Lisp_Object newcell; |
| 1038 | prev = Qnil; |
| 1039 | for (tail = plist; CONSP (tail) && CONSP (XCONS (tail)->cdr); |
| 1040 | tail = XCONS (XCONS (tail)->cdr)->cdr) |
| 1041 | { |
| 1042 | if (EQ (prop, XCONS (tail)->car)) |
| 1043 | { |
| 1044 | Fsetcar (XCONS (tail)->cdr, val); |
| 1045 | return plist; |
| 1046 | } |
| 1047 | prev = tail; |
| 1048 | } |
| 1049 | newcell = Fcons (prop, Fcons (val, Qnil)); |
| 1050 | if (NILP (prev)) |
| 1051 | return newcell; |
| 1052 | else |
| 1053 | Fsetcdr (XCONS (prev)->cdr, newcell); |
| 1054 | return plist; |
| 1055 | } |
| 1056 | |
| 1057 | DEFUN ("put", Fput, Sput, 3, 3, 0, |
| 1058 | "Store SYMBOL's PROPNAME property with value VALUE.\n\ |
| 1059 | It can be retrieved with `(get SYMBOL PROPNAME)'.") |
| 1060 | (symbol, propname, value) |
| 1061 | Lisp_Object symbol, propname, value; |
| 1062 | { |
| 1063 | CHECK_SYMBOL (symbol, 0); |
| 1064 | XSYMBOL (symbol)->plist |
| 1065 | = Fplist_put (XSYMBOL (symbol)->plist, propname, value); |
| 1066 | return value; |
| 1067 | } |
| 1068 | |
| 1069 | DEFUN ("equal", Fequal, Sequal, 2, 2, 0, |
| 1070 | "T if two Lisp objects have similar structure and contents.\n\ |
| 1071 | They must have the same data type.\n\ |
| 1072 | Conses are compared by comparing the cars and the cdrs.\n\ |
| 1073 | Vectors and strings are compared element by element.\n\ |
| 1074 | Numbers are compared by value, but integers cannot equal floats.\n\ |
| 1075 | (Use `=' if you want integers and floats to be able to be equal.)\n\ |
| 1076 | Symbols must match exactly.") |
| 1077 | (o1, o2) |
| 1078 | register Lisp_Object o1, o2; |
| 1079 | { |
| 1080 | return internal_equal (o1, o2, 0) ? Qt : Qnil; |
| 1081 | } |
| 1082 | |
| 1083 | static int |
| 1084 | internal_equal (o1, o2, depth) |
| 1085 | register Lisp_Object o1, o2; |
| 1086 | int depth; |
| 1087 | { |
| 1088 | if (depth > 200) |
| 1089 | error ("Stack overflow in equal"); |
| 1090 | |
| 1091 | tail_recurse: |
| 1092 | QUIT; |
| 1093 | if (EQ (o1, o2)) |
| 1094 | return 1; |
| 1095 | if (XTYPE (o1) != XTYPE (o2)) |
| 1096 | return 0; |
| 1097 | |
| 1098 | switch (XTYPE (o1)) |
| 1099 | { |
| 1100 | #ifdef LISP_FLOAT_TYPE |
| 1101 | case Lisp_Float: |
| 1102 | return (extract_float (o1) == extract_float (o2)); |
| 1103 | #endif |
| 1104 | |
| 1105 | case Lisp_Cons: |
| 1106 | if (!internal_equal (XCONS (o1)->car, XCONS (o2)->car, depth + 1)) |
| 1107 | return 0; |
| 1108 | o1 = XCONS (o1)->cdr; |
| 1109 | o2 = XCONS (o2)->cdr; |
| 1110 | goto tail_recurse; |
| 1111 | |
| 1112 | case Lisp_Misc: |
| 1113 | if (XMISCTYPE (o1) != XMISCTYPE (o2)) |
| 1114 | return 0; |
| 1115 | if (OVERLAYP (o1)) |
| 1116 | { |
| 1117 | if (!internal_equal (OVERLAY_START (o1), OVERLAY_START (o1), |
| 1118 | depth + 1) |
| 1119 | || !internal_equal (OVERLAY_END (o1), OVERLAY_END (o1), |
| 1120 | depth + 1)) |
| 1121 | return 0; |
| 1122 | o1 = XOVERLAY (o1)->plist; |
| 1123 | o2 = XOVERLAY (o2)->plist; |
| 1124 | goto tail_recurse; |
| 1125 | } |
| 1126 | if (MARKERP (o1)) |
| 1127 | { |
| 1128 | return (XMARKER (o1)->buffer == XMARKER (o2)->buffer |
| 1129 | && (XMARKER (o1)->buffer == 0 |
| 1130 | || XMARKER (o1)->bufpos == XMARKER (o2)->bufpos)); |
| 1131 | } |
| 1132 | break; |
| 1133 | |
| 1134 | case Lisp_Vectorlike: |
| 1135 | { |
| 1136 | register int i, size; |
| 1137 | size = XVECTOR (o1)->size; |
| 1138 | /* Pseudovectors have the type encoded in the size field, so this test |
| 1139 | actually checks that the objects have the same type as well as the |
| 1140 | same size. */ |
| 1141 | if (XVECTOR (o2)->size != size) |
| 1142 | return 0; |
| 1143 | /* Boolvectors are compared much like strings. */ |
| 1144 | if (BOOL_VECTOR_P (o1)) |
| 1145 | { |
| 1146 | int size_in_chars |
| 1147 | = (XBOOL_VECTOR (o1)->size + BITS_PER_CHAR - 1) / BITS_PER_CHAR; |
| 1148 | |
| 1149 | if (XBOOL_VECTOR (o1)->size != XBOOL_VECTOR (o2)->size) |
| 1150 | return 0; |
| 1151 | if (bcmp (XBOOL_VECTOR (o1)->data, XBOOL_VECTOR (o2)->data, |
| 1152 | size_in_chars)) |
| 1153 | return 0; |
| 1154 | return 1; |
| 1155 | } |
| 1156 | |
| 1157 | /* Aside from them, only true vectors, char-tables, and compiled |
| 1158 | functions are sensible to compare, so eliminate the others now. */ |
| 1159 | if (size & PSEUDOVECTOR_FLAG) |
| 1160 | { |
| 1161 | if (!(size & (PVEC_COMPILED | PVEC_CHAR_TABLE))) |
| 1162 | return 0; |
| 1163 | size &= PSEUDOVECTOR_SIZE_MASK; |
| 1164 | } |
| 1165 | for (i = 0; i < size; i++) |
| 1166 | { |
| 1167 | Lisp_Object v1, v2; |
| 1168 | v1 = XVECTOR (o1)->contents [i]; |
| 1169 | v2 = XVECTOR (o2)->contents [i]; |
| 1170 | if (!internal_equal (v1, v2, depth + 1)) |
| 1171 | return 0; |
| 1172 | } |
| 1173 | return 1; |
| 1174 | } |
| 1175 | break; |
| 1176 | |
| 1177 | case Lisp_String: |
| 1178 | if (XSTRING (o1)->size != XSTRING (o2)->size) |
| 1179 | return 0; |
| 1180 | if (bcmp (XSTRING (o1)->data, XSTRING (o2)->data, |
| 1181 | XSTRING (o1)->size)) |
| 1182 | return 0; |
| 1183 | return 1; |
| 1184 | } |
| 1185 | return 0; |
| 1186 | } |
| 1187 | \f |
| 1188 | DEFUN ("fillarray", Ffillarray, Sfillarray, 2, 2, 0, |
| 1189 | "Store each element of ARRAY with ITEM.\n\ |
| 1190 | ARRAY is a vector, string, char-table, or bool-vector.") |
| 1191 | (array, item) |
| 1192 | Lisp_Object array, item; |
| 1193 | { |
| 1194 | register int size, index, charval; |
| 1195 | retry: |
| 1196 | if (VECTORP (array)) |
| 1197 | { |
| 1198 | register Lisp_Object *p = XVECTOR (array)->contents; |
| 1199 | size = XVECTOR (array)->size; |
| 1200 | for (index = 0; index < size; index++) |
| 1201 | p[index] = item; |
| 1202 | } |
| 1203 | else if (CHAR_TABLE_P (array)) |
| 1204 | { |
| 1205 | register Lisp_Object *p = XCHAR_TABLE (array)->contents; |
| 1206 | size = CHAR_TABLE_ORDINARY_SLOTS; |
| 1207 | for (index = 0; index < size; index++) |
| 1208 | p[index] = item; |
| 1209 | XCHAR_TABLE (array)->defalt = Qnil; |
| 1210 | } |
| 1211 | else if (STRINGP (array)) |
| 1212 | { |
| 1213 | register unsigned char *p = XSTRING (array)->data; |
| 1214 | CHECK_NUMBER (item, 1); |
| 1215 | charval = XINT (item); |
| 1216 | size = XSTRING (array)->size; |
| 1217 | for (index = 0; index < size; index++) |
| 1218 | p[index] = charval; |
| 1219 | } |
| 1220 | else if (BOOL_VECTOR_P (array)) |
| 1221 | { |
| 1222 | register unsigned char *p = XBOOL_VECTOR (array)->data; |
| 1223 | int size_in_chars |
| 1224 | = (XBOOL_VECTOR (array)->size + BITS_PER_CHAR - 1) / BITS_PER_CHAR; |
| 1225 | |
| 1226 | charval = (! NILP (item) ? -1 : 0); |
| 1227 | for (index = 0; index < size_in_chars; index++) |
| 1228 | p[index] = charval; |
| 1229 | } |
| 1230 | else |
| 1231 | { |
| 1232 | array = wrong_type_argument (Qarrayp, array); |
| 1233 | goto retry; |
| 1234 | } |
| 1235 | return array; |
| 1236 | } |
| 1237 | |
| 1238 | DEFUN ("char-table-subtype", Fchar_table_subtype, Schar_table_subtype, |
| 1239 | 1, 1, 0, |
| 1240 | "Return the subtype of char-table CHAR-TABLE. The value is a symbol.") |
| 1241 | (char_table) |
| 1242 | Lisp_Object char_table; |
| 1243 | { |
| 1244 | CHECK_CHAR_TABLE (char_table, 0); |
| 1245 | |
| 1246 | return XCHAR_TABLE (char_table)->purpose; |
| 1247 | } |
| 1248 | |
| 1249 | DEFUN ("char-table-parent", Fchar_table_parent, Schar_table_parent, |
| 1250 | 1, 1, 0, |
| 1251 | "Return the parent char-table of CHAR-TABLE.\n\ |
| 1252 | The value is either nil or another char-table.\n\ |
| 1253 | If CHAR-TABLE holds nil for a given character,\n\ |
| 1254 | then the actual applicable value is inherited from the parent char-table\n\ |
| 1255 | \(or from its parents, if necessary).") |
| 1256 | (char_table) |
| 1257 | Lisp_Object char_table; |
| 1258 | { |
| 1259 | CHECK_CHAR_TABLE (char_table, 0); |
| 1260 | |
| 1261 | return XCHAR_TABLE (char_table)->parent; |
| 1262 | } |
| 1263 | |
| 1264 | DEFUN ("set-char-table-parent", Fset_char_table_parent, Sset_char_table_parent, |
| 1265 | 2, 2, 0, |
| 1266 | "Set the parent char-table of CHAR-TABLE to PARENT.\n\ |
| 1267 | PARENT must be either nil or another char-table.") |
| 1268 | (char_table, parent) |
| 1269 | Lisp_Object char_table, parent; |
| 1270 | { |
| 1271 | Lisp_Object temp; |
| 1272 | |
| 1273 | CHECK_CHAR_TABLE (char_table, 0); |
| 1274 | |
| 1275 | if (!NILP (parent)) |
| 1276 | { |
| 1277 | CHECK_CHAR_TABLE (parent, 0); |
| 1278 | |
| 1279 | for (temp = parent; !NILP (temp); temp = XCHAR_TABLE (temp)->parent) |
| 1280 | if (EQ (temp, char_table)) |
| 1281 | error ("Attempt to make a chartable be its own parent"); |
| 1282 | } |
| 1283 | |
| 1284 | XCHAR_TABLE (char_table)->parent = parent; |
| 1285 | |
| 1286 | return parent; |
| 1287 | } |
| 1288 | |
| 1289 | DEFUN ("char-table-extra-slot", Fchar_table_extra_slot, Schar_table_extra_slot, |
| 1290 | 2, 2, 0, |
| 1291 | "Return the value of CHAR-TABLE's extra-slot number N.") |
| 1292 | (char_table, n) |
| 1293 | Lisp_Object char_table, n; |
| 1294 | { |
| 1295 | CHECK_CHAR_TABLE (char_table, 1); |
| 1296 | CHECK_NUMBER (n, 2); |
| 1297 | if (XINT (n) < 0 |
| 1298 | || XINT (n) >= CHAR_TABLE_EXTRA_SLOTS (XCHAR_TABLE (char_table))) |
| 1299 | args_out_of_range (char_table, n); |
| 1300 | |
| 1301 | return XCHAR_TABLE (char_table)->extras[XINT (n)]; |
| 1302 | } |
| 1303 | |
| 1304 | DEFUN ("set-char-table-extra-slot", Fset_char_table_extra_slot, |
| 1305 | Sset_char_table_extra_slot, |
| 1306 | 3, 3, 0, |
| 1307 | "Set CHAR-TABLE's extra-slot number N to VALUE.") |
| 1308 | (char_table, n, value) |
| 1309 | Lisp_Object char_table, n, value; |
| 1310 | { |
| 1311 | CHECK_CHAR_TABLE (char_table, 1); |
| 1312 | CHECK_NUMBER (n, 2); |
| 1313 | if (XINT (n) < 0 |
| 1314 | || XINT (n) >= CHAR_TABLE_EXTRA_SLOTS (XCHAR_TABLE (char_table))) |
| 1315 | args_out_of_range (char_table, n); |
| 1316 | |
| 1317 | return XCHAR_TABLE (char_table)->extras[XINT (n)] = value; |
| 1318 | } |
| 1319 | |
| 1320 | DEFUN ("char-table-range", Fchar_table_range, Schar_table_range, |
| 1321 | 2, 2, 0, |
| 1322 | "Return the value in CHAR-TABLE for a range of characters RANGE.\n\ |
| 1323 | RANGE should be t (for all characters), nil (for the default value)\n\ |
| 1324 | a vector which identifies a character set or a row of a character set,\n\ |
| 1325 | or a character code.") |
| 1326 | (char_table, range) |
| 1327 | Lisp_Object char_table, range; |
| 1328 | { |
| 1329 | int i; |
| 1330 | |
| 1331 | CHECK_CHAR_TABLE (char_table, 0); |
| 1332 | |
| 1333 | if (EQ (range, Qnil)) |
| 1334 | return XCHAR_TABLE (char_table)->defalt; |
| 1335 | else if (INTEGERP (range)) |
| 1336 | return Faref (char_table, range); |
| 1337 | else if (VECTORP (range)) |
| 1338 | { |
| 1339 | if (XVECTOR (range)->size == 1) |
| 1340 | return Faref (char_table, XVECTOR (range)->contents[0]); |
| 1341 | else |
| 1342 | { |
| 1343 | int size = XVECTOR (range)->size; |
| 1344 | Lisp_Object *val = XVECTOR (range)->contents; |
| 1345 | Lisp_Object ch = Fmake_char_internal (size <= 0 ? Qnil : val[0], |
| 1346 | size <= 1 ? Qnil : val[1], |
| 1347 | size <= 2 ? Qnil : val[2]); |
| 1348 | return Faref (char_table, ch); |
| 1349 | } |
| 1350 | } |
| 1351 | else |
| 1352 | error ("Invalid RANGE argument to `char-table-range'"); |
| 1353 | } |
| 1354 | |
| 1355 | DEFUN ("set-char-table-range", Fset_char_table_range, Sset_char_table_range, |
| 1356 | 3, 3, 0, |
| 1357 | "Set the value in CHAR-TABLE for a range of characters RANGE to VALUE.\n\ |
| 1358 | RANGE should be t (for all characters), nil (for the default value)\n\ |
| 1359 | a vector which identifies a character set or a row of a character set,\n\ |
| 1360 | or a character code.") |
| 1361 | (char_table, range, value) |
| 1362 | Lisp_Object char_table, range, value; |
| 1363 | { |
| 1364 | int i; |
| 1365 | |
| 1366 | CHECK_CHAR_TABLE (char_table, 0); |
| 1367 | |
| 1368 | if (EQ (range, Qt)) |
| 1369 | for (i = 0; i < CHAR_TABLE_ORDINARY_SLOTS; i++) |
| 1370 | XCHAR_TABLE (char_table)->contents[i] = value; |
| 1371 | else if (EQ (range, Qnil)) |
| 1372 | XCHAR_TABLE (char_table)->defalt = value; |
| 1373 | else if (INTEGERP (range)) |
| 1374 | Faset (char_table, range, value); |
| 1375 | else if (VECTORP (range)) |
| 1376 | { |
| 1377 | if (XVECTOR (range)->size == 1) |
| 1378 | return Faset (char_table, XVECTOR (range)->contents[0], value); |
| 1379 | else |
| 1380 | { |
| 1381 | int size = XVECTOR (range)->size; |
| 1382 | Lisp_Object *val = XVECTOR (range)->contents; |
| 1383 | Lisp_Object ch = Fmake_char_internal (size <= 0 ? Qnil : val[0], |
| 1384 | size <= 1 ? Qnil : val[1], |
| 1385 | size <= 2 ? Qnil : val[2]); |
| 1386 | return Faset (char_table, ch, value); |
| 1387 | } |
| 1388 | } |
| 1389 | else |
| 1390 | error ("Invalid RANGE argument to `set-char-table-range'"); |
| 1391 | |
| 1392 | return value; |
| 1393 | } |
| 1394 | |
| 1395 | DEFUN ("set-char-table-default", Fset_char_table_default, |
| 1396 | Sset_char_table_default, 3, 3, 0, |
| 1397 | "Set the default value in CHAR-TABLE for a generic character CHAR to VALUE.\n\ |
| 1398 | The generic character specifies the group of characters.\n\ |
| 1399 | See also the documentation of make-char.") |
| 1400 | (char_table, ch, value) |
| 1401 | Lisp_Object char_table, ch, value; |
| 1402 | { |
| 1403 | int c, i, charset, code1, code2; |
| 1404 | Lisp_Object temp; |
| 1405 | |
| 1406 | CHECK_CHAR_TABLE (char_table, 0); |
| 1407 | CHECK_NUMBER (ch, 1); |
| 1408 | |
| 1409 | c = XINT (ch); |
| 1410 | SPLIT_NON_ASCII_CHAR (c, charset, code1, code2); |
| 1411 | if (! CHARSET_DEFINED_P (charset)) |
| 1412 | error ("Invalid character: %d", c); |
| 1413 | |
| 1414 | if (charset == CHARSET_ASCII) |
| 1415 | return (XCHAR_TABLE (char_table)->defalt = value); |
| 1416 | |
| 1417 | /* Even if C is not a generic char, we had better behave as if a |
| 1418 | generic char is specified. */ |
| 1419 | if (CHARSET_DIMENSION (charset) == 1) |
| 1420 | code1 = 0; |
| 1421 | temp = XCHAR_TABLE (char_table)->contents[charset + 128]; |
| 1422 | if (!code1) |
| 1423 | { |
| 1424 | if (SUB_CHAR_TABLE_P (temp)) |
| 1425 | XCHAR_TABLE (temp)->defalt = value; |
| 1426 | else |
| 1427 | XCHAR_TABLE (char_table)->contents[charset + 128] = value; |
| 1428 | return value; |
| 1429 | } |
| 1430 | char_table = temp; |
| 1431 | if (! SUB_CHAR_TABLE_P (char_table)) |
| 1432 | char_table = (XCHAR_TABLE (char_table)->contents[charset + 128] |
| 1433 | = make_sub_char_table (temp)); |
| 1434 | temp = XCHAR_TABLE (char_table)->contents[code1]; |
| 1435 | if (SUB_CHAR_TABLE_P (temp)) |
| 1436 | XCHAR_TABLE (temp)->defalt = value; |
| 1437 | else |
| 1438 | XCHAR_TABLE (char_table)->contents[code1] = value; |
| 1439 | return value; |
| 1440 | } |
| 1441 | |
| 1442 | \f |
| 1443 | /* Map C_FUNCTION or FUNCTION over SUBTABLE, calling it for each |
| 1444 | character or group of characters that share a value. |
| 1445 | DEPTH is the current depth in the originally specified |
| 1446 | chartable, and INDICES contains the vector indices |
| 1447 | for the levels our callers have descended. |
| 1448 | |
| 1449 | ARG is passed to C_FUNCTION when that is called. */ |
| 1450 | |
| 1451 | void |
| 1452 | map_char_table (c_function, function, subtable, arg, depth, indices) |
| 1453 | Lisp_Object (*c_function) (), function, subtable, arg, *indices; |
| 1454 | int depth; |
| 1455 | { |
| 1456 | int i, to; |
| 1457 | |
| 1458 | if (depth == 0) |
| 1459 | { |
| 1460 | /* At first, handle ASCII and 8-bit European characters. */ |
| 1461 | for (i = 0; i < CHAR_TABLE_SINGLE_BYTE_SLOTS; i++) |
| 1462 | { |
| 1463 | Lisp_Object elt = XCHAR_TABLE (subtable)->contents[i]; |
| 1464 | if (c_function) |
| 1465 | (*c_function) (arg, make_number (i), elt); |
| 1466 | else |
| 1467 | call2 (function, make_number (i), elt); |
| 1468 | } |
| 1469 | to = CHAR_TABLE_ORDINARY_SLOTS; |
| 1470 | } |
| 1471 | else |
| 1472 | { |
| 1473 | i = 0; |
| 1474 | to = SUB_CHAR_TABLE_ORDINARY_SLOTS; |
| 1475 | } |
| 1476 | |
| 1477 | for (; i < to; i++) |
| 1478 | { |
| 1479 | Lisp_Object elt = XCHAR_TABLE (subtable)->contents[i]; |
| 1480 | |
| 1481 | XSETFASTINT (indices[depth], i); |
| 1482 | |
| 1483 | if (SUB_CHAR_TABLE_P (elt)) |
| 1484 | { |
| 1485 | if (depth >= 3) |
| 1486 | error ("Too deep char table"); |
| 1487 | map_char_table (c_function, function, elt, arg, depth + 1, indices); |
| 1488 | } |
| 1489 | else |
| 1490 | { |
| 1491 | int charset = XFASTINT (indices[0]) - 128, c1, c2, c; |
| 1492 | |
| 1493 | if (CHARSET_DEFINED_P (charset)) |
| 1494 | { |
| 1495 | c1 = depth >= 1 ? XFASTINT (indices[1]) : 0; |
| 1496 | c2 = depth >= 2 ? XFASTINT (indices[2]) : 0; |
| 1497 | c = MAKE_NON_ASCII_CHAR (charset, c1, c2); |
| 1498 | if (c_function) |
| 1499 | (*c_function) (arg, make_number (c), elt); |
| 1500 | else |
| 1501 | call2 (function, make_number (c), elt); |
| 1502 | } |
| 1503 | } |
| 1504 | } |
| 1505 | } |
| 1506 | |
| 1507 | DEFUN ("map-char-table", Fmap_char_table, Smap_char_table, |
| 1508 | 2, 2, 0, |
| 1509 | "Call FUNCTION for each (normal and generic) characters in CHAR-TABLE.\n\ |
| 1510 | FUNCTION is called with two arguments--a key and a value.\n\ |
| 1511 | The key is always a possible IDX argument to `aref'.") |
| 1512 | (function, char_table) |
| 1513 | Lisp_Object function, char_table; |
| 1514 | { |
| 1515 | /* The depth of char table is at most 3. */ |
| 1516 | Lisp_Object indices[3]; |
| 1517 | |
| 1518 | CHECK_CHAR_TABLE (char_table, 1); |
| 1519 | |
| 1520 | map_char_table (NULL, function, char_table, char_table, 0, indices); |
| 1521 | return Qnil; |
| 1522 | } |
| 1523 | \f |
| 1524 | /* ARGSUSED */ |
| 1525 | Lisp_Object |
| 1526 | nconc2 (s1, s2) |
| 1527 | Lisp_Object s1, s2; |
| 1528 | { |
| 1529 | #ifdef NO_ARG_ARRAY |
| 1530 | Lisp_Object args[2]; |
| 1531 | args[0] = s1; |
| 1532 | args[1] = s2; |
| 1533 | return Fnconc (2, args); |
| 1534 | #else |
| 1535 | return Fnconc (2, &s1); |
| 1536 | #endif /* NO_ARG_ARRAY */ |
| 1537 | } |
| 1538 | |
| 1539 | DEFUN ("nconc", Fnconc, Snconc, 0, MANY, 0, |
| 1540 | "Concatenate any number of lists by altering them.\n\ |
| 1541 | Only the last argument is not altered, and need not be a list.") |
| 1542 | (nargs, args) |
| 1543 | int nargs; |
| 1544 | Lisp_Object *args; |
| 1545 | { |
| 1546 | register int argnum; |
| 1547 | register Lisp_Object tail, tem, val; |
| 1548 | |
| 1549 | val = Qnil; |
| 1550 | |
| 1551 | for (argnum = 0; argnum < nargs; argnum++) |
| 1552 | { |
| 1553 | tem = args[argnum]; |
| 1554 | if (NILP (tem)) continue; |
| 1555 | |
| 1556 | if (NILP (val)) |
| 1557 | val = tem; |
| 1558 | |
| 1559 | if (argnum + 1 == nargs) break; |
| 1560 | |
| 1561 | if (!CONSP (tem)) |
| 1562 | tem = wrong_type_argument (Qlistp, tem); |
| 1563 | |
| 1564 | while (CONSP (tem)) |
| 1565 | { |
| 1566 | tail = tem; |
| 1567 | tem = Fcdr (tail); |
| 1568 | QUIT; |
| 1569 | } |
| 1570 | |
| 1571 | tem = args[argnum + 1]; |
| 1572 | Fsetcdr (tail, tem); |
| 1573 | if (NILP (tem)) |
| 1574 | args[argnum + 1] = tail; |
| 1575 | } |
| 1576 | |
| 1577 | return val; |
| 1578 | } |
| 1579 | \f |
| 1580 | /* This is the guts of all mapping functions. |
| 1581 | Apply fn to each element of seq, one by one, |
| 1582 | storing the results into elements of vals, a C vector of Lisp_Objects. |
| 1583 | leni is the length of vals, which should also be the length of seq. */ |
| 1584 | |
| 1585 | static void |
| 1586 | mapcar1 (leni, vals, fn, seq) |
| 1587 | int leni; |
| 1588 | Lisp_Object *vals; |
| 1589 | Lisp_Object fn, seq; |
| 1590 | { |
| 1591 | register Lisp_Object tail; |
| 1592 | Lisp_Object dummy; |
| 1593 | register int i; |
| 1594 | struct gcpro gcpro1, gcpro2, gcpro3; |
| 1595 | |
| 1596 | /* Don't let vals contain any garbage when GC happens. */ |
| 1597 | for (i = 0; i < leni; i++) |
| 1598 | vals[i] = Qnil; |
| 1599 | |
| 1600 | GCPRO3 (dummy, fn, seq); |
| 1601 | gcpro1.var = vals; |
| 1602 | gcpro1.nvars = leni; |
| 1603 | /* We need not explicitly protect `tail' because it is used only on lists, and |
| 1604 | 1) lists are not relocated and 2) the list is marked via `seq' so will not be freed */ |
| 1605 | |
| 1606 | if (VECTORP (seq)) |
| 1607 | { |
| 1608 | for (i = 0; i < leni; i++) |
| 1609 | { |
| 1610 | dummy = XVECTOR (seq)->contents[i]; |
| 1611 | vals[i] = call1 (fn, dummy); |
| 1612 | } |
| 1613 | } |
| 1614 | else if (STRINGP (seq)) |
| 1615 | { |
| 1616 | for (i = 0; i < leni; i++) |
| 1617 | { |
| 1618 | XSETFASTINT (dummy, XSTRING (seq)->data[i]); |
| 1619 | vals[i] = call1 (fn, dummy); |
| 1620 | } |
| 1621 | } |
| 1622 | else /* Must be a list, since Flength did not get an error */ |
| 1623 | { |
| 1624 | tail = seq; |
| 1625 | for (i = 0; i < leni; i++) |
| 1626 | { |
| 1627 | vals[i] = call1 (fn, Fcar (tail)); |
| 1628 | tail = Fcdr (tail); |
| 1629 | } |
| 1630 | } |
| 1631 | |
| 1632 | UNGCPRO; |
| 1633 | } |
| 1634 | |
| 1635 | DEFUN ("mapconcat", Fmapconcat, Smapconcat, 3, 3, 0, |
| 1636 | "Apply FUNCTION to each element of SEQUENCE, and concat the results as strings.\n\ |
| 1637 | In between each pair of results, stick in SEPARATOR. Thus, \" \" as\n\ |
| 1638 | SEPARATOR results in spaces between the values returned by FUNCTION.") |
| 1639 | (function, sequence, separator) |
| 1640 | Lisp_Object function, sequence, separator; |
| 1641 | { |
| 1642 | Lisp_Object len; |
| 1643 | register int leni; |
| 1644 | int nargs; |
| 1645 | register Lisp_Object *args; |
| 1646 | register int i; |
| 1647 | struct gcpro gcpro1; |
| 1648 | |
| 1649 | len = Flength (sequence); |
| 1650 | leni = XINT (len); |
| 1651 | nargs = leni + leni - 1; |
| 1652 | if (nargs < 0) return build_string (""); |
| 1653 | |
| 1654 | args = (Lisp_Object *) alloca (nargs * sizeof (Lisp_Object)); |
| 1655 | |
| 1656 | GCPRO1 (separator); |
| 1657 | mapcar1 (leni, args, function, sequence); |
| 1658 | UNGCPRO; |
| 1659 | |
| 1660 | for (i = leni - 1; i >= 0; i--) |
| 1661 | args[i + i] = args[i]; |
| 1662 | |
| 1663 | for (i = 1; i < nargs; i += 2) |
| 1664 | args[i] = separator; |
| 1665 | |
| 1666 | return Fconcat (nargs, args); |
| 1667 | } |
| 1668 | |
| 1669 | DEFUN ("mapcar", Fmapcar, Smapcar, 2, 2, 0, |
| 1670 | "Apply FUNCTION to each element of SEQUENCE, and make a list of the results.\n\ |
| 1671 | The result is a list just as long as SEQUENCE.\n\ |
| 1672 | SEQUENCE may be a list, a vector or a string.") |
| 1673 | (function, sequence) |
| 1674 | Lisp_Object function, sequence; |
| 1675 | { |
| 1676 | register Lisp_Object len; |
| 1677 | register int leni; |
| 1678 | register Lisp_Object *args; |
| 1679 | |
| 1680 | len = Flength (sequence); |
| 1681 | leni = XFASTINT (len); |
| 1682 | args = (Lisp_Object *) alloca (leni * sizeof (Lisp_Object)); |
| 1683 | |
| 1684 | mapcar1 (leni, args, function, sequence); |
| 1685 | |
| 1686 | return Flist (leni, args); |
| 1687 | } |
| 1688 | \f |
| 1689 | /* Anything that calls this function must protect from GC! */ |
| 1690 | |
| 1691 | DEFUN ("y-or-n-p", Fy_or_n_p, Sy_or_n_p, 1, 1, 0, |
| 1692 | "Ask user a \"y or n\" question. Return t if answer is \"y\".\n\ |
| 1693 | Takes one argument, which is the string to display to ask the question.\n\ |
| 1694 | It should end in a space; `y-or-n-p' adds `(y or n) ' to it.\n\ |
| 1695 | No confirmation of the answer is requested; a single character is enough.\n\ |
| 1696 | Also accepts Space to mean yes, or Delete to mean no.") |
| 1697 | (prompt) |
| 1698 | Lisp_Object prompt; |
| 1699 | { |
| 1700 | register Lisp_Object obj, key, def, answer_string, map; |
| 1701 | register int answer; |
| 1702 | Lisp_Object xprompt; |
| 1703 | Lisp_Object args[2]; |
| 1704 | struct gcpro gcpro1, gcpro2; |
| 1705 | int count = specpdl_ptr - specpdl; |
| 1706 | |
| 1707 | specbind (Qcursor_in_echo_area, Qt); |
| 1708 | |
| 1709 | map = Fsymbol_value (intern ("query-replace-map")); |
| 1710 | |
| 1711 | CHECK_STRING (prompt, 0); |
| 1712 | xprompt = prompt; |
| 1713 | GCPRO2 (prompt, xprompt); |
| 1714 | |
| 1715 | while (1) |
| 1716 | { |
| 1717 | |
| 1718 | |
| 1719 | #ifdef HAVE_MENUS |
| 1720 | if ((NILP (last_nonmenu_event) || CONSP (last_nonmenu_event)) |
| 1721 | && have_menus_p ()) |
| 1722 | { |
| 1723 | Lisp_Object pane, menu; |
| 1724 | redisplay_preserve_echo_area (); |
| 1725 | pane = Fcons (Fcons (build_string ("Yes"), Qt), |
| 1726 | Fcons (Fcons (build_string ("No"), Qnil), |
| 1727 | Qnil)); |
| 1728 | menu = Fcons (prompt, pane); |
| 1729 | obj = Fx_popup_dialog (Qt, menu); |
| 1730 | answer = !NILP (obj); |
| 1731 | break; |
| 1732 | } |
| 1733 | #endif /* HAVE_MENUS */ |
| 1734 | cursor_in_echo_area = 1; |
| 1735 | choose_minibuf_frame (); |
| 1736 | message_nolog ("%s(y or n) ", XSTRING (xprompt)->data); |
| 1737 | |
| 1738 | if (minibuffer_auto_raise) |
| 1739 | { |
| 1740 | Lisp_Object mini_frame; |
| 1741 | |
| 1742 | mini_frame = WINDOW_FRAME (XWINDOW (minibuf_window)); |
| 1743 | |
| 1744 | Fraise_frame (mini_frame); |
| 1745 | } |
| 1746 | |
| 1747 | obj = read_filtered_event (1, 0, 0); |
| 1748 | cursor_in_echo_area = 0; |
| 1749 | /* If we need to quit, quit with cursor_in_echo_area = 0. */ |
| 1750 | QUIT; |
| 1751 | |
| 1752 | key = Fmake_vector (make_number (1), obj); |
| 1753 | def = Flookup_key (map, key, Qt); |
| 1754 | answer_string = Fsingle_key_description (obj); |
| 1755 | |
| 1756 | if (EQ (def, intern ("skip"))) |
| 1757 | { |
| 1758 | answer = 0; |
| 1759 | break; |
| 1760 | } |
| 1761 | else if (EQ (def, intern ("act"))) |
| 1762 | { |
| 1763 | answer = 1; |
| 1764 | break; |
| 1765 | } |
| 1766 | else if (EQ (def, intern ("recenter"))) |
| 1767 | { |
| 1768 | Frecenter (Qnil); |
| 1769 | xprompt = prompt; |
| 1770 | continue; |
| 1771 | } |
| 1772 | else if (EQ (def, intern ("quit"))) |
| 1773 | Vquit_flag = Qt; |
| 1774 | /* We want to exit this command for exit-prefix, |
| 1775 | and this is the only way to do it. */ |
| 1776 | else if (EQ (def, intern ("exit-prefix"))) |
| 1777 | Vquit_flag = Qt; |
| 1778 | |
| 1779 | QUIT; |
| 1780 | |
| 1781 | /* If we don't clear this, then the next call to read_char will |
| 1782 | return quit_char again, and we'll enter an infinite loop. */ |
| 1783 | Vquit_flag = Qnil; |
| 1784 | |
| 1785 | Fding (Qnil); |
| 1786 | Fdiscard_input (); |
| 1787 | if (EQ (xprompt, prompt)) |
| 1788 | { |
| 1789 | args[0] = build_string ("Please answer y or n. "); |
| 1790 | args[1] = prompt; |
| 1791 | xprompt = Fconcat (2, args); |
| 1792 | } |
| 1793 | } |
| 1794 | UNGCPRO; |
| 1795 | |
| 1796 | if (! noninteractive) |
| 1797 | { |
| 1798 | cursor_in_echo_area = -1; |
| 1799 | message_nolog ("%s(y or n) %c", |
| 1800 | XSTRING (xprompt)->data, answer ? 'y' : 'n'); |
| 1801 | } |
| 1802 | |
| 1803 | unbind_to (count, Qnil); |
| 1804 | return answer ? Qt : Qnil; |
| 1805 | } |
| 1806 | \f |
| 1807 | /* This is how C code calls `yes-or-no-p' and allows the user |
| 1808 | to redefined it. |
| 1809 | |
| 1810 | Anything that calls this function must protect from GC! */ |
| 1811 | |
| 1812 | Lisp_Object |
| 1813 | do_yes_or_no_p (prompt) |
| 1814 | Lisp_Object prompt; |
| 1815 | { |
| 1816 | return call1 (intern ("yes-or-no-p"), prompt); |
| 1817 | } |
| 1818 | |
| 1819 | /* Anything that calls this function must protect from GC! */ |
| 1820 | |
| 1821 | DEFUN ("yes-or-no-p", Fyes_or_no_p, Syes_or_no_p, 1, 1, 0, |
| 1822 | "Ask user a yes-or-no question. Return t if answer is yes.\n\ |
| 1823 | Takes one argument, which is the string to display to ask the question.\n\ |
| 1824 | It should end in a space; `yes-or-no-p' adds `(yes or no) ' to it.\n\ |
| 1825 | The user must confirm the answer with RET,\n\ |
| 1826 | and can edit it until it has been confirmed.") |
| 1827 | (prompt) |
| 1828 | Lisp_Object prompt; |
| 1829 | { |
| 1830 | register Lisp_Object ans; |
| 1831 | Lisp_Object args[2]; |
| 1832 | struct gcpro gcpro1; |
| 1833 | Lisp_Object menu; |
| 1834 | |
| 1835 | CHECK_STRING (prompt, 0); |
| 1836 | |
| 1837 | #ifdef HAVE_MENUS |
| 1838 | if ((NILP (last_nonmenu_event) || CONSP (last_nonmenu_event)) |
| 1839 | && have_menus_p ()) |
| 1840 | { |
| 1841 | Lisp_Object pane, menu, obj; |
| 1842 | redisplay_preserve_echo_area (); |
| 1843 | pane = Fcons (Fcons (build_string ("Yes"), Qt), |
| 1844 | Fcons (Fcons (build_string ("No"), Qnil), |
| 1845 | Qnil)); |
| 1846 | GCPRO1 (pane); |
| 1847 | menu = Fcons (prompt, pane); |
| 1848 | obj = Fx_popup_dialog (Qt, menu); |
| 1849 | UNGCPRO; |
| 1850 | return obj; |
| 1851 | } |
| 1852 | #endif /* HAVE_MENUS */ |
| 1853 | |
| 1854 | args[0] = prompt; |
| 1855 | args[1] = build_string ("(yes or no) "); |
| 1856 | prompt = Fconcat (2, args); |
| 1857 | |
| 1858 | GCPRO1 (prompt); |
| 1859 | |
| 1860 | while (1) |
| 1861 | { |
| 1862 | ans = Fdowncase (Fread_from_minibuffer (prompt, Qnil, Qnil, Qnil, |
| 1863 | Qyes_or_no_p_history, Qnil)); |
| 1864 | if (XSTRING (ans)->size == 3 && !strcmp (XSTRING (ans)->data, "yes")) |
| 1865 | { |
| 1866 | UNGCPRO; |
| 1867 | return Qt; |
| 1868 | } |
| 1869 | if (XSTRING (ans)->size == 2 && !strcmp (XSTRING (ans)->data, "no")) |
| 1870 | { |
| 1871 | UNGCPRO; |
| 1872 | return Qnil; |
| 1873 | } |
| 1874 | |
| 1875 | Fding (Qnil); |
| 1876 | Fdiscard_input (); |
| 1877 | message ("Please answer yes or no."); |
| 1878 | Fsleep_for (make_number (2), Qnil); |
| 1879 | } |
| 1880 | } |
| 1881 | \f |
| 1882 | DEFUN ("load-average", Fload_average, Sload_average, 0, 0, 0, |
| 1883 | "Return list of 1 minute, 5 minute and 15 minute load averages.\n\ |
| 1884 | Each of the three load averages is multiplied by 100,\n\ |
| 1885 | then converted to integer.\n\ |
| 1886 | If the 5-minute or 15-minute load averages are not available, return a\n\ |
| 1887 | shortened list, containing only those averages which are available.") |
| 1888 | () |
| 1889 | { |
| 1890 | double load_ave[3]; |
| 1891 | int loads = getloadavg (load_ave, 3); |
| 1892 | Lisp_Object ret; |
| 1893 | |
| 1894 | if (loads < 0) |
| 1895 | error ("load-average not implemented for this operating system"); |
| 1896 | |
| 1897 | ret = Qnil; |
| 1898 | while (loads > 0) |
| 1899 | ret = Fcons (make_number ((int) (load_ave[--loads] * 100.0)), ret); |
| 1900 | |
| 1901 | return ret; |
| 1902 | } |
| 1903 | \f |
| 1904 | Lisp_Object Vfeatures; |
| 1905 | |
| 1906 | DEFUN ("featurep", Ffeaturep, Sfeaturep, 1, 1, 0, |
| 1907 | "Returns t if FEATURE is present in this Emacs.\n\ |
| 1908 | Use this to conditionalize execution of lisp code based on the presence or\n\ |
| 1909 | absence of emacs or environment extensions.\n\ |
| 1910 | Use `provide' to declare that a feature is available.\n\ |
| 1911 | This function looks at the value of the variable `features'.") |
| 1912 | (feature) |
| 1913 | Lisp_Object feature; |
| 1914 | { |
| 1915 | register Lisp_Object tem; |
| 1916 | CHECK_SYMBOL (feature, 0); |
| 1917 | tem = Fmemq (feature, Vfeatures); |
| 1918 | return (NILP (tem)) ? Qnil : Qt; |
| 1919 | } |
| 1920 | |
| 1921 | DEFUN ("provide", Fprovide, Sprovide, 1, 1, 0, |
| 1922 | "Announce that FEATURE is a feature of the current Emacs.") |
| 1923 | (feature) |
| 1924 | Lisp_Object feature; |
| 1925 | { |
| 1926 | register Lisp_Object tem; |
| 1927 | CHECK_SYMBOL (feature, 0); |
| 1928 | if (!NILP (Vautoload_queue)) |
| 1929 | Vautoload_queue = Fcons (Fcons (Vfeatures, Qnil), Vautoload_queue); |
| 1930 | tem = Fmemq (feature, Vfeatures); |
| 1931 | if (NILP (tem)) |
| 1932 | Vfeatures = Fcons (feature, Vfeatures); |
| 1933 | LOADHIST_ATTACH (Fcons (Qprovide, feature)); |
| 1934 | return feature; |
| 1935 | } |
| 1936 | |
| 1937 | DEFUN ("require", Frequire, Srequire, 1, 2, 0, |
| 1938 | "If feature FEATURE is not loaded, load it from FILENAME.\n\ |
| 1939 | If FEATURE is not a member of the list `features', then the feature\n\ |
| 1940 | is not loaded; so load the file FILENAME.\n\ |
| 1941 | If FILENAME is omitted, the printname of FEATURE is used as the file name.") |
| 1942 | (feature, file_name) |
| 1943 | Lisp_Object feature, file_name; |
| 1944 | { |
| 1945 | register Lisp_Object tem; |
| 1946 | CHECK_SYMBOL (feature, 0); |
| 1947 | tem = Fmemq (feature, Vfeatures); |
| 1948 | LOADHIST_ATTACH (Fcons (Qrequire, feature)); |
| 1949 | if (NILP (tem)) |
| 1950 | { |
| 1951 | int count = specpdl_ptr - specpdl; |
| 1952 | |
| 1953 | /* Value saved here is to be restored into Vautoload_queue */ |
| 1954 | record_unwind_protect (un_autoload, Vautoload_queue); |
| 1955 | Vautoload_queue = Qt; |
| 1956 | |
| 1957 | Fload (NILP (file_name) ? Fsymbol_name (feature) : file_name, |
| 1958 | Qnil, Qt, Qnil); |
| 1959 | |
| 1960 | tem = Fmemq (feature, Vfeatures); |
| 1961 | if (NILP (tem)) |
| 1962 | error ("Required feature %s was not provided", |
| 1963 | XSYMBOL (feature)->name->data ); |
| 1964 | |
| 1965 | /* Once loading finishes, don't undo it. */ |
| 1966 | Vautoload_queue = Qt; |
| 1967 | feature = unbind_to (count, feature); |
| 1968 | } |
| 1969 | return feature; |
| 1970 | } |
| 1971 | \f |
| 1972 | syms_of_fns () |
| 1973 | { |
| 1974 | Qstring_lessp = intern ("string-lessp"); |
| 1975 | staticpro (&Qstring_lessp); |
| 1976 | Qprovide = intern ("provide"); |
| 1977 | staticpro (&Qprovide); |
| 1978 | Qrequire = intern ("require"); |
| 1979 | staticpro (&Qrequire); |
| 1980 | Qyes_or_no_p_history = intern ("yes-or-no-p-history"); |
| 1981 | staticpro (&Qyes_or_no_p_history); |
| 1982 | Qcursor_in_echo_area = intern ("cursor-in-echo-area"); |
| 1983 | staticpro (&Qcursor_in_echo_area); |
| 1984 | |
| 1985 | Fset (Qyes_or_no_p_history, Qnil); |
| 1986 | |
| 1987 | DEFVAR_LISP ("features", &Vfeatures, |
| 1988 | "A list of symbols which are the features of the executing emacs.\n\ |
| 1989 | Used by `featurep' and `require', and altered by `provide'."); |
| 1990 | Vfeatures = Qnil; |
| 1991 | |
| 1992 | defsubr (&Sidentity); |
| 1993 | defsubr (&Srandom); |
| 1994 | defsubr (&Slength); |
| 1995 | defsubr (&Ssafe_length); |
| 1996 | defsubr (&Sstring_equal); |
| 1997 | defsubr (&Sstring_lessp); |
| 1998 | defsubr (&Sappend); |
| 1999 | defsubr (&Sconcat); |
| 2000 | defsubr (&Svconcat); |
| 2001 | defsubr (&Scopy_sequence); |
| 2002 | defsubr (&Scopy_alist); |
| 2003 | defsubr (&Ssubstring); |
| 2004 | defsubr (&Snthcdr); |
| 2005 | defsubr (&Snth); |
| 2006 | defsubr (&Selt); |
| 2007 | defsubr (&Smember); |
| 2008 | defsubr (&Smemq); |
| 2009 | defsubr (&Sassq); |
| 2010 | defsubr (&Sassoc); |
| 2011 | defsubr (&Srassq); |
| 2012 | defsubr (&Srassoc); |
| 2013 | defsubr (&Sdelq); |
| 2014 | defsubr (&Sdelete); |
| 2015 | defsubr (&Snreverse); |
| 2016 | defsubr (&Sreverse); |
| 2017 | defsubr (&Ssort); |
| 2018 | defsubr (&Splist_get); |
| 2019 | defsubr (&Sget); |
| 2020 | defsubr (&Splist_put); |
| 2021 | defsubr (&Sput); |
| 2022 | defsubr (&Sequal); |
| 2023 | defsubr (&Sfillarray); |
| 2024 | defsubr (&Schar_table_subtype); |
| 2025 | defsubr (&Schar_table_parent); |
| 2026 | defsubr (&Sset_char_table_parent); |
| 2027 | defsubr (&Schar_table_extra_slot); |
| 2028 | defsubr (&Sset_char_table_extra_slot); |
| 2029 | defsubr (&Schar_table_range); |
| 2030 | defsubr (&Sset_char_table_range); |
| 2031 | defsubr (&Sset_char_table_default); |
| 2032 | defsubr (&Smap_char_table); |
| 2033 | defsubr (&Snconc); |
| 2034 | defsubr (&Smapcar); |
| 2035 | defsubr (&Smapconcat); |
| 2036 | defsubr (&Sy_or_n_p); |
| 2037 | defsubr (&Syes_or_no_p); |
| 2038 | defsubr (&Sload_average); |
| 2039 | defsubr (&Sfeaturep); |
| 2040 | defsubr (&Srequire); |
| 2041 | defsubr (&Sprovide); |
| 2042 | } |