fns.c 35.9 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* Random utility Lisp functions.
Karl Heuer's avatar
Karl Heuer committed
2
   Copyright (C) 1985, 1986, 1987, 1993, 1994 Free Software Foundation, Inc.
Jim Blandy's avatar
Jim Blandy committed
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

This file is part of GNU Emacs.

GNU Emacs is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 1, or (at your option)
any later version.

GNU Emacs is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with GNU Emacs; see the file COPYING.  If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */


21
#include <config.h>
Jim Blandy's avatar
Jim Blandy committed
22 23 24 25 26 27 28 29 30 31

/* Note on some machines this defines `vector' as a typedef,
   so make sure we don't use that name in this file.  */
#undef vector
#define vector *****

#include "lisp.h"
#include "commands.h"

#include "buffer.h"
Jim Blandy's avatar
Jim Blandy committed
32
#include "keyboard.h"
33
#include "intervals.h"
Jim Blandy's avatar
Jim Blandy committed
34

35 36
extern Lisp_Object Flookup_key ();

37
Lisp_Object Qstring_lessp, Qprovide, Qrequire;
38
Lisp_Object Qyes_or_no_p_history;
Jim Blandy's avatar
Jim Blandy committed
39

40
static int internal_equal ();
41

Jim Blandy's avatar
Jim Blandy committed
42 43 44 45 46 47 48 49 50 51 52 53 54 55
DEFUN ("identity", Fidentity, Sidentity, 1, 1, 0,
  "Return the argument unchanged.")
  (arg)
     Lisp_Object arg;
{
  return arg;
}

DEFUN ("random", Frandom, Srandom, 0, 1, 0,
  "Return a pseudo-random number.\n\
On most systems all integers representable in Lisp are equally likely.\n\
  This is 24 bits' worth.\n\
With argument N, return random number in interval [0,N).\n\
With argument t, set the random number seed from the current time and pid.")
56 57
  (limit)
     Lisp_Object limit;
Jim Blandy's avatar
Jim Blandy committed
58 59
{
  int val;
60
  unsigned long denominator;
Jim Blandy's avatar
Jim Blandy committed
61 62 63 64
  extern long random ();
  extern srandom ();
  extern long time ();

65
  if (EQ (limit, Qt))
Jim Blandy's avatar
Jim Blandy committed
66
    srandom (getpid () + time (0));
67
  if (INTEGERP (limit) && XINT (limit) > 0)
Jim Blandy's avatar
Jim Blandy committed
68
    {
69
      if (XFASTINT (limit) >= 0x40000000)
70
	/* This case may occur on 64-bit machines.  */
71
	val = random () % XFASTINT (limit);
72 73 74 75 76 77 78 79 80 81 82 83
      else
	{
	  /* Try to take our random number from the higher bits of VAL,
	     not the lower, since (says Gentzel) the low bits of `random'
	     are less random than the higher ones.  We do this by using the
	     quotient rather than the remainder.  At the high end of the RNG
	     it's possible to get a quotient larger than limit; discarding
	     these values eliminates the bias that would otherwise appear
	     when using a large limit.  */
	  denominator = (unsigned long)0x40000000 / XFASTINT (limit);
	  do
	    val = (random () & 0x3fffffff) / denominator;
84
	  while (val >= XFASTINT (limit));
85
	}
Jim Blandy's avatar
Jim Blandy committed
86
    }
87 88
  else
    val = random ();
Jim Blandy's avatar
Jim Blandy committed
89 90 91 92 93 94 95 96 97 98 99 100 101 102 103
  return make_number (val);
}

/* Random data-structure functions */

DEFUN ("length", Flength, Slength, 1, 1, 0,
  "Return the length of vector, list or string SEQUENCE.\n\
A byte-code function object is also allowed.")
  (obj)
     register Lisp_Object obj;
{
  register Lisp_Object tail, val;
  register int i;

 retry:
104
  if (VECTORP (obj) || STRINGP (obj) || COMPILEDP (obj))
Jim Blandy's avatar
Jim Blandy committed
105 106 107
    return Farray_length (obj);
  else if (CONSP (obj))
    {
Jim Blandy's avatar
Jim Blandy committed
108
      for (i = 0, tail = obj; !NILP(tail); i++)
Jim Blandy's avatar
Jim Blandy committed
109 110 111 112 113
	{
	  QUIT;
	  tail = Fcdr (tail);
	}

114
      XSETFASTINT (val, i);
Jim Blandy's avatar
Jim Blandy committed
115 116
      return val;
    }
Jim Blandy's avatar
Jim Blandy committed
117
  else if (NILP(obj))
Jim Blandy's avatar
Jim Blandy committed
118
    {
119
      XSETFASTINT (val, 0);
Jim Blandy's avatar
Jim Blandy committed
120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135
      return val;
    }
  else
    {
      obj = wrong_type_argument (Qsequencep, obj);
      goto retry;
    }
}

DEFUN ("string-equal", Fstring_equal, Sstring_equal, 2, 2, 0,
  "T if two strings have identical contents.\n\
Case is significant.\n\
Symbols are also allowed; their print names are used instead.")
  (s1, s2)
     register Lisp_Object s1, s2;
{
136
  if (SYMBOLP (s1))
137
    XSETSTRING (s1, XSYMBOL (s1)->name);
138
  if (SYMBOLP (s2))
139
    XSETSTRING (s2, XSYMBOL (s2)->name);
Jim Blandy's avatar
Jim Blandy committed
140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159
  CHECK_STRING (s1, 0);
  CHECK_STRING (s2, 1);

  if (XSTRING (s1)->size != XSTRING (s2)->size ||
      bcmp (XSTRING (s1)->data, XSTRING (s2)->data, XSTRING (s1)->size))
    return Qnil;
  return Qt;
}

