alloc.c 77.3 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* Storage allocation and gc for GNU Emacs Lisp interpreter.
Richard M. Stallman's avatar
Richard M. Stallman committed
2
   Copyright (C) 1985, 86, 88, 93, 94, 95, 97 Free Software Foundation, Inc.
Jim Blandy's avatar
Jim Blandy committed
3 4 5 6 7

This file is part of GNU Emacs.

GNU Emacs is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
8
the Free Software Foundation; either version 2, or (at your option)
Jim Blandy's avatar
Jim Blandy committed
9 10 11 12 13 14 15 16 17
any later version.

GNU Emacs is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with GNU Emacs; see the file COPYING.  If not, write to
18 19
the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.  */
Jim Blandy's avatar
Jim Blandy committed
20

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

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

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

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

40 41 42 43
#ifdef DOUG_LEA_MALLOC
#include <malloc.h>
#define __malloc_size_t int
#else
44 45 46 47 48 49 50 51 52 53
/* The following come from gmalloc.c.  */

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

56 57
extern Lisp_Object Vhistory_length;

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

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

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

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

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

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

/* Nonzero during gc */
int gc_in_progress;

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

Jim Blandy's avatar
Jim Blandy committed
101 102 103 104 105 106 107 108 109 110
#ifndef VIRT_ADDR_VARIES
extern
#endif /* VIRT_ADDR_VARIES */
 int malloc_sbrk_used;

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

Jim Blandy's avatar
Jim Blandy committed
111 112 113
/* Two limits controlling how much undo information to keep.  */
int undo_limit;
int undo_strong_limit;
Jim Blandy's avatar
Jim Blandy committed
114

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

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

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

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

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

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

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

#ifndef MAX_SAVE_STACK
#define MAX_SAVE_STACK 16000
#endif

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

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

187
Lisp_Object Qgc_cons_threshold, Qchar_table_extra_slots;
188

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

362
  __free_hook = emacs_blocked_free;
363 364 365
  UNBLOCK_INPUT;
}

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

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

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

  return value;
}

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

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

  return value;
}

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

  old_malloc_hook = __malloc_hook;
424
  __malloc_hook = emacs_blocked_malloc;
425 426

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

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

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

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

static int total_free_intervals, total_intervals;

/* Mark the pointers of one interval. */

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

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

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

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

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

#else  /* no interval use */

#define INIT_INTERVALS

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

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

Jim Blandy's avatar
Jim Blandy committed
556 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
#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
584
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
585
  float_block = (struct float_block *) malloc (sizeof (struct float_block));
Karl Heuer's avatar
Karl Heuer committed
586
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
587
  float_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
588
  bzero ((char *) float_block->floats, sizeof float_block->floats);
