fns.c 52.2 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, 86, 87, 93, 94, 95 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 24 25 26 27 28 29 30

/* 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"
31
#include "charset.h"
Jim Blandy's avatar
Jim Blandy committed
32 33

#include "buffer.h"
Jim Blandy's avatar
Jim Blandy committed
34
#include "keyboard.h"
35
#include "intervals.h"
36 37
#include "frame.h"
#include "window.h"
Jim Blandy's avatar
Jim Blandy committed
38

Karl Heuer's avatar
Karl Heuer committed
39 40 41 42
#ifndef NULL
#define NULL (void *)0
#endif

43 44
extern Lisp_Object Flookup_key ();

45 46 47
extern int minibuffer_auto_raise;
extern Lisp_Object minibuf_window;

48
Lisp_Object Qstring_lessp, Qprovide, Qrequire;
49
Lisp_Object Qyes_or_no_p_history;
50
Lisp_Object Qcursor_in_echo_area;
Jim Blandy's avatar
Jim Blandy committed
51

52
static int internal_equal ();
53

Jim Blandy's avatar
Jim Blandy committed
54 55 56 57 58 59 60 61
DEFUN ("identity", Fidentity, Sidentity, 1, 1, 0,
  "Return the argument unchanged.")
  (arg)
     Lisp_Object arg;
{
  return arg;
}

62 63 64 65
extern long get_random ();
extern void seed_random ();
extern long time ();

Jim Blandy's avatar
Jim Blandy committed
66 67
DEFUN ("random", Frandom, Srandom, 0, 1, 0,
  "Return a pseudo-random number.\n\
68 69
All integers representable in Lisp are equally likely.\n\
  On most systems, this is 28 bits' worth.\n\
70
With positive integer argument N, return random number in interval [0,N).\n\
Jim Blandy's avatar
Jim Blandy committed
71
With argument t, set the random number seed from the current time and pid.")
72 73
  (n)
     Lisp_Object n;
Jim Blandy's avatar
Jim Blandy committed
74
{
75 76
  EMACS_INT val;
  Lisp_Object lispy_val;
77
  unsigned long denominator;
Jim Blandy's avatar
Jim Blandy committed
78

79
  if (EQ (n, Qt))
80
    seed_random (getpid () + time (NULL));
81
  if (NATNUMP (n) && XFASTINT (n) != 0)
Jim Blandy's avatar
Jim Blandy committed
82
    {
83 84 85 86
      /* 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
87
	 it's possible to get a quotient larger than n; discarding
88
	 these values eliminates the bias that would otherwise appear
89 90
	 when using a large n.  */
      denominator = ((unsigned long)1 << VALBITS) / XFASTINT (n);
91
      do
92
	val = get_random () / denominator;
93
      while (val >= XFASTINT (n));
Jim Blandy's avatar
Jim Blandy committed
94
    }
95
  else
96
    val = get_random ();
97 98
  XSETINT (lispy_val, val);
  return lispy_val;
Jim Blandy's avatar
Jim Blandy committed
99 100 101 102 103 104 105
}