DEFUN ("string-lessp", Fstring_lessp, Sstring_lessp, 2, 2, 0,
  "T if first arg string is less than second in lexicographic order.\n\
Case is significant.\n\
Symbols are also allowed; their print names are used instead.")
  (s1, s2)
     register Lisp_Object s1, s2;
{
  register int i;
  register unsigned char *p1, *p2;
  register int end;

160
  if (SYMBOLP (s1))
161
    XSETSTRING (s1, XSYMBOL (s1)->name);
162
  if (SYMBOLP (s2))
163
    XSETSTRING (s2, XSYMBOL (s2)->name);
Jim Blandy's avatar
Jim Blandy committed
164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197
  CHECK_STRING (s1, 0);
  CHECK_STRING (s2, 1);

  p1 = XSTRING (s1)->data;
  p2 = XSTRING (s2)->data;
  end = XSTRING (s1)->size;
  if (end > XSTRING (s2)->size)
    end = XSTRING (s2)->size;

  for (i = 0; i < end; i++)
    {
      if (p1[i] != p2[i])
	return p1[i] < p2[i] ? Qt : Qnil;
    }
  return i < XSTRING (s2)->size ? Qt : Qnil;
}

static Lisp_Object concat ();

/* ARGSUSED */
Lisp_Object
concat2 (s1, s2)
     Lisp_Object s1, s2;
{
#ifdef NO_ARG_ARRAY
  Lisp_Object args[2];
  args[0] = s1;
  args[1] = s2;
  return concat (2, args, Lisp_String, 0);
#else
  return concat (2, &s1, Lisp_String, 0);
#endif /* NO_ARG_ARRAY */
}

Richard M. Stallman's avatar
Richard M. Stallman committed
198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213
/* ARGSUSED */
Lisp_Object
concat3 (s1, s2, s3)
     Lisp_Object s1, s2, s3;
{
#ifdef NO_ARG_ARRAY
  Lisp_Object args[3];
  args[0] = s1;
  args[1] = s2;
  args[2] = s3;
  return concat (3, args, Lisp_String, 0);
#else
  return concat (3, &s1, Lisp_String, 0);
#endif /* NO_ARG_ARRAY */
}

