alloc.c 79.5 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 3
   Copyright (C) 1985, 86, 88, 93, 94, 95, 97, 1998
      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

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

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

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

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

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

57 58
extern Lisp_Object Vhistory_length;

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

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

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

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

84 85 86 87 88 89 90 91 92
/* 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
93
/* Number of bytes of consing since gc before another gc should be done. */
94
int gc_cons_threshold;
Jim Blandy's avatar
Jim Blandy committed
95 96 97 98

/* Nonzero during gc */
int gc_in_progress;

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

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

116 117 118 119 120 121
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 */

122 123 124 125 126 127 128 129 130 131
/* 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
132 133 134
/* Nonzero when malloc is called for allocating Lisp object space.  */
int allocating_for_lisp;

Jim Blandy's avatar
Jim Blandy committed
135 136 137 138
/* Non-nil means defun should do purecopy on the function definition */
Lisp_Object Vpurify_flag;

#ifndef HAVE_SHM
139
EMACS_INT pure[PURESIZE / sizeof (EMACS_INT)] = {0,};   /* Force it into data space! */
Jim Blandy's avatar
Jim Blandy committed
140 141 142 143
#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
144 145 146 147 148 149 150

/* 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.  */
151
EMACS_INT pure_size;
Jim Blandy's avatar
Jim Blandy committed
152 153 154 155 156 157 158 159
#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;

160
/* Pre-computed signal argument for use when memory is exhausted.  */
161
Lisp_Object memory_signal_data;
162

Jim Blandy's avatar
Jim Blandy committed
163 164 165 166 167 168
/* Maximum amount of C stack to save when a GC happens.  */

#ifndef MAX_SAVE_STACK
#define MAX_SAVE_STACK 16000
#endif

169 170 171
/* 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
172
   Word-addressable architectures may need to override this in the m-file.)
173 174 175
   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.  */
176
#ifndef DONT_COPY_FLAG
177
#define DONT_COPY_FLAG 1
178 179
#endif /* no DONT_COPY_FLAG  */

Jim Blandy's avatar
Jim Blandy committed
180 181 182 183 184 185 186
/* 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
187

188
Lisp_Object Qgc_cons_threshold, Qchar_table_extra_slots;
189

190
static void mark_object (), mark_buffer (), mark_kboards ();
Joseph Arceneaux's avatar
Joseph Arceneaux committed
191 192
static void clear_marks (), gc_sweep ();
static void compact_strings ();
Richard M. Stallman's avatar
Richard M. Stallman committed
193 194

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

Jim Blandy's avatar
Jim Blandy committed
198 199 200 201 202 203 204 205 206 207 208 209
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 */
210 211

void
Jim Blandy's avatar
Jim Blandy committed
212 213 214 215 216 217
malloc_warning (str)
     char *str;
{
  pending_malloc_warning = str;
}

218
void
Jim Blandy's avatar
Jim Blandy committed
219 220 221 222 223 224 225 226 227
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);
}

228
#ifdef DOUG_LEA_MALLOC
229
#  define BYTES_USED (mallinfo ().arena)
230
#else
231
#  define BYTES_USED _bytes_used
232 233
#endif

Jim Blandy's avatar
Jim Blandy committed
234
/* Called if malloc returns zero */
235

236
void
Jim Blandy's avatar
Jim Blandy committed
237 238
memory_full ()
{
239
#ifndef SYSTEM_MALLOC
240
  bytes_used_when_full = BYTES_USED;
241 242 243 244 245 246 247 248 249 250 251 252
#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)
253
    Fsignal (Qnil, memory_signal_data);
254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271
}

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

272 273 274 275
  /* 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
276 277
}

278
/* like malloc routines but check for no memory and block interrupt input.  */
Jim Blandy's avatar
Jim Blandy committed
279 280 281 282 283 284 285

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

286
  BLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
287
  val = (long *) malloc (size);
