alloc.c 65.9 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* Storage allocation and gc for GNU Emacs Lisp interpreter.
2
   Copyright (C) 1985, 86, 88, 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 18 19
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.  */

20
#include <signal.h>
Jim Blandy's avatar
Jim Blandy committed
21

22
#include <config.h>
Jim Blandy's avatar
Jim Blandy committed
23
#include "lisp.h"
24
#include "intervals.h"
Jim Blandy's avatar
Jim Blandy committed
25
#include "puresize.h"
Jim Blandy's avatar
Jim Blandy committed
26 27 28
#ifndef standalone
#include "buffer.h"
#include "window.h"
Jim Blandy's avatar
Jim Blandy committed
29
#include "frame.h"
30
#include "blockinput.h"
Richard M. Stallman's avatar
Richard M. Stallman committed
31
#include "keyboard.h"
Jim Blandy's avatar
Jim Blandy committed
32 33
#endif

Jim Blandy's avatar
Jim Blandy committed
34 35
#include "syssignal.h"

Karl Heuer's avatar
Karl Heuer committed
36 37
extern char *sbrk ();

38 39 40 41 42 43 44 45 46 47 48
/* The following come from gmalloc.c.  */

#if defined (__STDC__) && __STDC__
#include <stddef.h>
#define	__malloc_size_t		size_t
#else
#define	__malloc_size_t		unsigned int
#endif
extern __malloc_size_t _bytes_used;
extern int __malloc_extra_blocks;

Jim Blandy's avatar
Jim Blandy committed
49
#define max(A,B) ((A) > (B) ? (A) : (B))
50
#define min(A,B) ((A) < (B) ? (A) : (B))
Jim Blandy's avatar
Jim Blandy committed
51 52 53 54 55 56 57 58 59

/* Macro to verify that storage intended for Lisp objects is not
   out of range to fit in the space for a pointer.
   ADDRESS is the start of the block, and SIZE
   is the amount of space within which objects can start.  */
#define VALIDATE_LISP_STORAGE(address, size)			\
do								\
  {								\
    Lisp_Object val;						\
60
    XSETCONS (val, (char *) address + size);		\
Jim Blandy's avatar
Jim Blandy committed
61 62
    if ((char *) XCONS (val) != (char *) address + size)	\
      {								\
63
	xfree (address);					\
Jim Blandy's avatar
Jim Blandy committed
64 65 66 67
	memory_full ();						\
      }								\
  } while (0)

68 69 70
/* Value of _bytes_used, when spare_memory was freed.  */
static __malloc_size_t bytes_used_when_full;

Jim Blandy's avatar
Jim Blandy committed
71 72 73 74
/* Number of bytes of consing done since the last gc */
int consing_since_gc;

/* Number of bytes of consing since gc before another gc should be done. */
75
int gc_cons_threshold;
Jim Blandy's avatar
Jim Blandy committed
76 77 78 79 80 81 82 83 84 85 86 87 88 89

/* Nonzero during gc */
int gc_in_progress;

#ifndef VIRT_ADDR_VARIES
extern
#endif /* VIRT_ADDR_VARIES */
 int malloc_sbrk_used;

#ifndef VIRT_ADDR_VARIES
extern
#endif /* VIRT_ADDR_VARIES */
 int malloc_sbrk_unused;

Jim Blandy's avatar
Jim Blandy committed
90 91 92
/* Two limits controlling how much undo information to keep.  */
int undo_limit;
int undo_strong_limit;
Jim Blandy's avatar
Jim Blandy committed
93

94 95 96 97 98 99 100 101 102 103
/* Points to memory space allocated as "spare",
   to be freed if we run out of memory.  */
static char *spare_memory;

/* Amount of spare memory to keep in reserve.  */
#define SPARE_MEMORY (1 << 14)

/* Number of extra blocks malloc should get when it needs more core.  */
static int malloc_hysteresis;

Karl Heuer's avatar
Karl Heuer committed
104 105 106
/* Nonzero when malloc is called for allocating Lisp object space.  */
int allocating_for_lisp;

Jim Blandy's avatar
Jim Blandy committed
107 108 109 110
/* Non-nil means defun should do purecopy on the function definition */
Lisp_Object Vpurify_flag;

#ifndef HAVE_SHM
111
EMACS_INT pure[PURESIZE / sizeof (EMACS_INT)] = {0,};   /* Force it into data space! */
Jim Blandy's avatar
Jim Blandy committed
112 113 114 115
#define PUREBEG (char *) pure
#else
#define pure PURE_SEG_BITS   /* Use shared memory segment */
#define PUREBEG (char *)PURE_SEG_BITS
Jim Blandy's avatar
Jim Blandy committed
116 117 118 119 120 121 122

/* This variable is used only by the XPNTR macro when HAVE_SHM is
   defined.  If we used the PURESIZE macro directly there, that would
   make most of emacs dependent on puresize.h, which we don't want -
   you should be able to change that without too much recompilation.
   So map_in_data initializes pure_size, and the dependencies work
   out.  */
123
EMACS_INT pure_size;
Jim Blandy's avatar
Jim Blandy committed
124 125 126 127 128 129 130 131
#endif /* not HAVE_SHM */

/* Index in pure at which next pure object will be allocated. */
int pureptr;

/* If nonzero, this is a warning delivered by malloc and not yet displayed.  */
char *pending_malloc_warning;

132
/* Pre-computed signal argument for use when memory is exhausted.  */
133
Lisp_Object memory_signal_data;
134

Jim Blandy's avatar
Jim Blandy committed
135 136 137 138 139 140
/* Maximum amount of C stack to save when a GC happens.  */

#ifndef MAX_SAVE_STACK
#define MAX_SAVE_STACK 16000
#endif

