alloc.c 90.4 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

Jim Blandy's avatar
Jim Blandy committed
27
#include "lisp.h"
28
#include "intervals.h"
Jim Blandy's avatar
Jim Blandy committed
29
#include "puresize.h"
Jim Blandy's avatar
Jim Blandy committed
30 31 32
#ifndef standalone
#include "buffer.h"
#include "window.h"
Jim Blandy's avatar
Jim Blandy committed
33
#include "frame.h"
34
#include "blockinput.h"
Richard M. Stallman's avatar
Richard M. Stallman committed
35
#include "keyboard.h"
36
#include "charset.h"
Jim Blandy's avatar
Jim Blandy committed
37 38
#endif

Jim Blandy's avatar
Jim Blandy committed
39 40
#include "syssignal.h"

Karl Heuer's avatar
Karl Heuer committed
41 42
extern char *sbrk ();

43 44 45
#ifdef DOUG_LEA_MALLOC
#include <malloc.h>
#define __malloc_size_t int
46 47 48 49 50 51

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

52
#else
53 54 55 56 57 58 59 60 61 62
/* 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;
63
#endif /* !defined(DOUG_LEA_MALLOC) */
64

Jim Blandy's avatar
Jim Blandy committed
65
#define max(A,B) ((A) > (B) ? (A) : (B))
66
#define min(A,B) ((A) < (B) ? (A) : (B))
Jim Blandy's avatar
Jim Blandy committed
67 68 69 70 71 72 73 74 75

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

84 85 86
/* Value of _bytes_used, when spare_memory was freed.  */
static __malloc_size_t bytes_used_when_full;

Jim Blandy's avatar
Jim Blandy committed
87 88 89
/* Number of bytes of consing done since the last gc */
int consing_since_gc;

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

/* Nonzero during gc */
int gc_in_progress;

105 106 107
/* Nonzero means display messages at beginning and end of GC.  */
int garbage_collection_messages;

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

122 123 124 125 126 127
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 */

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

Jim Blandy's avatar
Jim Blandy committed
141 142 143 144
/* Non-nil means defun should do purecopy on the function definition */
Lisp_Object Vpurify_flag;

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

/* 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.  */
157
EMACS_INT pure_size;
Jim Blandy's avatar
Jim Blandy committed
158 159 160 161 162 163 164 165
#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;

166
/* Pre-computed signal argument for use when memory is exhausted.  */
167
Lisp_Object memory_signal_data;
168

Jim Blandy's avatar
Jim Blandy committed
169 170 171 172 173 174
/* Maximum amount of C stack to save when a GC happens.  */

#ifndef MAX_SAVE_STACK
#define MAX_SAVE_STACK 16000
#endif

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

Jim Blandy's avatar
Jim Blandy committed
186 187 188 189 190 191 192
/* 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
193

194
Lisp_Object Qgc_cons_threshold, Qchar_table_extra_slots;
195

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

#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
210 211

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

Jim Blandy's avatar
Jim Blandy committed
215 216 217 218 219 220 221 222 223 224 225 226
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 */
227 228

void
Jim Blandy's avatar
Jim Blandy committed
229 230 231 232 233 234
malloc_warning (str)
     char *str;
{
  pending_malloc_warning = str;
}

235
void
Jim Blandy's avatar
Jim Blandy committed
236 237 238 239 240 241 242 243 244
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);
}

245
#ifdef DOUG_LEA_MALLOC
246
#  define BYTES_USED (mallinfo ().arena)
247
#else
248
#  define BYTES_USED _bytes_used
249 250
#endif

Jim Blandy's avatar
Jim Blandy committed
251
/* Called if malloc returns zero */
252

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

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

289 290 291 292
  /* 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
293 294
}

295
/* Like malloc routines but check for no memory and block interrupt input.  */
Jim Blandy's avatar
Jim Blandy committed
296 297 298 299 300 301 302

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

303
  BLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
304
  val = (long *) malloc (size);
305
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
306 307 308 309 310 311 312 313 314 315 316 317

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

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

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

  if (!val && size) memory_full ();
  return val;
}
330 331 332 333 334 335 336 337 338 339

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

340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367
/* 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;
}
368 369 370 371 372 373 374 375 376 377 378 379

/* 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
380 381 382 383 384 385
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) ();
386

387 388
/* This function is used as the hook for free to call.  */

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

