alloc.c 90.3 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, 97, 98, 1999
Richard M. Stallman's avatar
Richard M. Stallman committed
3
      Free Software Foundation, Inc.
Jim Blandy's avatar
Jim Blandy committed
4 5 6 7 8

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

22
#include <config.h>
23

24 25
/* Note that this declares bzero on OSF/1.  How dumb.  */
#include <signal.h>
26

27 28 29 30
/* This file is part of the core Lisp implementation, and thus must
   deal with the real data structures.  If the Lisp implementation is
   replaced, this file likely will not be used.  */
#undef HIDE_LISP_IMPLEMENTATION
Jim Blandy's avatar
Jim Blandy committed
31
#include "lisp.h"
32
#include "intervals.h"
Jim Blandy's avatar
Jim Blandy committed
33
#include "puresize.h"
Jim Blandy's avatar
Jim Blandy committed
34 35 36
#ifndef standalone
#include "buffer.h"
#include "window.h"
Jim Blandy's avatar
Jim Blandy committed
37
#include "frame.h"
38
#include "blockinput.h"
Richard M. Stallman's avatar
Richard M. Stallman committed
39
#include "keyboard.h"
40
#include "charset.h"
Jim Blandy's avatar
Jim Blandy committed
41 42
#endif

Jim Blandy's avatar
Jim Blandy committed
43 44
#include "syssignal.h"

Karl Heuer's avatar
Karl Heuer committed
45 46
extern char *sbrk ();

47 48 49
#ifdef DOUG_LEA_MALLOC
#include <malloc.h>
#define __malloc_size_t int
50 51 52 53 54 55

/* Specify maximum number of areas to mmap.
   It would be nice to use a value that explicitly
   means "no limit".  */
#define MMAP_MAX_AREAS 100000000

56
#else
57 58 59 60 61 62 63 64 65 66
/* 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;
67
#endif /* !defined(DOUG_LEA_MALLOC) */
68

Jim Blandy's avatar
Jim Blandy committed
69
#define max(A,B) ((A) > (B) ? (A) : (B))
70
#define min(A,B) ((A) < (B) ? (A) : (B))
Jim Blandy's avatar
Jim Blandy committed
71 72 73 74 75 76 77 78 79

/* 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;						\
80
    XSETCONS (val, (char *) address + size);		\
Jim Blandy's avatar
Jim Blandy committed
81 82
    if ((char *) XCONS (val) != (char *) address + size)	\
      {								\
83
	xfree (address);					\
Jim Blandy's avatar
Jim Blandy committed
84 85 86 87
	memory_full ();						\
      }								\
  } while (0)

88 89 90
/* Value of _bytes_used, when spare_memory was freed.  */
static __malloc_size_t bytes_used_when_full;

Jim Blandy's avatar
Jim Blandy committed
91 92 93
/* Number of bytes of consing done since the last gc */
int consing_since_gc;

94 95 96 97 98 99 100 101 102
/* 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
103
/* Number of bytes of consing since gc before another gc should be done. */
104
int gc_cons_threshold;
Jim Blandy's avatar
Jim Blandy committed
105 106 107 108

/* Nonzero during gc */
int gc_in_progress;

109 110 111
/* Nonzero means display messages at beginning and end of GC.  */
int garbage_collection_messages;

Jim Blandy's avatar
Jim Blandy committed
112 113 114 115 116 117 118 119 120 121
#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
122 123 124
/* Two limits controlling how much undo information to keep.  */
int undo_limit;
int undo_strong_limit;
Jim Blandy's avatar
Jim Blandy committed
125

126 127 128 129 130 131
int total_conses, total_markers, total_symbols, total_string_size, total_vector_size;
int total_free_conses, total_free_markers, total_free_symbols;
#ifdef LISP_FLOAT_TYPE
int total_free_floats, total_floats;
#endif /* LISP_FLOAT_TYPE */

132 133 134 135 136 137 138 139 140 141
/* 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
142 143 144
/* Nonzero when malloc is called for allocating Lisp object space.  */
int allocating_for_lisp;

Jim Blandy's avatar
Jim Blandy committed
145 146 147 148
/* Non-nil means defun should do purecopy on the function definition */
Lisp_Object Vpurify_flag;