Jim Blandy's avatar
Jim Blandy committed
214 215 216 217
DEFUN ("append", Fappend, Sappend, 0, MANY, 0,
  "Concatenate all the arguments and make the result a list.\n\
The result is a list whose elements are the elements of all the arguments.\n\
Each argument may be a list, vector or string.\n\
Richard M. Stallman's avatar
Richard M. Stallman committed
218
The last argument is not copied, just used as the tail of the new list.")
Jim Blandy's avatar
Jim Blandy committed
219 220 221 222 223 224 225 226 227 228
  (nargs, args)
     int nargs;
     Lisp_Object *args;
{
  return concat (nargs, args, Lisp_Cons, 1);
}

DEFUN ("concat", Fconcat, Sconcat, 0, MANY, 0,
  "Concatenate all the arguments and make the result a string.\n\
The result is a string whose elements are the elements of all the arguments.\n\
Richard M. Stallman's avatar
Richard M. Stallman committed
229 230
Each argument may be a string, a list of characters (integers),\n\
or a vector of characters (integers).")
Jim Blandy's avatar
Jim Blandy committed
231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255
  (nargs, args)
     int nargs;
     Lisp_Object *args;
{
  return concat (nargs, args, Lisp_String, 0);
}

DEFUN ("vconcat", Fvconcat, Svconcat, 0, MANY, 0,
  "Concatenate all the arguments and make the result a vector.\n\
The result is a vector whose elements are the elements of all the arguments.\n\
Each argument may be a list, vector or string.")
  (nargs, args)
     int nargs;
     Lisp_Object *args;
{
  return concat (nargs, args, Lisp_Vector, 0);
}

DEFUN ("copy-sequence", Fcopy_sequence, Scopy_sequence, 1, 1, 0,
  "Return a copy of a list, vector or string.\n\
The elements of a list or vector are not copied; they are shared\n\
with the original.")
  (arg)
     Lisp_Object arg;
{
Jim Blandy's avatar
Jim Blandy committed
256
  if (NILP (arg)) return arg;
257
  if (!CONSP (arg) && !VECTORP (arg) && !STRINGP (arg))
Jim Blandy's avatar
Jim Blandy committed
258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290
    arg = wrong_type_argument (Qsequencep, arg);
  return concat (1, &arg, CONSP (arg) ? Lisp_Cons : XTYPE (arg), 0);
}

static Lisp_Object
concat (nargs, args, target_type, last_special)
     int nargs;
     Lisp_Object *args;
     enum Lisp_Type target_type;
     int last_special;
{
  Lisp_Object val;
  Lisp_Object len;
  register Lisp_Object tail;
  register Lisp_Object this;
  int toindex;
  register int leni;
  register int argnum;
  Lisp_Object last_tail;
  Lisp_Object prev;

  /* In append, the last arg isn't treated like the others */
  if (last_special && nargs > 0)
    {
      nargs--;
      last_tail = args[nargs];
    }
  else
    last_tail = Qnil;

  for (argnum = 0; argnum < nargs; argnum++)
    {
      this = args[argnum];
291 292
      if (!(CONSP (this) || NILP (this) || VECTORP (this) || STRINGP (this)
	    || COMPILEDP (this)))
Jim Blandy's avatar
Jim Blandy committed
293
	{
294
	  if (INTEGERP (this))
295
            args[argnum] = Fnumber_to_string (this);
Jim Blandy's avatar
Jim Blandy committed
296 297 298 299 300 301 302 303 304 305 306 307
	  else
	    args[argnum] = wrong_type_argument (Qsequencep, this);
	}
    }

  for (argnum = 0, leni = 0; argnum < nargs; argnum++)
    {
      this = args[argnum];
      len = Flength (this);
      leni += XFASTINT (len);
    }

308
  XSETFASTINT (len, leni);
Jim Blandy's avatar
Jim Blandy committed
309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337

  if (target_type == Lisp_Cons)
    val = Fmake_list (len, Qnil);
  else if (target_type == Lisp_Vector)
    val = Fmake_vector (len, Qnil);
  else
    val = Fmake_string (len, len);

  /* In append, if all but last arg are nil, return last arg */
  if (target_type == Lisp_Cons && EQ (val, Qnil))
    return last_tail;

  if (CONSP (val))
    tail = val, toindex = -1;		/* -1 in toindex is flag we are making a list */
  else
    toindex = 0;

  prev = Qnil;

  for (argnum = 0; argnum < nargs; argnum++)
    {
      Lisp_Object thislen;
      int thisleni;
      register int thisindex = 0;

      this = args[argnum];
      if (!CONSP (this))
	thislen = Flength (this), thisleni = XINT (thislen);

338
      if (STRINGP (this) && STRINGP (val)
339 340 341 342 343 344
	  && ! NULL_INTERVAL_P (XSTRING (this)->intervals))
	{
	  copy_text_properties (make_number (0), thislen, this,
				make_number (toindex), val, Qnil);
	}

Jim Blandy's avatar
Jim Blandy committed
345 346 347 348
      while (1)
	{
	  register Lisp_Object elt;

349 350
	  /* Fetch next element of `this' arg into `elt', or break if
             `this' is exhausted. */
Jim Blandy's avatar
Jim Blandy committed
351
	  if (NILP (this)) break;
Jim Blandy's avatar
Jim Blandy committed
352 353 354 355 356
	  if (CONSP (this))
	    elt = Fcar (this), this = Fcdr (this);
	  else
	    {
	      if (thisindex >= thisleni) break;
357
	      if (STRINGP (this))
358
		XSETFASTINT (elt, XSTRING (this)->data[thisindex++]);
Jim Blandy's avatar
Jim Blandy committed
359 360 361 362 363 364 365 366 367 368 369
	      else
		elt = XVECTOR (this)->contents[thisindex++];
	    }

	  /* Store into result */
	  if (toindex < 0)
	    {
	      XCONS (tail)->car = elt;
	      prev = tail;
	      tail = XCONS (tail)->cdr;
	    }
370
	  else if (VECTORP (val))
Jim Blandy's avatar
Jim Blandy committed
371 372 373
	    XVECTOR (val)->contents[toindex++] = elt;
	  else
	    {
374
	      while (!INTEGERP (elt))
Jim Blandy's avatar
Jim Blandy committed
375 376 377 378 379 380 381 382 383 384 385 386 387 388
		elt = wrong_type_argument (Qintegerp, elt);
	      {
#ifdef MASSC_REGISTER_BUG
		/* Even removing all "register"s doesn't disable this bug!
		   Nothing simpler than this seems to work. */
		unsigned char *p = & XSTRING (val)->data[toindex++];
		*p = XINT (elt);
#else
		XSTRING (val)->data[toindex++] = XINT (elt);
#endif
	      }
	    }
	}
    }
Jim Blandy's avatar
Jim Blandy committed
389
  if (!NILP (prev))
Jim Blandy's avatar
Jim Blandy committed
390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407
    XCONS (prev)->cdr = last_tail;

  return val;  
}

DEFUN ("copy-alist", Fcopy_alist, Scopy_alist, 1, 1, 0,
  "Return a copy of ALIST.\n\
This is an alist which represents the same mapping from objects to objects,\n\
but does not share the alist structure with ALIST.\n\
The objects mapped (cars and cdrs of elements of the alist)\n\
are shared, however.\n\
Elements of ALIST that are not conses are also shared.")
  (alist)
     Lisp_Object alist;
{
  register Lisp_Object tem;

  CHECK_LIST (alist, 0);
Jim Blandy's avatar
Jim Blandy committed
408
  if (NILP (alist))
Jim Blandy's avatar
Jim Blandy committed
409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429
    return alist;
  alist = concat (1, &alist, Lisp_Cons, 0);
  for (tem = alist; CONSP (tem); tem = XCONS (tem)->cdr)
    {
      register Lisp_Object car;
      car = XCONS (tem)->car;

      if (CONSP (car))
	XCONS (tem)->car = Fcons (XCONS (car)->car, XCONS (car)->cdr);
    }
  return alist;
}

DEFUN ("substring", Fsubstring, Ssubstring, 2, 3, 0,
  "Return a substring of STRING, starting at index FROM and ending before TO.\n\
TO may be nil or omitted; then the substring runs to the end of STRING.\n\
If FROM or TO is negative, it counts from the end.")
  (string, from, to)
     Lisp_Object string;
     register Lisp_Object from, to;
{
430 431
  Lisp_Object res;

Jim Blandy's avatar
Jim Blandy committed
432 433
  CHECK_STRING (string, 0);
  CHECK_NUMBER (from, 1);
Jim Blandy's avatar
Jim Blandy committed
434
  if (NILP (to))
Jim Blandy's avatar
Jim Blandy committed
435 436 437 438 439 440 441 442 443 444 445 446
    to = Flength (string);
  else
    CHECK_NUMBER (to, 2);

  if (XINT (from) < 0)
    XSETINT (from, XINT (from) + XSTRING (string)->size);
  if (XINT (to) < 0)
    XSETINT (to, XINT (to) + XSTRING (string)->size);
  if (!(0 <= XINT (from) && XINT (from) <= XINT (to)
        && XINT (to) <= XSTRING (string)->size))
    args_out_of_range_3 (string, from, to);

447 448 449 450
  res = make_string (XSTRING (string)->data + XINT (from),
		     XINT (to) - XINT (from));
  copy_text_properties (from, to, string, make_number (0), res, Qnil);
  return res;
Jim Blandy's avatar
Jim Blandy committed
451 452 453 454 455 456 457 458 459 460 461
}

DEFUN ("nthcdr", Fnthcdr, Snthcdr, 2, 2, 0,
  "Take cdr N times on LIST, returns the result.")
  (n, list)
     Lisp_Object n;
     register Lisp_Object list;
{
  register int i, num;
  CHECK_NUMBER (n, 0);
  num = XINT (n);
Jim Blandy's avatar
Jim Blandy committed
462
  for (i = 0; i < num && !NILP (list); i++)
Jim Blandy's avatar
Jim Blandy committed
463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486
    {
      QUIT;
      list = Fcdr (list);
    }
  return list;
}

DEFUN ("nth", Fnth, Snth, 2, 2, 0,
  "Return the Nth element of LIST.\n\
N counts from zero.  If LIST is not that long, nil is returned.")
  (n, list)
     Lisp_Object n, list;
{
  return Fcar (Fnthcdr (n, list));
}

DEFUN ("elt", Felt, Selt, 2, 2, 0,
  "Return element of SEQUENCE at index N.")
  (seq, n)
     register Lisp_Object seq, n;
{
  CHECK_NUMBER (n, 0);
  while (1)
    {
487
      if (CONSP (seq) || NILP (seq))
Jim Blandy's avatar
Jim Blandy committed
488
	return Fcar (Fnthcdr (n, seq));
489
      else if (STRINGP (seq) || VECTORP (seq))
Jim Blandy's avatar
Jim Blandy committed
490 491 492 493 494 495 496
	return Faref (seq, n);
      else
	seq = wrong_type_argument (Qsequencep, seq);
    }
}

DEFUN ("member", Fmember, Smember, 2, 2, 0,
Richard M. Stallman's avatar
Richard M. Stallman committed
497
  "Return non-nil if ELT is an element of LIST.  Comparison done with `equal'.\n\
Jim Blandy's avatar
Jim Blandy committed
498 499 500 501 502 503
The value is actually the tail of LIST whose car is ELT.")
  (elt, list)
     register Lisp_Object elt;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
504
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
505 506 507
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
Jim Blandy's avatar
Jim Blandy committed
508
      if (! NILP (Fequal (elt, tem)))
Jim Blandy's avatar
Jim Blandy committed
509 510 511 512 513 514 515 516 517 518 519 520 521 522
	return tail;
      QUIT;
    }
  return Qnil;
}

DEFUN ("memq", Fmemq, Smemq, 2, 2, 0,
  "Return non-nil if ELT is an element of LIST.  Comparison done with EQ.\n\
The value is actually the tail of LIST whose car is ELT.")
  (elt, list)
     register Lisp_Object elt;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
523
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
524 525 526 527 528 529 530 531 532 533
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (elt, tem)) return tail;
      QUIT;
    }
  return Qnil;
}