/* 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.")
106 107
  (sequence)
     register Lisp_Object sequence;
Jim Blandy's avatar
Jim Blandy committed
108 109 110 111 112
{
  register Lisp_Object tail, val;
  register int i;

 retry:
113 114 115 116 117
  if (STRINGP (sequence))
    XSETFASTINT (val, XSTRING (sequence)->size);
  else if (VECTORP (sequence))
    XSETFASTINT (val, XVECTOR (sequence)->size);
  else if (CHAR_TABLE_P (sequence))
118
    XSETFASTINT (val, CHAR_TABLE_ORDINARY_SLOTS);
119 120 121 122 123
  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
124
    {
125
      for (i = 0, tail = sequence; !NILP (tail); i++)
Jim Blandy's avatar
Jim Blandy committed
126 127 128 129 130
	{
	  QUIT;
	  tail = Fcdr (tail);
	}

131
      XSETFASTINT (val, i);
Jim Blandy's avatar
Jim Blandy committed
132
    }
133
  else if (NILP (sequence))
134
    XSETFASTINT (val, 0);
Jim Blandy's avatar
Jim Blandy committed
135 136
  else
    {
137
      sequence = wrong_type_argument (Qsequencep, sequence);
Jim Blandy's avatar
Jim Blandy committed
138 139
      goto retry;
    }
140
  return val;
Jim Blandy's avatar
Jim Blandy committed
141 142
}

143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161
/* 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.")
 (list)
     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)
162
	break;
163
      len++;
164
      if ((len & 1) == 0)
165 166 167 168 169 170 171
	halftail = XCONS (halftail)->cdr;
    }

  XSETINT (length, len);
  return length;
}

Jim Blandy's avatar
Jim Blandy committed
172 173
DEFUN ("string-equal", Fstring_equal, Sstring_equal, 2, 2, 0,
  "T if two strings have identical contents.\n\
174
Case is significant, but text properties are ignored.\n\
Jim Blandy's avatar
Jim Blandy committed
175 176 177 178
Symbols are also allowed; their print names are used instead.")
  (s1, s2)
     register Lisp_Object s1, s2;
{
179
  if (SYMBOLP (s1))
180
    XSETSTRING (s1, XSYMBOL (s1)->name);
181
  if (SYMBOLP (s2))
182
    XSETSTRING (s2, XSYMBOL (s2)->name);
Jim Blandy's avatar
Jim Blandy committed
183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202
  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;

203
  if (SYMBOLP (s1))
204
    XSETSTRING (s1, XSYMBOL (s1)->name);
205
  if (SYMBOLP (s2))
206
    XSETSTRING (s2, XSYMBOL (s2)->name);
Jim Blandy's avatar
Jim Blandy committed
207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240
  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
241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256
/* 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
257 258 259 260
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
261
The last argument is not copied, just used as the tail of the new list.")
Jim Blandy's avatar
Jim Blandy committed
262 263 264 265 266 267 268 269 270 271
  (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\
272 273 274 275 276 277
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
278 279 280 281 282 283 284 285 286 287 288 289 290 291 292
  (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;
{
293
  return concat (nargs, args, Lisp_Vectorlike, 0);
Jim Blandy's avatar
Jim Blandy committed
294 295
}

296 297 298 299
/* 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)
300
     Lisp_Object arg;
301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317
{
  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
318 319 320 321 322 323 324
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
325
  if (NILP (arg)) return arg;
326 327 328

  if (CHAR_TABLE_P (arg))
    {
329
      int i;
330 331
      Lisp_Object copy;

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 336
	     ((XCHAR_TABLE (arg)->size & PSEUDOVECTOR_SIZE_MASK)
	      * sizeof (Lisp_Object)));
337

338 339 340 341 342
      /* 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]))
343
	  XCHAR_TABLE (copy)->contents[i]
344
	    = copy_sub_char_table (XCHAR_TABLE (copy)->contents[i]);
345 346 347 348 349 350 351 352

      return copy;
    }

  if (BOOL_VECTOR_P (arg))
    {
      Lisp_Object val;
      int size_in_chars
353
	= (XBOOL_VECTOR (arg)->size + BITS_PER_CHAR - 1) / BITS_PER_CHAR;
354 355 356 357 358 359 360

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

361
  if (!CONSP (arg) && !VECTORP (arg) && !STRINGP (arg))
Jim Blandy's avatar
Jim Blandy committed
362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394
    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];
395
      if (!(CONSP (this) || NILP (this) || VECTORP (this) || STRINGP (this)
396
	    || COMPILEDP (this) || BOOL_VECTOR_P (this)))
Jim Blandy's avatar
Jim Blandy committed
397
	{
398
	  if (INTEGERP (this))
399
            args[argnum] = Fnumber_to_string (this);
Jim Blandy's avatar
Jim Blandy committed
400 401 402 403 404 405 406 407 408 409 410 411
	  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);
    }

412
  XSETFASTINT (len, leni);
Jim Blandy's avatar
Jim Blandy committed
413 414 415

  if (target_type == Lisp_Cons)
    val = Fmake_list (len, Qnil);
416
  else if (target_type == Lisp_Vectorlike)
Jim Blandy's avatar
Jim Blandy committed
417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435
    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;
436
      register unsigned int thisindex = 0;
Jim Blandy's avatar
Jim Blandy committed
437 438 439 440 441

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

442
      if (STRINGP (this) && STRINGP (val)
443 444 445 446 447 448
	  && ! 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
449 450 451 452
      while (1)
	{
	  register Lisp_Object elt;

453 454
	  /* Fetch next element of `this' arg into `elt', or break if
             `this' is exhausted. */