288
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
289 290 291 292 293 294 295 296 297 298 299 300

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

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

301
  BLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
302 303 304 305
  /* 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
306
  else
Jim Blandy's avatar
Jim Blandy committed
307
    val = (long *) realloc (block, size);
308
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
309 310 311 312

  if (!val && size) memory_full ();
  return val;
}
313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334

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
335 336 337 338 339 340
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) ();
341

342 343
/* This function is used as the hook for free to call.  */

344 345 346 347 348 349 350
static void
emacs_blocked_free (ptr)
     void *ptr;
{
  BLOCK_INPUT;
  __free_hook = old_free_hook;
  free (ptr);
351 352 353 354 355 356 357 358 359
  /* 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
360
	  > BYTES_USED + max (malloc_hysteresis, 4) * SPARE_MEMORY))
361 362
    spare_memory = (char *) malloc (SPARE_MEMORY);

363
  __free_hook = emacs_blocked_free;
364 365 366
  UNBLOCK_INPUT;
}

367 368 369 370 371 372 373 374 375 376 377 378 379 380 381
/* 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.  */

382 383 384 385 386 387 388 389
static void *
emacs_blocked_malloc (size)
     unsigned size;
{
  void *value;

  BLOCK_INPUT;
  __malloc_hook = old_malloc_hook;
390
#ifdef DOUG_LEA_MALLOC
391
    mallopt (M_TOP_PAD, malloc_hysteresis * 4096);
392
#else
393
    __malloc_extra_blocks = malloc_hysteresis;
394
#endif
395
  value = (void *) malloc (size);
396
  __malloc_hook = emacs_blocked_malloc;
397 398 399 400 401 402 403 404 405 406 407 408 409 410
  UNBLOCK_INPUT;

  return value;
}

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

  BLOCK_INPUT;
  __realloc_hook = old_realloc_hook;
411
  value = (void *) realloc (ptr, size);
412
  __realloc_hook = emacs_blocked_realloc;
413 414 415 416 417 418 419 420 421
  UNBLOCK_INPUT;

  return value;
}

void
uninterrupt_malloc ()
{
  old_free_hook = __free_hook;
422
  __free_hook = emacs_blocked_free;
423 424

  old_malloc_hook = __malloc_hook;
425
  __malloc_hook = emacs_blocked_malloc;
426 427

  old_realloc_hook = __realloc_hook;
428
  __realloc_hook = emacs_blocked_realloc;
429 430
}
#endif
Jim Blandy's avatar
Jim Blandy committed
431

432 433
/* Interval allocation.  */

434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451
#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
452
  allocating_for_lisp = 1;
453 454
  interval_block
    = (struct interval_block *) malloc (sizeof (struct interval_block));
Karl Heuer's avatar
Karl Heuer committed
455
  allocating_for_lisp = 0;
456
  interval_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
457
  bzero ((char *) interval_block->intervals, sizeof interval_block->intervals);
458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477
  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
478 479 480 481
	  register struct interval_block *newi;

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

Karl Heuer's avatar
Karl Heuer committed
483
	  allocating_for_lisp = 0;
484 485 486 487 488 489 490 491
	  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);
492
  intervals_consed++;
493 494 495 496 497 498 499 500 501
  RESET_INTERVAL (val);
  return val;
}

static int total_free_intervals, total_intervals;

/* Mark the pointers of one interval. */

static void
502
mark_interval (i, dummy)
503
     register INTERVAL i;
504
     Lisp_Object dummy;
505 506 507 508 509 510 511 512 513 514 515
{
  if (XMARKBIT (i->plist))
    abort ();
  mark_object (&i->plist);
  XMARK (i->plist);
}

