fns.c 72.6 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* Random utility Lisp functions.
Richard M. Stallman's avatar
Richard M. Stallman committed
2
   Copyright (C) 1985, 86, 87, 93, 94, 95, 97, 1998 Free Software Foundation, Inc.
Jim Blandy's avatar
Jim Blandy committed
3 4 5 6 7

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
8
the Free Software Foundation; either version 2, or (at your option)
Jim Blandy's avatar
Jim Blandy committed
9 10 11 12 13 14 15 16 17
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
18 19
the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.  */
Jim Blandy's avatar
Jim Blandy committed
20 21


22
#include <config.h>
Jim Blandy's avatar
Jim Blandy committed
23

Andreas Schwab's avatar
Andreas Schwab committed
24 25 26 27
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif

Jim Blandy's avatar
Jim Blandy committed
28 29 30 31 32 33 34
/* 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"
35
#include "charset.h"
Jim Blandy's avatar
Jim Blandy committed
36 37

#include "buffer.h"
Jim Blandy's avatar
Jim Blandy committed
38
#include "keyboard.h"
39
#include "intervals.h"
40 41
#include "frame.h"
#include "window.h"
42
#if defined (HAVE_MENUS) && defined (HAVE_X_WINDOWS)
Andreas Schwab's avatar
Andreas Schwab committed
43 44
#include "xterm.h"
#endif
Jim Blandy's avatar
Jim Blandy committed
45

Karl Heuer's avatar
Karl Heuer committed
46 47 48 49
#ifndef NULL
#define NULL (void *)0
#endif

50 51 52 53
/* Nonzero enables use of dialog boxes for questions
   asked by mouse commands.  */
int use_dialog_box;

54 55 56
extern int minibuffer_auto_raise;
extern Lisp_Object minibuf_window;

57
Lisp_Object Qstring_lessp, Qprovide, Qrequire;
58
Lisp_Object Qyes_or_no_p_history;
59
Lisp_Object Qcursor_in_echo_area;
Karl Heuer's avatar
Karl Heuer committed
60
Lisp_Object Qwidget_type;
Jim Blandy's avatar
Jim Blandy committed
61

62
static int internal_equal ();
63 64 65 66 67 68 69

extern long get_random ();
extern void seed_random ();

#ifndef HAVE_UNISTD_H
extern long time ();
#endif
70

Jim Blandy's avatar
Jim Blandy committed
71 72 73 74 75 76 77 78 79 80
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\
81 82
All integers representable in Lisp are equally likely.\n\
  On most systems, this is 28 bits' worth.\n\
83
With positive integer argument N, return random number in interval [0,N).\n\
Jim Blandy's avatar
Jim Blandy committed
84
With argument t, set the random number seed from the current time and pid.")
85 86
  (n)
     Lisp_Object n;
Jim Blandy's avatar
Jim Blandy committed
87
{
88 89
  EMACS_INT val;
  Lisp_Object lispy_val;
90
  unsigned long denominator;
Jim Blandy's avatar
Jim Blandy committed
91

92
  if (EQ (n, Qt))
93
    seed_random (getpid () + time (NULL));
94
  if (NATNUMP (n) && XFASTINT (n) != 0)
Jim Blandy's avatar
Jim Blandy committed
95
    {
96 97 98 99
      /* 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
100
	 it's possible to get a quotient larger than n; discarding
101
	 these values eliminates the bias that would otherwise appear
102 103
	 when using a large n.  */
      denominator = ((unsigned long)1 << VALBITS) / XFASTINT (n);
104
      do
105
	val = get_random () / denominator;
106
      while (val >= XFASTINT (n));
Jim Blandy's avatar
Jim Blandy committed
107
    }
108
  else
109
    val = get_random ();
110 111
  XSETINT (lispy_val, val);
  return lispy_val;
Jim Blandy's avatar
Jim Blandy committed
112 113 114 115 116 117
}

/* Random data-structure functions */