Jim Blandy's avatar
Jim Blandy committed
455
	  if (NILP (this)) break;
Jim Blandy's avatar
Jim Blandy committed
456 457 458 459 460
	  if (CONSP (this))
	    elt = Fcar (this), this = Fcdr (this);
	  else
	    {
	      if (thisindex >= thisleni) break;
461
	      if (STRINGP (this))
462
		XSETFASTINT (elt, XSTRING (this)->data[thisindex++]);
463 464 465
	      else if (BOOL_VECTOR_P (this))
		{
		  int size_in_chars
466
		    = ((XBOOL_VECTOR (this)->size + BITS_PER_CHAR - 1)
467
		       / BITS_PER_CHAR);
468
		  int byte;
469
		  byte = XBOOL_VECTOR (val)->data[thisindex / BITS_PER_CHAR];
470
		  if (byte & (1 << (thisindex % BITS_PER_CHAR)))
471 472 473 474
		    elt = Qt;
		  else
		    elt = Qnil;
		}
Jim Blandy's avatar
Jim Blandy committed
475 476 477 478 479 480 481 482 483 484 485
	      else
		elt = XVECTOR (this)->contents[thisindex++];
	    }

	  /* Store into result */
	  if (toindex < 0)
	    {
	      XCONS (tail)->car = elt;
	      prev = tail;
	      tail = XCONS (tail)->cdr;
	    }
486
	  else if (VECTORP (val))