DEFUN ("assq", Fassq, Sassq, 2, 2, 0,
534 535
  "Return non-nil if KEY is `eq' to the car of an element of LIST.\n\
The value is actually the element of LIST whose car is KEY.\n\
Jim Blandy's avatar
Jim Blandy committed
536 537 538 539 540 541
Elements of LIST that are not conses are ignored.")
  (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
542
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fcar (elt);
      if (EQ (key, tem)) return elt;
      QUIT;
    }
  return Qnil;
}

/* Like Fassq but never report an error and do not allow quits.
   Use only on lists known never to be circular.  */

Lisp_Object
assq_no_quit (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
  for (tail = list; CONSP (tail); tail = Fcdr (tail))
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fcar (elt);
      if (EQ (key, tem)) return elt;
    }
  return Qnil;
}

DEFUN ("assoc", Fassoc, Sassoc, 2, 2, 0,
575 576
  "Return non-nil if KEY is `equal' to the car of an element of LIST.\n\
The value is actually the element of LIST whose car is KEY.")
Jim Blandy's avatar
Jim Blandy committed
577 578 579 580 581
  (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
582
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
583 584 585 586 587
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fequal (Fcar (elt), key);
Jim Blandy's avatar
Jim Blandy committed
588
      if (!NILP (tem)) return elt;
Jim Blandy's avatar
Jim Blandy committed
589 590 591 592 593 594 595 596 597 598 599 600 601
      QUIT;
    }
  return Qnil;
}

DEFUN ("rassq", Frassq, Srassq, 2, 2, 0,
  "Return non-nil if ELT is `eq' to the cdr of an element of LIST.\n\
The value is actually the element of LIST whose cdr is ELT.")
  (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
602
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fcdr (elt);
      if (EQ (key, tem)) return elt;
      QUIT;
    }
  return Qnil;
}

