alloc.c 74 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* Storage allocation and gc for GNU Emacs Lisp interpreter.
Richard M. Stallman's avatar
Richard M. Stallman committed
2
   Copyright (C) 1985, 86, 88, 93, 94, 95, 97 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

Richard M. Stallman's avatar
Richard M. Stallman committed
21
/* Note that this declares bzero on OSF/1.  How dumb.  */
22
#include <signal.h>
Jim Blandy's avatar
Jim Blandy committed
23

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

Jim Blandy's avatar
Jim Blandy committed
36 37
#include "syssignal.h"

Karl Heuer's avatar
Karl Heuer committed
38 39
extern char *sbrk ();

40 41 42 43
#ifdef DOUG_LEA_MALLOC
#include <malloc.h>
#define __malloc_size_t int
#else
44 45 46 47 48 49 50 51 52 53
/* 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;
54
#endif /* !defined(DOUG_LEA_MALLOC) */
55

56 57
extern Lisp_Object Vhistory_length;

Jim Blandy's avatar
Jim Blandy committed
58
#define max(A,B) ((A) > (B) ? (A) : (B))
59
#define min(A,B) ((A) < (B) ? (A) : (B))
Jim Blandy's avatar
Jim Blandy committed
60 61 62 63 64 65 66 67 68

/* 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;						\
69
    XSETCONS (val, (char *) address + size);		\
Jim Blandy's avatar
Jim Blandy committed
70 71
    if ((char *) XCONS (val) != (char *) address + size)	\
      {								\
72
	xfree (address);					\
Jim Blandy's avatar
Jim Blandy committed
73 74 75 76
	memory_full ();						\
      }								\
  } while (0)

77 78 79
/* Value of _bytes_used, when spare_memory was freed.  */
static __malloc_size_t bytes_used_when_full;

Jim Blandy's avatar
Jim Blandy committed
80 81 82
/* Number of bytes of consing done since the last gc */
int consing_since_gc;

83 84 85 86 87 88 89 90 91
/* Count the amount of consing of various sorts of space.  */
int cons_cells_consed;
int floats_consed;
int vector_cells_consed;
int symbols_consed;
int string_chars_consed;
int misc_objects_consed;
int intervals_consed;

Jim Blandy's avatar
Jim Blandy committed
92
/* Number of bytes of consing since gc before another gc should be done. */
93
int gc_cons_threshold;
Jim Blandy's avatar
Jim Blandy committed
94 95 96 97

/* Nonzero during gc */
int gc_in_progress;

98 99 100
/* Nonzero means display messages at beginning and end of GC.  */
int garbage_collection_messages;

Jim Blandy's avatar
Jim Blandy committed
101 102 103 104 105 106 107 108 109 110
#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
111 112 113
/* Two limits controlling how much undo information to keep.  */
int undo_limit;
int undo_strong_limit;
Jim Blandy's avatar
Jim Blandy committed
114

115 116 117 118 119 120 121 122 123 124
/* 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
125 126 127
/* Nonzero when malloc is called for allocating Lisp object space.  */
int allocating_for_lisp;

Jim Blandy's avatar
Jim Blandy committed
128 129 130 131
/* Non-nil means defun should do purecopy on the function definition */
Lisp_Object Vpurify_flag;

#ifndef HAVE_SHM
132
EMACS_INT pure[PURESIZE / sizeof (EMACS_INT)] = {0,};   /* Force it into data space! */
Jim Blandy's avatar
Jim Blandy committed
133 134 135 136
#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
137 138 139 140 141 142 143

/* 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.  */
144
EMACS_INT pure_size;
Jim Blandy's avatar
Jim Blandy committed
145 146 147 148 149 150 151 152
#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;

153
/* Pre-computed signal argument for use when memory is exhausted.  */
154
Lisp_Object memory_signal_data;
155