408
  __free_hook = emacs_blocked_free;
409 410 411
  UNBLOCK_INPUT;
}

412 413 414 415 416 417 418 419 420 421 422 423 424 425 426
/* 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.  */

427 428 429 430 431 432 433 434
static void *
emacs_blocked_malloc (size)
     unsigned size;
{
  void *value;

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

  return value;
}

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

  BLOCK_INPUT;
  __realloc_hook = old_realloc_hook;
456
  value = (void *) realloc (ptr, size);
457
  __realloc_hook = emacs_blocked_realloc;
458 459 460 461 462 463 464 465
  UNBLOCK_INPUT;

  return value;
}

void
uninterrupt_malloc ()
{
466 467
  if (__free_hook != emacs_blocked_free)
    old_free_hook = __free_hook;
468
  __free_hook = emacs_blocked_free;
469

470 471
  if (__malloc_hook != emacs_blocked_malloc)
    old_malloc_hook = __malloc_hook;
472
  __malloc_hook = emacs_blocked_malloc;
473

474 475
  if (__realloc_hook != emacs_blocked_realloc)
    old_realloc_hook = __realloc_hook;
476
  __realloc_hook = emacs_blocked_realloc;
477 478
}
#endif
Jim Blandy's avatar
Jim Blandy committed
479

480 481
/* Interval allocation.  */

482 483 484 485 486 487 488 489 490 491 492 493 494 495 496
#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;

497 498 499
/* Total number of interval blocks now in use.  */
int n_interval_blocks;

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

#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
528 529
	  register struct interval_block *newi;

530
	  newi = (struct interval_block *) lisp_malloc (sizeof (struct interval_block));
531 532 533 534 535

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

static int total_free_intervals, total_intervals;

/* Mark the pointers of one interval. */

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

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

573
  traverse_intervals (tree, 1, 0, mark_interval, Qnil);
574 575
}

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

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

#else  /* no interval use */

#define INIT_INTERVALS

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

#endif /* no interval use */

604 605
/* Floating point allocation.  */

Jim Blandy's avatar
Jim Blandy committed
606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628
#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;

629 630 631
/* Total number of float blocks now in use.  */
int n_float_blocks;

Jim Blandy's avatar
Jim Blandy committed
632 633 634 635 636
struct Lisp_Float *float_free_list;

void
init_float ()
{
637
  float_block = (struct float_block *) lisp_malloc (sizeof (struct float_block));
Jim Blandy's avatar
Jim Blandy committed
638
  float_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
639
  bzero ((char *) float_block->floats, sizeof float_block->floats);
Jim Blandy's avatar
Jim Blandy committed
640 641
  float_block_index = 0;
  float_free_list = 0;
642
  n_float_blocks = 1;
Jim Blandy's avatar
Jim Blandy committed
643 644 645
}

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

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

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

673
	  new = (struct float_block *) lisp_malloc (sizeof (struct float_block));
Jim Blandy's avatar
Jim Blandy committed
674 675 676 677
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = float_block;
	  float_block = new;
	  float_block_index = 0;
678
	  n_float_blocks++;
Jim Blandy's avatar
Jim Blandy committed
679
	}