DEFUN ("delq", Fdelq, Sdelq, 2, 2, 0,
  "Delete by side effect any occurrences of ELT as a member of LIST.\n\
The modified LIST is returned.  Comparison is done with `eq'.\n\
If the first member of LIST is ELT, there is no way to remove it by side effect;\n\
therefore, write `(setq foo (delq element foo))'\n\
to be sure of changing the value of `foo'.")
  (elt, list)
     register Lisp_Object elt;
     Lisp_Object list;
{
  register Lisp_Object tail, prev;
  register Lisp_Object tem;

  tail = list;
  prev = Qnil;
Jim Blandy's avatar
Jim Blandy committed
629
  while (!NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
630 631 632 633
    {
      tem = Fcar (tail);
      if (EQ (elt, tem))
	{
Jim Blandy's avatar
Jim Blandy committed
634
	  if (NILP (prev))
Jim Blandy's avatar
Jim Blandy committed
635 636 637 638 639 640 641 642 643 644 645 646
	    list = Fcdr (tail);
	  else
	    Fsetcdr (prev, Fcdr (tail));
	}
      else
	prev = tail;
      tail = Fcdr (tail);
      QUIT;
    }
  return list;
}

Jim Blandy's avatar
Jim Blandy committed
647
DEFUN ("delete", Fdelete, Sdelete, 2, 2, 0,
Roland McGrath's avatar
Roland McGrath committed
648 649
  "Delete by side effect any occurrences of ELT as a member of LIST.\n\
The modified LIST is returned.  Comparison is done with `equal'.\n\
Richard M. Stallman's avatar
Richard M. Stallman committed
650 651 652
If the first member of LIST is ELT, deleting it is not a side effect;\n\
it is simply using a different list.\n\
Therefore, write `(setq foo (delete element foo))'\n\
Roland McGrath's avatar
Roland McGrath committed
653 654 655 656 657 658 659 660 661 662
to be sure of changing the value of `foo'.")
  (elt, list)
     register Lisp_Object elt;
     Lisp_Object list;
{
  register Lisp_Object tail, prev;
  register Lisp_Object tem;

  tail = list;
  prev = Qnil;
Jim Blandy's avatar
Jim Blandy committed
663
  while (!NILP (tail))
Roland McGrath's avatar
Roland McGrath committed
664 665
    {
      tem = Fcar (tail);
Jim Blandy's avatar
Jim Blandy committed
666
      if (! NILP (Fequal (elt, tem)))
Roland McGrath's avatar
Roland McGrath committed
667
	{
Jim Blandy's avatar
Jim Blandy committed
668
	  if (NILP (prev))
Roland McGrath's avatar
Roland McGrath committed
669 670 671 672 673 674 675 676 677 678 679 680
	    list = Fcdr (tail);
	  else
	    Fsetcdr (prev, Fcdr (tail));
	}
      else
	prev = tail;
      tail = Fcdr (tail);
      QUIT;
    }
  return list;
}

Jim Blandy's avatar
Jim Blandy committed
681 682 683 684 685 686 687 688
DEFUN ("nreverse", Fnreverse, Snreverse, 1, 1, 0,
  "Reverse LIST by modifying cdr pointers.\n\
Returns the beginning of the reversed list.")
  (list)
     Lisp_Object list;
{
  register Lisp_Object prev, tail, next;

Jim Blandy's avatar
Jim Blandy committed
689
  if (NILP (list)) return list;
Jim Blandy's avatar
Jim Blandy committed
690 691
  prev = Qnil;
  tail = list;
Jim Blandy's avatar
Jim Blandy committed
692
  while (!NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777
    {
      QUIT;
      next = Fcdr (tail);
      Fsetcdr (tail, prev);
      prev = tail;
      tail = next;
    }
  return prev;
}

DEFUN ("reverse", Freverse, Sreverse, 1, 1, 0,
  "Reverse LIST, copying.  Returns the beginning of the reversed list.\n\
See also the function `nreverse', which is used more often.")
  (list)
     Lisp_Object list;
{
  Lisp_Object length;
  register Lisp_Object *vec;
  register Lisp_Object tail;
  register int i;

  length = Flength (list);
  vec = (Lisp_Object *) alloca (XINT (length) * sizeof (Lisp_Object));
  for (i = XINT (length) - 1, tail = list; i >= 0; i--, tail = Fcdr (tail))
    vec[i] = Fcar (tail);

  return Flist (XINT (length), vec);
}

Lisp_Object merge ();

DEFUN ("sort", Fsort, Ssort, 2, 2, 0,
  "Sort LIST, stably, comparing elements using PREDICATE.\n\
Returns the sorted list.  LIST is modified by side effects.\n\
PREDICATE is called with two elements of LIST, and should return T\n\
if the first element is \"less\" than the second.")
  (list, pred)
     Lisp_Object list, pred;
{
  Lisp_Object front, back;
  register Lisp_Object len, tem;
  struct gcpro gcpro1, gcpro2;
  register int length;

  front = list;
  len = Flength (list);
  length = XINT (len);
  if (length < 2)
    return list;

  XSETINT (len, (length / 2) - 1);
  tem = Fnthcdr (len, list);
  back = Fcdr (tem);
  Fsetcdr (tem, Qnil);

  GCPRO2 (front, back);
  front = Fsort (front, pred);
  back = Fsort (back, pred);
  UNGCPRO;
  return merge (front, back, pred);
}

Lisp_Object
merge (org_l1, org_l2, pred)
     Lisp_Object org_l1, org_l2;
     Lisp_Object pred;
{
  Lisp_Object value;
  register Lisp_Object tail;
  Lisp_Object tem;
  register Lisp_Object l1, l2;
  struct gcpro gcpro1, gcpro2, gcpro3, gcpro4;

  l1 = org_l1;
  l2 = org_l2;
  tail = Qnil;
  value = Qnil;

  /* It is sufficient to protect org_l1 and org_l2.
     When l1 and l2 are updated, we copy the new values
     back into the org_ vars.  */
  GCPRO4 (org_l1, org_l2, pred, value);

  while (1)
    {
Jim Blandy's avatar
Jim Blandy committed
778
      if (NILP (l1))
Jim Blandy's avatar
Jim Blandy committed
779 780
	{
	  UNGCPRO;
Jim Blandy's avatar
Jim Blandy committed
781
	  if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
782 783 784 785
	    return l2;
	  Fsetcdr (tail, l2);
	  return value;
	}
Jim Blandy's avatar
Jim Blandy committed
786
      if (NILP (l2))
Jim Blandy's avatar
Jim Blandy committed
787 788
	{
	  UNGCPRO;
Jim Blandy's avatar
Jim Blandy committed
789
	  if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
790 791 792 793 794
	    return l1;
	  Fsetcdr (tail, l1);
	  return value;
	}
      tem = call2 (pred, Fcar (l2), Fcar (l1));
Jim Blandy's avatar
Jim Blandy committed
795
      if (NILP (tem))
Jim Blandy's avatar
Jim Blandy committed
796 797 798 799 800 801 802 803 804 805 806
	{
	  tem = l1;
	  l1 = Fcdr (l1);
	  org_l1 = l1;
	}
      else
	{
	  tem = l2;
	  l2 = Fcdr (l2);
	  org_l2 = l2;
	}
Jim Blandy's avatar
Jim Blandy committed
807
      if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
808 809 810 811 812 813 814 815 816 817 818 819 820 821 822
	value = tem;
      else
	Fsetcdr (tail, tem);
      tail = tem;
    }
}

DEFUN ("get", Fget, Sget, 2, 2, 0,
  "Return the value of SYMBOL's PROPNAME property.\n\
This is the last VALUE stored with `(put SYMBOL PROPNAME VALUE)'.")
  (sym, prop)
     Lisp_Object sym;
     register Lisp_Object prop;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
823
  for (tail = Fsymbol_plist (sym); !NILP (tail); tail = Fcdr (Fcdr (tail)))
Jim Blandy's avatar
Jim Blandy committed
824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (prop, tem))
	return Fcar (Fcdr (tail));
    }
  return Qnil;
}

DEFUN ("put", Fput, Sput, 3, 3, 0,
  "Store SYMBOL's PROPNAME property with value VALUE.\n\
It can be retrieved with `(get SYMBOL PROPNAME)'.")
  (sym, prop, val)
     Lisp_Object sym;
     register Lisp_Object prop;
     Lisp_Object val;
{
  register Lisp_Object tail, prev;
  Lisp_Object newcell;
  prev = Qnil;
Jim Blandy's avatar
Jim Blandy committed
844
  for (tail = Fsymbol_plist (sym); !NILP (tail); tail = Fcdr (Fcdr (tail)))
Jim Blandy's avatar
Jim Blandy committed
845 846 847 848 849 850 851 852
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (prop, tem))
	return Fsetcar (Fcdr (tail), val);
      prev = tail;
    }
  newcell = Fcons (prop, Fcons (val, Qnil));