Jim Blandy's avatar
Jim Blandy committed
156 157 158 159 160 161
/* Maximum amount of C stack to save when a GC happens.  */

#ifndef MAX_SAVE_STACK
#define MAX_SAVE_STACK 16000
#endif

162 163 164
/* 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.
Karl Heuer's avatar
Karl Heuer committed
165
   Word-addressable architectures may need to override this in the m-file.)
166 167 168
   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.  */
169
#ifndef DONT_COPY_FLAG
170
#define DONT_COPY_FLAG 1
171 172
#endif /* no DONT_COPY_FLAG  */

Jim Blandy's avatar
Jim Blandy committed
173 174 175 176 177 178 179
/* 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
180

181
Lisp_Object Qgc_cons_threshold, Qchar_table_extra_slots;
182

183
static void mark_object (), mark_buffer (), mark_kboards ();
Joseph Arceneaux's avatar
Joseph Arceneaux committed
184 185
static void clear_marks (), gc_sweep ();
static void compact_strings ();
Jim Blandy's avatar
Jim Blandy committed
186

187 188
/* Versions of malloc and realloc that print warnings as memory gets full.  */

Jim Blandy's avatar
Jim Blandy committed
189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215
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);
}

216
#ifdef DOUG_LEA_MALLOC
217
#  define BYTES_USED (mallinfo ().arena)
218
#else
219
#  define BYTES_USED _bytes_used
220 221
#endif

Jim Blandy's avatar
Jim Blandy committed
222
/* Called if malloc returns zero */
223

Jim Blandy's avatar
Jim Blandy committed
224 225
memory_full ()
{
226
#ifndef SYSTEM_MALLOC
227
  bytes_used_when_full = BYTES_USED;
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
#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

259 260 261 262
  /* 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
263 264
}

265
/* like malloc routines but check for no memory and block interrupt input.  */
Jim Blandy's avatar
Jim Blandy committed
266 267 268 269 270 271 272

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

273
  BLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
274
  val = (long *) malloc (size);
275
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
276 277 278 279 280 281 282 283 284 285 286 287

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

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

288
  BLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
289 290 291 292
  /* 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
293
  else
Jim Blandy's avatar
Jim Blandy committed
294
    val = (long *) realloc (block, size);
295
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
296 297 298 299

  if (!val && size) memory_full ();
  return val;
}
300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321

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
322 323 324 325 326 327
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) ();
328

329 330
/* This function is used as the hook for free to call.  */

331 332 333 334 335 336 337
static void
emacs_blocked_free (ptr)
     void *ptr;
{
  BLOCK_INPUT;
  __free_hook = old_free_hook;
  free (ptr);
338 339 340 341 342 343 344 345 346
  /* 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
347
	  > BYTES_USED + max (malloc_hysteresis, 4) * SPARE_MEMORY))
348 349
    spare_memory = (char *) malloc (SPARE_MEMORY);

350
  __free_hook = emacs_blocked_free;
351 352 353
  UNBLOCK_INPUT;
}

354 355 356 357 358 359 360 361 362 363 364 365 366 367 368
/* 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.  */

369 370 371 372 373 374 375 376
static void *
emacs_blocked_malloc (size)
     unsigned size;
{
  void *value;

  BLOCK_INPUT;
  __malloc_hook = old_malloc_hook;
377
#ifdef DOUG_LEA_MALLOC
378
    mallopt (M_TOP_PAD, malloc_hysteresis * 4096);
379
#else
380
    __malloc_extra_blocks = malloc_hysteresis;
381
#endif
382
  value = (void *) malloc (size);
383
  __malloc_hook = emacs_blocked_malloc;
384 385 386 387 388 389 390 391 392 393 394 395 396 397
  UNBLOCK_INPUT;

  return value;
}

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

  BLOCK_INPUT;
  __realloc_hook = old_realloc_hook;
398
  value = (void *) realloc (ptr, size);
399
  __realloc_hook = emacs_blocked_realloc;
400 401 402 403 404 405 406 407 408
  UNBLOCK_INPUT;

  return value;
}

void
uninterrupt_malloc ()
{
  old_free_hook = __free_hook;
409
  __free_hook = emacs_blocked_free;
410 411

  old_malloc_hook = __malloc_hook;
412
  __malloc_hook = emacs_blocked_malloc;
413 414

  old_realloc_hook = __realloc_hook;
415
  __realloc_hook = emacs_blocked_realloc;
416 417
}
#endif
Jim Blandy's avatar
Jim Blandy committed
418

419 420
/* Interval allocation.  */

421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438
#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
439
  allocating_for_lisp = 1;
440 441
  interval_block
    = (struct interval_block *) malloc (sizeof (struct interval_block));
Karl Heuer's avatar
Karl Heuer committed
442
  allocating_for_lisp = 0;
443
  interval_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
444
  bzero ((char *) interval_block->intervals, sizeof interval_block->intervals);
445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464
  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
465 466 467 468
	  register struct interval_block *newi;

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

Karl Heuer's avatar
Karl Heuer committed
470
	  allocating_for_lisp = 0;
471 472 473 474 475 476 477 478
	  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);