141 142 143 144 145 146 147
/* Define DONT_COPY_FLAG to be some bit which will always be zero in a
   pointer to a Lisp_Object, when that pointer is viewed as an integer.
   (On most machines, pointers are even, so we can use the low bit.
   Word-addressible architectures may need to override this in the m-file.)
   When linking references to small strings through the size field, we
   use this slot to hold the bit that would otherwise be interpreted as
   the GC mark bit.  */
148
#ifndef DONT_COPY_FLAG
149
#define DONT_COPY_FLAG 1
150 151
#endif /* no DONT_COPY_FLAG  */

Jim Blandy's avatar
Jim Blandy committed
152 153 154 155 156 157 158
/* Buffer in which we save a copy of the C stack at each GC.  */

char *stack_copy;
int stack_copy_size;

/* Non-zero means ignore malloc warnings.  Set during initialization.  */
int ignore_warnings;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
159

160 161
Lisp_Object Qgc_cons_threshold;

162
static void mark_object (), mark_buffer (), mark_kboards ();
Joseph Arceneaux's avatar
Joseph Arceneaux committed
163 164
static void clear_marks (), gc_sweep ();
static void compact_strings ();
Jim Blandy's avatar
Jim Blandy committed
165

166 167
/* Versions of malloc and realloc that print warnings as memory gets full.  */

Jim Blandy's avatar
Jim Blandy committed
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
Lisp_Object
malloc_warning_1 (str)
     Lisp_Object str;
{
  Fprinc (str, Vstandard_output);
  write_string ("\nKilling some buffers may delay running out of memory.\n", -1);
  write_string ("However, certainly by the time you receive the 95% warning,\n", -1);
  write_string ("you should clean up, kill this Emacs, and start a new one.", -1);
  return Qnil;
}

/* malloc calls this if it finds we are near exhausting storage */
malloc_warning (str)
     char *str;
{
  pending_malloc_warning = str;
}

display_malloc_warning ()
{
  register Lisp_Object val;

  val = build_string (pending_malloc_warning);
  pending_malloc_warning = 0;
  internal_with_output_to_temp_buffer (" *Danger*", malloc_warning_1, val);
}

/* Called if malloc returns zero */
196

Jim Blandy's avatar
Jim Blandy committed
197 198
memory_full ()
{
199 200 201 202 203 204 205 206 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
#ifndef SYSTEM_MALLOC
  bytes_used_when_full = _bytes_used;
#endif

  /* The first time we get here, free the spare memory.  */
  if (spare_memory)
    {
      free (spare_memory);
      spare_memory = 0;
    }

  /* This used to call error, but if we've run out of memory, we could get
     infinite recursion trying to build the string.  */
  while (1)
    Fsignal (Qerror, memory_signal_data);
}

/* Called if we can't allocate relocatable space for a buffer.  */

void
buffer_memory_full ()
{
  /* If buffers use the relocating allocator,
     no need to free spare_memory, because we may have plenty of malloc
     space left that we could get, and if we don't, the malloc that fails
     will itself cause spare_memory to be freed.
     If buffers don't use the relocating allocator,
     treat this like any other failing malloc.  */

#ifndef REL_ALLOC
  memory_full ();
#endif

232 233 234 235
  /* This used to call error, but if we've run out of memory, we could get
     infinite recursion trying to build the string.  */
  while (1)
    Fsignal (Qerror, memory_signal_data);
Jim Blandy's avatar
Jim Blandy committed
236 237
}

238
/* like malloc routines but check for no memory and block interrupt input.  */
Jim Blandy's avatar
Jim Blandy committed
239 240 241 242 243 244 245

long *
xmalloc (size)
     int size;
{
  register long *val;

246
  BLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
247
  val = (long *) malloc (size);
248
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
249 250 251 252 253 254 255 256 257 258 259 260

  if (!val && size) memory_full ();
  return val;
}

long *
xrealloc (block, size)
     long *block;
     int size;
{
  register long *val;

261
  BLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
262 263 264 265
  /* We must call malloc explicitly when BLOCK is 0, since some
     reallocs don't do this.  */
  if (! block)
    val = (long *) malloc (size);
Noah Friedman's avatar
Noah Friedman committed
266
  else
Jim Blandy's avatar
Jim Blandy committed
267
    val = (long *) realloc (block, size);
268
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
269 270 271 272

  if (!val && size) memory_full ();
  return val;
}
273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294

void
xfree (block)
     long *block;
{
  BLOCK_INPUT;
  free (block);
  UNBLOCK_INPUT;
}


/* Arranging to disable input signals while we're in malloc.

   This only works with GNU malloc.  To help out systems which can't
   use GNU malloc, all the calls to malloc, realloc, and free
   elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
   pairs; unfortunately, we have no idea what C library functions
   might call malloc, so we can't really protect them unless you're
   using GNU malloc.  Fortunately, most of the major operating can use
   GNU malloc.  */

#ifndef SYSTEM_MALLOC
295 296 297 298 299 300
extern void * (*__malloc_hook) ();
static void * (*old_malloc_hook) ();
extern void * (*__realloc_hook) ();
static void * (*old_realloc_hook) ();
extern void (*__free_hook) ();
static void (*old_free_hook) ();
301

302 303
/* This function is used as the hook for free to call.  */

304 305 306 307 308 309 310
static void
emacs_blocked_free (ptr)
     void *ptr;
{
  BLOCK_INPUT;
  __free_hook = old_free_hook;
  free (ptr);
311 312 313 314 315 316 317 318 319 320 321 322
  /* If we released our reserve (due to running out of memory),
     and we have a fair amount free once again,
     try to set aside another reserve in case we run out once more.  */
  if (spare_memory == 0
      /* Verify there is enough space that even with the malloc
	 hysteresis this call won't run out again.
	 The code here is correct as long as SPARE_MEMORY
	 is substantially larger than the block size malloc uses.  */
      && (bytes_used_when_full
	  > _bytes_used + max (malloc_hysteresis, 4) * SPARE_MEMORY))
    spare_memory = (char *) malloc (SPARE_MEMORY);

323
  __free_hook = emacs_blocked_free;
324 325 326
  UNBLOCK_INPUT;
}