static void
mark_interval_tree (tree)
     register INTERVAL tree;
{
516 517 518 519 520 521 522
  /* 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);
523

524
  traverse_intervals (tree, 1, 0, mark_interval, Qnil);
525 526
}

527 528 529
#define MARK_INTERVAL_TREE(i)				\
  do {							\
    if (!NULL_INTERVAL_P (i)				\
530
	&& ! XMARKBIT (*(Lisp_Object *) &i->parent))	\
531 532
      mark_interval_tree (i);				\
  } while (0)
533

534
/* The oddity in the call to XUNMARK is necessary because XUNMARK
535
   expands to an assignment to its argument, and most C compilers don't
536 537 538 539 540 541 542 543
   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);				\
     } 								\
544 545 546 547 548 549 550 551 552 553 554
}

#else  /* no interval use */

#define INIT_INTERVALS

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

#endif /* no interval use */

555 556
/* Floating point allocation.  */

Jim Blandy's avatar
Jim Blandy committed
557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584
#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
585
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
586
  float_block = (struct float_block *) malloc (sizeof (struct float_block));
Karl Heuer's avatar
Karl Heuer committed
587
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
588
  float_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
589
  bzero ((char *) float_block->floats, sizeof float_block->floats);
Jim Blandy's avatar
Jim Blandy committed
590 591 592 593 594 595 596 597
  float_block_index = 0;
  float_free_list = 0;
}