#ifndef HAVE_SHM
149
EMACS_INT pure[PURESIZE / sizeof (EMACS_INT)] = {0,};   /* Force it into data space! */
Jim Blandy's avatar
Jim Blandy committed
150 151 152 153
#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
154 155 156 157 158 159 160

/* 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.  */
161
EMACS_INT pure_size;
Jim Blandy's avatar
Jim Blandy committed
162 163 164 165 166 167 168 169
#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;

170
/* Pre-computed signal argument for use when memory is exhausted.  */
171
Lisp_Object memory_signal_data;
172

Jim Blandy's avatar
Jim Blandy committed
173 174 175 176 177 178
/* Maximum amount of C stack to save when a GC happens.  */

#ifndef MAX_SAVE_STACK
#define MAX_SAVE_STACK 16000
#endif

179 180 181
/* 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
182
   Word-addressable architectures may need to override this in the m-file.)
183 184 185
   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.  */
186
#ifndef DONT_COPY_FLAG
187
#define DONT_COPY_FLAG 1
188 189
#endif /* no DONT_COPY_FLAG  */

Jim Blandy's avatar
Jim Blandy committed
190 191 192 193 194 195 196
/* 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
197

198
Lisp_Object Qgc_cons_threshold, Qchar_table_extra_slots;
199

200
static void mark_buffer (), mark_kboards ();
201
static void gc_sweep ();
Joseph Arceneaux's avatar
Joseph Arceneaux committed
202
static void compact_strings ();
203 204
static void mark_glyph_matrix P_ ((struct glyph_matrix *));
static void mark_face_cache P_ ((struct face_cache *));
205 206 207
#if 0
static void clear_marks ();
#endif
208 209 210 211 212 213

#ifdef HAVE_WINDOW_SYSTEM
static void mark_image P_ ((struct image *));
static void mark_image_cache P_ ((struct frame *));
#endif /* HAVE_WINDOW_SYSTEM */

Richard M. Stallman's avatar
Richard M. Stallman committed
214 215

extern int message_enable_multibyte;
Jim Blandy's avatar
Jim Blandy committed
216

217 218
/* Versions of malloc and realloc that print warnings as memory gets full.  */

Jim Blandy's avatar
Jim Blandy committed
219 220 221 222 223 224 225 226 227 228 229 230
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 */
231 232

void
Jim Blandy's avatar
Jim Blandy committed
233 234 235 236 237 238
malloc_warning (str)
     char *str;
{
  pending_malloc_warning = str;
}

239
void
Jim Blandy's avatar
Jim Blandy committed
240 241 242 243 244 245 246 247 248
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);
}

249
#ifdef DOUG_LEA_MALLOC
250
#  define BYTES_USED (mallinfo ().arena)
251
#else
252
#  define BYTES_USED _bytes_used
253 254
#endif

Jim Blandy's avatar
Jim Blandy committed
255
/* Called if malloc returns zero */
256

257
void
Jim Blandy's avatar
Jim Blandy committed
258 259
memory_full ()
{
260
#ifndef SYSTEM_MALLOC
261
  bytes_used_when_full = BYTES_USED;
262 263 264 265 266 267 268 269 270 271 272 273
#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)
274
    Fsignal (Qnil, memory_signal_data);
275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292
}

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

293 294 295 296
  /* 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
297 298
}

299
/* Like malloc routines but check for no memory and block interrupt input.  */
Jim Blandy's avatar
Jim Blandy committed
300 301 302 303 304 305 306

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

307
  BLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
308
  val = (long *) malloc (size);
309
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
310 311 312 313 314 315 316 317 318 319 320 321

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

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

322
  BLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
323 324 325 326
  /* 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
327
  else
Jim Blandy's avatar
Jim Blandy committed
328
    val = (long *) realloc (block, size);
329
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
330 331 332 333

  if (!val && size) memory_full ();
  return val;
}
334 335 336 337 338 339 340 341 342 343

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

344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371
/* Like malloc but used for allocating Lisp data.  */

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

  BLOCK_INPUT;
  allocating_for_lisp++;
  val = (long *) malloc (size);
  allocating_for_lisp--;
  UNBLOCK_INPUT;

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