479
  intervals_consed++;
480 481 482 483 484 485 486 487 488
  RESET_INTERVAL (val);
  return val;
}

static int total_free_intervals, total_intervals;

/* Mark the pointers of one interval. */

static void
489
mark_interval (i, dummy)
490
     register INTERVAL i;
491
     Lisp_Object dummy;
492 493 494 495 496 497 498 499 500 501 502
{
  if (XMARKBIT (i->plist))
    abort ();
  mark_object (&i->plist);
  XMARK (i->plist);
}

static void
mark_interval_tree (tree)
     register INTERVAL tree;
{
503 504 505 506 507 508 509
  /* 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);
510

511
  traverse_intervals (tree, 1, 0, mark_interval, Qnil);
512 513
}

514 515 516 517 518 519
#define MARK_INTERVAL_TREE(i)				\
  do {							\
    if (!NULL_INTERVAL_P (i)				\
	&& ! XMARKBIT ((Lisp_Object) i->parent))	\
      mark_interval_tree (i);				\
  } while (0)
520

521
/* The oddity in the call to XUNMARK is necessary because XUNMARK
522
   expands to an assignment to its argument, and most C compilers don't
523 524 525 526 527 528 529 530
   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);				\
     } 								\
531 532 533 534 535 536 537 538 539 540 541
}

#else  /* no interval use */

#define INIT_INTERVALS

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

#endif /* no interval use */

542 543
/* Floating point allocation.  */

Jim Blandy's avatar
Jim Blandy committed
544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571
#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
572
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
573
  float_block = (struct float_block *) malloc (sizeof (struct float_block));
Karl Heuer's avatar
Karl Heuer committed
574
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
575
  float_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
576
  bzero ((char *) float_block->floats, sizeof float_block->floats);
Jim Blandy's avatar
Jim Blandy committed
577 578 579 580 581 582 583 584
  float_block_index = 0;
  float_free_list = 0;
}