Jim Blandy's avatar
Jim Blandy committed
853
  if (NILP (prev))
Jim Blandy's avatar
Jim Blandy committed
854 855 856 857 858 859 860 861 862 863 864
    Fsetplist (sym, newcell);
  else
    Fsetcdr (Fcdr (prev), newcell);
  return val;
}

DEFUN ("equal", Fequal, Sequal, 2, 2, 0,
  "T if two Lisp objects have similar structure and contents.\n\
They must have the same data type.\n\
Conses are compared by comparing the cars and the cdrs.\n\
Vectors and strings are compared element by element.\n\
865 866 867
Numbers are compared by value, but integers cannot equal floats.\n\
 (Use `=' if you want integers and floats to be able to be equal.)\n\
Symbols must match exactly.")
Jim Blandy's avatar
Jim Blandy committed
868 869 870
  (o1, o2)
     register Lisp_Object o1, o2;
{
871
  return internal_equal (o1, o2, 0) ? Qt : Qnil;
872 873
}

874
static int
875 876 877 878 879 880
internal_equal (o1, o2, depth)
     register Lisp_Object o1, o2;
     int depth;
{
  if (depth > 200)
    error ("Stack overflow in equal");
881
 tail_recurse:
Jim Blandy's avatar
Jim Blandy committed
882
  QUIT;
883
  if (EQ (o1, o2)) return 1;
884
#ifdef LISP_FLOAT_TYPE
885
  if (FLOATP (o1) && FLOATP (o2))
886
    return (extract_float (o1) == extract_float (o2));
887
#endif
888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905
  if (XTYPE (o1) != XTYPE (o2)) return 0;
  if (MISCP (o1) && XMISC (o1)->type != XMISC (o2)->type) return 0;
  if (CONSP (o1))
    {
      if (!internal_equal (XCONS (o1)->car, XCONS (o2)->car, depth + 1))
	return 0;
      o1 = XCONS (o1)->cdr;
      o2 = XCONS (o2)->cdr;
      goto tail_recurse;
    }
  if (OVERLAYP (o1))
    {
      if (!internal_equal (OVERLAY_START (o1), OVERLAY_START (o1), depth + 1)
	  || !internal_equal (OVERLAY_END (o1), OVERLAY_END (o1), depth + 1))
	return 0;
      o1 = XOVERLAY (o1)->plist;
      o2 = XOVERLAY (o2)->plist;
      goto tail_recurse;
Jim Blandy's avatar
Jim Blandy committed
906
    }
907
  if (MARKERP (o1))
Jim Blandy's avatar
Jim Blandy committed
908
    {
909
      return (XMARKER (o1)->buffer == XMARKER (o2)->buffer
910
	      && (XMARKER (o1)->buffer == 0
911
		  || XMARKER (o1)->bufpos == XMARKER (o2)->bufpos));
Jim Blandy's avatar
Jim Blandy committed
912
    }
913
  if (VECTORP (o1) || COMPILEDP (o1))
Jim Blandy's avatar
Jim Blandy committed
914 915 916
    {
      register int index;
      if (XVECTOR (o1)->size != XVECTOR (o2)->size)
917
	return 0;
Jim Blandy's avatar
Jim Blandy committed
918 919
      for (index = 0; index < XVECTOR (o1)->size; index++)
	{
920
	  Lisp_Object v1, v2;
Jim Blandy's avatar
Jim Blandy committed
921 922
	  v1 = XVECTOR (o1)->contents [index];
	  v2 = XVECTOR (o2)->contents [index];
923 924
	  if (!internal_equal (v1, v2, depth + 1))
	    return 0;
Jim Blandy's avatar
Jim Blandy committed
925
	}
926
      return 1;
Jim Blandy's avatar
Jim Blandy committed
927
    }
928
  if (STRINGP (o1))
Jim Blandy's avatar
Jim Blandy committed
929 930
    {
      if (XSTRING (o1)->size != XSTRING (o2)->size)
931
	return 0;
Jim Blandy's avatar
Jim Blandy committed
932
      if (bcmp (XSTRING (o1)->data, XSTRING (o2)->data, XSTRING (o1)->size))
933 934
	return 0;
      return 1;
Jim Blandy's avatar
Jim Blandy committed
935
    }
936
  return 0;
Jim Blandy's avatar
Jim Blandy committed
937 938 939 940 941 942 943 944 945
}

DEFUN ("fillarray", Ffillarray, Sfillarray, 2, 2, 0,
  "Store each element of ARRAY with ITEM.  ARRAY is a vector or string.")
  (array, item)
     Lisp_Object array, item;
{
  register int size, index, charval;
 retry:
946
  if (VECTORP (array))
Jim Blandy's avatar
Jim Blandy committed
947 948 949 950 951 952
    {
      register Lisp_Object *p = XVECTOR (array)->contents;
      size = XVECTOR (array)->size;
      for (index = 0; index < size; index++)
	p[index] = item;
    }
953
  else if (STRINGP (array))
Jim Blandy's avatar
Jim Blandy committed
954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999
    {
      register unsigned char *p = XSTRING (array)->data;
      CHECK_NUMBER (item, 1);
      charval = XINT (item);
      size = XSTRING (array)->size;
      for (index = 0; index < size; index++)
	p[index] = charval;
    }
  else
    {
      array = wrong_type_argument (Qarrayp, array);
      goto retry;
    }
  return array;
}

/* ARGSUSED */
Lisp_Object
nconc2 (s1, s2)
     Lisp_Object s1, s2;
{
#ifdef NO_ARG_ARRAY
  Lisp_Object args[2];
  args[0] = s1;
  args[1] = s2;
  return Fnconc (2, args);
#else
  return Fnconc (2, &s1);
#endif /* NO_ARG_ARRAY */
}

DEFUN ("nconc", Fnconc, Snconc, 0, MANY, 0,
  "Concatenate any number of lists by altering them.\n\
Only the last argument is not altered, and need not be a list.")
  (nargs, args)
     int nargs;
     Lisp_Object *args;
{
  register int argnum;
  register Lisp_Object tail, tem, val;

  val = Qnil;

  for (argnum = 0; argnum < nargs; argnum++)
    {
      tem = args[argnum];
Jim Blandy's avatar
Jim Blandy committed
1000
      if (NILP (tem)) continue;
Jim Blandy's avatar
Jim Blandy committed
1001

Jim Blandy's avatar
Jim Blandy committed
1002
      if (NILP (val))
Jim Blandy's avatar
Jim Blandy committed
1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018
	val = tem;

      if (argnum + 1 == nargs) break;

      if (!CONSP (tem))
	tem = wrong_type_argument (Qlistp, tem);

      while (CONSP (tem))
	{
	  tail = tem;
	  tem = Fcdr (tail);
	  QUIT;
	}

      tem = args[argnum + 1];
      Fsetcdr (tail, tem);
Jim Blandy's avatar
Jim Blandy committed
1019
      if (NILP (tem))
Jim Blandy's avatar
Jim Blandy committed
1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051
	args[argnum + 1] = tail;
    }

  return val;
}

/* This is the guts of all mapping functions.
 Apply fn to each element of seq, one by one,
 storing the results into elements of vals, a C vector of Lisp_Objects.
 leni is the length of vals, which should also be the length of seq. */

static void
mapcar1 (leni, vals, fn, seq)
     int leni;
     Lisp_Object *vals;
     Lisp_Object fn, seq;
{
  register Lisp_Object tail;
  Lisp_Object dummy;
  register int i;
  struct gcpro gcpro1, gcpro2, gcpro3;

  /* Don't let vals contain any garbage when GC happens.  */
  for (i = 0; i < leni; i++)
    vals[i] = Qnil;

  GCPRO3 (dummy, fn, seq);
  gcpro1.var = vals;
  gcpro1.nvars = leni;
  /* We need not explicitly protect `tail' because it is used only on lists, and
    1) lists are not relocated and 2) the list is marked via `seq' so will not be freed */

1052
  if (VECTORP (seq))
Jim Blandy's avatar
Jim Blandy committed
1053 1054 1055 1056 1057 1058 1059
    {
      for (i = 0; i < leni; i++)
	{
	  dummy = XVECTOR (seq)->contents[i];
	  vals[i] = call1 (fn, dummy);
	}
    }
1060
  else if (STRINGP (seq))
Jim Blandy's avatar
Jim Blandy committed
1061 1062 1063
    {
      for (i = 0; i < leni; i++)
	{
1064
	  XSETFASTINT (dummy, XSTRING (seq)->data[i]);
Jim Blandy's avatar
Jim Blandy committed
1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083
	  vals[i] = call1 (fn, dummy);
	}
    }
  else   /* Must be a list, since Flength did not get an error */
    {
      tail = seq;
      for (i = 0; i < leni; i++)
	{
	  vals[i] = call1 (fn, Fcar (tail));
	  tail = Fcdr (tail);
	}
    }

  UNGCPRO;
}

DEFUN ("mapconcat", Fmapconcat, Smapconcat, 3, 3, 0,
  "Apply FN to each element of SEQ, and concat the results as strings.\n\
In between each pair of results, stick in SEP.\n\
Richard M. Stallman's avatar
Richard M. Stallman committed
1084
Thus, \" \" as SEP results in spaces between the values returned by FN.")
Jim Blandy's avatar
Jim Blandy committed
1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138
  (fn, seq, sep)
     Lisp_Object fn, seq, sep;
{
  Lisp_Object len;
  register int leni;
  int nargs;
  register Lisp_Object *args;
  register int i;
  struct gcpro gcpro1;

  len = Flength (seq);
  leni = XINT (len);
  nargs = leni + leni - 1;
  if (nargs < 0) return build_string ("");

  args = (Lisp_Object *) alloca (nargs * sizeof (Lisp_Object));

  GCPRO1 (sep);
  mapcar1 (leni, args, fn, seq);
  UNGCPRO;

  for (i = leni - 1; i >= 0; i--)
    args[i + i] = args[i];
      
  for (i = 1; i < nargs; i += 2)
    args[i] = sep;

  return Fconcat (nargs, args);
}

DEFUN ("mapcar", Fmapcar, Smapcar, 2, 2, 0,
  "Apply FUNCTION to each element of SEQUENCE, and make a list of the results.\n\
The result is a list just as long as SEQUENCE.\n\
SEQUENCE may be a list, a vector or a string.")
  (fn, seq)
     Lisp_Object fn, seq;
{
  register Lisp_Object len;
  register int leni;
  register Lisp_Object *args;

  len = Flength (seq);
  leni = XFASTINT (len);
  args = (Lisp_Object *) alloca (leni * sizeof (Lisp_Object));

  mapcar1 (leni, args, fn, seq);

  return Flist (leni, args);
}

/* Anything that calls this function must protect from GC!  */

DEFUN ("y-or-n-p", Fy_or_n_p, Sy_or_n_p, 1, 1, 0,
  "Ask user a \"y or n\" question.  Return t if answer is \"y\".\n\
1139 1140
Takes one argument, which is the string to display to ask the question.\n\
It should end in a space; `y-or-n-p' adds `(y or n) ' to it.\n\
Jim Blandy's avatar
Jim Blandy committed
1141 1142 1143 1144 1145
No confirmation of the answer is requested; a single character is enough.\n\
Also accepts Space to mean yes, or Delete to mean no.")
  (prompt)
     Lisp_Object prompt;
{
1146 1147
  register Lisp_Object obj, key, def, answer_string, map;
  register int answer;
Jim Blandy's avatar
Jim Blandy committed
1148 1149 1150 1151 1152
  Lisp_Object xprompt;
  Lisp_Object args[2];
  int ocech = cursor_in_echo_area;
  struct gcpro gcpro1, gcpro2;

1153 1154
  map = Fsymbol_value (intern ("query-replace-map"));

Jim Blandy's avatar
Jim Blandy committed
1155 1156 1157 1158 1159 1160
  CHECK_STRING (prompt, 0);
  xprompt = prompt;
  GCPRO2 (prompt, xprompt);

  while (1)
    {
1161
#ifdef HAVE_X_MENU
1162 1163
      if ((NILP (last_nonmenu_event) || CONSP (last_nonmenu_event))
	  && using_x_p ())
1164 1165
	{
	  Lisp_Object pane, menu;
1166
	  redisplay_preserve_echo_area ();
1167 1168 1169
	  pane = Fcons (Fcons (build_string ("Yes"), Qt),
			Fcons (Fcons (build_string ("No"), Qnil),
			       Qnil));
1170
	  menu = Fcons (prompt, pane);
1171
	  obj = Fx_popup_dialog (Qt, menu);
1172 1173 1174
	  answer = !NILP (obj);
	  break;
	}
1175 1176 1177
#endif
      cursor_in_echo_area = 1;
      message ("%s(y or n) ", XSTRING (xprompt)->data);
Jim Blandy's avatar
Jim Blandy committed
1178

1179 1180 1181 1182
      obj = read_filtered_event (1, 0, 0);
      cursor_in_echo_area = 0;
      /* If we need to quit, quit with cursor_in_echo_area = 0.  */
      QUIT;
1183

1184 1185 1186
      key = Fmake_vector (make_number (1), obj);
      def = Flookup_key (map, key);
      answer_string = Fsingle_key_description (obj);
Jim Blandy's avatar
Jim Blandy committed
1187

1188 1189 1190 1191 1192 1193 1194 1195 1196 1197
      if (EQ (def, intern ("skip")))
	{
	  answer = 0;
	  break;
	}
      else if (EQ (def, intern ("act")))
	{
	  answer = 1;
	  break;
	}
1198 1199 1200 1201 1202 1203
      else if (EQ (def, intern ("recenter")))
	{
	  Frecenter (Qnil);
	  xprompt = prompt;
	  continue;
	}
1204
      else if (EQ (def, intern ("quit")))
Jim Blandy's avatar
Jim Blandy committed
1205
	Vquit_flag = Qt;
1206

Jim Blandy's avatar
Jim Blandy committed
1207
      QUIT;
Jim Blandy's avatar
Jim Blandy committed
1208 1209 1210

      /* If we don't clear this, then the next call to read_char will
	 return quit_char again, and we'll enter an infinite loop.  */
1211
      Vquit_flag = Qnil;
Jim Blandy's avatar
Jim Blandy committed
1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222

      Fding (Qnil);
      Fdiscard_input ();
      if (EQ (xprompt, prompt))
	{
	  args[0] = build_string ("Please answer y or n.  ");
	  args[1] = prompt;
	  xprompt = Fconcat (2, args);
	}
    }
  UNGCPRO;
1223

1224 1225 1226 1227 1228 1229
  if (! noninteractive)
    {
      cursor_in_echo_area = -1;
      message ("%s(y or n) %c", XSTRING (xprompt)->data, answer ? 'y' : 'n');
      cursor_in_echo_area = ocech;
    }
1230

1231
  return answer ? Qt : Qnil;
Jim Blandy's avatar
Jim Blandy committed
1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248
}