void
lisp_free (block)
     long *block;
{
  BLOCK_INPUT;
  allocating_for_lisp++;
  free (block);
  allocating_for_lisp--;
  UNBLOCK_INPUT;
}
372 373 374 375 376 377 378 379 380 381 382 383

/* 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
384 385 386 387 388 389
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) ();
390

391 392
/* This function is used as the hook for free to call.  */

393 394 395 396 397 398 399
static void
emacs_blocked_free (ptr)
     void *ptr;
{
  BLOCK_INPUT;
  __free_hook = old_free_hook;
  free (ptr);
400 401 402 403 404 405 406 407 408
  /* 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
409
	  > BYTES_USED + max (malloc_hysteresis, 4) * SPARE_MEMORY))
410 411
    spare_memory = (char *) malloc (SPARE_MEMORY);

412
  __free_hook = emacs_blocked_free;
413 414 415
  UNBLOCK_INPUT;
}

416 417 418 419 420 421 422 423 424 425 426 427 428 429 430
/* 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.  */

431 432 433 434 435 436 437 438
static void *
emacs_blocked_malloc (size)
     unsigned size;
{
  void *value;

  BLOCK_INPUT;
  __malloc_hook = old_malloc_hook;
439
#ifdef DOUG_LEA_MALLOC
440
    mallopt (M_TOP_PAD, malloc_hysteresis * 4096);
441
#else
442
    __malloc_extra_blocks = malloc_hysteresis;
443
#endif
444
  value = (void *) malloc (size);
445
  __malloc_hook = emacs_blocked_malloc;
446 447 448 449 450 451 452 453 454 455 456 457 458 459
  UNBLOCK_INPUT;

  return value;
}

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

  BLOCK_INPUT;
  __realloc_hook = old_realloc_hook;
460
  value = (void *) realloc (ptr, size);
461
  __realloc_hook = emacs_blocked_realloc;
462 463 464 465 466 467 468 469
  UNBLOCK_INPUT;

  return value;
}

void
uninterrupt_malloc ()
{
470 471
  if (__free_hook != emacs_blocked_free)
    old_free_hook = __free_hook;
472
  __free_hook = emacs_blocked_free;
473

474 475
  if (__malloc_hook != emacs_blocked_malloc)
    old_malloc_hook = __malloc_hook;
476
  __malloc_hook = emacs_blocked_malloc;
477

478 479
  if (__realloc_hook != emacs_blocked_realloc)
    old_realloc_hook = __realloc_hook;
480
  __realloc_hook = emacs_blocked_realloc;
481 482
}
#endif
Jim Blandy's avatar
Jim Blandy committed
483

484 485
/* Interval allocation.  */

486 487 488 489 490 491 492 493 494 495 496 497 498 499
#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;

500 501 502
/* Total number of interval blocks now in use.  */
int n_interval_blocks;

503 504 505 506
static void
init_intervals ()
{
  interval_block
507
    = (struct interval_block *) lisp_malloc (sizeof (struct interval_block));
508
  interval_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
509
  bzero ((char *) interval_block->intervals, sizeof interval_block->intervals);
510 511
  interval_block_index = 0;
  interval_free_list = 0;
512
  n_interval_blocks = 1;
513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530
}

#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
531 532
	  register struct interval_block *newi;

533
	  newi = (struct interval_block *) lisp_malloc (sizeof (struct interval_block));
534 535 536 537 538

	  VALIDATE_LISP_STORAGE (newi, sizeof *newi);
	  newi->next = interval_block;
	  interval_block = newi;
	  interval_block_index = 0;
539
	  n_interval_blocks++;
540 541 542 543
	}
      val = &interval_block->intervals[interval_block_index++];
    }
  consing_since_gc += sizeof (struct interval);
544
  intervals_consed++;
545 546 547 548 549 550 551 552 553
  RESET_INTERVAL (val);
  return val;
}

static int total_free_intervals, total_intervals;

/* Mark the pointers of one interval. */

static void
554
mark_interval (i, dummy)
555
     register INTERVAL i;
556
     Lisp_Object dummy;