Jim Blandy's avatar
Jim Blandy committed
487 488 489
	    XVECTOR (val)->contents[toindex++] = elt;
	  else
	    {
490
	      while (!INTEGERP (elt))
Jim Blandy's avatar
Jim Blandy committed
491 492 493 494 495 496 497 498 499 500 501 502 503 504
		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
505
  if (!NILP (prev))
Jim Blandy's avatar
Jim Blandy committed
506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523
    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
524
  if (NILP (alist))
Jim Blandy's avatar
Jim Blandy committed
525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540
    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\
541 542 543
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
544 545 546 547
  (string, from, to)
     Lisp_Object string;
     register Lisp_Object from, to;
{
548
  Lisp_Object res;
549 550 551 552
  int size;

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

Jim Blandy's avatar
Jim Blandy committed
554
  CHECK_NUMBER (from, 1);
555 556 557 558 559 560

  if (STRINGP (string))
    size = XSTRING (string)->size;
  else
    size = XVECTOR (string)->size;

Jim Blandy's avatar
Jim Blandy committed
561
  if (NILP (to))
562
    to = size;
Jim Blandy's avatar
Jim Blandy committed
563 564 565 566
  else
    CHECK_NUMBER (to, 2);

  if (XINT (from) < 0)
567
    XSETINT (from, XINT (from) + size);
Jim Blandy's avatar
Jim Blandy committed
568
  if (XINT (to) < 0)
569
    XSETINT (to, XINT (to) + size);
Jim Blandy's avatar
Jim Blandy committed
570
  if (!(0 <= XINT (from) && XINT (from) <= XINT (to)
571
        && XINT (to) <= size))
Jim Blandy's avatar
Jim Blandy committed
572 573
    args_out_of_range_3 (string, from, to);

574 575 576 577 578 579 580 581 582 583
  if (STRINGP (string))
    {
      res = make_string (XSTRING (string)->data + XINT (from),
			 XINT (to) - XINT (from));
      copy_text_properties (from, to, string, make_number (0), res, Qnil);
    }
  else
    res = Fvector (XINT (to) - XINT (from),
		   XVECTOR (string)->contents + XINT (from));
		   
584
  return res;
Jim Blandy's avatar
Jim Blandy committed
585 586 587 588 589 590 591 592 593 594 595
}

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
596
  for (i = 0; i < num && !NILP (list); i++)
Jim Blandy's avatar
Jim Blandy committed
597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614
    {
      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.")
615 616
  (sequence, n)
     register Lisp_Object sequence, n;
Jim Blandy's avatar
Jim Blandy committed
617 618 619 620
{
  CHECK_NUMBER (n, 0);
  while (1)
    {
621 622 623 624 625
      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
626
      else
627
	sequence = wrong_type_argument (Qsequencep, sequence);
Jim Blandy's avatar
Jim Blandy committed
628 629 630 631
    }
}

DEFUN ("member", Fmember, Smember, 2, 2, 0,
Richard M. Stallman's avatar
Richard M. Stallman committed
632
  "Return non-nil if ELT is an element of LIST.  Comparison done with `equal'.\n\
Jim Blandy's avatar
Jim Blandy committed
633 634 635 636 637 638
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
639
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
640 641 642
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
Jim Blandy's avatar
Jim Blandy committed
643
      if (! NILP (Fequal (elt, tem)))
Jim Blandy's avatar
Jim Blandy committed
644 645 646 647 648 649 650 651 652 653 654 655 656 657
	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
658
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
659 660 661 662 663 664 665 666 667 668
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (elt, tem)) return tail;
      QUIT;
    }
  return Qnil;
}

DEFUN ("assq", Fassq, Sassq, 2, 2, 0,
669 670
  "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
671 672 673 674 675 676
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
677
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709
    {
      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,
710
  "Return non-nil if KEY is `equal' to the car of an element of LIST.\n\
Richard M. Stallman's avatar
Richard M. Stallman committed
711
The value is actually the element of LIST whose car equals KEY.")
Jim Blandy's avatar
Jim Blandy committed
712 713 714 715 716
  (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
717
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
718 719 720 721 722
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fequal (Fcar (elt), key);
Jim Blandy's avatar
Jim Blandy committed
723
      if (!NILP (tem)) return elt;
Jim Blandy's avatar
Jim Blandy committed
724 725 726 727 728 729 730 731 732 733 734 735 736
      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
737
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
738 739 740 741 742 743 744 745 746 747
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fcdr (elt);
      if (EQ (key, tem)) return elt;
      QUIT;
    }
  return Qnil;
}
Richard M. Stallman's avatar
Richard M. Stallman committed
748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767

DEFUN ("rassoc", Frassoc, Srassoc, 2, 2, 0,
  "Return non-nil if KEY is `equal' to the cdr of an element of LIST.\n\
The value is actually the element of LIST whose cdr equals KEY.")
  (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fequal (Fcdr (elt), key);
      if (!NILP (tem)) return elt;
      QUIT;
    }
  return Qnil;
}
Jim Blandy's avatar
Jim Blandy committed
768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783

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
784
  while (!NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
785 786 787 788
    {
      tem = Fcar (tail);
      if (EQ (elt, tem))
	{
Jim Blandy's avatar
Jim Blandy committed
789
	  if (NILP (prev))
Jim Blandy's avatar
Jim Blandy committed
790 791 792 793 794 795 796 797 798 799 800 801
	    list = Fcdr (tail);
	  else
	    Fsetcdr (prev, Fcdr (tail));
	}
      else
	prev = tail;
      tail = Fcdr (tail);
      QUIT;
    }
  return list;
}