327 328 329 330 331 332 333 334 335 336 337 338 339 340 341
/* If we released our reserve (due to running out of memory),
   and we have a fair amount free once again,
   try to set aside another reserve in case we run out once more.

   This is called when a relocatable block is freed in ralloc.c.  */

void
refill_memory_reserve ()
{
  if (spare_memory == 0)
    spare_memory = (char *) malloc (SPARE_MEMORY);
}

/* This function is the malloc hook that Emacs uses.  */

342 343 344 345 346 347 348 349
static void *
emacs_blocked_malloc (size)
     unsigned size;
{
  void *value;

  BLOCK_INPUT;
  __malloc_hook = old_malloc_hook;
350
  __malloc_extra_blocks = malloc_hysteresis;
351
  value = (void *) malloc (size);
352
  __malloc_hook = emacs_blocked_malloc;
353 354 355 356 357 358 359 360 361 362 363 364 365 366
  UNBLOCK_INPUT;

  return value;
}

static void *
emacs_blocked_realloc (ptr, size)
     void *ptr;
     unsigned size;
{
  void *value;

  BLOCK_INPUT;
  __realloc_hook = old_realloc_hook;
367
  value = (void *) realloc (ptr, size);
368
  __realloc_hook = emacs_blocked_realloc;
369 370 371 372 373 374 375 376 377
  UNBLOCK_INPUT;

  return value;
}

void
uninterrupt_malloc ()
{
  old_free_hook = __free_hook;
378
  __free_hook = emacs_blocked_free;
379 380

  old_malloc_hook = __malloc_hook;
381
  __malloc_hook = emacs_blocked_malloc;
382 383

  old_realloc_hook = __realloc_hook;
384
  __realloc_hook = emacs_blocked_realloc;
385 386
}
#endif
Jim Blandy's avatar
Jim Blandy committed
387

388 389
/* Interval allocation.  */

390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407
#ifdef USE_TEXT_PROPERTIES
#define INTERVAL_BLOCK_SIZE \
  ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))

struct interval_block
  {
    struct interval_block *next;
    struct interval intervals[INTERVAL_BLOCK_SIZE];
  };

struct interval_block *interval_block;
static int interval_block_index;

INTERVAL interval_free_list;

static void
init_intervals ()
{
Karl Heuer's avatar
Karl Heuer committed
408
  allocating_for_lisp = 1;
409 410
  interval_block
    = (struct interval_block *) malloc (sizeof (struct interval_block));
Karl Heuer's avatar
Karl Heuer committed
411
  allocating_for_lisp = 0;
412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433
  interval_block->next = 0;
  bzero (interval_block->intervals, sizeof interval_block->intervals);
  interval_block_index = 0;
  interval_free_list = 0;
}

#define INIT_INTERVALS init_intervals ()

INTERVAL
make_interval ()
{
  INTERVAL val;

  if (interval_free_list)
    {
      val = interval_free_list;
      interval_free_list = interval_free_list->parent;
    }
  else
    {
      if (interval_block_index == INTERVAL_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
434 435 436 437
	  register struct interval_block *newi;

	  allocating_for_lisp = 1;
	  newi = (struct interval_block *) xmalloc (sizeof (struct interval_block));
438

Karl Heuer's avatar
Karl Heuer committed
439
	  allocating_for_lisp = 0;
440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456
	  VALIDATE_LISP_STORAGE (newi, sizeof *newi);
	  newi->next = interval_block;
	  interval_block = newi;
	  interval_block_index = 0;
	}
      val = &interval_block->intervals[interval_block_index++];
    }
  consing_since_gc += sizeof (struct interval);
  RESET_INTERVAL (val);
  return val;
}

static int total_free_intervals, total_intervals;

/* Mark the pointers of one interval. */

static void
457
mark_interval (i, dummy)
458
     register INTERVAL i;
459
     Lisp_Object dummy;
460 461 462 463 464 465 466 467 468 469 470
{
  if (XMARKBIT (i->plist))
    abort ();
  mark_object (&i->plist);
  XMARK (i->plist);
}

static void
mark_interval_tree (tree)
     register INTERVAL tree;
{
471 472 473 474 475 476 477
  /* No need to test if this tree has been marked already; this
     function is always called through the MARK_INTERVAL_TREE macro,
     which takes care of that.  */

  /* XMARK expands to an assignment; the LHS of an assignment can't be
     a cast.  */
  XMARK (* (Lisp_Object *) &tree->parent);
478

479
  traverse_intervals (tree, 1, 0, mark_interval, Qnil);
480 481
}

482 483 484 485 486 487
#define MARK_INTERVAL_TREE(i)				\
  do {							\
    if (!NULL_INTERVAL_P (i)				\
	&& ! XMARKBIT ((Lisp_Object) i->parent))	\
      mark_interval_tree (i);				\
  } while (0)
488

489
/* The oddity in the call to XUNMARK is necessary because XUNMARK
490
   expands to an assignment to its argument, and most C compilers don't
491 492 493 494 495 496 497 498
   support casts on the left operand of `='.  */
#define UNMARK_BALANCE_INTERVALS(i) 				\
{                                   				\
   if (! NULL_INTERVAL_P (i))       				\
     {                              				\
       XUNMARK (* (Lisp_Object *) (&(i)->parent));		\
       (i) = balance_intervals (i);				\
     } 								\
499 500 501 502 503 504 505 506 507 508 509
}

#else  /* no interval use */

#define INIT_INTERVALS

#define UNMARK_BALANCE_INTERVALS(i)
#define MARK_INTERVAL_TREE(i)

#endif /* no interval use */

510 511
/* Floating point allocation.  */