DEFUN ("length", Flength, Slength, 1, 1, 0,
  "Return the length of vector, list or string SEQUENCE.\n\
Richard M. Stallman's avatar
Richard M. Stallman committed
118 119
A byte-code function object is also allowed.\n\
If the string contains multibyte characters, this is not the necessarily\n\
Andreas Schwab's avatar
Andreas Schwab committed
120 121
the number of bytes in the string; it is the number of characters.\n\
To get the number of bytes, use `string-bytes'")
122 123
  (sequence)
     register Lisp_Object sequence;
Jim Blandy's avatar
Jim Blandy committed
124 125 126 127 128
{
  register Lisp_Object tail, val;
  register int i;

 retry:
129 130 131 132 133
  if (STRINGP (sequence))
    XSETFASTINT (val, XSTRING (sequence)->size);
  else if (VECTORP (sequence))
    XSETFASTINT (val, XVECTOR (sequence)->size);
  else if (CHAR_TABLE_P (sequence))
Karl Heuer's avatar
Karl Heuer committed
134 135 136
    XSETFASTINT (val, (MIN_CHAR_COMPOSITION
		       + (CHAR_FIELD2_MASK | CHAR_FIELD3_MASK)
		       - 1));
137 138 139 140 141
  else if (BOOL_VECTOR_P (sequence))
    XSETFASTINT (val, XBOOL_VECTOR (sequence)->size);
  else if (COMPILEDP (sequence))
    XSETFASTINT (val, XVECTOR (sequence)->size & PSEUDOVECTOR_SIZE_MASK);
  else if (CONSP (sequence))
Jim Blandy's avatar
Jim Blandy committed
142
    {
143
      for (i = 0, tail = sequence; !NILP (tail); i++)
Jim Blandy's avatar
Jim Blandy committed
144 145 146 147 148
	{
	  QUIT;
	  tail = Fcdr (tail);
	}

149
      XSETFASTINT (val, i);
Jim Blandy's avatar
Jim Blandy committed
150
    }
151
  else if (NILP (sequence))
152
    XSETFASTINT (val, 0);
Jim Blandy's avatar
Jim Blandy committed
153 154
  else
    {
155
      sequence = wrong_type_argument (Qsequencep, sequence);
Jim Blandy's avatar
Jim Blandy committed
156 157
      goto retry;
    }
158
  return val;
Jim Blandy's avatar
Jim Blandy committed
159 160
}

161 162 163 164 165 166 167 168
/* This does not check for quits.  That is safe
   since it must terminate.  */

DEFUN ("safe-length", Fsafe_length, Ssafe_length, 1, 1, 0,
  "Return the length of a list, but avoid error or infinite loop.\n\
This function never gets an error.  If LIST is not really a list,\n\
it returns 0.  If LIST is circular, it returns a finite value\n\
which is at least the number of distinct elements.")
Karl Heuer's avatar
Karl Heuer committed
169
  (list)
170 171 172 173 174 175 176 177 178 179
     Lisp_Object list;
{
  Lisp_Object tail, halftail, length;
  int len = 0;

  /* halftail is used to detect circular lists.  */
  halftail = list;
  for (tail = list; CONSP (tail); tail = XCONS (tail)->cdr)
    {
      if (EQ (tail, halftail) && len != 0)
180
	break;
181
      len++;
182
      if ((len & 1) == 0)
183 184 185 186 187 188 189
	halftail = XCONS (halftail)->cdr;
    }

  XSETINT (length, len);
  return length;
}

190 191 192 193
DEFUN ("string-bytes", Fstring_bytes, Sstring_bytes, 1, 1, 0,
  "Return the number of bytes in STRING.\n\
If STRING is a multibyte string, this is greater than the length of STRING.")
  (string)
194
     Lisp_Object string;
195 196
{
  CHECK_STRING (string, 1);
197
  return make_number (STRING_BYTES (XSTRING (string)));
198 199
}

Jim Blandy's avatar
Jim Blandy committed
200
DEFUN ("string-equal", Fstring_equal, Sstring_equal, 2, 2, 0,
201
  "Return t if two strings have identical contents.\n\
202
Case is significant, but text properties are ignored.\n\
Jim Blandy's avatar
Jim Blandy committed
203 204 205 206
Symbols are also allowed; their print names are used instead.")
  (s1, s2)
     register Lisp_Object s1, s2;
{
207
  if (SYMBOLP (s1))
208
    XSETSTRING (s1, XSYMBOL (s1)->name);
209
  if (SYMBOLP (s2))
210
    XSETSTRING (s2, XSYMBOL (s2)->name);
Jim Blandy's avatar
Jim Blandy committed
211 212 213
  CHECK_STRING (s1, 0);
  CHECK_STRING (s2, 1);

214
  if (XSTRING (s1)->size != XSTRING (s2)->size
215 216
      || STRING_BYTES (XSTRING (s1)) != STRING_BYTES (XSTRING (s2))
      || bcmp (XSTRING (s1)->data, XSTRING (s2)->data, STRING_BYTES (XSTRING (s1))))
Jim Blandy's avatar
Jim Blandy committed
217 218 219 220
    return Qnil;
  return Qt;
}

221
DEFUN ("compare-strings", Fcompare_strings,
222
       Scompare_strings, 6, 7, 0,
223 224 225
  "Compare the contents of two strings, converting to multibyte if needed.\n\
In string STR1, skip the first START1 characters and stop at END1.\n\
In string STR2, skip the first START2 characters and stop at END2.\n\
226 227
END1 and END2 default to the full lengths of the respective strings.\n\
\n\
228 229 230 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 256 257 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 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323
Case is significant in this comparison if IGNORE-CASE is nil.\n\
Unibyte strings are converted to multibyte for comparison.\n\
\n\
The value is t if the strings (or specified portions) match.\n\
If string STR1 is less, the value is a negative number N;\n\
  - 1 - N is the number of characters that match at the beginning.\n\
If string STR1 is greater, the value is a positive number N;\n\
  N - 1 is the number of characters that match at the beginning.")
  (str1, start1, end1, str2, start2, end2, ignore_case)
     Lisp_Object str1, start1, end1, start2, str2, end2, ignore_case;
{
  register int end1_char, end2_char;
  register int i1, i1_byte, i2, i2_byte;

  CHECK_STRING (str1, 0);
  CHECK_STRING (str2, 1);
  if (NILP (start1))
    start1 = make_number (0);
  if (NILP (start2))
    start2 = make_number (0);
  CHECK_NATNUM (start1, 2);
  CHECK_NATNUM (start2, 3);
  if (! NILP (end1))
    CHECK_NATNUM (end1, 4);
  if (! NILP (end2))
    CHECK_NATNUM (end2, 4);

  i1 = XINT (start1);
  i2 = XINT (start2);

  i1_byte = string_char_to_byte (str1, i1);
  i2_byte = string_char_to_byte (str2, i2);

  end1_char = XSTRING (str1)->size;
  if (! NILP (end1) && end1_char > XINT (end1))
    end1_char = XINT (end1);

  end2_char = XSTRING (str2)->size;
  if (! NILP (end2) && end2_char > XINT (end2))
    end2_char = XINT (end2);

  while (i1 < end1_char && i2 < end2_char)
    {
      /* When we find a mismatch, we must compare the
	 characters, not just the bytes.  */
      int c1, c2;

      if (STRING_MULTIBYTE (str1))
	FETCH_STRING_CHAR_ADVANCE (c1, str1, i1, i1_byte);
      else
	{
	  c1 = XSTRING (str1)->data[i1++];
	  c1 = unibyte_char_to_multibyte (c1);
	}

      if (STRING_MULTIBYTE (str2))
	FETCH_STRING_CHAR_ADVANCE (c2, str2, i2, i2_byte);
      else
	{
	  c2 = XSTRING (str2)->data[i2++];
	  c2 = unibyte_char_to_multibyte (c2);
	}

      if (c1 == c2)
	continue;

      if (! NILP (ignore_case))
	{
	  Lisp_Object tem;

	  tem = Fupcase (make_number (c1));
	  c1 = XINT (tem);
	  tem = Fupcase (make_number (c2));
	  c2 = XINT (tem);
	}

      if (c1 == c2)
	continue;

      /* Note that I1 has already been incremented
	 past the character that we are comparing;
	 hence we don't add or subtract 1 here.  */
      if (c1 < c2)
	return make_number (- i1);
      else
	return make_number (i1);
    }

  if (i1 < end1_char)
    return make_number (i1 - XINT (start1) + 1);
  if (i2 < end2_char)
    return make_number (- i1 + XINT (start1) - 1);

  return Qt;
}

Jim Blandy's avatar
Jim Blandy committed
324
DEFUN ("string-lessp", Fstring_lessp, Sstring_lessp, 2, 2, 0,
325
  "Return t if first arg string is less than second in lexicographic order.\n\
Jim Blandy's avatar
Jim Blandy committed
326 327 328 329 330 331
Case is significant.\n\
Symbols are also allowed; their print names are used instead.")
  (s1, s2)
     register Lisp_Object s1, s2;
{
  register int end;
332
  register int i1, i1_byte, i2, i2_byte;
Jim Blandy's avatar
Jim Blandy committed
333

334
  if (SYMBOLP (s1))
335
    XSETSTRING (s1, XSYMBOL (s1)->name);
336
  if (SYMBOLP (s2))
337
    XSETSTRING (s2, XSYMBOL (s2)->name);
Jim Blandy's avatar
Jim Blandy committed
338 339 340
  CHECK_STRING (s1, 0);
  CHECK_STRING (s2, 1);

341 342 343 344 345
  i1 = i1_byte = i2 = i2_byte = 0;

  end = XSTRING (s1)->size;
  if (end > XSTRING (s2)->size)
    end = XSTRING (s2)->size;
Jim Blandy's avatar
Jim Blandy committed
346

347
  while (i1 < end)
Jim Blandy's avatar
Jim Blandy committed
348
    {
349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364
      /* When we find a mismatch, we must compare the
	 characters, not just the bytes.  */
      int c1, c2;

      if (STRING_MULTIBYTE (s1))
	FETCH_STRING_CHAR_ADVANCE (c1, s1, i1, i1_byte);
      else
	c1 = XSTRING (s1)->data[i1++];

      if (STRING_MULTIBYTE (s2))
	FETCH_STRING_CHAR_ADVANCE (c2, s2, i2, i2_byte);
      else
	c2 = XSTRING (s2)->data[i2++];

      if (c1 != c2)
	return c1 < c2 ? Qt : Qnil;
Jim Blandy's avatar
Jim Blandy committed
365
    }
366
  return i1 < XSTRING (s2)->size ? Qt : Qnil;
Jim Blandy's avatar
Jim Blandy committed
367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385
}

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
386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401
/* 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
402 403 404 405
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
406
The last argument is not copied, just used as the tail of the new list.")
Jim Blandy's avatar
Jim Blandy committed
407 408 409 410 411 412 413 414 415 416
  (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\
417 418 419 420 421 422
Each argument may be a string or a list or vector of characters (integers).\n\
\n\
Do not use individual integers as arguments!\n\
The behavior of `concat' in that case will be changed later!\n\
If your program passes an integer as an argument to `concat',\n\
you should change it right away not to do so.")
Jim Blandy's avatar
Jim Blandy committed
423 424 425 426 427 428 429 430 431 432 433 434 435 436 437
  (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;
{
438
  return concat (nargs, args, Lisp_Vectorlike, 0);
Jim Blandy's avatar
Jim Blandy committed
439 440
}

441 442 443 444
/* Retrun a copy of a sub char table ARG.  The elements except for a
   nested sub char table are not copied.  */
static Lisp_Object
copy_sub_char_table (arg)
445
     Lisp_Object arg;
446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462
{
  Lisp_Object copy = make_sub_char_table (XCHAR_TABLE (arg)->defalt);
  int i;

  /* Copy all the contents.  */
  bcopy (XCHAR_TABLE (arg)->contents, XCHAR_TABLE (copy)->contents,
	 SUB_CHAR_TABLE_ORDINARY_SLOTS * sizeof (Lisp_Object));
  /* Recursively copy any sub char-tables in the ordinary slots.  */
  for (i = 32; i < SUB_CHAR_TABLE_ORDINARY_SLOTS; i++)
    if (SUB_CHAR_TABLE_P (XCHAR_TABLE (arg)->contents[i]))
      XCHAR_TABLE (copy)->contents[i]
	= copy_sub_char_table (XCHAR_TABLE (copy)->contents[i]);

  return copy;
}


Jim Blandy's avatar
Jim Blandy committed
463 464 465 466 467 468 469
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
470
  if (NILP (arg)) return arg;
471 472 473

  if (CHAR_TABLE_P (arg))
    {
474
      int i;
475 476
      Lisp_Object copy;

477
      copy = Fmake_char_table (XCHAR_TABLE (arg)->purpose, Qnil);
478
      /* Copy all the slots, including the extra ones.  */
479
      bcopy (XVECTOR (arg)->contents, XVECTOR (copy)->contents,
480 481
	     ((XCHAR_TABLE (arg)->size & PSEUDOVECTOR_SIZE_MASK)
	      * sizeof (Lisp_Object)));
482

483 484 485 486 487
      /* Recursively copy any sub char tables in the ordinary slots
         for multibyte characters.  */
      for (i = CHAR_TABLE_SINGLE_BYTE_SLOTS;
	   i < CHAR_TABLE_ORDINARY_SLOTS; i++)
	if (SUB_CHAR_TABLE_P (XCHAR_TABLE (arg)->contents[i]))
488
	  XCHAR_TABLE (copy)->contents[i]
489
	    = copy_sub_char_table (XCHAR_TABLE (copy)->contents[i]);
490 491 492 493 494 495 496 497

      return copy;
    }

  if (BOOL_VECTOR_P (arg))
    {
      Lisp_Object val;
      int size_in_chars
498
	= (XBOOL_VECTOR (arg)->size + BITS_PER_CHAR - 1) / BITS_PER_CHAR;
499 500 501 502 503 504 505

      val = Fmake_bool_vector (Flength (arg), Qnil);
      bcopy (XBOOL_VECTOR (arg)->data, XBOOL_VECTOR (val)->data,
	     size_in_chars);
      return val;
    }

506
  if (!CONSP (arg) && !VECTORP (arg) && !STRINGP (arg))
Jim Blandy's avatar
Jim Blandy committed
507 508 509 510 511 512 513 514 515 516 517 518 519 520 521
    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;
  register Lisp_Object tail;
  register Lisp_Object this;
  int toindex;
522 523 524
  int toindex_byte;
  register int result_len;
  register int result_len_byte;
Jim Blandy's avatar
Jim Blandy committed
525 526 527
  register int argnum;
  Lisp_Object last_tail;
  Lisp_Object prev;
528
  int some_multibyte;
Jim Blandy's avatar
Jim Blandy committed
529 530 531 532 533 534 535 536 537 538

  /* 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;

539
  /* Canonicalize each argument.  */
Jim Blandy's avatar
Jim Blandy committed
540 541 542
  for (argnum = 0; argnum < nargs; argnum++)
    {
      this = args[argnum];
543
      if (!(CONSP (this) || NILP (this) || VECTORP (this) || STRINGP (this)
544
	    || COMPILEDP (this) || BOOL_VECTOR_P (this)))
Jim Blandy's avatar
Jim Blandy committed
545
	{
546
	  if (INTEGERP (this))
547
            args[argnum] = Fnumber_to_string (this);
Jim Blandy's avatar
Jim Blandy committed
548 549 550 551 552
	  else
	    args[argnum] = wrong_type_argument (Qsequencep, this);
	}
    }

553 554 555 556 557 558 559 560
  /* Compute total length in chars of arguments in RESULT_LEN.
     If desired output is a string, also compute length in bytes
     in RESULT_LEN_BYTE, and determine in SOME_MULTIBYTE
     whether the result should be a multibyte string.  */
  result_len_byte = 0;
  result_len = 0;
  some_multibyte = 0;
  for (argnum = 0; argnum < nargs; argnum++)
Jim Blandy's avatar
Jim Blandy committed
561
    {
562
      int len;
Jim Blandy's avatar
Jim Blandy committed
563
      this = args[argnum];
564 565
      len = XFASTINT (Flength (this));
      if (target_type == Lisp_String)
566
	{
567 568
	  /* We must count the number of bytes needed in the string
	     as well as the number of characters.  */
569 570
	  int i;
	  Lisp_Object ch;
571
	  int this_len_byte;
572

573
	  if (VECTORP (this))
574
	    for (i = 0; i < len; i++)
575 576 577 578
	      {
		ch = XVECTOR (this)->contents[i];
		if (! INTEGERP (ch))
		  wrong_type_argument (Qintegerp, ch);
579 580 581 582
		this_len_byte = XFASTINT (Fchar_bytes (ch));
		result_len_byte += this_len_byte;
		if (this_len_byte > 1)
		  some_multibyte = 1;
583
	      }
584 585
	  else if (BOOL_VECTOR_P (this) && XBOOL_VECTOR (this)->size > 0)
	    wrong_type_argument (Qintegerp, Faref (this, make_number (0)));
586
	  else if (CONSP (this))
587 588 589 590 591
	    for (; CONSP (this); this = XCONS (this)->cdr)
	      {
		ch = XCONS (this)->car;
		if (! INTEGERP (ch))
		  wrong_type_argument (Qintegerp, ch);
592 593 594 595
		this_len_byte = XFASTINT (Fchar_bytes (ch));
		result_len_byte += this_len_byte;
		if (this_len_byte > 1)
		  some_multibyte = 1;
596
	      }
597
	  else if (STRINGP (this))
598
	    {
599
	      if (STRING_MULTIBYTE (this))
600 601
		{
		  some_multibyte = 1;
602
		  result_len_byte += STRING_BYTES (XSTRING (this));
603 604 605 606
		}
	      else
		result_len_byte += count_size_as_multibyte (XSTRING (this)->data,
							    XSTRING (this)->size);
607
	    }
608
	}
609 610

      result_len += len;
Jim Blandy's avatar
Jim Blandy committed
611 612
    }

613 614
  if (! some_multibyte)
    result_len_byte = result_len;
Jim Blandy's avatar
Jim Blandy committed
615

616
  /* Create the output object.  */
Jim Blandy's avatar
Jim Blandy committed
617
  if (target_type == Lisp_Cons)
618
    val = Fmake_list (make_number (result_len), Qnil);
619
  else if (target_type == Lisp_Vectorlike)
620
    val = Fmake_vector (make_number (result_len), Qnil);
621
  else if (some_multibyte)
622
    val = make_uninit_multibyte_string (result_len, result_len_byte);
623 624
  else
    val = make_uninit_string (result_len);
Jim Blandy's avatar
Jim Blandy committed
625

626 627 628
  /* In `append', if all but last arg are nil, return last arg.  */
  if (target_type == Lisp_Cons && EQ (val, Qnil))
    return last_tail;
Jim Blandy's avatar
Jim Blandy committed
629

630
  /* Copy the contents of the args into the result.  */
Jim Blandy's avatar
Jim Blandy committed
631 632 633
  if (CONSP (val))
    tail = val, toindex = -1;		/* -1 in toindex is flag we are making a list */
  else
634
    toindex = 0, toindex_byte = 0;
Jim Blandy's avatar
Jim Blandy committed
635 636 637 638 639 640 641

  prev = Qnil;

  for (argnum = 0; argnum < nargs; argnum++)
    {
      Lisp_Object thislen;
      int thisleni;
642
      register unsigned int thisindex = 0;
643
      register unsigned int thisindex_byte = 0;
Jim Blandy's avatar
Jim Blandy committed
644 645 646 647 648

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

649
      if (STRINGP (this) && STRINGP (val)
650
	  && ! NULL_INTERVAL_P (XSTRING (this)->intervals))
651 652
	copy_text_properties (make_number (0), thislen, this,
			      make_number (toindex), val, Qnil);
653

654 655 656
      /* Between strings of the same kind, copy fast.  */
      if (STRINGP (this) && STRINGP (val)
	  && STRING_MULTIBYTE (this) == some_multibyte)
Jim Blandy's avatar
Jim Blandy committed
657
	{
658
	  int thislen_byte = STRING_BYTES (XSTRING (this));
659
	  bcopy (XSTRING (this)->data, XSTRING (val)->data + toindex_byte,
660
		 STRING_BYTES (XSTRING (this)));
661 662 663
	  toindex_byte += thislen_byte;
	  toindex += thisleni;
	}
664 665 666 667 668 669 670 671
      /* Copy a single-byte string to a multibyte string.  */
      else if (STRINGP (this) && STRINGP (val))
	{
	  toindex_byte += copy_text (XSTRING (this)->data,
				     XSTRING (val)->data + toindex_byte,
				     XSTRING (this)->size, 0, 1);
	  toindex += thisleni;
	}
672 673 674 675 676 677 678 679 680 681 682
      else
	/* Copy element by element.  */
	while (1)
	  {
	    register Lisp_Object elt;

	    /* Fetch next element of `this' arg into `elt', or break if
	       `this' is exhausted. */
	    if (NILP (this)) break;
	    if (CONSP (this))
	      elt = XCONS (this)->car, this = XCONS (this)->cdr;
683 684 685
	    else if (thisindex >= thisleni)
	      break;
	    else if (STRINGP (this))
686
	      {
687
		int c;
688
		if (STRING_MULTIBYTE (this))
689
		  {
690 691 692 693
		    FETCH_STRING_CHAR_ADVANCE (c, this,
					       thisindex,
					       thisindex_byte);
		    XSETFASTINT (elt, c);
694
		  }
695
		else
696
		  {
697 698 699 700
		    XSETFASTINT (elt, XSTRING (this)->data[thisindex++]);
		    if (some_multibyte && XINT (elt) >= 0200
			&& XINT (elt) < 0400)
		      {
701
			c = unibyte_char_to_multibyte (XINT (elt));
702 703
			XSETINT (elt, c);
		      }
704
		  }
705 706 707 708 709 710 711
	      }
	    else if (BOOL_VECTOR_P (this))
	      {
		int byte;
		byte = XBOOL_VECTOR (this)->data[thisindex / BITS_PER_CHAR];
		if (byte & (1 << (thisindex % BITS_PER_CHAR)))
		  elt = Qt;
712
		else
713 714
		  elt = Qnil;
		thisindex++;
715
	      }
716 717
	    else
	      elt = XVECTOR (this)->contents[thisindex++];
Jim Blandy's avatar
Jim Blandy committed
718

719 720
	    /* Store this element into the result.  */
	    if (toindex < 0)
Jim Blandy's avatar
Jim Blandy committed
721
	      {
722 723 724
		XCONS (tail)->car = elt;
		prev = tail;
		tail = XCONS (tail)->cdr;
Jim Blandy's avatar
Jim Blandy committed
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
	    else if (VECTORP (val))
	      XVECTOR (val)->contents[toindex++] = elt;
	    else
	      {
		CHECK_NUMBER (elt, 0);
		if (SINGLE_BYTE_CHAR_P (XINT (elt)))
		  {
		    XSTRING (val)->data[toindex++] = XINT (elt);
		    toindex_byte++;
		  }
		else
		  /* If we have any multibyte characters,
		     we already decided to make a multibyte string.  */
		  {
		    int c = XINT (elt);
		    unsigned char work[4], *str;
		    int i = CHAR_STRING (c, work, str);

		    /* P exists as a variable
		       to avoid a bug on the Masscomp C compiler.  */
		    unsigned char *p = & XSTRING (val)->data[toindex_byte];
		    bcopy (str, p, i);
		    toindex_byte += i;
		    toindex++;
		  }
	      }
	  }
Jim Blandy's avatar
Jim Blandy committed
753
    }
Jim Blandy's avatar
Jim Blandy committed
754
  if (!NILP (prev))
Jim Blandy's avatar
Jim Blandy committed
755 756
    XCONS (prev)->cdr = last_tail;

Karl Heuer's avatar
Karl Heuer committed
757
  return val;
Jim Blandy's avatar
Jim Blandy committed
758 759
}

760 761 762 763
static Lisp_Object string_char_byte_cache_string;
static int string_char_byte_cache_charpos;
static int string_char_byte_cache_bytepos;

764 765 766 767 768 769 770
/* Return the character index corresponding to CHAR_INDEX in STRING.  */

int
string_char_to_byte (string, char_index)
     Lisp_Object string;
     int char_index;
{
771 772 773
  int i, i_byte;
  int best_below, best_below_byte;
  int best_above, best_above_byte;
774 775 776 777

  if (! STRING_MULTIBYTE (string))
    return char_index;

778 779
  best_below = best_below_byte = 0;
  best_above = XSTRING (string)->size;
780
  best_above_byte = STRING_BYTES (XSTRING (string));
781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806

  if (EQ (string, string_char_byte_cache_string))
    {
      if (string_char_byte_cache_charpos < char_index)
	{
	  best_below = string_char_byte_cache_charpos;
	  best_below_byte = string_char_byte_cache_bytepos;
	}
      else
	{
	  best_above = string_char_byte_cache_charpos;
	  best_above_byte = string_char_byte_cache_bytepos;
	}
    }

  if (char_index - best_below < best_above - char_index)
    {
      while (best_below < char_index)
	{
	  int c;
	  FETCH_STRING_CHAR_ADVANCE (c, string, best_below, best_below_byte);
	}
      i = best_below;
      i_byte = best_below_byte;
    }
  else
807
    {
808 809 810 811 812 813 814 815 816 817 818 819 820
      while (best_above > char_index)
	{
	  int best_above_byte_saved = --best_above_byte;

	  while (best_above_byte > 0
		 && !CHAR_HEAD_P (XSTRING (string)->data[best_above_byte]))
	    best_above_byte--;
	  if (XSTRING (string)->data[best_above_byte] < 0x80)
	    best_above_byte = best_above_byte_saved;
	  best_above--;
	}
      i = best_above;
      i_byte = best_above_byte;
821 822
    }

823 824 825 826
  string_char_byte_cache_bytepos = i_byte;
  string_char_byte_cache_charpos = i;
  string_char_byte_cache_string = string;

827 828
  return i_byte;
}
829

830 831 832 833 834 835 836
/* Return the character index corresponding to BYTE_INDEX in STRING.  */

int
string_byte_to_char (string, byte_index)
     Lisp_Object string;
     int byte_index;
{
837 838 839
  int i, i_byte;
  int best_below, best_below_byte;
  int best_above, best_above_byte;
840 841 842 843

  if (! STRING_MULTIBYTE (string))
    return byte_index;

844 845
  best_below = best_below_byte = 0;
  best_above = XSTRING (string)->size;
846
  best_above_byte = STRING_BYTES (XSTRING (string));
847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872

  if (EQ (string, string_char_byte_cache_string))
    {
      if (string_char_byte_cache_bytepos < byte_index)
	{
	  best_below = string_char_byte_cache_charpos;
	  best_below_byte = string_char_byte_cache_bytepos;
	}
      else
	{
	  best_above = string_char_byte_cache_charpos;
	  best_above_byte = string_char_byte_cache_bytepos;
	}
    }

  if (byte_index - best_below_byte < best_above_byte - byte_index)
    {
      while (best_below_byte < byte_index)
	{
	  int c;
	  FETCH_STRING_CHAR_ADVANCE (c, string, best_below, best_below_byte);
	}
      i = best_below;
      i_byte = best_below_byte;
    }
  else
873
    {
874 875 876 877 878 879 880 881 882 883 884 885 886
      while (best_above_byte > byte_index)
	{
	  int best_above_byte_saved = --best_above_byte;

	  while (best_above_byte > 0
		 && !CHAR_HEAD_P (XSTRING (string)->data[best_above_byte]))
	    best_above_byte--;
	  if (XSTRING (string)->data[best_above_byte] < 0x80)
	    best_above_byte = best_above_byte_saved;
	  best_above--;
	}
      i = best_above;
      i_byte = best_above_byte;
887 888
    }

889 890 891 892
  string_char_byte_cache_bytepos = i_byte;
  string_char_byte_cache_charpos = i;
  string_char_byte_cache_string = string;

893 894
  return i;
}
895

896
/* Convert STRING to a multibyte string.
897
   Single-byte characters 0240 through 0377 are converted
898 899 900 901 902 903 904 905 906 907 908 909 910 911
   by adding nonascii_insert_offset to each.  */

Lisp_Object
string_make_multibyte (string)
     Lisp_Object string;
{
  unsigned char *buf;
  int nbytes;

  if (STRING_MULTIBYTE (string))
    return string;

  nbytes = count_size_as_multibyte (XSTRING (string)->data,
				    XSTRING (string)->size);
912 913
  /* If all the chars are ASCII, they won't need any more bytes
     once converted.  In that case, we can return STRING itself.  */
914
  if (nbytes == STRING_BYTES (XSTRING (string)))
915 916
    return string;

917
  buf = (unsigned char *) alloca (nbytes);
918
  copy_text (XSTRING (string)->data, buf, STRING_BYTES (XSTRING (string)),
919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936
	     0, 1);

  return make_multibyte_string (buf, XSTRING (string)->size, nbytes);
}

/* Convert STRING to a single-byte string.  */

Lisp_Object
string_make_unibyte (string)
     Lisp_Object string;
{
  unsigned char *buf;

  if (! STRING_MULTIBYTE (string))
    return string;

  buf = (unsigned char *) alloca (XSTRING (string)->size);

937
  copy_text (XSTRING (string)->data, buf, STRING_BYTES (XSTRING (string)),
938 939 940 941
	     1, 0);

  return make_unibyte_string (buf, XSTRING (string)->size);
}
942 943 944

DEFUN ("string-make-multibyte", Fstring_make_multibyte, Sstring_make_multibyte,
       1, 1, 0,
945 946 947
  "Return the multibyte equivalent of STRING.\n\
The function `unibyte-char-to-multibyte' is used to convert\n\
each unibyte character to a multibyte character.")
948 949 950 951 952 953 954 955
  (string)
     Lisp_Object string;
{
  return string_make_multibyte (string);
}

DEFUN ("string-make-unibyte", Fstring_make_unibyte, Sstring_make_unibyte,
       1, 1, 0,
956 957 958
  "Return the unibyte equivalent of STRING.\n\
Multibyte character codes are converted to unibyte\n\
by using just the low 8 bits.")
959 960 961 962 963
  (string)
     Lisp_Object string;
{
  return string_make_unibyte (string);
}
964 965 966 967 968 969 970 971 972 973 974

DEFUN ("string-as-unibyte", Fstring_as_unibyte, Sstring_as_unibyte,
       1, 1, 0,
  "Return a unibyte string with the same individual bytes as STRING.\n\
If STRING is unibyte, the result is STRING itself.")
  (string)
     Lisp_Object string;
{
  if (STRING_MULTIBYTE (string))
    {
      string = Fcopy_sequence (string);
975
      XSTRING (string)->size = STRING_BYTES (XSTRING (string));
976
      SET_STRING_BYTES (XSTRING (string), -1);
977 978 979 980 981 982 983 984 985 986 987 988 989
    }
  return string;
}

DEFUN ("string-as-multibyte", Fstring_as_multibyte, Sstring_as_multibyte,
       1, 1, 0,
  "Return a multibyte string with the same individual bytes as STRING.\n\
If STRING is multibyte, the result is STRING itself.")
  (string)
     Lisp_Object string;
{
  if (! STRING_MULTIBYTE (string))
    {
990 991 992 993 994 995
      int nbytes = STRING_BYTES (XSTRING (string));
      int newlen = multibyte_chars_in_text (XSTRING (string)->data, nbytes);

      string = Fcopy_sequence (string);
      XSTRING (string)->size = newlen;
      XSTRING (string)->size_byte = nbytes;
996 997 998
    }
  return string;
}
999

Jim Blandy's avatar
Jim Blandy committed
1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012
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
1013
  if (NILP (alist))
Jim Blandy's avatar
Jim Blandy committed
1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029
    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\
1030 1031 1032
If FROM or TO is negative, it counts from the end.\n\
\n\
This function allows vectors as well as strings.")
Jim Blandy's avatar
Jim Blandy committed
1033 1034 1035 1036
  (string, from, to)
     Lisp_Object string;
     register Lisp_Object from, to;
{
1037
  Lisp_Object res;
1038
  int size;
1039 1040 1041
  int size_byte;
  int from_char, to_char;
  int from_byte, to_byte;
1042 1043 1044

  if (! (STRINGP (string) || VECTORP (string)))
    wrong_type_argument (Qarrayp, string);
1045

Jim Blandy's avatar
Jim Blandy committed
1046
  CHECK_NUMBER (from, 1);
1047 1048

  if (STRINGP (string))
1049 1050
    {
      size = XSTRING (string)->size;
1051
      size_byte = STRING_BYTES (XSTRING (string));
1052
    }
1053 1054 1055
  else
    size = XVECTOR (string)->size;

Jim Blandy's avatar
Jim Blandy committed
1056
  if (NILP (to))
1057 1058 1059 1060
    {
      to_char = size;
      to_byte = size_byte;
    }
Jim Blandy's avatar
Jim Blandy committed
1061
  else
1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077
    {
      CHECK_NUMBER (to, 2);

      to_char = XINT (to);
      if (to_char < 0)
	to_char += size;

      if (STRINGP (string))
	to_byte = string_char_to_byte (string, to_char);
    }

  from_char = XINT (from);
  if (from_char < 0)
    from_char += size;
  if (STRINGP (string))
    from_byte = string_char_to_byte (string, from_char);
Jim Blandy's avatar
Jim Blandy committed
1078

1079 1080 1081
  if (!(0 <= from_char && from_char <= to_char && to_char <= size))
    args_out_of_range_3 (string, make_number (from_char),
			 make_number (to_char));
Jim Blandy's avatar
Jim Blandy committed
1082

1083 1084
  if (STRINGP (string))
    {
1085 1086 1087
      res = make_specified_string (XSTRING (string)->data + from_byte,
				   to_char - from_char, to_byte - from_byte,
				   STRING_MULTIBYTE (string));
1088 1089
      copy_text_properties (make_number (from_char), make_number (to_char),
			    string, make_number (0), res, Qnil);
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
    }
  else
    res = Fvector (to_char - from_char,
		   XVECTOR (string)->contents + from_char);

  return res;
}

/* Extract a substring of STRING, giving start and end positions
   both in characters and in bytes.  */

Lisp_Object
substring_both (string, from, from_byte, to, to_byte)
     Lisp_Object string;
     int from, from_byte, to, to_byte;
{
  Lisp_Object res;
  int size;
  int size_byte;

  if (! (STRINGP (string) || VECTORP (string)))
    wrong_type_argument (Qarrayp, string);

  if (STRINGP (string))
    {
      size = XSTRING (string)->size;
1116
      size_byte = STRING_BYTES (XSTRING (string));
1117 1118 1119 1120 1121 1122 1123 1124 1125
    }
  else
    size = XVECTOR (string)->size;

  if (!(0 <= from && from <= to && to <= size))
    args_out_of_range_3 (string, make_number (from), make_number (to));

  if (STRINGP (string))
    {
1126 1127 1128
      res = make_specified_string (XSTRING (string)->data + from_byte,
				   to - from, to_byte - from_byte,
				   STRING_MULTIBYTE (string));
1129 1130
      copy_text_properties (make_number (from), make_number (to),
			    string, make_number (0), res, Qnil);
1131 1132
    }
  else
1133 1134
    res = Fvector (to - from,
		   XVECTOR (string)->contents + from);
Karl Heuer's avatar
Karl Heuer committed
1135

1136
  return res;
Jim Blandy's avatar
Jim Blandy committed
1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147
}

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
1148
  for (i = 0; i < num && !NILP (list); i++)
Jim Blandy's avatar
Jim Blandy committed
1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166
    {
      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.")
1167 1168
  (sequence, n)
     register Lisp_Object sequence, n;
Jim Blandy's avatar
Jim Blandy committed
1169 1170 1171 1172
{
  CHECK_NUMBER (n, 0);
  while (1)
    {
1173 1174 1175 1176 1177
      if (CONSP (sequence) || NILP (sequence))
	return Fcar (Fnthcdr (n, sequence));
      else if (STRINGP (sequence) || VECTORP (sequence)
	       || BOOL_VECTOR_P (sequence) || CHAR_TABLE_P (sequence))
	return Faref (sequence, n);
Jim Blandy's avatar
Jim Blandy committed
1178
      else
1179
	sequence = wrong_type_argument (Qsequencep, sequence);
Jim Blandy's avatar
Jim Blandy committed
1180 1181 1182 1183
    }
}

DEFUN ("member", Fmember, Smember, 2, 2, 0,
Richard M. Stallman's avatar
Richard M. Stallman committed
1184
  "Return non-nil if ELT is an element of LIST.  Comparison done with `equal'.\n\
Jim Blandy's avatar
Jim Blandy committed
1185 1186 1187 1188 1189 1190
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;
1191
  for (tail = list; !NILP (tail); tail = XCONS (tail)->cdr)
Jim Blandy's avatar
Jim Blandy committed
1192 1193 1194
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
Jim Blandy's avatar
Jim Blandy committed
1195
      if (! NILP (Fequal (elt, tem)))
Jim Blandy's avatar
Jim Blandy committed
1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209
	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;
1210
  for (tail = list; !NILP (tail); tail = XCONS (tail)->cdr)
Jim Blandy's avatar
Jim Blandy committed
1211 1212 1213 1214 1215 1216 1217 1218 1219 1220
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (elt, tem)) return tail;
      QUIT;
    }
  return Qnil;
}

DEFUN ("assq", Fassq, Sassq, 2, 2, 0,
1221 1222
  "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
1223 1224 1225 1226 1227 1228
Elements of LIST that are not conses are ignored.")
  (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
1229
  for (tail = list; !NILP (tail); tail = XCONS (tail)->cdr)
Jim Blandy's avatar
Jim Blandy committed
1230 1231 1232 1233
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
1234
      tem = XCONS (elt)->car;
Jim Blandy's avatar
Jim Blandy committed
1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249
      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;
1250
  for (tail = list; CONSP (tail); tail = XCONS (tail)->cdr)
Jim Blandy's avatar
Jim Blandy committed
1251 1252 1253 1254
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
1255
      tem = XCONS (elt)->car;
Jim Blandy's avatar
Jim Blandy committed
1256 1257 1258 1259 1260 1261
      if (EQ (key, tem)) return elt;
    }
  return Qnil;
}

DEFUN ("assoc", Fassoc, Sassoc, 2, 2, 0,