Jim Blandy's avatar
Jim Blandy committed
802
DEFUN ("delete", Fdelete, Sdelete, 2, 2, 0,
Roland McGrath's avatar
Roland McGrath committed
803 804
  "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
805 806 807
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
808 809 810 811 812 813 814 815 816 817
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
818
  while (!NILP (tail))
Roland McGrath's avatar
Roland McGrath committed
819 820
    {
      tem = Fcar (tail);
Jim Blandy's avatar
Jim Blandy committed
821
      if (! NILP (Fequal (elt, tem)))
Roland McGrath's avatar
Roland McGrath committed
822
	{
Jim Blandy's avatar
Jim Blandy committed
823
	  if (NILP (prev))
Roland McGrath's avatar
Roland McGrath committed
824 825 826 827 828 829 830 831 832 833 834 835
	    list = Fcdr (tail);
	  else
	    Fsetcdr (prev, Fcdr (tail));
	}
      else
	prev = tail;
      tail = Fcdr (tail);
      QUIT;
    }
  return list;
}

Jim Blandy's avatar
Jim Blandy committed
836 837 838 839 840 841 842 843
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
844
  if (NILP (list)) return list;
Jim Blandy's avatar
Jim Blandy committed
845 846
  prev = Qnil;
  tail = list;
Jim Blandy's avatar
Jim Blandy committed
847
  while (!NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
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 873 874 875 876 877 878 879 880 881 882 883
    {
      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.")
884 885
  (list, predicate)
     Lisp_Object list, predicate;
Jim Blandy's avatar
Jim Blandy committed
886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903
{
  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);
904 905
  front = Fsort (front, predicate);
  back = Fsort (back, predicate);
Jim Blandy's avatar
Jim Blandy committed
906
  UNGCPRO;
907
  return merge (front, back, predicate);
Jim Blandy's avatar
Jim Blandy committed
908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932
}

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
933
      if (NILP (l1))
Jim Blandy's avatar
Jim Blandy committed
934 935
	{
	  UNGCPRO;
Jim Blandy's avatar
Jim Blandy committed
936
	  if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
937 938 939 940
	    return l2;
	  Fsetcdr (tail, l2);
	  return value;
	}
Jim Blandy's avatar
Jim Blandy committed
941
      if (NILP (l2))
Jim Blandy's avatar
Jim Blandy committed
942 943
	{
	  UNGCPRO;
Jim Blandy's avatar
Jim Blandy committed
944
	  if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
945 946 947 948 949
	    return l1;
	  Fsetcdr (tail, l1);
	  return value;
	}
      tem = call2 (pred, Fcar (l2), Fcar (l1));
Jim Blandy's avatar
Jim Blandy committed
950
      if (NILP (tem))
Jim Blandy's avatar
Jim Blandy committed
951 952 953 954 955 956 957 958 959 960 961
	{
	  tem = l1;
	  l1 = Fcdr (l1);
	  org_l1 = l1;
	}
      else
	{
	  tem = l2;
	  l2 = Fcdr (l2);
	  org_l2 = l2;
	}
Jim Blandy's avatar
Jim Blandy committed
962
      if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
963 964 965 966 967 968 969
	value = tem;
      else
	Fsetcdr (tail, tem);
      tail = tem;
    }
}

970 971

DEFUN ("plist-get", Fplist_get, Splist_get, 2, 2, 0,
972
  "Extract a value from a property list.\n\
973
PLIST is a property list, which is a list of the form\n\
974
\(PROP1 VALUE1 PROP2 VALUE2...).  This function returns the value\n\
975 976
corresponding to the given PROP, or nil if PROP is not\n\
one of the properties on the list.")
977 978
  (plist, prop)
     Lisp_Object plist;
Jim Blandy's avatar
Jim Blandy committed
979 980 981
     register Lisp_Object prop;
{
  register Lisp_Object tail;
982
  for (tail = plist; !NILP (tail); tail = Fcdr (Fcdr (tail)))
Jim Blandy's avatar
Jim Blandy committed
983 984 985 986 987 988 989 990 991
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (prop, tem))
	return Fcar (Fcdr (tail));
    }
  return Qnil;
}