Jim Blandy's avatar
Jim Blandy committed
512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539
#ifdef LISP_FLOAT_TYPE
/* Allocation of float cells, just like conses */
/* We store float cells inside of float_blocks, allocating a new
   float_block with malloc whenever necessary.  Float cells reclaimed by
   GC are put on a free list to be reallocated before allocating
   any new float cells from the latest float_block.

   Each float_block is just under 1020 bytes long,
   since malloc really allocates in units of powers of two
   and uses 4 bytes for its own overhead. */

#define FLOAT_BLOCK_SIZE \
  ((1020 - sizeof (struct float_block *)) / sizeof (struct Lisp_Float))

struct float_block
  {
    struct float_block *next;
    struct Lisp_Float floats[FLOAT_BLOCK_SIZE];
  };

struct float_block *float_block;
int float_block_index;

struct Lisp_Float *float_free_list;

void
init_float ()
{
Karl Heuer's avatar
Karl Heuer committed
540
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
541
  float_block = (struct float_block *) malloc (sizeof (struct float_block));
Karl Heuer's avatar
Karl Heuer committed
542
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
543 544 545 546 547 548 549 550 551 552
  float_block->next = 0;
  bzero (float_block->floats, sizeof float_block->floats);
  float_block_index = 0;
  float_free_list = 0;
}

/* Explicitly free a float cell.  */
free_float (ptr)
     struct Lisp_Float *ptr;
{
553
  *(struct Lisp_Float **)&ptr->type = float_free_list;
Jim Blandy's avatar
Jim Blandy committed
554 555 556 557 558 559 560 561 562 563 564
  float_free_list = ptr;
}