/* Explicitly free a float cell.  */
free_float (ptr)
     struct Lisp_Float *ptr;
{
598
  *(struct Lisp_Float **)&ptr->data = float_free_list;
Jim Blandy's avatar
Jim Blandy committed
599 600 601 602 603 604 605 606 607 608 609
  float_free_list = ptr;
}

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

  if (float_free_list)
    {
610 611
      /* We use the data field for chaining the free list
	 so that we won't use the same field that has the mark bit.  */
612
      XSETFLOAT (val, float_free_list);
613
      float_free_list = *(struct Lisp_Float **)&float_free_list->data;
Jim Blandy's avatar
Jim Blandy committed
614 615 616 617 618
    }
  else
    {
      if (float_block_index == FLOAT_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
619 620 621 622 623
	  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
624 625 626 627 628
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = float_block;
	  float_block = new;
	  float_block_index = 0;
	}
629
      XSETFLOAT (val, &float_block->floats[float_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
630 631
    }
  XFLOAT (val)->data = float_value;
632
  XSETFASTINT (XFLOAT (val)->type, 0);	/* bug chasing -wsr */
Jim Blandy's avatar
Jim Blandy committed
633
  consing_since_gc += sizeof (struct Lisp_Float);
634
  floats_consed++;
Jim Blandy's avatar
Jim Blandy committed
635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666
  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
667
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
668
  cons_block = (struct cons_block *) malloc (sizeof (struct cons_block));
Karl Heuer's avatar
Karl Heuer committed
669
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
670
  cons_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
671
  bzero ((char *) cons_block->conses, sizeof cons_block->conses);
Jim Blandy's avatar
Jim Blandy committed
672 673 674 675 676
  cons_block_index = 0;
  cons_free_list = 0;
}

/* Explicitly free a cons cell.  */
677 678

void
Jim Blandy's avatar
Jim Blandy committed
679 680 681
free_cons (ptr)
     struct Lisp_Cons *ptr;
{
682
  *(struct Lisp_Cons **)&ptr->cdr = cons_free_list;
Jim Blandy's avatar
Jim Blandy committed
683 684 685 686 687 688 689 690 691 692 693 694
  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)
    {
695 696
      /* We use the cdr for chaining the free list
	 so that we won't use the same field that has the mark bit.  */
697
      XSETCONS (val, cons_free_list);
698
      cons_free_list = *(struct Lisp_Cons **)&cons_free_list->cdr;
Jim Blandy's avatar
Jim Blandy committed
699 700 701 702 703
    }
  else
    {
      if (cons_block_index == CONS_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
704 705 706 707
	  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
708 709 710 711 712
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = cons_block;
	  cons_block = new;
	  cons_block_index = 0;
	}
713
      XSETCONS (val, &cons_block->conses[cons_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
714 715 716 717
    }
  XCONS (val)->car = car;
  XCONS (val)->cdr = cdr;
  consing_since_gc += sizeof (struct Lisp_Cons);
718
  cons_cells_consed++;
Jim Blandy's avatar
Jim Blandy committed
719 720
  return val;
}
721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751

/* 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
752 753 754 755 756 757 758 759

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;
{
760 761
  register Lisp_Object val;
  val = Qnil;
Jim Blandy's avatar
Jim Blandy committed
762

763 764 765 766 767
  while (nargs > 0)
    {
      nargs--;
      val = Fcons (args[nargs], val);
    }
Jim Blandy's avatar
Jim Blandy committed
768 769 770 771 772 773 774 775 776 777 778
  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;

779 780
  CHECK_NATNUM (length, 0);
  size = XFASTINT (length);
Jim Blandy's avatar
Jim Blandy committed
781 782 783 784 785 786 787 788 789 790 791

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

struct Lisp_Vector *all_vectors;

792 793 794 795 796 797
struct Lisp_Vector *
allocate_vectorlike (len)
     EMACS_INT len;
{
  struct Lisp_Vector *p;

Karl Heuer's avatar
Karl Heuer committed
798
  allocating_for_lisp = 1;
799 800 801 802
#ifdef DOUG_LEA_MALLOC
  /* Prevent mmap'ing the chunk (which is potentially very large). */
  mallopt (M_MMAP_MAX, 0);
#endif
803 804
  p = (struct Lisp_Vector *)xmalloc (sizeof (struct Lisp_Vector)
				     + (len - 1) * sizeof (Lisp_Object));
805 806 807 808
#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
809
  allocating_for_lisp = 0;
810 811 812
  VALIDATE_LISP_STORAGE (p, 0);
  consing_since_gc += (sizeof (struct Lisp_Vector)
		       + (len - 1) * sizeof (Lisp_Object));
813
  vector_cells_consed += len;
814 815 816 817 818 819

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

Jim Blandy's avatar
Jim Blandy committed
820 821 822 823 824 825
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;
{
826 827 828
  Lisp_Object vector;
  register EMACS_INT sizei;
  register int index;
Jim Blandy's avatar
Jim Blandy committed
829 830
  register struct Lisp_Vector *p;

831 832
  CHECK_NATNUM (length, 0);
  sizei = XFASTINT (length);
Jim Blandy's avatar
Jim Blandy committed
833

834
  p = allocate_vectorlike (sizei);
Jim Blandy's avatar
Jim Blandy committed
835 836 837 838
  p->size = sizei;
  for (index = 0; index < sizei; index++)
    p->contents[index] = init;

839
  XSETVECTOR (vector, p);
Jim Blandy's avatar
Jim Blandy committed
840 841 842
  return vector;
}

843
DEFUN ("make-char-table", Fmake_char_table, Smake_char_table, 1, 2, 0,
844
  "Return a newly created char-table, with purpose PURPOSE.\n\
845
Each element is initialized to INIT, which defaults to nil.\n\
Erik Naggum's avatar
Erik Naggum committed
846
PURPOSE should be a symbol which has a `char-table-extra-slots' property.\n\
847 848 849
The property's value should be an integer between 0 and 10.")
  (purpose, init)
     register Lisp_Object purpose, init;
850 851
{
  Lisp_Object vector;
852 853
  Lisp_Object n;
  CHECK_SYMBOL (purpose, 1);
854
  n = Fget (purpose, Qchar_table_extra_slots);
855
  CHECK_NUMBER (n, 0);
856 857 858 859 860
  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);
861
  XCHAR_TABLE (vector)->top = Qt;
862
  XCHAR_TABLE (vector)->parent = Qnil;
863
  XCHAR_TABLE (vector)->purpose = purpose;
864 865 866 867
  XSETCHAR_TABLE (vector, XCHAR_TABLE (vector));
  return vector;
}

868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883
/* 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
884 885 886 887 888 889 890 891 892 893 894
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;

895
  XSETFASTINT (len, nargs);
Jim Blandy's avatar
Jim Blandy committed
896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916
  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;

917
  XSETFASTINT (len, nargs);
Jim Blandy's avatar
Jim Blandy committed
918
  if (!NILP (Vpurify_flag))
919
    val = make_pure_vector ((EMACS_INT) nargs);
Jim Blandy's avatar
Jim Blandy committed
920 921 922 923 924
  else
    val = Fmake_vector (len, Qnil);
  p = XVECTOR (val);
  for (index = 0; index < nargs; index++)
    {
Jim Blandy's avatar
Jim Blandy committed
925
      if (!NILP (Vpurify_flag))
Jim Blandy's avatar
Jim Blandy committed
926 927 928
	args[index] = Fpurecopy (args[index]);
      p->contents[index] = args[index];
    }
929
  XSETCOMPILED (val, p);
Jim Blandy's avatar
Jim Blandy committed
930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956
  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
957
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
958
  symbol_block = (struct symbol_block *) malloc (sizeof (struct symbol_block));
Karl Heuer's avatar
Karl Heuer committed
959
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
960
  symbol_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
961
  bzero ((char *) symbol_block->symbols, sizeof symbol_block->symbols);
Jim Blandy's avatar
Jim Blandy committed
962 963 964 965 966 967 968
  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.")
969 970
  (name)
     Lisp_Object name;
Jim Blandy's avatar
Jim Blandy committed
971 972 973 974
{
  register Lisp_Object val;
  register struct Lisp_Symbol *p;

975
  CHECK_STRING (name, 0);
Jim Blandy's avatar
Jim Blandy committed
976 977 978

  if (symbol_free_list)
    {
979
      XSETSYMBOL (val, symbol_free_list);
980
      symbol_free_list = *(struct Lisp_Symbol **)&symbol_free_list->value;
Jim Blandy's avatar
Jim Blandy committed
981 982 983 984 985
    }
  else
    {
      if (symbol_block_index == SYMBOL_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
986 987 988 989
	  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
990 991 992 993 994
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = symbol_block;
	  symbol_block = new;
	  symbol_block_index = 0;
	}
995
      XSETSYMBOL (val, &symbol_block->symbols[symbol_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
996 997
    }
  p = XSYMBOL (val);
998
  p->name = XSTRING (name);
999
  p->obarray = Qnil;
Jim Blandy's avatar
Jim Blandy committed
1000 1001 1002 1003 1004
  p->plist = Qnil;
  p->value = Qunbound;
  p->function = Qunbound;
  p->next = 0;
  consing_since_gc += sizeof (struct Lisp_Symbol);
1005
  symbols_consed++;
Jim Blandy's avatar
Jim Blandy committed
1006 1007 1008
  return val;
}

1009
/* Allocation of markers and other objects that share that structure.
Jim Blandy's avatar
Jim Blandy committed
1010 1011 1012
   Works like allocation of conses. */

#define MARKER_BLOCK_SIZE \
1013
  ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
Jim Blandy's avatar
Jim Blandy committed
1014 1015 1016 1017

struct marker_block
  {
    struct marker_block *next;
1018
    union Lisp_Misc markers[MARKER_BLOCK_SIZE];
Jim Blandy's avatar
Jim Blandy committed
1019 1020 1021 1022 1023
  };

struct marker_block *marker_block;
int marker_block_index;

1024
union Lisp_Misc *marker_free_list;
Jim Blandy's avatar
Jim Blandy committed
1025 1026 1027 1028

void
init_marker ()
{
Karl Heuer's avatar
Karl Heuer committed
1029
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
1030
  marker_block = (struct marker_block *) malloc (sizeof (struct marker_block));
Karl Heuer's avatar
Karl Heuer committed
1031
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
1032
  marker_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
1033
  bzero ((char *) marker_block->markers, sizeof marker_block->markers);
Jim Blandy's avatar
Jim Blandy committed
1034 1035 1036 1037
  marker_block_index = 0;
  marker_free_list = 0;
}

1038 1039 1040
/* Return a newly allocated Lisp_Misc object, with no substructure.  */
Lisp_Object
allocate_misc ()
Jim Blandy's avatar
Jim Blandy committed
1041
{
1042
  Lisp_Object val;
Jim Blandy's avatar
Jim Blandy committed
1043

Jim Blandy's avatar
Jim Blandy committed
1044 1045
  if (marker_free_list)
    {
1046 1047
      XSETMISC (val, marker_free_list);
      marker_free_list = marker_free_list->u_free.chain;
Jim Blandy's avatar
Jim Blandy committed
1048 1049 1050 1051 1052
    }
  else
    {
      if (marker_block_index == MARKER_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
1053 1054 1055 1056
	  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
1057 1058 1059 1060 1061
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = marker_block;
	  marker_block = new;
	  marker_block_index = 0;
	}
1062
      XSETMISC (val, &marker_block->markers[marker_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
1063
    }
1064
  consing_since_gc += sizeof (union Lisp_Misc);
1065
  misc_objects_consed++;
1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076
  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 ();
1077
  XMISCTYPE (val) = Lisp_Misc_Marker;
Jim Blandy's avatar
Jim Blandy committed
1078 1079
  p = XMARKER (val);
  p->buffer = 0;
1080 1081
  p->bytepos = 0;
  p->charpos = 0;
Jim Blandy's avatar
Jim Blandy committed
1082
  p->chain = Qnil;
1083
  p->insertion_type = 0;
Jim Blandy's avatar
Jim Blandy committed
1084 1085
  return val;
}
1086 1087 1088

/* Put MARKER back on the free list after using it temporarily.  */

1089
void
1090 1091 1092
free_marker (marker)
     Lisp_Object marker;
{
1093 1094
  unchain_marker (marker);

1095 1096 1097 1098 1099 1100
  XMISC (marker)->u_marker.type = Lisp_Misc_Free;
  XMISC (marker)->u_free.chain = marker_free_list;
  marker_free_list = XMISC (marker);

  total_free_markers++;
}
Jim Blandy's avatar
Jim Blandy committed
1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128

/* 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;
1129
    EMACS_INT pos;
Jim Blandy's avatar
Jim Blandy committed
1130 1131 1132 1133 1134
  };

struct string_block
  {
    struct string_block *next, *prev;
1135
    EMACS_INT pos;
Jim Blandy's avatar
Jim Blandy committed
1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153
    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).  */

Karl Heuer's avatar
Karl Heuer committed
1154 1155 1156 1157 1158 1159 1160 1161
#define STRING_FULLSIZE(size) (((size) + 1 + STRING_BASE_SIZE + STRING_PAD - 1) \
			       & ~(STRING_PAD - 1))
     /* Add 1 for the null terminator,
	and add STRING_PAD - 1 as part of rounding up.  */

#define STRING_PAD (sizeof (EMACS_INT))
/* Size of the stuff in the string not including its data.  */
#define STRING_BASE_SIZE (((sizeof (struct Lisp_String) - 1) / STRING_PAD) * STRING_PAD)
Jim Blandy's avatar
Jim Blandy committed
1162 1163 1164

#if 0
#define STRING_FULLSIZE(SIZE)   \
1165
(((SIZE) + 2 * sizeof (EMACS_INT)) & ~(sizeof (EMACS_INT) - 1))
Jim Blandy's avatar
Jim Blandy committed
1166 1167 1168 1169 1170
#endif

void
init_strings ()
{
Karl Heuer's avatar
Karl Heuer committed
1171
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
1172
  current_string_block = (struct string_block *) malloc (sizeof (struct string_block));
Karl Heuer's avatar
Karl Heuer committed
1173
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
1174 1175