992 993
DEFUN ("get", Fget, Sget, 2, 2, 0,
  "Return the value of SYMBOL's PROPNAME property.\n\
994 995 996
This is the last value stored with `(put SYMBOL PROPNAME VALUE)'.")
  (symbol, propname)
     Lisp_Object symbol, propname;
997
{
998 999
  CHECK_SYMBOL (symbol, 0);
  return Fplist_get (XSYMBOL (symbol)->plist, propname);
1000 1001 1002 1003 1004
}

DEFUN ("plist-put", Fplist_put, Splist_put, 3, 3, 0,
  "Change value in PLIST of PROP to VAL.\n\
PLIST is a property list, which is a list of the form\n\
1005
\(PROP1 VALUE1 PROP2 VALUE2 ...).  PROP is a symbol and VAL is any object.\n\
1006
If PROP is already a property on the list, its value is set to VAL,\n\
Karl Heuer's avatar
Karl Heuer committed
1007
otherwise the new PROP VAL pair is added.  The new plist is returned;\n\
1008 1009 1010 1011 1012 1013
use `(setq x (plist-put x prop val))' to be sure to use the new value.\n\
The PLIST is modified by side effects.")
  (plist, prop, val)
    Lisp_Object plist;
    register Lisp_Object prop;
    Lisp_Object val;
Jim Blandy's avatar
Jim Blandy committed
1014 1015 1016 1017
{
  register Lisp_Object tail, prev;
  Lisp_Object newcell;
  prev = Qnil;
1018 1019
  for (tail = plist; CONSP (tail) && CONSP (XCONS (tail)->cdr);
       tail = XCONS (XCONS (tail)->cdr)->cdr)
Jim Blandy's avatar
Jim Blandy committed
1020
    {
1021
      if (EQ (prop, XCONS (tail)->car))
1022
	{
1023
	  Fsetcar (XCONS (tail)->cdr, val);
1024 1025
	  return plist;
	}
Jim Blandy's avatar
Jim Blandy committed
1026 1027 1028
      prev = tail;
    }
  newcell = Fcons (prop, Fcons (val, Qnil));
Jim Blandy's avatar
Jim Blandy committed
1029
  if (NILP (prev))
1030
    return newcell;
Jim Blandy's avatar
Jim Blandy committed
1031
  else
1032
    Fsetcdr (XCONS (prev)->cdr, newcell);
1033 1034 1035 1036 1037 1038
  return plist;
}

DEFUN ("put", Fput, Sput, 3, 3, 0,
  "Store SYMBOL's PROPNAME property with value VALUE.\n\
It can be retrieved with `(get SYMBOL PROPNAME)'.")
1039 1040
  (symbol, propname, value)
     Lisp_Object symbol, propname, value;
1041
{
1042 1043 1044 1045
  CHECK_SYMBOL (symbol, 0);
  XSYMBOL (symbol)->plist
    = Fplist_put (XSYMBOL (symbol)->plist, propname, value);
  return value;
Jim Blandy's avatar
Jim Blandy committed
1046 1047 1048 1049 1050 1051 1052
}

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\
1053 1054 1055
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
1056 1057 1058
  (o1, o2)
     register Lisp_Object o1, o2;
{
1059
  return internal_equal (o1, o2, 0) ? Qt : Qnil;
1060 1061
}

1062
static int
1063 1064 1065 1066 1067 1068
internal_equal (o1, o2, depth)
     register Lisp_Object o1, o2;
     int depth;
{
  if (depth > 200)
    error ("Stack overflow in equal");
1069

1070
 tail_recurse:
Jim Blandy's avatar
Jim Blandy committed
1071
  QUIT;
1072 1073 1074 1075 1076 1077 1078
  if (EQ (o1, o2))
    return 1;
  if (XTYPE (o1) != XTYPE (o2))
    return 0;

  switch (XTYPE (o1))
    {
1079
#ifdef LISP_FLOAT_TYPE
1080 1081
    case Lisp_Float:
      return (extract_float (o1) == extract_float (o2));
1082
#endif
1083 1084

    case Lisp_Cons:
1085 1086 1087 1088 1089
      if (!internal_equal (XCONS (o1)->car, XCONS (o2)->car, depth + 1))
	return 0;
      o1 = XCONS (o1)->cdr;
      o2 = XCONS (o2)->cdr;
      goto tail_recurse;
1090 1091

    case Lisp_Misc:
1092
      if (XMISCTYPE (o1) != XMISCTYPE (o2))
1093
	return 0;
1094
      if (OVERLAYP (o1))
Jim Blandy's avatar
Jim Blandy committed
1095
	{
1096 1097 1098 1099
	  if (!internal_equal (OVERLAY_START (o1), OVERLAY_START (o1),
			       depth + 1)
	      || !internal_equal (OVERLAY_END (o1), OVERLAY_END (o1),
				  depth + 1))
1100
	    return 0;
1101 1102 1103
	  o1 = XOVERLAY (o1)->plist;
	  o2 = XOVERLAY (o2)->plist;
	  goto tail_recurse;
Jim Blandy's avatar
Jim Blandy committed
1104
	}
1105 1106 1107 1108 1109 1110 1111 1112 1113
      if (MARKERP (o1))
	{
	  return (XMARKER (o1)->buffer == XMARKER (o2)->buffer
		  && (XMARKER (o1)->buffer == 0
		      || XMARKER (o1)->bufpos == XMARKER (o2)->bufpos));
	}
      break;

    case Lisp_Vectorlike:
1114 1115 1116 1117 1118 1119 1120 1121
      {
	register int i, size;
	size = XVECTOR (o1)->size;
	/* Pseudovectors have the type encoded in the size field, so this test
	   actually checks that the objects have the same type as well as the
	   same size.  */
	if (XVECTOR (o2)->size != size)
	  return 0;
1122 1123 1124 1125
	/* Boolvectors are compared much like strings.  */
	if (BOOL_VECTOR_P (o1))
	  {
	    int size_in_chars
1126
	      = (XBOOL_VECTOR (o1)->size + BITS_PER_CHAR - 1) / BITS_PER_CHAR;
1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137

	    if (XBOOL_VECTOR (o1)->size != XBOOL_VECTOR (o2)->size)
	      return 0;
	    if (bcmp (XBOOL_VECTOR (o1)->data, XBOOL_VECTOR (o2)->data,
		      size_in_chars))
	      return 0;
	    return 1;
	  }

	/* Aside from them, only true vectors, char-tables, and compiled
	   functions are sensible to compare, so eliminate the others now.  */
1138 1139
	if (size & PSEUDOVECTOR_FLAG)
	  {
1140
	    if (!(size & (PVEC_COMPILED | PVEC_CHAR_TABLE)))
1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153
	      return 0;
	    size &= PSEUDOVECTOR_SIZE_MASK;
	  }
	for (i = 0; i < size; i++)
	  {
	    Lisp_Object v1, v2;
	    v1 = XVECTOR (o1)->contents [i];
	    v2 = XVECTOR (o2)->contents [i];
	    if (!internal_equal (v1, v2, depth + 1))
	      return 0;
	  }
	return 1;
      }
1154 1155 1156
      break;

    case Lisp_String:
1157 1158 1159 1160 1161 1162
      if (XSTRING (o1)->size != XSTRING (o2)->size)
	return 0;
      if (bcmp (XSTRING (o1)->data, XSTRING (o2)->data,
		XSTRING (o1)->size))
	return 0;
      return 1;
Jim Blandy's avatar
Jim Blandy committed