680
      XSETFLOAT (val, &float_block->floats[float_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
681
    }
682
  XFLOAT_DATA (val) = float_value;
683
  XSETFASTINT (XFLOAT (val)->type, 0);	/* bug chasing -wsr */
Jim Blandy's avatar
Jim Blandy committed
684
  consing_since_gc += sizeof (struct Lisp_Float);
685
  floats_consed++;
Jim Blandy's avatar
Jim Blandy committed
686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714
  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;

715 716 717
/* Total number of cons blocks now in use.  */
int n_cons_blocks;

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

/* Explicitly free a cons cell.  */
730 731

void
Jim Blandy's avatar
Jim Blandy committed
732 733 734
free_cons (ptr)
     struct Lisp_Cons *ptr;
{
735
  *(struct Lisp_Cons **)&ptr->cdr = cons_free_list;
Jim Blandy's avatar
Jim Blandy committed
736 737 738 739 740 741 742 743 744 745 746 747
  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)
    {
748 749
      /* We use the cdr for chaining the free list
	 so that we won't use the same field that has the mark bit.  */
750
      XSETCONS (val, cons_free_list);
751
      cons_free_list = *(struct Lisp_Cons **)&cons_free_list->cdr;
Jim Blandy's avatar
Jim Blandy committed
752 753 754 755 756
    }
  else
    {
      if (cons_block_index == CONS_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
757
	  register struct cons_block *new;
758
	  new = (struct cons_block *) lisp_malloc (sizeof (struct cons_block));
Jim Blandy's avatar
Jim Blandy committed
759 760 761 762
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = cons_block;
	  cons_block = new;
	  cons_block_index = 0;
763
	  n_cons_blocks++;
Jim Blandy's avatar
Jim Blandy committed
764
	}
765
      XSETCONS (val, &cons_block->conses[cons_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
766
    }
767 768
  XCAR (val) = car;
  XCDR (val) = cdr;
Jim Blandy's avatar
Jim Blandy committed
769
  consing_since_gc += sizeof (struct Lisp_Cons);
770
  cons_cells_consed++;
Jim Blandy's avatar
Jim Blandy committed
771 772
  return val;
}
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 799 800 801 802 803

/* 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
804 805 806 807 808 809 810 811

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;
{
812 813
  register Lisp_Object val;
  val = Qnil;
Jim Blandy's avatar
Jim Blandy committed
814

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

831 832
  CHECK_NATNUM (length, 0);
  size = XFASTINT (length);
Jim Blandy's avatar
Jim Blandy committed
833 834 835 836 837 838 839 840 841 842 843

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

struct Lisp_Vector *all_vectors;

844 845 846
/* Total number of vectorlike objects now in use.  */
int n_vectors;

847 848 849 850 851 852
struct Lisp_Vector *
allocate_vectorlike (len)
     EMACS_INT len;
{
  struct Lisp_Vector *p;

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

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

Jim Blandy's avatar
Jim Blandy committed
874 875 876 877 878 879
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;
{
880 881 882
  Lisp_Object vector;
  register EMACS_INT sizei;
  register int index;
Jim Blandy's avatar
Jim Blandy committed
883 884
  register struct Lisp_Vector *p;

885 886
  CHECK_NATNUM (length, 0);
  sizei = XFASTINT (length);
Jim Blandy's avatar
Jim Blandy committed
887

888
  p = allocate_vectorlike (sizei);
Jim Blandy's avatar
Jim Blandy committed
889 890 891 892
  p->size = sizei;
  for (index = 0; index < sizei; index++)
    p->contents[index] = init;

893
  XSETVECTOR (vector, p);
Jim Blandy's avatar
Jim Blandy committed
894 895 896
  return vector;
}

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

922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937
/* 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
938 939 940 941 942 943 944 945 946 947 948
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;

949
  XSETFASTINT (len, nargs);
Jim Blandy's avatar
Jim Blandy committed
950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970
  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;

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

1008 1009 1010
/* Total number of symbol blocks now in use.  */
int n_symbol_blocks;

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

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.")
1025 1026
  (name)
     Lisp_Object name;
Jim Blandy's avatar
Jim Blandy committed
1027 1028 1029 1030
{
  register Lisp_Object val;
  register struct Lisp_Symbol *p;

1031
  CHECK_STRING (name, 0);
Jim Blandy's avatar
Jim Blandy committed
1032 1033 1034

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

#define MARKER_BLOCK_SIZE \
1068
  ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
Jim Blandy's avatar
Jim Blandy committed
1069 1070

struct marker_block
1071
{
Jim Blandy's avatar
Jim Blandy committed
1072
    struct marker_block *next;
1073
    union Lisp_Misc markers[MARKER_BLOCK_SIZE];
Jim Blandy's avatar
Jim Blandy committed
1074 1075 1076 1077 1078
  };

struct marker_block *marker_block;
int marker_block_index;

1079
union Lisp_Misc *marker_free_list;
Jim Blandy's avatar
Jim Blandy committed
1080

1081 1082 1083
/* Total number of marker blocks now in use.  */
int n_marker_blocks;

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

1095 1096 1097
/* Return a newly allocated Lisp_Misc object, with no substructure.  */
Lisp_Object
allocate_misc ()
Jim Blandy's avatar
Jim Blandy committed
1098
{
1099
  Lisp_Object val;
Jim Blandy's avatar
Jim Blandy committed
1100

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