/* Explicitly free a float cell.  */
free_float (ptr)
     struct Lisp_Float *ptr;
{
585
  *(struct Lisp_Float **)&ptr->type = float_free_list;
Jim Blandy's avatar
Jim Blandy committed
586 587 588 589 590 591 592 593 594 595 596
  float_free_list = ptr;
}

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

  if (float_free_list)
    {
597
      XSETFLOAT (val, float_free_list);
598
      float_free_list = *(struct Lisp_Float **)&float_free_list->type;
Jim Blandy's avatar
Jim Blandy committed
599 600 601 602 603
    }
  else
    {
      if (float_block_index == FLOAT_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
604 605 606 607 608
	  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
609 610 611 612 613
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = float_block;
	  float_block = new;
	  float_block_index = 0;
	}
614
      XSETFLOAT (val, &float_block->floats[float_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
615 616
    }
  XFLOAT (val)->data = float_value;
617
  XSETFASTINT (XFLOAT (val)->type, 0);	/* bug chasing -wsr */
Jim Blandy's avatar
Jim Blandy committed
618
  consing_since_gc += sizeof (struct Lisp_Float);
619
  floats_consed++;
Jim Blandy's avatar
Jim Blandy committed
620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651
  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
652
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
653
  cons_block = (struct cons_block *) malloc (sizeof (struct cons_block));
Karl Heuer's avatar
Karl Heuer committed
654
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
655
  cons_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
656
  bzero ((char *) cons_block->conses, sizeof cons_block->conses);
Jim Blandy's avatar
Jim Blandy committed
657 658 659 660 661 662 663 664
  cons_block_index = 0;
  cons_free_list = 0;
}

/* Explicitly free a cons cell.  */
free_cons (ptr)
     struct Lisp_Cons *ptr;
{
665
  *(struct Lisp_Cons **)&ptr->car = cons_free_list;
Jim Blandy's avatar
Jim Blandy committed
666 667 668 669 670 671 672 673 674 675 676 677
  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)
    {
678
      XSETCONS (val, cons_free_list);
679
      cons_free_list = *(struct Lisp_Cons **)&cons_free_list->car;
Jim Blandy's avatar
Jim Blandy committed
680 681 682 683 684
    }
  else
    {
      if (cons_block_index == CONS_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
685 686 687 688
	  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
689 690 691 692 693
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = cons_block;
	  cons_block = new;
	  cons_block_index = 0;
	}
694
      XSETCONS (val, &cons_block->conses[cons_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
695 696 697 698
    }
  XCONS (val)->car = car;
  XCONS (val)->cdr = cdr;
  consing_since_gc += sizeof (struct Lisp_Cons);
699
  cons_cells_consed++;
Jim Blandy's avatar
Jim Blandy committed
700 701 702 703 704 705 706 707 708 709
  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;
{
710 711
  register Lisp_Object val;
  val = Qnil;
Jim Blandy's avatar
Jim Blandy committed
712

713 714 715 716 717
  while (nargs > 0)
    {
      nargs--;
      val = Fcons (args[nargs], val);
    }
Jim Blandy's avatar
Jim Blandy committed
718 719 720 721 722 723 724 725 726 727 728
  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;

729 730
  CHECK_NATNUM (length, 0);
  size = XFASTINT (length);
Jim Blandy's avatar
Jim Blandy committed
731 732 733 734 735 736 737 738 739 740 741

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

struct Lisp_Vector *all_vectors;

742 743 744 745 746 747
struct Lisp_Vector *
allocate_vectorlike (len)
     EMACS_INT len;
{
  struct Lisp_Vector *p;

Karl Heuer's avatar
Karl Heuer committed
748
  allocating_for_lisp = 1;
749 750 751 752
#ifdef DOUG_LEA_MALLOC
  /* Prevent mmap'ing the chunk (which is potentially very large). */
  mallopt (M_MMAP_MAX, 0);
#endif
753 754
  p = (struct Lisp_Vector *)xmalloc (sizeof (struct Lisp_Vector)
				     + (len - 1) * sizeof (Lisp_Object));
755 756 757 758
#ifdef DOUG_LEA_MALLOC
  /* Back to a reasonable maximum of mmap'ed areas. */
  mallopt (M_MMAP_MAX, 64);
#endif
Karl Heuer's avatar
Karl Heuer committed
759
  allocating_for_lisp = 0;
760 761 762
  VALIDATE_LISP_STORAGE (p, 0);
  consing_since_gc += (sizeof (struct Lisp_Vector)
		       + (len - 1) * sizeof (Lisp_Object));
763
  vector_cells_consed += len;
764 765 766 767 768 769

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

Jim Blandy's avatar
Jim Blandy committed
770 771 772 773 774 775
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;
{
776 777 778
  Lisp_Object vector;
  register EMACS_INT sizei;
  register int index;
Jim Blandy's avatar
Jim Blandy committed
779 780
  register struct Lisp_Vector *p;

781 782
  CHECK_NATNUM (length, 0);
  sizei = XFASTINT (length);
Jim Blandy's avatar
Jim Blandy committed
783

784
  p = allocate_vectorlike (sizei);
Jim Blandy's avatar
Jim Blandy committed
785 786 787 788
  p->size = sizei;
  for (index = 0; index < sizei; index++)
    p->contents[index] = init;

789
  XSETVECTOR (vector, p);
Jim Blandy's avatar
Jim Blandy committed
790 791 792
  return vector;
}

793
DEFUN ("make-char-table", Fmake_char_table, Smake_char_table, 1, 2, 0,
794
  "Return a newly created char-table, with purpose PURPOSE.\n\
795
Each element is initialized to INIT, which defaults to nil.\n\
Erik Naggum's avatar
Erik Naggum committed
796
PURPOSE should be a symbol which has a `char-table-extra-slots' property.\n\
797 798 799
The property's value should be an integer between 0 and 10.")
  (purpose, init)
     register Lisp_Object purpose, init;
800 801
{
  Lisp_Object vector;
802 803
  Lisp_Object n;
  CHECK_SYMBOL (purpose, 1);
804
  n = Fget (purpose, Qchar_table_extra_slots);
805
  CHECK_NUMBER (n, 0);
806 807 808 809 810
  if (XINT (n) < 0 || XINT (n) > 10)
    args_out_of_range (n, Qnil);
  /* Add 2 to the size for the defalt and parent slots.  */
  vector = Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS + XINT (n)),
			 init);
811
  XCHAR_TABLE (vector)->top = Qt;
812
  XCHAR_TABLE (vector)->parent = Qnil;
813
  XCHAR_TABLE (vector)->purpose = purpose;
814 815 816 817
  XSETCHAR_TABLE (vector, XCHAR_TABLE (vector));
  return vector;
}

818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833
/* Return a newly created sub char table with default value DEFALT.
   Since a sub char table does not appear as a top level Emacs Lisp
   object, we don't need a Lisp interface to make it.  */

Lisp_Object
make_sub_char_table (defalt)
     Lisp_Object defalt;
{
  Lisp_Object vector
    = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS), Qnil);
  XCHAR_TABLE (vector)->top = Qnil;
  XCHAR_TABLE (vector)->defalt = defalt;
  XSETCHAR_TABLE (vector, XCHAR_TABLE (vector));
  return vector;
}

Jim Blandy's avatar
Jim Blandy committed
834 835 836 837 838 839 840 841 842 843 844
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;

845
  XSETFASTINT (len, nargs);
Jim Blandy's avatar
Jim Blandy committed
846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866
  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;

867
  XSETFASTINT (len, nargs);
Jim Blandy's avatar
Jim Blandy committed
868
  if (!NILP (Vpurify_flag))
869
    val = make_pure_vector ((EMACS_INT) nargs);
Jim Blandy's avatar
Jim Blandy committed
870 871 872 873 874
  else
    val = Fmake_vector (len, Qnil);
  p = XVECTOR (val);
  for (index = 0; index < nargs; index++)
    {
Jim Blandy's avatar
Jim Blandy committed
875
      if (!NILP (Vpurify_flag))
Jim Blandy's avatar
Jim Blandy committed
876 877 878
	args[index] = Fpurecopy (args[index]);
      p->contents[index] = args[index];
    }
879
  XSETCOMPILED (val, val);
Jim Blandy's avatar
Jim Blandy committed
880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906
  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
907
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
908
  symbol_block = (struct symbol_block *) malloc (sizeof (struct symbol_block));
Karl Heuer's avatar
Karl Heuer committed
909
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
910
  symbol_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
911
  bzero ((char *) symbol_block->symbols, sizeof symbol_block->symbols);
Jim Blandy's avatar
Jim Blandy committed
912 913 914 915 916 917 918
  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.")
919 920
  (name)
     Lisp_Object name;
Jim Blandy's avatar
Jim Blandy committed
921 922 923 924
{
  register Lisp_Object val;
  register struct Lisp_Symbol *p;

925
  CHECK_STRING (name, 0);
Jim Blandy's avatar
Jim Blandy committed
926 927 928

  if (symbol_free_list)
    {
929
      XSETSYMBOL (val, symbol_free_list);
930
      symbol_free_list = *(struct Lisp_Symbol **)&symbol_free_list->value;
Jim Blandy's avatar
Jim Blandy committed
931 932 933 934 935
    }
  else
    {
      if (symbol_block_index == SYMBOL_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
936 937 938 939
	  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
940 941 942 943 944
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = symbol_block;
	  symbol_block = new;
	  symbol_block_index = 0;
	}
945
      XSETSYMBOL (val, &symbol_block->symbols[symbol_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
946 947
    }
  p = XSYMBOL (val);
948
  p->name = XSTRING (name);
949
  p->obarray = Qnil;
Jim Blandy's avatar
Jim Blandy committed
950 951 952 953 954
  p->plist = Qnil;
  p->value = Qunbound;
  p->function = Qunbound;
  p->next = 0;
  consing_since_gc += sizeof (struct Lisp_Symbol);
955
  symbols_consed++;
Jim Blandy's avatar
Jim Blandy committed
956 957 958
  return val;
}

959
/* Allocation of markers and other objects that share that structure.
Jim Blandy's avatar
Jim Blandy committed
960 961 962
   Works like allocation of conses. */

#define MARKER_BLOCK_SIZE \
963
  ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
Jim Blandy's avatar
Jim Blandy committed
964 965 966 967

struct marker_block
  {
    struct marker_block *next;
968
    union Lisp_Misc markers[MARKER_BLOCK_SIZE];
Jim Blandy's avatar
Jim Blandy committed
969 970 971 972 973
  };

struct marker_block *marker_block;
int marker_block_index;

974
union Lisp_Misc *marker_free_list;
Jim Blandy's avatar
Jim Blandy committed
975 976 977 978

void
init_marker ()
{
Karl Heuer's avatar
Karl Heuer committed
979
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
980
  marker_block = (struct marker_block *) malloc (sizeof (struct marker_block));
Karl Heuer's avatar
Karl Heuer committed
981
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
982
  marker_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
983
  bzero ((char *) marker_block->markers, sizeof marker_block->markers);
Jim Blandy's avatar
Jim Blandy committed
984 985 986 987
  marker_block_index = 0;
  marker_free_list = 0;
}

988 989 990
/* Return a newly allocated Lisp_Misc object, with no substructure.  */
Lisp_Object
allocate_misc ()
Jim Blandy's avatar
Jim Blandy committed
991
{
992
  Lisp_Object val;
Jim Blandy's avatar
Jim Blandy committed
993

Jim Blandy's avatar
Jim Blandy committed
994 995
  if (marker_free_list)
    {
996 997
      XSETMISC (val, marker_free_list);
      marker_free_list = marker_free_list->u_free.chain;
Jim Blandy's avatar
Jim Blandy committed
998 999 1000 1001 1002
    }
  else
    {
      if (marker_block_index == MARKER_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
1003 1004 1005 1006
	  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
1007 1008 1009 1010 1011
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = marker_block;
	  marker_block = new;
	  marker_block_index = 0;
	}
1012
      XSETMISC (val, &marker_block->markers[marker_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
1013
    }
1014
  consing_since_gc += sizeof (union Lisp_Misc);
1015
  misc_objects_consed++;
1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026
  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 ();
1027
  XMISCTYPE (val) = Lisp_Misc_Marker;
Jim Blandy's avatar
Jim Blandy committed
1028 1029 1030 1031
  p = XMARKER (val);
  p->buffer = 0;
  p->bufpos = 0;
  p->chain = Qnil;
1032
  p->insertion_type = 0;
Jim Blandy's avatar
Jim Blandy committed
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
  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;
1063
    EMACS_INT pos;
Jim Blandy's avatar
Jim Blandy committed
1064 1065 1066 1067 1068
  };

struct string_block
  {
    struct string_block *next, *prev;
1069
    EMACS_INT pos;
Jim Blandy's avatar
Jim Blandy committed
1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089
    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))
1090
#define PAD (sizeof (EMACS_INT))
Jim Blandy's avatar
Jim Blandy committed
1091 1092 1093

#if 0
#define STRING_FULLSIZE(SIZE)   \
1094
(((SIZE) + 2 * sizeof (EMACS_INT)) & ~(sizeof (EMACS_INT) - 1))
Jim Blandy's avatar
Jim Blandy committed
1095 1096 1097 1098 1099
#endif

void
init_strings ()
{
Karl Heuer's avatar
Karl Heuer committed
1100
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
1101
  current_string_block = (struct string_block *) malloc (sizeof (struct string_block));
Karl Heuer's avatar
Karl Heuer committed
1102
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119
  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;

1120
  CHECK_NATNUM (length, 0);
Jim Blandy's avatar
Jim Blandy committed
1121
  CHECK_NUMBER (init, 1);
1122
  val = make_uninit_string (XFASTINT (length));
Jim Blandy's avatar
Jim Blandy committed
1123 1124 1125 1126 1127 1128 1129 1130 1131
  c = XINT (init);
  p = XSTRING (val)->data;
  end = p + XSTRING (val)->size;
  while (p != end)
    *p++ = c;
  *p = 0;
  return val;
}

1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144
DEFUN ("make-bool-vector", Fmake_bool_vector, Smake_bool_vector, 2, 2, 0,
  "Return a newly created bitstring of length LENGTH, with INIT as each element.\n\
Both LENGTH and INIT must be numbers.  INIT matters only in whether it is t or nil.")
  (length, init)
     Lisp_Object length, init;
{
  register Lisp_Object val;
  struct Lisp_Bool_Vector *p;
  int real_init, i;
  int length_in_chars, length_in_elts, bits_per_value;

  CHECK_NATNUM (length, 0);

1145
  bits_per_value = sizeof (EMACS_INT) * BITS_PER_CHAR;
1146 1147 1148 1149

  length_in_elts = (XFASTINT (length) + bits_per_value - 1) / bits_per_value;
  length_in_chars = length_in_elts * sizeof (EMACS_INT);

1150 1151 1152
  /* We must allocate one more elements than LENGTH_IN_ELTS for the
     slot `size' of the struct Lisp_Bool_Vector.  */
  val = Fmake_vector (make_number (length_in_elts + 1), Qnil);
1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165
  p = XBOOL_VECTOR (val);
  /* Get rid of any bits that would cause confusion.  */
  p->vector_size = 0;
  XSETBOOL_VECTOR (val, p);
  p->size = XFASTINT (length);
  
  real_init = (NILP (init) ? 0 : -1);
  for (i = 0; i < length_in_chars ; i++)
    p->data[i] = real_init;

  return val;
}

Jim Blandy's avatar
Jim Blandy committed
1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195
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 */
    {
1196 1197 1198
      XSETSTRING (val,
		  ((struct Lisp_String *)
		   (current_string_block->chars + current_string_block->pos)));
Jim Blandy's avatar
Jim Blandy committed
1199 1200 1201 1202 1203
      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
1204 1205
      register struct string_block *new;
      allocating_for_lisp = 1;
1206