/* This is how C code calls `yes-or-no-p' and allows the user
   to redefined it.

   Anything that calls this function must protect from GC!  */

Lisp_Object
do_yes_or_no_p (prompt)
     Lisp_Object prompt;
{
  return call1 (intern ("yes-or-no-p"), prompt);
}

/* Anything that calls this function must protect from GC!  */

DEFUN ("yes-or-no-p", Fyes_or_no_p, Syes_or_no_p, 1, 1, 0,
1249 1250 1251 1252 1253
  "Ask user a yes-or-no question.  Return t if answer is yes.\n\
Takes one argument, which is the string to display to ask the question.\n\
It should end in a space; `yes-or-no-p' adds `(yes or no) ' to it.\n\
The user must confirm the answer with RET,\n\
and can edit it until it as been confirmed.")
Jim Blandy's avatar
Jim Blandy committed
1254 1255 1256 1257 1258 1259
  (prompt)
     Lisp_Object prompt;
{
  register Lisp_Object ans;
  Lisp_Object args[2];
  struct gcpro gcpro1;
1260
  Lisp_Object menu;
Jim Blandy's avatar
Jim Blandy committed
1261 1262 1263

  CHECK_STRING (prompt, 0);

1264
#ifdef HAVE_X_MENU
1265 1266
  if ((NILP (last_nonmenu_event) || CONSP (last_nonmenu_event))
      && using_x_p ())
1267 1268
    {
      Lisp_Object pane, menu, obj;
1269
      redisplay_preserve_echo_area ();
1270 1271 1272 1273
      pane = Fcons (Fcons (build_string ("Yes"), Qt),
		    Fcons (Fcons (build_string ("No"), Qnil),
			   Qnil));
      GCPRO1 (pane);
1274
      menu = Fcons (prompt, pane);
Richard M. Stallman's avatar
Richard M. Stallman committed
1275
      obj = Fx_popup_dialog (Qt, menu);
1276 1277 1278
      UNGCPRO;
      return obj;
    }
1279
#endif
1280

Jim Blandy's avatar
Jim Blandy committed
1281 1282 1283 1284 1285
  args[0] = prompt;
  args[1] = build_string ("(yes or no) ");
  prompt = Fconcat (2, args);

  GCPRO1 (prompt);
1286

Jim Blandy's avatar
Jim Blandy committed
1287 1288
  while (1)
    {
1289 1290
      ans = Fdowncase (Fread_from_minibuffer (prompt, Qnil, Qnil, Qnil,
					      Qyes_or_no_p_history));
Jim Blandy's avatar
Jim Blandy committed
1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304
      if (XSTRING (ans)->size == 3 && !strcmp (XSTRING (ans)->data, "yes"))
	{
	  UNGCPRO;
	  return Qt;
	}
      if (XSTRING (ans)->size == 2 && !strcmp (XSTRING (ans)->data, "no"))
	{
	  UNGCPRO;
	  return Qnil;
	}

      Fding (Qnil);
      Fdiscard_input ();
      message ("Please answer yes or no.");