Lisp_Object
make_float (float_value)
     double float_value;
{
  register Lisp_Object val;

  if (float_free_list)
    {
565
      XSETFLOAT (val, float_free_list);
566
      float_free_list = *(struct Lisp_Float **)&float_free_list->type;
Jim Blandy's avatar
Jim Blandy committed
567 568 569 570 571
    }
  else
    {
      if (float_block_index == FLOAT_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
572 573 574 575 576
	  register struct float_block *new;

	  allocating_for_lisp = 1;
	  new = (struct float_block *) xmalloc (sizeof (struct float_block));
	  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
577 578 579 580 581
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = float_block;
	  float_block = new;
	  float_block_index = 0;
	}
582
      XSETFLOAT (val, &float_block->floats[float_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
583 584
    }
  XFLOAT (val)->data = float_value;
585
  XSETFASTINT (XFLOAT (val)->type, 0);	/* bug chasing -wsr */
Jim Blandy's avatar
Jim Blandy committed
586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618
  consing_since_gc += sizeof (struct Lisp_Float);
  return val;
}

#endif /* LISP_FLOAT_TYPE */

/* Allocation of cons cells */
/* We store cons cells inside of cons_blocks, allocating a new
   cons_block with malloc whenever necessary.  Cons cells reclaimed by
   GC are put on a free list to be reallocated before allocating
   any new cons cells from the latest cons_block.

   Each cons_block is just under 1020 bytes long,
   since malloc really allocates in units of powers of two
   and uses 4 bytes for its own overhead. */

#define CONS_BLOCK_SIZE \
  ((1020 - sizeof (struct cons_block *)) / sizeof (struct Lisp_Cons))

struct cons_block
  {
    struct cons_block *next;
    struct Lisp_Cons conses[CONS_BLOCK_SIZE];
  };

struct cons_block *cons_block;
int cons_block_index;

struct Lisp_Cons *cons_free_list;

void
init_cons ()
{
Karl Heuer's avatar
Karl Heuer committed
619
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
620
  cons_block = (struct cons_block *) malloc (sizeof (struct cons_block));
Karl Heuer's avatar
Karl Heuer committed
621
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
622 623 624 625 626 627 628 629 630 631
  cons_block->next = 0;
  bzero (cons_block->conses, sizeof cons_block->conses);
  cons_block_index = 0;
  cons_free_list = 0;
}

/* Explicitly free a cons cell.  */
free_cons (ptr)
     struct Lisp_Cons *ptr;
{
632
  *(struct Lisp_Cons **)&ptr->car = cons_free_list;
Jim Blandy's avatar
Jim Blandy committed
633 634 635 636 637 638 639 640 641 642 643 644
  cons_free_list = ptr;
}

DEFUN ("cons", Fcons, Scons, 2, 2, 0,
  "Create a new cons, give it CAR and CDR as components, and return it.")
  (car, cdr)
     Lisp_Object car, cdr;
{
  register Lisp_Object val;

  if (cons_free_list)
    {
645
      XSETCONS (val, cons_free_list);
646
      cons_free_list = *(struct Lisp_Cons **)&cons_free_list->car;
Jim Blandy's avatar
Jim Blandy committed
647 648 649 650 651
    }
  else
    {
      if (cons_block_index == CONS_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
652 653 654 655
	  register struct cons_block *new;
	  allocating_for_lisp = 1;
	  new = (struct cons_block *) xmalloc (sizeof (struct cons_block));
	  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
656 657 658 659 660
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = cons_block;
	  cons_block = new;
	  cons_block_index = 0;
	}
661
      XSETCONS (val, &cons_block->conses[cons_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
662 663 664 665 666 667 668 669 670 671 672 673 674 675
    }
  XCONS (val)->car = car;
  XCONS (val)->cdr = cdr;
  consing_since_gc += sizeof (struct Lisp_Cons);
  return val;
}

DEFUN ("list", Flist, Slist, 0, MANY, 0,
  "Return a newly created list with specified arguments as elements.\n\
Any number of arguments, even zero arguments, are allowed.")
  (nargs, args)
     int nargs;
     register Lisp_Object *args;
{
Karl Heuer's avatar
Karl Heuer committed
676
  register Lisp_Object val = Qnil;
Jim Blandy's avatar
Jim Blandy committed
677

Karl Heuer's avatar
Karl Heuer committed
678 679
  while (nargs--)
    val = Fcons (args[nargs], val);
Jim Blandy's avatar
Jim Blandy committed
680 681 682 683 684 685 686 687 688 689 690
  return val;
}

DEFUN ("make-list", Fmake_list, Smake_list, 2, 2, 0,
  "Return a newly created list of length LENGTH, with each element being INIT.")
  (length, init)
     register Lisp_Object length, init;
{
  register Lisp_Object val;
  register int size;

691 692
  CHECK_NATNUM (length, 0);
  size = XFASTINT (length);
Jim Blandy's avatar
Jim Blandy committed
693 694 695 696 697 698 699 700 701 702 703

  val = Qnil;
  while (size-- > 0)
    val = Fcons (init, val);
  return val;
}

/* Allocation of vectors */

struct Lisp_Vector *all_vectors;

704 705 706 707 708 709
struct Lisp_Vector *
allocate_vectorlike (len)
     EMACS_INT len;
{
  struct Lisp_Vector *p;

Karl Heuer's avatar
Karl Heuer committed
710
  allocating_for_lisp = 1;
711 712
  p = (struct Lisp_Vector *)xmalloc (sizeof (struct Lisp_Vector)
				     + (len - 1) * sizeof (Lisp_Object));
Karl Heuer's avatar
Karl Heuer committed
713
  allocating_for_lisp = 0;
714 715 716 717 718 719 720 721 722
  VALIDATE_LISP_STORAGE (p, 0);
  consing_since_gc += (sizeof (struct Lisp_Vector)
		       + (len - 1) * sizeof (Lisp_Object));

  p->next = all_vectors;
  all_vectors = p;
  return p;
}

Jim Blandy's avatar
Jim Blandy committed
723 724 725 726 727 728
DEFUN ("make-vector", Fmake_vector, Smake_vector, 2, 2, 0,
  "Return a newly created vector of length LENGTH, with each element being INIT.\n\
See also the function `vector'.")
  (length, init)
     register Lisp_Object length, init;
{
729 730 731
  Lisp_Object vector;
  register EMACS_INT sizei;
  register int index;
Jim Blandy's avatar
Jim Blandy committed
732 733
  register struct Lisp_Vector *p;

734 735
  CHECK_NATNUM (length, 0);
  sizei = XFASTINT (length);
Jim Blandy's avatar
Jim Blandy committed
736

737
  p = allocate_vectorlike (sizei);
Jim Blandy's avatar
Jim Blandy committed
738 739 740 741
  p->size = sizei;
  for (index = 0; index < sizei; index++)
    p->contents[index] = init;

742
  XSETVECTOR (vector, p);
Jim Blandy's avatar
Jim Blandy committed
743 744 745 746 747 748 749 750 751 752 753 754 755 756
  return vector;
}

DEFUN ("vector", Fvector, Svector, 0, MANY, 0,
  "Return a newly created vector with specified arguments as elements.\n\
Any number of arguments, even zero arguments, are allowed.")
  (nargs, args)
     register int nargs;
     Lisp_Object *args;
{
  register Lisp_Object len, val;
  register int index;
  register struct Lisp_Vector *p;

757
  XSETFASTINT (len, nargs);
Jim Blandy's avatar
Jim Blandy committed
758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778
  val = Fmake_vector (len, Qnil);
  p = XVECTOR (val);
  for (index = 0; index < nargs; index++)
    p->contents[index] = args[index];
  return val;
}

DEFUN ("make-byte-code", Fmake_byte_code, Smake_byte_code, 4, MANY, 0,
  "Create a byte-code object with specified arguments as elements.\n\
The arguments should be the arglist, bytecode-string, constant vector,\n\
stack size, (optional) doc string, and (optional) interactive spec.\n\
The first four arguments are required; at most six have any\n\
significance.")
  (nargs, args)
     register int nargs;
     Lisp_Object *args;
{
  register Lisp_Object len, val;
  register int index;
  register struct Lisp_Vector *p;

779
  XSETFASTINT (len, nargs);
Jim Blandy's avatar
Jim Blandy committed
780
  if (!NILP (Vpurify_flag))
Jim Blandy's avatar
Jim Blandy committed
781 782 783 784 785 786
    val = make_pure_vector (len);
  else
    val = Fmake_vector (len, Qnil);
  p = XVECTOR (val);
  for (index = 0; index < nargs; index++)
    {
Jim Blandy's avatar
Jim Blandy committed
787
      if (!NILP (Vpurify_flag))
Jim Blandy's avatar
Jim Blandy committed
788 789 790
	args[index] = Fpurecopy (args[index]);
      p->contents[index] = args[index];
    }
791
  XSETCOMPILED (val, val);
Jim Blandy's avatar
Jim Blandy committed
792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818
  return val;
}

/* Allocation of symbols.
   Just like allocation of conses!

   Each symbol_block is just under 1020 bytes long,
   since malloc really allocates in units of powers of two
   and uses 4 bytes for its own overhead. */

#define SYMBOL_BLOCK_SIZE \
  ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))

struct symbol_block
  {
    struct symbol_block *next;
    struct Lisp_Symbol symbols[SYMBOL_BLOCK_SIZE];
  };

struct symbol_block *symbol_block;
int symbol_block_index;

struct Lisp_Symbol *symbol_free_list;

void
init_symbol ()
{
Karl Heuer's avatar
Karl Heuer committed
819
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
820
  symbol_block = (struct symbol_block *) malloc (sizeof (struct symbol_block));
Karl Heuer's avatar
Karl Heuer committed
821
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840
  symbol_block->next = 0;
  bzero (symbol_block->symbols, sizeof symbol_block->symbols);
  symbol_block_index = 0;
  symbol_free_list = 0;
}

DEFUN ("make-symbol", Fmake_symbol, Smake_symbol, 1, 1, 0,
  "Return a newly allocated uninterned symbol whose name is NAME.\n\
Its value and function definition are void, and its property list is nil.")
  (str)
     Lisp_Object str;
{
  register Lisp_Object val;
  register struct Lisp_Symbol *p;

  CHECK_STRING (str, 0);

  if (symbol_free_list)
    {
841
      XSETSYMBOL (val, symbol_free_list);
842
      symbol_free_list = *(struct Lisp_Symbol **)&symbol_free_list->value;
Jim Blandy's avatar
Jim Blandy committed
843 844 845 846 847
    }
  else
    {
      if (symbol_block_index == SYMBOL_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
848 849 850 851
	  struct symbol_block *new;
	  allocating_for_lisp = 1;
	  new = (struct symbol_block *) xmalloc (sizeof (struct symbol_block));
	  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
852 853 854 855 856
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = symbol_block;
	  symbol_block = new;
	  symbol_block_index = 0;
	}
857
      XSETSYMBOL (val, &symbol_block->symbols[symbol_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
858 859 860 861 862 863 864 865 866 867 868
    }
  p = XSYMBOL (val);
  p->name = XSTRING (str);
  p->plist = Qnil;
  p->value = Qunbound;
  p->function = Qunbound;
  p->next = 0;
  consing_since_gc += sizeof (struct Lisp_Symbol);
  return val;
}

869
/* Allocation of markers and other objects that share that structure.
Jim Blandy's avatar
Jim Blandy committed
870 871 872
   Works like allocation of conses. */

#define MARKER_BLOCK_SIZE \
873
  ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
Jim Blandy's avatar
Jim Blandy committed
874 875 876 877

struct marker_block
  {
    struct marker_block *next;
878
    union Lisp_Misc markers[MARKER_BLOCK_SIZE];
Jim Blandy's avatar
Jim Blandy committed
879 880 881 882 883
  };

struct marker_block *marker_block;
int marker_block_index;

884
union Lisp_Misc *marker_free_list;
Jim Blandy's avatar
Jim Blandy committed
885 886 887 888

void
init_marker ()
{
Karl Heuer's avatar
Karl Heuer committed
889
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
890
  marker_block = (struct marker_block *) malloc (sizeof (struct marker_block));
Karl Heuer's avatar
Karl Heuer committed
891
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
892 893 894 895 896 897
  marker_block->next = 0;
  bzero (marker_block->markers, sizeof marker_block->markers);
  marker_block_index = 0;
  marker_free_list = 0;
}

898 899 900
/* Return a newly allocated Lisp_Misc object, with no substructure.  */
Lisp_Object
allocate_misc ()
Jim Blandy's avatar
Jim Blandy committed
901
{
902
  Lisp_Object val;
Jim Blandy's avatar
Jim Blandy committed
903

Jim Blandy's avatar
Jim Blandy committed
904 905
  if (marker_free_list)
    {
906 907
      XSETMISC (val, marker_free_list);
      marker_free_list = marker_free_list->u_free.chain;
Jim Blandy's avatar
Jim Blandy committed
908 909 910 911 912
    }
  else
    {
      if (marker_block_index == MARKER_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
913 914 915 916
	  struct marker_block *new;
	  allocating_for_lisp = 1;
	  new = (struct marker_block *) xmalloc (sizeof (struct marker_block));
	  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
917 918 919 920 921
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = marker_block;
	  marker_block = new;
	  marker_block_index = 0;
	}
922
      XSETMISC (val, &marker_block->markers[marker_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
923
    }
924 925 926 927 928 929 930 931 932 933 934 935
  consing_since_gc += sizeof (union Lisp_Misc);
  return val;
}

DEFUN ("make-marker", Fmake_marker, Smake_marker, 0, 0, 0,
  "Return a newly allocated marker which does not point at any place.")
  ()
{
  register Lisp_Object val;
  register struct Lisp_Marker *p;

  val = allocate_misc ();
936
  XMISCTYPE (val) = Lisp_Misc_Marker;
Jim Blandy's avatar
Jim Blandy committed
937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976
  p = XMARKER (val);
  p->buffer = 0;
  p->bufpos = 0;
  p->chain = Qnil;
  return val;
}

/* Allocation of strings */

/* Strings reside inside of string_blocks.  The entire data of the string,
 both the size and the contents, live in part of the `chars' component of a string_block.
 The `pos' component is the index within `chars' of the first free byte.

 first_string_block points to the first string_block ever allocated.
 Each block points to the next one with its `next' field.
 The `prev' fields chain in reverse order.
 The last one allocated is the one currently being filled.
 current_string_block points to it.

 The string_blocks that hold individual large strings
 go in a separate chain, started by large_string_blocks.  */


/* String blocks contain this many useful bytes.
   8188 is power of 2, minus 4 for malloc overhead. */
#define STRING_BLOCK_SIZE (8188 - sizeof (struct string_block_head))

/* A string bigger than this gets its own specially-made string block
 if it doesn't fit in the current one. */
#define STRING_BLOCK_OUTSIZE 1024

struct string_block_head
  {
    struct string_block *next, *prev;
    int pos;
  };

struct string_block
  {
    struct string_block *next, *prev;
977
    EMACS_INT pos;
Jim Blandy's avatar
Jim Blandy committed
978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997
    char chars[STRING_BLOCK_SIZE];
  };

/* This points to the string block we are now allocating strings.  */

struct string_block *current_string_block;

/* This points to the oldest string block, the one that starts the chain.  */

struct string_block *first_string_block;

/* Last string block in chain of those made for individual large strings.  */

struct string_block *large_string_blocks;

/* If SIZE is the length of a string, this returns how many bytes
   the string occupies in a string_block (including padding).  */

#define STRING_FULLSIZE(size) (((size) + sizeof (struct Lisp_String) + PAD) \
			       & ~(PAD - 1))
998
#define PAD (sizeof (EMACS_INT))
Jim Blandy's avatar
Jim Blandy committed
999 1000 1001

#if 0
#define STRING_FULLSIZE(SIZE)   \
1002
(((SIZE) + 2 * sizeof (EMACS_INT)) & ~(sizeof (EMACS_INT) - 1))
Jim Blandy's avatar
Jim Blandy committed
1003 1004 1005 1006 1007
#endif

void
init_strings ()
{
Karl Heuer's avatar
Karl Heuer committed
1008
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
1009
  current_string_block = (struct string_block *) malloc (sizeof (struct string_block));
Karl Heuer's avatar
Karl Heuer committed
1010
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027
  first_string_block = current_string_block;
  consing_since_gc += sizeof (struct string_block);
  current_string_block->next = 0;
  current_string_block->prev = 0;
  current_string_block->pos = 0;
  large_string_blocks = 0;
}

DEFUN ("make-string", Fmake_string, Smake_string, 2, 2, 0,
  "Return a newly created string of length LENGTH, with each element being INIT.\n\
Both LENGTH and INIT must be numbers.")
  (length, init)
     Lisp_Object length, init;
{
  register Lisp_Object val;
  register unsigned char *p, *end, c;

1028
  CHECK_NATNUM (length, 0);
Jim Blandy's avatar
Jim Blandy committed
1029
  CHECK_NUMBER (init, 1);
1030
  val = make_uninit_string (XFASTINT (length));
Jim Blandy's avatar
Jim Blandy committed
1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069
  c = XINT (init);
  p = XSTRING (val)->data;
  end = p + XSTRING (val)->size;
  while (p != end)
    *p++ = c;
  *p = 0;
  return val;
}

Lisp_Object
make_string (contents, length)
     char *contents;
     int length;
{
  register Lisp_Object val;
  val = make_uninit_string (length);
  bcopy (contents, XSTRING (val)->data, length);
  return val;
}

Lisp_Object
build_string (str)
     char *str;
{
  return make_string (str, strlen (str));
}

Lisp_Object
make_uninit_string (length)
     int length;
{
  register Lisp_Object val;
  register int fullsize = STRING_FULLSIZE (length);

  if (length < 0) abort ();

  if (fullsize <= STRING_BLOCK_SIZE - current_string_block->pos)
    /* This string can fit in the current string block */
    {
1070 1071 1072
      XSETSTRING (val,
		  ((struct Lisp_String *)
		   (current_string_block->chars + current_string_block->pos)));
Jim Blandy's avatar
Jim Blandy committed
1073 1074 1075 1076 1077
      current_string_block->pos += fullsize;
    }
  else if (fullsize > STRING_BLOCK_OUTSIZE)
    /* This string gets its own string block */
    {
Karl Heuer's avatar
Karl Heuer committed
1078 1079 1080 1081
      register struct string_block *new;
      allocating_for_lisp = 1;
      new = (struct string_block *) xmalloc (sizeof (struct string_block_head) + fullsize);
      allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
1082 1083 1084 1085 1086
      VALIDATE_LISP_STORAGE (new, 0);
      consing_since_gc += sizeof (struct string_block_head) + fullsize;
      new->pos = fullsize;
      new->next = large_string_blocks;
      large_string_blocks = new;
1087 1088 1089
      XSETSTRING (val,
		  ((struct Lisp_String *)
		   ((struct string_block_head *)new + 1)));
Jim Blandy's avatar
Jim Blandy committed
1090 1091 1092 1093
    }
  else
    /* Make a new current string block and start it off with this string */
    {
Karl Heuer's avatar
Karl Heuer committed
1094 1095 1096 1097
      register struct string_block *new;
      allocating_for_lisp = 1;
      new = (struct string_block *) xmalloc (sizeof (struct string_block));
      allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
1098 1099 1100 1101 1102 1103 1104
      VALIDATE_LISP_STORAGE (new, sizeof *new);
      consing_since_gc += sizeof (struct string_block);
      current_string_block->next = new;
      new->prev = current_string_block;
      new->next = 0;
      current_string_block = new;
      new->pos = fullsize;
1105 1106
      XSETSTRING (val,
		  (struct Lisp_String *) current_string_block->chars);
Jim Blandy's avatar
Jim Blandy committed
1107 1108 1109 1110
    }
    
  XSTRING (val)->size = length;
  XSTRING (val)->data[length] = 0;
1111
  INITIALIZE_INTERVAL (XSTRING (val), NULL_INTERVAL);
Jim Blandy's avatar
Jim Blandy committed
1112 1113 1114 1115 1116

  return val;
}

/* Return a newly created vector or string with specified arguments as
1117 1118 1119 1120
   elements.  If all the arguments are characters that can fit
   in a string of events, make a string; otherwise, make a vector.

   Any number of arguments, even zero arguments, are allowed.  */
Jim Blandy's avatar
Jim Blandy committed
1121 1122

Lisp_Object
1123
make_event_array (nargs, args)
Jim Blandy's avatar
Jim Blandy committed
1124 1125 1126 1127 1128 1129
     register int nargs;
     Lisp_Object *args;
{
  int i;

  for (i = 0; i < nargs; i++)
1130
    /* The things that fit in a string
1131 1132
       are characters that are in 0...127,
       after discarding the meta bit and all the bits above it.  */
1133
    if (!INTEGERP (args[i])
1134
	|| (XUINT (args[i]) & ~(-CHAR_META)) >= 0200)
Jim Blandy's avatar
Jim Blandy committed
1135 1136 1137 1138 1139
      return Fvector (nargs, args);

  /* Since the loop exited, we know that all the things in it are
     characters, so we can make a string.  */
  {
1140
    Lisp_Object result;
Jim Blandy's avatar
Jim Blandy committed
1141
    
1142
    result = Fmake_string (nargs, make_number (0));
Jim Blandy's avatar
Jim Blandy committed
1143
    for (i = 0; i < nargs; i++)
1144 1145 1146 1147 1148 1149
      {
	XSTRING (result)->data[i] = XINT (args[i]);
	/* Move the meta bit to the right place for a string char.  */
	if (XINT (args[i]) & CHAR_META)
	  XSTRING (result)->data[i] |= 0x80;
      }
Jim Blandy's avatar
Jim Blandy committed
1150 1151 1152 1153 1154
    
    return result;
  }
}

1155 1156
/* Pure storage management.  */

Jim Blandy's avatar
Jim Blandy committed
1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167
/* Must get an error if pure storage is full,
 since if it cannot hold a large string
 it may be able to hold conses that point to that string;
 then the string is not protected from gc. */

Lisp_Object
make_pure_string (data, length)
     char *data;
     int length;
{
  register Lisp_Object new;
1168
  register int size = sizeof (EMACS_INT) + INTERVAL_PTR_SIZE + length + 1;
Jim Blandy's avatar
Jim Blandy committed
1169 1170 1171

  if (pureptr + size > PURESIZE)
    error ("Pure Lisp storage exhausted");
1172
  XSETSTRING (new, PUREBEG + pureptr);
Jim Blandy's avatar
Jim Blandy committed
1173 1174 1175
  XSTRING (new)->size = length;
  bcopy (data, XSTRING (new)->data, length);
  XSTRING (new)->data[length] = 0;
1176 1177 1178 1179 1180 1181

  /* We must give strings in pure storage some kind of interval.  So we
     give them a null one.  */
#if defined (USE_TEXT_PROPERTIES)
  XSTRING (new)->intervals = NULL_INTERVAL;
#endif
1182 1183
  pureptr += (size + sizeof (EMACS_INT) - 1)
	     / sizeof (EMACS_INT) * sizeof (EMACS_INT);
Jim Blandy's avatar
Jim Blandy committed
1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194
  return new;
}

Lisp_Object
pure_cons (car, cdr)
     Lisp_Object car, cdr;
{
  register Lisp_Object new;

  if (pureptr + sizeof (struct Lisp_Cons) > PURESIZE)
    error ("Pure Lisp storage exhausted");
1195
  XSETCONS (new, PUREBEG + pureptr);
Jim Blandy's avatar
Jim Blandy committed
1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209
  pureptr += sizeof (struct Lisp_Cons);
  XCONS (new)->car = Fpurecopy (car);
  XCONS (new)->cdr = Fpurecopy (cdr);
  return new;
}

#ifdef LISP_FLOAT_TYPE

Lisp_Object
make_pure_float (num)
     double num;
{
  register Lisp_Object new;

1210 1211 1212 1213 1214 1215 1216 1217
  /* Make sure that PUREBEG + pureptr is aligned on at least a sizeof
     (double) boundary.  Some architectures (like the sparc) require
     this, and I suspect that floats are rare enough that it's no
     tragedy for those that do.  */
  {
    int alignment;
    char *p = PUREBEG + pureptr;

1218 1219
#ifdef __GNUC__
#if __GNUC__ >= 2
1220
    alignment = __alignof (struct Lisp_Float);
1221
#else
1222
    alignment = sizeof (struct Lisp_Float);
1223 1224
#endif
#else
1225
    alignment = sizeof (struct Lisp_Float);
1226
#endif  
1227 1228 1229
    p = (char *) (((unsigned long) p + alignment - 1) & - alignment);
    pureptr = p - PUREBEG;
  }
1230

Jim Blandy's avatar
Jim Blandy committed
1231 1232
  if (pureptr + sizeof (struct Lisp_Float) > PURESIZE)
    error ("Pure Lisp storage exhausted");
1233
  XSETFLOAT (new, PUREBEG + pureptr);
Jim Blandy's avatar
Jim Blandy committed
1234 1235
  pureptr += sizeof (struct Lisp_Float);
  XFLOAT (new)->data = num;
1236
  XSETFASTINT (XFLOAT (new)->type, 0);	/* bug chasing -wsr */
Jim Blandy's avatar
Jim Blandy committed
1237 1238 1239 1240 1241 1242 1243
  return new;
}

#endif /* LISP_FLOAT_TYPE */

Lisp_Object
make_pure_vector (len)
1244
     EMACS_INT len;
Jim Blandy's avatar
Jim Blandy committed
1245 1246
{
  register Lisp_Object new;
1247
  register EMACS_INT size = sizeof (struct Lisp_Vector) + (len - 1) * sizeof (Lisp_Object);
Jim Blandy's avatar
Jim Blandy committed
1248 1249 1250 1251

  if (pureptr + size > PURESIZE)
    error ("Pure Lisp storage exhausted");

1252
  XSETVECTOR (new, PUREBEG + pureptr);
Jim Blandy's avatar
Jim Blandy committed
1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264
  pureptr += size;
  XVECTOR (new)->size = len;
  return new;
}

DEFUN ("purecopy", Fpurecopy, Spurecopy, 1, 1, 0,
  "Make a copy of OBJECT in pure storage.\n\
Recursively copies contents of vectors and cons cells.\n\
Does not copy symbols.")
  (obj)
     register Lisp_Object obj;
{
Jim Blandy's avatar
Jim Blandy committed
1265
  if (NILP (Vpurify_flag))
Jim Blandy's avatar
Jim Blandy committed
1266 1267 1268 1269 1270 1271
    return obj;

  if ((PNTR_COMPARISON_TYPE) XPNTR (obj) < (PNTR_COMPARISON_TYPE) ((char *) pure + PURESIZE)
      && (PNTR_COMPARISON_TYPE) XPNTR (obj) >= (PNTR_COMPARISON_TYPE) pure)
    return obj;

1272 1273
  if (CONSP (obj))
    return pure_cons (XCONS (obj)->car, XCONS (obj)->cdr);
Jim Blandy's avatar
Jim Blandy committed
1274
#ifdef LISP_FLOAT_TYPE
1275 1276
  else if (FLOATP (obj))
    return make_pure_float (XFLOAT (obj)->data);
Jim Blandy's avatar
Jim Blandy committed
1277
#endif /* LISP_FLOAT_TYPE */
1278 1279 1280 1281 1282 1283