557 558 559 560 561 562 563 564 565 566 567
{
  if (XMARKBIT (i->plist))
    abort ();
  mark_object (&i->plist);
  XMARK (i->plist);
}

static void
mark_interval_tree (tree)
     register INTERVAL tree;
{
568 569 570 571 572 573 574
  /* 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);
575

576
  traverse_intervals (tree, 1, 0, mark_interval, Qnil);
577 578
}

579 580 581
#define MARK_INTERVAL_TREE(i)				\
  do {							\
    if (!NULL_INTERVAL_P (i)				\
582
	&& ! XMARKBIT (*(Lisp_Object *) &i->parent))	\
583 584
      mark_interval_tree (i);				\
  } while (0)
585

586
/* The oddity in the call to XUNMARK is necessary because XUNMARK
587
   expands to an assignment to its argument, and most C compilers don't
588 589 590 591 592 593 594 595
   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);				\
     } 								\
596 597 598
}


599 600
/* Floating point allocation.  */

Jim Blandy's avatar
Jim Blandy committed
601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623
#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;

624 625 626
/* Total number of float blocks now in use.  */
int n_float_blocks;

Jim Blandy's avatar
Jim Blandy committed
627 628 629 630 631
struct Lisp_Float *float_free_list;

void
init_float ()
{
632
  float_block = (struct float_block *) lisp_malloc (sizeof (struct float_block));
Jim Blandy's avatar
Jim Blandy committed
633
  float_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
634
  bzero ((char *) float_block->floats, sizeof float_block->floats);
Jim Blandy's avatar
Jim Blandy committed
635 636
  float_block_index = 0;
  float_free_list = 0;
637
  n_float_blocks = 1;
Jim Blandy's avatar
Jim Blandy committed
638 639 640
}

/* Explicitly free a float cell.  */
Andreas Schwab's avatar
Andreas Schwab committed
641
void
Jim Blandy's avatar
Jim Blandy committed
642 643 644
free_float (ptr)
     struct Lisp_Float *ptr;
{
645
  *(struct Lisp_Float **)&ptr->data = float_free_list;
Jim Blandy's avatar
Jim Blandy committed
646 647 648 649 650 651 652 653 654 655 656
  float_free_list = ptr;
}

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

  if (float_free_list)
    {
657 658
      /* We use the data field for chaining the free list
	 so that we won't use the same field that has the mark bit.  */
659
      XSETFLOAT (val, float_free_list);
660
      float_free_list = *(struct Lisp_Float **)&float_free_list->data;
Jim Blandy's avatar
Jim Blandy committed
661 662 663 664 665
    }
  else
    {
      if (float_block_index == FLOAT_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
666 667
	  register struct float_block *new;

668
	  new = (struct float_block *) lisp_malloc (sizeof (struct float_block));
Jim Blandy's avatar
Jim Blandy committed
669 670 671 672
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = float_block;
	  float_block = new;
	  float_block_index = 0;
673
	  n_float_blocks++;
Jim Blandy's avatar
Jim Blandy committed
674
	}
675
      XSETFLOAT (val, &float_block->floats[float_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
676
    }
677
  XFLOAT_DATA (val) = float_value;
678
  XSETFASTINT (XFLOAT (val)->type, 0);	/* bug chasing -wsr */
Jim Blandy's avatar
Jim Blandy committed
679
  consing_since_gc += sizeof (struct Lisp_Float);
680
  floats_consed++;
Jim Blandy's avatar
Jim Blandy committed
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
  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;

710 711 712
/* Total number of cons blocks now in use.  */
int n_cons_blocks;

Jim Blandy's avatar
Jim Blandy committed
713 714 715
void
init_cons ()
{
716
  cons_block = (struct cons_block *) lisp_malloc (sizeof (struct cons_block));
Jim Blandy's avatar
Jim Blandy committed
717
  cons_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
718
  bzero ((char *) cons_block->conses, sizeof cons_block->conses);
Jim Blandy's avatar
Jim Blandy committed
719 720
  cons_block_index = 0;
  cons_free_list = 0;
721
  n_cons_blocks = 1;
Jim Blandy's avatar
Jim Blandy committed
722 723 724
}

/* Explicitly free a cons cell.  */
725 726

void
Jim Blandy's avatar
Jim Blandy committed
727 728 729
free_cons (ptr)
     struct Lisp_Cons *ptr;
{
730
  *(struct Lisp_Cons **)&ptr->cdr = cons_free_list;
Jim Blandy's avatar
Jim Blandy committed
731 732 733 734 735 736 737 738 739 740 741 742
  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)
    {
743 744
      /* We use the cdr for chaining the free list
	 so that we won't use the same field that has the mark bit.  */
745
      XSETCONS (val, cons_free_list);
746
      cons_free_list = *(struct Lisp_Cons **)&cons_free_list->cdr;
Jim Blandy's avatar
Jim Blandy committed
747 748 749 750 751
    }
  else
    {
      if (cons_block_index == CONS_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
752
	  register struct cons_block *new;
753
	  new = (struct cons_block *) lisp_malloc (sizeof (struct cons_block));
Jim Blandy's avatar
Jim Blandy committed
754 755 756 757
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = cons_block;
	  cons_block = new;
	  cons_block_index = 0;
758
	  n_cons_blocks++;
Jim Blandy's avatar
Jim Blandy committed
759
	}
760
      XSETCONS (val, &cons_block->conses[cons_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
761
    }
762 763
  XCAR (val) = car;
  XCDR (val) = cdr;
Jim Blandy's avatar
Jim Blandy committed
764
  consing_since_gc += sizeof (struct Lisp_Cons);
765
  cons_cells_consed++;
Jim Blandy's avatar
Jim Blandy committed
766 767
  return val;
}
768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798

/* Make a list of 2, 3, 4 or 5 specified objects.  */

Lisp_Object
list2 (arg1, arg2)
     Lisp_Object arg1, arg2;
{
  return Fcons (arg1, Fcons (arg2, Qnil));
}

Lisp_Object
list3 (arg1, arg2, arg3)
     Lisp_Object arg1, arg2, arg3;
{
  return Fcons (arg1, Fcons (arg2, Fcons (arg3, Qnil)));
}

Lisp_Object
list4 (arg1, arg2, arg3, arg4)
     Lisp_Object arg1, arg2, arg3, arg4;
{
  return Fcons (arg1, Fcons (arg2, Fcons (arg3, Fcons (arg4, Qnil))));
}

Lisp_Object
list5 (arg1, arg2, arg3, arg4, arg5)
     Lisp_Object arg1, arg2, arg3, arg4, arg5;
{
  return Fcons (arg1, Fcons (arg2, Fcons (arg3, Fcons (arg4,
						       Fcons (arg5, Qnil)))));
}
Jim Blandy's avatar
Jim Blandy committed
799 800 801 802 803 804 805 806

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;
{
807 808
  register Lisp_Object val;
  val = Qnil;
Jim Blandy's avatar
Jim Blandy committed
809

810 811 812 813 814
  while (nargs > 0)
    {
      nargs--;
      val = Fcons (args[nargs], val);
    }
Jim Blandy's avatar
Jim Blandy committed
815 816 817 818 819 820 821 822 823 824 825
  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;

826 827
  CHECK_NATNUM (length, 0);
  size = XFASTINT (length);
Jim Blandy's avatar
Jim Blandy committed
828 829 830 831 832 833 834 835 836 837 838

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

struct Lisp_Vector *all_vectors;

839 840 841
/* Total number of vectorlike objects now in use.  */
int n_vectors;

842 843 844 845 846 847
struct Lisp_Vector *
allocate_vectorlike (len)
     EMACS_INT len;
{
  struct Lisp_Vector *p;

848 849 850 851
#ifdef DOUG_LEA_MALLOC
  /* Prevent mmap'ing the chunk (which is potentially very large). */
  mallopt (M_MMAP_MAX, 0);
#endif
852
  p = (struct Lisp_Vector *)lisp_malloc (sizeof (struct Lisp_Vector)
853
				     + (len - 1) * sizeof (Lisp_Object));
854 855
#ifdef DOUG_LEA_MALLOC
  /* Back to a reasonable maximum of mmap'ed areas. */
856
  mallopt (M_MMAP_MAX, MMAP_MAX_AREAS);
857
#endif
858 859 860
  VALIDATE_LISP_STORAGE (p, 0);
  consing_since_gc += (sizeof (struct Lisp_Vector)
		       + (len - 1) * sizeof (Lisp_Object));
861
  vector_cells_consed += len;
862
  n_vectors++;
863 864 865 866 867 868

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

Jim Blandy's avatar
Jim Blandy committed
869 870 871 872 873 874
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;
{
875 876 877
  Lisp_Object vector;
  register EMACS_INT sizei;
  register int index;
Jim Blandy's avatar
Jim Blandy committed
878 879
  register struct Lisp_Vector *p;

880 881
  CHECK_NATNUM (length, 0);
  sizei = XFASTINT (length);
Jim Blandy's avatar
Jim Blandy committed
882

883
  p = allocate_vectorlike (sizei);
Jim Blandy's avatar
Jim Blandy committed
884 885 886 887
  p->size = sizei;
  for (index = 0; index < sizei; index++)
    p->contents[index] = init;

888
  XSETVECTOR (vector, p);
Jim Blandy's avatar
Jim Blandy committed
889 890 891
  return vector;
}

892
DEFUN ("make-char-table", Fmake_char_table, Smake_char_table, 1, 2, 0,
893
  "Return a newly created char-table, with purpose PURPOSE.\n\
894
Each element is initialized to INIT, which defaults to nil.\n\
Erik Naggum's avatar
Erik Naggum committed
895
PURPOSE should be a symbol which has a `char-table-extra-slots' property.\n\
896 897 898
The property's value should be an integer between 0 and 10.")
  (purpose, init)
     register Lisp_Object purpose, init;
899 900
{
  Lisp_Object vector;
901 902
  Lisp_Object n;
  CHECK_SYMBOL (purpose, 1);
903
  n = Fget (purpose, Qchar_table_extra_slots);
904
  CHECK_NUMBER (n, 0);
905 906 907 908 909
  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);
910
  XCHAR_TABLE (vector)->top = Qt;
911
  XCHAR_TABLE (vector)->parent = Qnil;
912
  XCHAR_TABLE (vector)->purpose = purpose;
913 914 915 916
  XSETCHAR_TABLE (vector, XCHAR_TABLE (vector));
  return vector;
}

917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932
/* 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
933 934 935 936 937 938 939 940 941 942 943
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;

944
  XSETFASTINT (len, nargs);
Jim Blandy's avatar
Jim Blandy committed
945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965
  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;

966
  XSETFASTINT (len, nargs);
Jim Blandy's avatar
Jim Blandy committed
967
  if (!NILP (Vpurify_flag))
968
    val = make_pure_vector ((EMACS_INT) nargs);
Jim Blandy's avatar
Jim Blandy committed
969 970 971 972 973
  else
    val = Fmake_vector (len, Qnil);
  p = XVECTOR (val);
  for (index = 0; index < nargs; index++)
    {
Jim Blandy's avatar
Jim Blandy committed
974
      if (!NILP (Vpurify_flag))
Jim Blandy's avatar
Jim Blandy committed
975 976 977
	args[index] = Fpurecopy (args[index]);
      p->contents[index] = args[index];
    }
978
  XSETCOMPILED (val, p);
Jim Blandy's avatar
Jim Blandy committed
979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002
  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;

1003 1004 1005
/* Total number of symbol blocks now in use.  */
int n_symbol_blocks;

Jim Blandy's avatar
Jim Blandy committed
1006 1007 1008
void
init_symbol ()
{
1009
  symbol_block = (struct symbol_block *) lisp_malloc (sizeof (struct symbol_block));
Jim Blandy's avatar
Jim Blandy committed
1010
  symbol_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
1011
  bzero ((char *) symbol_block->symbols, sizeof symbol_block->symbols);
Jim Blandy's avatar
Jim Blandy committed
1012 1013
  symbol_block_index = 0;
  symbol_free_list = 0;
1014
  n_symbol_blocks = 1;
Jim Blandy's avatar
Jim Blandy committed
1015 1016 1017 1018 1019
}

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.")
1020 1021
  (name)
     Lisp_Object name;
Jim Blandy's avatar
Jim Blandy committed
1022 1023 1024 1025
{
  register Lisp_Object val;
  register struct Lisp_Symbol *p;

1026
  CHECK_STRING (name, 0);
Jim Blandy's avatar
Jim Blandy committed
1027 1028 1029

  if (symbol_free_list)
    {
1030
      XSETSYMBOL (val, symbol_free_list);
1031
      symbol_free_list = *(struct Lisp_Symbol **)&symbol_free_list->value;
Jim Blandy's avatar
Jim Blandy committed
1032 1033 1034 1035 1036
    }
  else
    {
      if (symbol_block_index == SYMBOL_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
1037
	  struct symbol_block *new;
1038
	  new = (struct symbol_block *) lisp_malloc (sizeof (struct symbol_block));
Jim Blandy's avatar
Jim Blandy committed
1039 1040 1041 1042
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = symbol_block;
	  symbol_block = new;
	  symbol_block_index = 0;
1043
	  n_symbol_blocks++;
Jim Blandy's avatar
Jim Blandy committed
1044
	}
1045
      XSETSYMBOL (val, &symbol_block->symbols[symbol_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
1046 1047
    }
  p = XSYMBOL (val);
1048
  p->name = XSTRING (name);
1049
  p->obarray = Qnil;
Jim Blandy's avatar
Jim Blandy committed
1050 1051 1052 1053 1054
  p->plist = Qnil;
  p->value = Qunbound;
  p->function = Qunbound;
  p->next = 0;
  consing_since_gc += sizeof (struct Lisp_Symbol);
1055
  symbols_consed++;
Jim Blandy's avatar
Jim Blandy committed
1056 1057 1058
  return val;
}

1059
/* Allocation of markers and other objects that share that structure.
Jim Blandy's avatar
Jim Blandy committed
1060 1061 1062
   Works like allocation of conses. */

#define MARKER_BLOCK_SIZE \
1063
  ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
Jim Blandy's avatar
Jim Blandy committed
1064 1065

struct marker_block
1066
{
Jim Blandy's avatar
Jim Blandy committed
1067
    struct marker_block *next;
1068
    union Lisp_Misc markers[MARKER_BLOCK_SIZE];
Jim Blandy's avatar
Jim Blandy committed
1069 1070 1071 1072 1073
  };

struct marker_block *marker_block;
int marker_block_index;

1074
union Lisp_Misc *marker_free_list;
Jim Blandy's avatar
Jim Blandy committed
1075

1076 1077 1078
/* Total number of marker blocks now in use.  */
int n_marker_blocks;

Jim Blandy's avatar
Jim Blandy committed
1079 1080 1081
void
init_marker ()
{
1082
  marker_block = (struct marker_block *) lisp_malloc (sizeof (struct marker_block));
Jim Blandy's avatar
Jim Blandy committed
1083
  marker_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
1084
  bzero ((char *) marker_block->markers, sizeof marker_block->markers);
Jim Blandy's avatar
Jim Blandy committed
1085 1086
  marker_block_index = 0;
  marker_free_list = 0;
1087
  n_marker_blocks = 1;
Jim Blandy's avatar
Jim Blandy committed
1088 1089
}

1090 1091 1092
/* Return a newly allocated Lisp_Misc object, with no substructure.  */
Lisp_Object
allocate_misc ()
Jim Blandy's avatar
Jim Blandy committed
1093
{
1094
  Lisp_Object val;
Jim Blandy's avatar
Jim Blandy committed
1095

Jim Blandy's avatar
Jim Blandy committed
1096 1097
  if (marker_free_list)
    {
1098 1099
      XSETMISC (val, marker_free_list);
      marker_free_list = marker_free_list->u_free.chain;
Jim Blandy's avatar
Jim Blandy committed
1100 1101 1102 1103 1104
    }
  else
    {
      if (marker_block_index == MARKER_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
1105
	  struct marker_block *new;
1106
	  new = (struct marker_block *) lisp_malloc (sizeof (struct marker_block));
Jim Blandy's avatar
Jim Blandy committed
1107 1108 1109 1110
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = marker_block;
	  marker_block = new;
	  marker_block_index = 0;
1111
	  n_marker_blocks++;
Jim Blandy's avatar
Jim Blandy committed
1112
	}