Jim Blandy's avatar
Jim Blandy committed
589 590 591 592 593 594 595 596
  float_block_index = 0;
  float_free_list = 0;
}

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

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

  if (float_free_list)
    {
609 610
      /* We use the data field for chaining the free list
	 so that we won't use the same field that has the mark bit.  */
611
      XSETFLOAT (val, float_free_list);
612
      float_free_list = *(struct Lisp_Float **)&float_free_list->data;
Jim Blandy's avatar
Jim Blandy committed
613 614 615 616 617
    }
  else
    {
      if (float_block_index == FLOAT_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
618 619 620 621 622
	  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
623 624 625 626 627
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = float_block;
	  float_block = new;
	  float_block_index = 0;
	}
628
      XSETFLOAT (val, &float_block->floats[float_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
629 630
    }
  XFLOAT (val)->data = float_value;
631
  XSETFASTINT (XFLOAT (val)->type, 0);	/* bug chasing -wsr */
Jim Blandy's avatar
Jim Blandy committed
632
  consing_since_gc += sizeof (struct Lisp_Float);
633
  floats_consed++;
Jim Blandy's avatar
Jim Blandy committed
634 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
  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
666
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
667
  cons_block = (struct cons_block *) malloc (sizeof (struct cons_block));
Karl Heuer's avatar
Karl Heuer committed
668
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
669
  cons_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
670
  bzero ((char *) cons_block->conses, sizeof cons_block->conses);
Jim Blandy's avatar
Jim Blandy committed
671 672 673 674 675
  cons_block_index = 0;
  cons_free_list = 0;
}

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

void
Jim Blandy's avatar
Jim Blandy committed
678 679 680
free_cons (ptr)
     struct Lisp_Cons *ptr;
{
681
  *(struct Lisp_Cons **)&ptr->cdr = cons_free_list;
Jim Blandy's avatar
Jim Blandy committed
682 683 684 685 686 687 688 689 690 691 692 693
  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)
    {
694 695
      /* We use the cdr for chaining the free list
	 so that we won't use the same field that has the mark bit.  */
696
      XSETCONS (val, cons_free_list);
697
      cons_free_list = *(struct Lisp_Cons **)&cons_free_list->cdr;
Jim Blandy's avatar
Jim Blandy committed
698 699 700 701 702
    }
  else
    {
      if (cons_block_index == CONS_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
703 704 705 706
	  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
707 708 709 710 711
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = cons_block;
	  cons_block = new;
	  cons_block_index = 0;
	}
712
      XSETCONS (val, &cons_block->conses[cons_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
713 714 715 716
    }
  XCONS (val)->car = car;
  XCONS (val)->cdr = cdr;
  consing_since_gc += sizeof (struct Lisp_Cons);
717
  cons_cells_consed++;
Jim Blandy's avatar
Jim Blandy committed
718 719 720 721 722 723 724 725 726 727
  return val;
}

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

731 732 733 734 735
  while (nargs > 0)
    {
      nargs--;
      val = Fcons (args[nargs], val);
    }
Jim Blandy's avatar
Jim Blandy committed
736 737 738 739 740 741 742 743 744 745 746
  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;

747 748
  CHECK_NATNUM (length, 0);
  size = XFASTINT (length);
Jim Blandy's avatar
Jim Blandy committed
749 750 751 752 753 754 755 756 757 758 759

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

struct Lisp_Vector *all_vectors;

760 761 762 763 764 765
struct Lisp_Vector *
allocate_vectorlike (len)
     EMACS_INT len;
{
  struct Lisp_Vector *p;

Karl Heuer's avatar
Karl Heuer committed
766
  allocating_for_lisp = 1;
767 768 769 770
#ifdef DOUG_LEA_MALLOC
  /* Prevent mmap'ing the chunk (which is potentially very large). */
  mallopt (M_MMAP_MAX, 0);
#endif
771 772
  p = (struct Lisp_Vector *)xmalloc (sizeof (struct Lisp_Vector)
				     + (len - 1) * sizeof (Lisp_Object));
773 774 775 776
#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
777
  allocating_for_lisp = 0;
778 779 780
  VALIDATE_LISP_STORAGE (p, 0);
  consing_since_gc += (sizeof (struct Lisp_Vector)
		       + (len - 1) * sizeof (Lisp_Object));
781
  vector_cells_consed += len;
782 783 784 785 786 787

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

Jim Blandy's avatar
Jim Blandy committed
788 789 790 791 792 793
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;
{
794 795 796
  Lisp_Object vector;
  register EMACS_INT sizei;
  register int index;
Jim Blandy's avatar
Jim Blandy committed
797 798
  register struct Lisp_Vector *p;

799 800
  CHECK_NATNUM (length, 0);
  sizei = XFASTINT (length);
Jim Blandy's avatar
Jim Blandy committed
801

802
  p = allocate_vectorlike (sizei);
Jim Blandy's avatar
Jim Blandy committed
803 804 805 806
  p->size = sizei;
  for (index = 0; index < sizei; index++)
    p->contents[index] = init;

807
  XSETVECTOR (vector, p);
Jim Blandy's avatar
Jim Blandy committed
808 809 810
  return vector;
}

811
DEFUN ("make-char-table", Fmake_char_table, Smake_char_table, 1, 2, 0,
812
  "Return a newly created char-table, with purpose PURPOSE.\n\
813
Each element is initialized to INIT, which defaults to nil.\n\
Erik Naggum's avatar
Erik Naggum committed
814
PURPOSE should be a symbol which has a `char-table-extra-slots' property.\n\
815 816 817
The property's value should be an integer between 0 and 10.")
  (purpose, init)
     register Lisp_Object purpose, init;
818 819
{
  Lisp_Object vector;
820 821
  Lisp_Object n;
  CHECK_SYMBOL (purpose, 1);
822
  n = Fget (purpose, Qchar_table_extra_slots);
823
  CHECK_NUMBER (n, 0);
824 825 826 827 828
  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);
829
  XCHAR_TABLE (vector)->top = Qt;
830
  XCHAR_TABLE (vector)->parent = Qnil;
831
  XCHAR_TABLE (vector)->purpose = purpose;
832 833 834 835
  XSETCHAR_TABLE (vector, XCHAR_TABLE (vector));
  return vector;
}

836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851
/* 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
852 853 854 855 856 857 858 859 860 861 862
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;

863
  XSETFASTINT (len, nargs);
Jim Blandy's avatar
Jim Blandy committed
864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884
  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;

885
  XSETFASTINT (len, nargs);
Jim Blandy's avatar
Jim Blandy committed
886
  if (!NILP (Vpurify_flag))
887
    val = make_pure_vector ((EMACS_INT) nargs);
Jim Blandy's avatar
Jim Blandy committed
888 889 890 891 892
  else
    val = Fmake_vector (len, Qnil);
  p = XVECTOR (val);
  for (index = 0; index < nargs; index++)
    {
Jim Blandy's avatar
Jim Blandy committed
893
      if (!NILP (Vpurify_flag))
Jim Blandy's avatar
Jim Blandy committed
894 895 896
	args[index] = Fpurecopy (args[index]);
      p->contents[index] = args[index];
    }
897
  XSETCOMPILED (val, p);
Jim Blandy's avatar
Jim Blandy committed
898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924
  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
925
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
926
  symbol_block = (struct symbol_block *) malloc (sizeof (struct symbol_block));
Karl Heuer's avatar
Karl Heuer committed
927
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
928
  symbol_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
929
  bzero ((char *) symbol_block->symbols, sizeof symbol_block->symbols);
Jim Blandy's avatar
Jim Blandy committed
930 931 932 933 934 935 936
  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.")
937 938
  (name)
     Lisp_Object name;
Jim Blandy's avatar
Jim Blandy committed
939 940 941 942
{
  register Lisp_Object val;
  register struct Lisp_Symbol *p;

943
  CHECK_STRING (name, 0);
Jim Blandy's avatar
Jim Blandy committed
944 945 946

  if (symbol_free_list)
    {
947
      XSETSYMBOL (val, symbol_free_list);
948
      symbol_free_list = *(struct Lisp_Symbol **)&symbol_free_list->value;
Jim Blandy's avatar
Jim Blandy committed
949 950 951 952 953
    }
  else
    {
      if (symbol_block_index == SYMBOL_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
954 955 956 957
	  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
958 959 960 961 962
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = symbol_block;
	  symbol_block = new;
	  symbol_block_index = 0;
	}
963
      XSETSYMBOL (val, &symbol_block->symbols[symbol_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
964 965
    }
  p = XSYMBOL (val);
966
  p->name = XSTRING (name);
967
  p->obarray = Qnil;
Jim Blandy's avatar
Jim Blandy committed
968 969 970 971 972
  p->plist = Qnil;
  p->value = Qunbound;
  p->function = Qunbound;
  p->next = 0;
  consing_since_gc += sizeof (struct Lisp_Symbol);
973
  symbols_consed++;
Jim Blandy's avatar
Jim Blandy committed
974 975 976
  return val;
}

977
/* Allocation of markers and other objects that share that structure.
Jim Blandy's avatar
Jim Blandy committed
978 979 980
   Works like allocation of conses. */

#define MARKER_BLOCK_SIZE \
981
  ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
Jim Blandy's avatar
Jim Blandy committed
982 983 984 985

struct marker_block
  {
    struct marker_block *next;
986
    union Lisp_Misc markers[MARKER_BLOCK_SIZE];
Jim Blandy's avatar
Jim Blandy committed
987 988 989 990 991
  };

struct marker_block *marker_block;
int marker_block_index;

992
union Lisp_Misc *marker_free_list;
Jim Blandy's avatar
Jim Blandy committed
993 994 995 996

void
init_marker ()
{
Karl Heuer's avatar
Karl Heuer committed
997
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
998
  marker_block = (struct marker_block *) malloc (sizeof (struct marker_block));
Karl Heuer's avatar
Karl Heuer committed
999
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
1000
  marker_block->next = 0;
Richard M. Stallman's avatar
Richard M. Stallman committed
1001
  bzero ((char *) marker_block->markers, sizeof marker_block->markers);
Jim Blandy's avatar
Jim Blandy committed
1002 1003 1004 1005
  marker_block_index = 0;
  marker_free_list = 0;
}

1006 1007 1008
/* Return a newly allocated Lisp_Misc object, with no substructure.  */
Lisp_Object
allocate_misc ()
Jim Blandy's avatar
Jim Blandy committed
1009
{
1010
  Lisp_Object val;
Jim Blandy's avatar
Jim Blandy committed
1011

Jim Blandy's avatar
Jim Blandy committed
1012 1013
  if (marker_free_list)
    {
1014 1015
      XSETMISC (val, marker_free_list);
      marker_free_list = marker_free_list->u_free.chain;
Jim Blandy's avatar
Jim Blandy committed
1016 1017 1018 1019 1020
    }
  else
    {
      if (marker_block_index == MARKER_BLOCK_SIZE)
	{
Karl Heuer's avatar
Karl Heuer committed
1021 1022 1023 1024
	  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
1025 1026 1027 1028 1029
	  VALIDATE_LISP_STORAGE (new, sizeof *new);
	  new->next = marker_block;
	  marker_block = new;
	  marker_block_index = 0;
	}
1030
      XSETMISC (val, &marker_block->markers[marker_block_index++]);
Jim Blandy's avatar
Jim Blandy committed
1031
    }
1032
  consing_since_gc += sizeof (union Lisp_Misc);
1033
  misc_objects_consed++;
1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044
  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 ();
1045
  XMISCTYPE (val) = Lisp_Misc_Marker;
Jim Blandy's avatar
Jim Blandy committed
1046 1047
  p = XMARKER (val);
  p->buffer = 0;
1048 1049
  p->bytepos = 0;
  p->charpos = 0;
Jim Blandy's avatar
Jim Blandy committed
1050
  p->chain = Qnil;
1051
  p->insertion_type = 0;
Jim Blandy's avatar
Jim Blandy committed
1052 1053
  return val;
}
1054 1055 1056

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

1057
void
1058 1059 1060
free_marker (marker)
     Lisp_Object marker;
{
1061 1062
  unchain_marker (marker);

1063 1064 1065 1066 1067 1068
  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
1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096

/* 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;
1097
    EMACS_INT pos;
Jim Blandy's avatar
Jim Blandy committed
1098 1099 1100 1101 1102
  };

struct string_block
  {
    struct string_block *next, *prev;
1103
    EMACS_INT pos;
Jim Blandy's avatar
Jim Blandy committed
1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123
    char chars[STRING_BLOCK_SIZE];
  };

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

struct string_block *current_string_block;

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

struct string_block *first_string_block;

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

struct string_block *large_string_blocks;

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

#define STRING_FULLSIZE(size) (((size) + sizeof (struct Lisp_String) + PAD) \
			       & ~(PAD - 1))
1124
#define PAD (sizeof (EMACS_INT))
Jim Blandy's avatar
Jim Blandy committed
1125 1126 1127

#if 0
#define STRING_FULLSIZE(SIZE)   \
1128
(((SIZE) + 2 * sizeof (EMACS_INT)) & ~(sizeof (EMACS_INT) - 1))
Jim Blandy's avatar
Jim Blandy committed
1129 1130 1131 1132 1133
#endif

void
init_strings ()
{
Karl Heuer's avatar
Karl Heuer committed
1134
  allocating_for_lisp = 1;
Jim Blandy's avatar
Jim Blandy committed
1135
  current_string_block = (struct string_block *) malloc (sizeof (struct string_block));
Karl Heuer's avatar
Karl Heuer committed
1136
  allocating_for_lisp = 0;
Jim Blandy's avatar
Jim Blandy committed
1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153
  first_string_block = current_string_block;
  consing_since_gc += sizeof (struct string_block);
  current_string_block->next = 0;
  current_string_block->prev = 0;
  current_string_block->pos = 0;
  large_string_blocks = 0;
}

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

1154
  CHECK_NATNUM (length, 0);
Jim Blandy's avatar
Jim Blandy committed
1155
  CHECK_NUMBER (init, 1);
1156
  val = make_uninit_string (XFASTINT (length));
Jim Blandy's avatar
Jim Blandy committed
1157 1158 1159 1160 1161 1162 1163 1164 1165
  c = XINT (init);
  p = XSTRING (val)->data;
  end = p + XSTRING (val)->size;
  while (p != end)
    *p++ = c;
  *p = 0;
  return val;
}