This is alloc.c in view mode; [Download] [Up]
/* Storage allocation and gc for XEmacs Lisp interpreter.
Copyright (C) 1985, 1986, 1988, 1992, 1993, 1994
Free Software Foundation, Inc.
This file is part of XEmacs.
XEmacs is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version.
XEmacs 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 XEmacs; see the file COPYING. If not, write to the Free
Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
/* Synched up with: FSF 19.28, Mule 2.0. Substantially different from
FSF. */
#include <config.h>
#include "lisp.h"
#ifndef standalone
#ifdef HAVE_X_WINDOWS
#include "device-x.h"
#endif /* HAVE_X_WINDOWS */
#ifdef HAVE_NEXTSTEP
#include "device-ns.h"
#endif /* HAVE_NEXTSTEP */
#include "backtrace.h"
#include "buffer.h"
#include "bytecode.h"
#include "elhash.h"
#include "events.h"
#include "extents.h"
#include "frame.h"
#include "redisplay.h"
#include "specifier.h"
#include "window.h"
#endif
/* Define this to see where all that space is going... */
#define PURESTAT
/* Define this to use malloc/free with no freelist for all datatypes,
the hope being that some debugging tools may help detect
freed memory references */
/* #define ALLOC_NO_POOLS */
#include "puresize.h"
#define ALIGN_SIZE(len,unit) \
((((len) + (unit) - 1) / (unit)) * (unit))
/* Number of bytes of consing done since the last gc */
int consing_since_gc;
#ifdef EMACS_BTL
extern void cadillac_record_backtrace ();
#define INCREMENT_CONS_COUNTER(size) \
do { \
int __sz__ = ((int) (size)); \
consing_since_gc += __sz__; \
cadillac_record_backtrace (2, __sz__); \
} while (0)
#else
#define INCREMENT_CONS_COUNTER(size) (consing_since_gc += (size))
#endif
/* Number of bytes of consing since gc before another gc should be done. */
int gc_cons_threshold;
/* Nonzero during gc */
int gc_in_progress;
/* Number of times GC has happened at this level or below.
* Level 0 is most volatile, contrary to usual convention.
* (Of course, there's only one level at present) */
int gc_generation_number[1];
/* This is just for use by the printer, to allow things to print uniquely */
static int lrecord_uid_counter;
/* Nonzero when calling the hooks in Energize-beta */
int gc_currently_forbidden;
/* Hooks. */
Lisp_Object Vpre_gc_hook, Qpre_gc_hook;
Lisp_Object Vpost_gc_hook, Qpost_gc_hook;
/* "Garbage collecting" */
Lisp_Object Vgc_message;
static CONST char gc_default_message[] = "Garbage collecting";
Lisp_Object Qgarbage_collecting;
#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;
/* Non-zero means defun should do purecopy on the function definition */
int purify_flag;
extern Lisp_Object pure[];/* moved to pure.c to speed incremental linking */
#define PUREBEG ((unsigned char *) pure)
/* Index in pure at which next pure object will be allocated. */
static long pureptr;
#define PURIFIED(ptr) \
((PNTR_COMPARISON_TYPE) (ptr) < \
(PNTR_COMPARISON_TYPE) (PUREBEG + PURESIZE) && \
(PNTR_COMPARISON_TYPE) (ptr) >= \
(PNTR_COMPARISON_TYPE) PUREBEG)
/* Non-zero if pureptr > PURESIZE; accounts for excess purespace needs. */
static long pure_lossage;
int
purified (Lisp_Object obj)
{
if (!POINTER_TYPE_P (XGCTYPE (obj)))
return (0);
return (PURIFIED (XPNTR (obj)));
}
static int
check_purespace (int size)
{
if (pure_lossage)
{
pure_lossage += size;
return (0);
}
else if (pureptr + size > PURESIZE)
{
message ("\nERROR: Pure Lisp storage exhausted!\n");
pure_lossage = size;
return (0);
}
else
return (1);
}
#ifndef PURESTAT
#define bump_purestat(p,b) do {} while (0) /* Do nothing */
#else /* PURESTAT */
static int purecopying_for_bytecode;
static int pure_sizeof (Lisp_Object /*, int recurse */);
/* Keep statistics on how much of what is in purespace */
struct purestat
{
int nobjects;
int nbytes;
CONST char *name;
};
#define FMH(s,n) static struct purestat s = { 0, 0, n }
FMH (purestat_cons, "cons cells:");
FMH (purestat_float, "float objects:");
FMH (purestat_string_pname, "symbol-name strings:");
FMH (purestat_bytecode, "function objects:");
FMH (purestat_string_bytecodes, "byte-code strings:");
FMH (purestat_vector_bytecode_constants, "byte-constant vectors:");
FMH (purestat_string_interactive, "interactive strings:");
#ifdef I18N3
FMH (purestat_string_domain, "domain strings:");
#endif
FMH (purestat_string_documentation, "documentation strings:");
FMH (purestat_string_other_function, "other function strings:");
FMH (purestat_vector_other, "other vectors:");
FMH (purestat_string_other, "other strings:");
FMH (purestat_string_all, "all strings:");
FMH (purestat_vector_all, "all vectors:");
static struct purestat *purestats[] =
{
&purestat_cons,
&purestat_float,
&purestat_string_pname,
&purestat_bytecode,
&purestat_string_bytecodes,
&purestat_vector_bytecode_constants,
&purestat_string_interactive,
#ifdef I18N3
&purestat_string_domain,
#endif
&purestat_string_documentation,
&purestat_string_other_function,
&purestat_vector_other,
&purestat_string_other,
0,
&purestat_string_all,
&purestat_vector_all
};
#undef FMH
static void
bump_purestat (struct purestat *purestat, int nbytes)
{
if (pure_lossage) return;
purestat->nobjects += 1;
purestat->nbytes += nbytes;
}
#endif /* PURESTAT */
/* Maximum amount of C stack to save when a GC happens. */
#ifndef MAX_SAVE_STACK
#define MAX_SAVE_STACK 16000
#endif
/* Buffer in which we save a copy of the C stack at each GC. */
static char *stack_copy;
static int stack_copy_size;
/* Non-zero means ignore malloc warnings. Set during initialization. */
int ignore_malloc_warnings;
static void mark_object (Lisp_Object obj);
static void *breathing_space;
void
release_breathing_space (void)
{
if (breathing_space)
{
void *tmp = breathing_space;
breathing_space = 0;
xfree (tmp);
}
}
/* malloc calls this if it finds we are near exhausting storage */
void
malloc_warning (CONST char *str)
{
if (ignore_malloc_warnings)
return;
warn_when_safe
(Qmemory, Qcritical,
"%s\n"
"Killing some buffers may delay running out of memory.\n"
"However, certainly by the time you receive the 95%% warning,\n"
"you should clean up, kill this Emacs, and start a new one.",
str);
}
/* Called if malloc returns zero */
DOESNT_RETURN
memory_full (void)
{
/* Force a GC next time eval is called.
It's better to loop garbage-collecting (we might reclaim enough
to win) than to loop beeping and barfing "Memory exhausted"
*/
consing_since_gc = gc_cons_threshold + 1;
release_breathing_space ();
#ifndef standalone
/* Flush some histories which might conceivably contain
* garbalogical inhibitors */
if (!NILP (Fboundp (Qvalues)))
Fset (Qvalues, Qnil);
Vcommand_history = Qnil;
#endif
error ("Memory exhausted");
}
/* like malloc and realloc but check for no memory left, and block input. */
void *
xmalloc (int size)
{
void *val;
val = (void *) malloc (size);
if (!val && (size != 0)) memory_full ();
return val;
}
void *
xmalloc_and_zero (int size)
{
void *val = xmalloc (size);
memset (val, 0, size);
return val;
}
void *
xrealloc (void *block, int size)
{
void *val;
/* We must call malloc explicitly when BLOCK is 0, since some
reallocs don't do this. */
if (! block)
val = (void *) malloc (size);
else
val = (void *) realloc (block, size);
if (!val && (size != 0)) memory_full ();
return val;
}
void
#ifdef ERROR_CHECK_MALLOC
xfree_1 (void *block)
#else
xfree (void *block)
#endif
{
#ifdef ERROR_CHECK_MALLOC
/* Unbelievably, calling free() on 0xDEADBEEF doesn't cause an
error until much later on for many system mallocs, such as
the one that comes with Solaris 2.3. FMH!! */
assert (block != (void *) 0xDEADBEEF);
#endif
free (block);
}
#if INTBITS == 32
# define FOUR_BYTE_TYPE unsigned int
#elif LONGBITS == 32
# define FOUR_BYTE_TYPE unsigned long
#elif SHORTBITS == 32
# define FOUR_BYTE_TYPE unsigned short
#else
What kind of strange-ass system are we running on?
#endif
#ifdef ERROR_CHECK_GC
#ifdef WORDS_BIGENDIAN
static unsigned char deadbeef_as_char[] = {0xDE, 0xAD, 0xBE, 0xEF};
#else
static unsigned char deadbeef_as_char[] = {0xEF, 0xBE, 0xAD, 0xDE};
#endif
static void
deadbeef_memory (void *ptr, unsigned long size)
{
unsigned long long_length = size / sizeof (FOUR_BYTE_TYPE);
unsigned long i;
unsigned long bytes_left_over = size - sizeof (FOUR_BYTE_TYPE) * long_length;
for (i = 0; i < long_length; i++)
((FOUR_BYTE_TYPE *) ptr)[i] = 0xdeadbeef;
for (i = i; i < bytes_left_over; i++)
((unsigned char *) ptr + long_length)[i] = deadbeef_as_char[i];
}
#else
#define deadbeef_memory(ptr, size)
#endif
char *
xstrdup (CONST char *str)
{
char *val;
int len = strlen (str) + 1; /* for stupid terminating 0 */
val = xmalloc (len);
if (val == 0) return 0;
memcpy (val, str, len);
return (val);
}
#ifdef NEED_STRDUP
char *
strdup (CONST char *s)
{
return xstrdup (s);
}
#endif /* NEED_STRDUP */
static void *
allocate_lisp_storage (int size)
{
void *p = xmalloc (size);
char *lim = ((char *) p) + size;
Lisp_Object val = Qnil;
XSETCONS (val, lim);
if ((char *) XCONS (val) != lim)
{
xfree (p);
memory_full ();
}
return (p);
}
#define MARKED_RECORD_HEADER_P(lheader) \
(((lheader)->implementation->finalizer) == this_marks_a_marked_record)
#define UNMARKABLE_RECORD_HEADER_P(lheader) \
(((lheader)->implementation->marker) == this_one_is_unmarkable)
#define MARK_RECORD_HEADER(lheader) \
do { (((lheader)->implementation)++); } while (0)
#define UNMARK_RECORD_HEADER(lheader) \
do { (((lheader)->implementation)--); } while (0)
/* lrecords are chained together through their "next.v" field.
* After doing the mark phase, the GC will walk this linked
* list and free any record which hasn't been marked
*/
static struct lcrecord_header *all_lcrecords;
void *
alloc_lcrecord (int size, CONST struct lrecord_implementation *implementation)
{
struct lcrecord_header *lcheader;
if (size <= 0) abort ();
if (implementation->static_size == 0)
{
if (!implementation->size_in_bytes_method)
abort ();
}
else if (implementation->static_size != size)
abort ();
lcheader = allocate_lisp_storage (size);
lcheader->lheader.implementation = implementation;
lcheader->next = all_lcrecords;
#if 1 /* mly prefers to see small ID numbers */
lcheader->uid = lrecord_uid_counter++;
#else /* jwz prefers to see real addrs */
lcheader->uid = (int) &lcheader;
#endif
all_lcrecords = lcheader;
INCREMENT_CONS_COUNTER (size);
return (lcheader);
}
#if 0 /* Presently unused */
/* Very, very poor man's EGC?
* This may be slow and thrash pages all over the place.
* Only call it if you really feel you must (and if the
* lrecord was fairly recently allocated).
* Otherwise, just let the GC do its job -- that's what it's there for
*/
void
free_lcrecord (struct lcrecord_header *lcrecord)
{
if (all_lcrecords == lcrecord)
{
all_lcrecords = lcrecord->next;
}
else
{
struct lrecord_header *header = all_lcrecords;
for (;;)
{
struct lrecord_header *next = header->next;
if (next == lcrecord)
{
header->next = lrecord->next;
break;
}
else if (next == 0)
abort ();
else
header = next;
}
}
if (lrecord->implementation->finalizer)
((lrecord->implementation->finalizer) (lrecord, 0));
xfree (lrecord);
return;
}
#endif /* Unused */
static void
disksave_object_finalization_1 (void)
{
struct lcrecord_header *header;
for (header = all_lcrecords; header; header = header->next)
{
if (header->lheader.implementation->finalizer)
((header->lheader.implementation->finalizer) (header, 1));
}
}
/* This must not be called -- it just serves as for EQ test
* If lheader->implementation->finalizer is this_marks_a_marked_record,
* then lrecord has been marked by the GC sweeper
* header->implementation is put back to its correct value by
* sweep_records */
void
this_marks_a_marked_record (void *dummy0, int dummy1)
{
abort ();
}
/* Semi-kludge -- lrecord_symbol_value_forward objects get stuck
in CONST space and you get SEGV's if you attempt to mark them.
This sits in lheader->implementation->marker. */
Lisp_Object
this_one_is_unmarkable (Lisp_Object obj, void (*markobj) (Lisp_Object))
{
abort ();
return Qnil;
}
/* XGCTYPE for records */
int
gc_record_type_p (Lisp_Object frob, CONST struct lrecord_implementation *type)
{
return (XGCTYPE (frob) == Lisp_Record
&& (XRECORD_LHEADER (frob)->implementation == type
|| XRECORD_LHEADER (frob)->implementation == type + 1));
}
/**********************************************************************/
/* Fixed-size type macros */
/**********************************************************************/
/* For fixed-size types that are commonly used, we malloc() large blocks
of memory at a time and subdivide them into chunks of the correct
size for an object of that type. This is more efficient than
malloc()ing each object separately because we save on malloc() time
and overhead due to the fewer number of malloc()ed blocks, and
also because we don't need any extra pointers within each object
to keep them threaded together for GC purposes. For less common
(and frequently large-size) types, we use lcrecords, which are
malloc()ed individually and chained together through a pointer
in the lcrecord header. lcrecords do not need to be fixed-size
(i.e. two objects of the same type need not have the same size;
however, the size of a particular object cannot vary dynamically).
It is also much easier to create a new lcrecord type because no
additional code needs to be added to alloc.c. Finally, lcrecords
may be more efficient when there are only a small number of them.
The types that are stored in these large blocks (or "frob blocks")
are cons, float, bytecode, symbol, marker, extent, extent replica,
event, and string.
Note that strings are special in that they are actually stored in
two parts: a structure containing information about the string, and
the actual data associated with the string. The former structure
(a struct Lisp_String) is a fixed-size structure and is managed the
same way as all the other such types. This structure contains a
pointer to the actual string data, which is stored in structures of
type struct string_chars_block. Each string_chars_block consists
of a pointer to a struct Lisp_String, followed by the data for that
string, followed by another pointer to a struct Lisp_String,
followed by the data for that string, etc. At GC time, the data in
these blocks is compacted by searching sequentially through all the
blocks and compressing out any holes created by unmarked strings.
Strings that are more than a certain size (bigger than the size of
a string_chars_block, although something like half as big might
make more sense) are malloc()ed separately and not stored in
string_chars_blocks. Furthermore, no one string stretches across
two string_chars_blocks.
Vectors are each malloc()ed separately, similar to lcrecords.
In the following discussion, we use conses, but it applies equally
well to the other fixed-size types.
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 2^n - MALLOC_OVERHEAD bytes long, since malloc (at least
the versions in malloc.c and gmalloc.c) really allocates in units
of powers of two and uses 4 bytes for its own overhead.
What GC actually does is to search through all the cons_blocks,
from the most recently allocated to the oldest, and put all
cons cells that are not marked (whether or not they're already
free) on a cons_free_list. The cons_free_list is a stack, and
so the cons cells in the oldest-allocated cons_block end up
at the head of the stack and are the first to be reallocated.
If any cons_block is entirely free, it is freed with free()
and its cons cells removed from the cons_free_list. Because
the cons_free_list ends up basically in memory order, we have
a high locality of reference (assuming a reasonable turnover
of allocating and freeing) and have a reasonable probability
of entirely freeing up cons_blocks that have been more recently
allocated. This stage is called the "sweep stage" of GC, and
is executed after the "mark stage", which involves starting
from all places that are known to point to in-use Lisp objects
(e.g. the obarray, where are all symbols are stored; the
current catches and condition-cases; the backtrace list of
currently executing functions; the gcpro list; etc.) and
recursively marking all objects that are accessible.
At the beginning of the sweep stage, the conses in the cons
blocks are in one of three states: in use and marked, in use
but not marked, and not in use (already freed). Any conses
that are marked have been marked in the mark stage just
executed, because as part of the sweep stage we unmark any
marked objects. The way we tell whether or not a cons cell
is in use is through the FREE_STRUCT_P macro. This basically
looks at the first 4 bytes (or however many bytes a pointer
fits in) to see if all the bits in those bytes are 1. The
resulting value (0xFFFFFFFF) is not a valid pointer and is
not a valid Lisp_Object. All current fixed-size types have
a pointer or Lisp_Object as their first element with the
exception of strings; they have a size value, which can
never be less than zero, and so 0xFFFFFFFF is invalid for
strings as well. Now assuming that a cons cell is in use,
the way we tell whether or not it is marked is to look at
the mark bit of its car (each Lisp_Object has one bit
reserved as a mark bit, in case it's needed). Note that
different types of objects use different fields to indicate
whether the object is marked, but the principle is the same.
Conses on the free_cons_list are threaded through a pointer
stored in the bytes directly after the bytes that are set
to 0xFFFFFFFF (we cannot overwrite these because the cons
is still in a cons_block and needs to remain marked as
not in use for the next time that GC happens). This
implies that all fixed-size types must be at least big
enough to store two pointers, which is indeed the case
for all current fixed-size types.
Some types of objects need additional "finalization" done
when an object is converted from in use to not in use;
this is the purpose of the ADDITIONAL_FREE_type macro.
For example, markers need to be removed from the chain
of markers that is kept in each buffer. This is because
markers in a buffer automatically disappear if the marker
is no longer referenced anywhere (the same does not
apply to extents, however).
When ERROR_CHECK_GC is defined, we do things differently
so as to maximize our chances of catching places where
there is insufficient GCPROing. The thing we want to
avoid is having an object that we're using but didn't
GCPRO get freed by GC and then reallocated while we're
in the process of using it -- this will result in something
seemingly unrelated getting trashed, and is extremely
difficult to track down. If the object gets freed but
not reallocated, we can usually catch this because we
set all bytes of a freed object to 0xDEADBEEF. (The
first four bytes, however, are 0xFFFFFFFF, and the next
four are a pointer used to chain freed objects together;
we play some tricks with this pointer to make it more
bogus, so crashes are more likely to occur right away.)
We want freed objects to stay free as long as possible,
so instead of doing what we do above, we maintain the
free objects in a first-in first-out queue. We also
don't recompute the free list each GC, unlike above;
this ensures that the queue ordering is preserved.
[This means that we are likely to have worse locality
of reference, and that we can never free a frob block
once it's allocated. (Even if we know that all cells
in it are free, there's no easy way to remove all those
cells from the free list because the objects on the
free list are unlikely to be in memory order.)]
Furthermore, we never take objects off the free list
unless there's a large number (usually 1000, but
varies depending on type) of them already on the list.
This way, we ensure that an object that gets freed will
remain free for the next 1000 (or whatever) times that
an object of that type is allocated.
*/
#ifndef MALLOC_OVERHEAD
#define MALLOC_OVERHEAD 4
#endif
#ifdef ALLOC_NO_POOLS
# define TYPE_ALLOC_SIZE(type, structtype) 1
#else
# define TYPE_ALLOC_SIZE(type, structtype) \
((2048 - MALLOC_OVERHEAD - sizeof (struct type##_block *)) \
/ sizeof (structtype))
#endif
#define DECLARE_FIXED_TYPE_ALLOC(type, structtype) \
\
struct type##_block \
{ \
struct type##_block *prev; \
structtype block[TYPE_ALLOC_SIZE (type, structtype)]; \
}; \
\
static struct type##_block *current_##type##_block; \
static int current_##type##_block_index; \
\
static structtype *type##_free_list; \
static structtype *type##_free_list_tail; \
\
static void \
init_##type##_alloc (void) \
{ \
current_##type##_block = 0; \
current_##type##_block_index = countof (current_##type##_block->block); \
type##_free_list = 0; \
type##_free_list_tail = 0; \
} \
\
static int gc_count_num_##type##_in_use, gc_count_num_##type##_freelist
#define ALLOCATE_FIXED_TYPE_FROM_BLOCK(type, result) \
do { \
if (current_##type##_block_index \
== countof (current_##type##_block->block)) \
{ \
struct type##_block *__new__ \
= allocate_lisp_storage (sizeof (struct type##_block)); \
__new__->prev = current_##type##_block; \
current_##type##_block = __new__; \
current_##type##_block_index = 0; \
} \
(result) = \
&(current_##type##_block->block[current_##type##_block_index++]); \
} while (0)
/* Allocate an instance of a type that is stored in blocks.
TYPE is the "name" of the type, STRUCTTYPE is the corresponding
structure type. */
#ifdef ERROR_CHECK_GC
/* Note: if you get crashes in this function, suspect incorrect calls
to free_cons() and friends. This happened once because the cons
cell was not GC-protected and was getting collected before
free_cons() was called. */
#define ALLOCATE_FIXED_TYPE(type, structtype, result) \
do \
{ \
if (gc_count_num_##type##_freelist > \
MINIMUM_ALLOWED_FIXED_TYPE_CELLS_##type) \
{ \
result = type##_free_list; \
/* Before actually using the chain pointer, we complement all its \
bits; see FREE_FIXED_TYPE(). */ \
type##_free_list = \
(structtype *) ~(unsigned long) \
(* (structtype **) ((char *) result + sizeof (void *))); \
gc_count_num_##type##_freelist--; \
} \
else \
ALLOCATE_FIXED_TYPE_FROM_BLOCK (type, result); \
MARK_STRUCT_AS_NOT_FREE (result); \
INCREMENT_CONS_COUNTER (sizeof (structtype)); \
} while (0)
#else
#define ALLOCATE_FIXED_TYPE(type, structtype, result) \
do \
{ \
if (type##_free_list) \
{ \
result = type##_free_list; \
type##_free_list = \
* (structtype **) ((char *) result + sizeof (void *)); \
} \
else \
ALLOCATE_FIXED_TYPE_FROM_BLOCK (type, result); \
MARK_STRUCT_AS_NOT_FREE (result); \
INCREMENT_CONS_COUNTER (sizeof (structtype)); \
} while (0)
#endif
/* INVALID_POINTER_VALUE should be a value that is invalid as a pointer
to a Lisp object and invalid as an actual Lisp_Object value. We have
to make sure that this value cannot be an integer in Lisp_Object form.
0xFFFFFFFF could be so on a 64-bit system, so we extend it to 64 bits.
On a 32-bit system, the type bits will be non-zero, making the value
be a pointer, and the pointer will be misaligned.
Even if Emacs is run on some weirdo system that allows and allocates
byte-aligned pointers, this pointer is at the very top of the address
space and so it's almost inconceivable that it could ever be valid. */
#if INTBITS == 32
# define INVALID_POINTER_VALUE 0xFFFFFFFF
#elif INTBITS == 48
# define INVALID_POINTER_VALUE 0xFFFFFFFFFFFF
#elif INTBITS == 64
# define INVALID_POINTER_VALUE 0xFFFFFFFFFFFFFFFF
#else
You have some weird system and need to supply a reasonable value here.
#endif
#define FREE_STRUCT_P(ptr) \
(* (void **) ptr == (void *) INVALID_POINTER_VALUE)
#define MARK_STRUCT_AS_FREE(ptr) \
(* (void **) ptr = (void *) INVALID_POINTER_VALUE)
#define MARK_STRUCT_AS_NOT_FREE(ptr) \
(* (void **) ptr = 0)
#ifdef ERROR_CHECK_GC
#define PUT_FIXED_TYPE_ON_FREE_LIST(type, structtype, ptr) \
do { if (type##_free_list_tail) \
{ \
/* When we store the chain pointer, we complement all \
its bits; this should significantly increase its \
bogosity in case someone tries to use the value, and \
should make us dump faster if someone stores something \
over the pointer because when it gets un-complemented in \
ALLOCATED_FIXED_TYPE(), the resulting pointer will be \
extremely bogus. */ \
* (structtype **) \
((char *) type##_free_list_tail + sizeof (void *)) = \
(structtype *) ~(unsigned long) ptr; \
} \
else \
type##_free_list = ptr; \
type##_free_list_tail = ptr; \
} while (0)
#else
#define PUT_FIXED_TYPE_ON_FREE_LIST(type, structtype, ptr) \
do { * (structtype **) ((char *) ptr + sizeof (void *)) = \
type##_free_list; \
type##_free_list = ptr; \
} while (0)
#endif
/* TYPE and STRUCTTYPE are the same as in ALLOCATE_FIXED_TYPE(). */
#define FREE_FIXED_TYPE(type, structtype, ptr) \
do { structtype *_weird_ = (ptr); \
ADDITIONAL_FREE_##type (_weird_); \
deadbeef_memory (ptr, sizeof (structtype)); \
PUT_FIXED_TYPE_ON_FREE_LIST (type, structtype, ptr); \
MARK_STRUCT_AS_FREE (_weird_); \
} while (0)
/**********************************************************************/
/* Cons allocation */
/**********************************************************************/
DECLARE_FIXED_TYPE_ALLOC (cons, struct Lisp_Cons);
/* conses are used and freed so often that we set this really high */
/* #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_cons 20000 */
#define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_cons 2000
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;
{
Lisp_Object val = Qnil;
struct Lisp_Cons *c;
ALLOCATE_FIXED_TYPE (cons, struct Lisp_Cons, c);
XSETCONS (val, c);
XCAR (val) = car;
XCDR (val) = cdr;
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;
Lisp_Object *args;
{
Lisp_Object len, val, val_tail;
len = make_number (nargs);
val = Fmake_list (len, Qnil);
val_tail = val;
while (!NILP (val_tail))
{
XCAR (val_tail) = *args++;
val_tail = XCDR (val_tail);
}
return val;
}
Lisp_Object
list1 (Lisp_Object obj0)
{
return (Fcons (obj0, Qnil));
}
Lisp_Object
list2 (Lisp_Object obj0, Lisp_Object obj1)
{
return Fcons (obj0, list1 (obj1));
}
Lisp_Object
list3 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2)
{
return Fcons (obj0, list2 (obj1, obj2));
}
static Lisp_Object
cons3 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2)
{
return Fcons (obj0, Fcons (obj1, obj2));
}
Lisp_Object
list4 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, Lisp_Object obj3)
{
return Fcons (obj0, list3 (obj1, obj2, obj3));
}
Lisp_Object
list5 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, Lisp_Object obj3,
Lisp_Object obj4)
{
return Fcons (obj0, list4 (obj1, obj2, obj3, obj4));
}
Lisp_Object
list6 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, Lisp_Object obj3,
Lisp_Object obj4, Lisp_Object obj5)
{
return Fcons (obj0, list5 (obj1, obj2, obj3, obj4, obj5));
}
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)
Lisp_Object length, init;
{
Lisp_Object val;
int size;
if (!INTP (length) || XINT (length) < 0)
length = wrong_type_argument (Qnatnump, length);
size = XINT (length);
val = Qnil;
while (size-- > 0)
val = Fcons (init, val);
return val;
}
/**********************************************************************/
/* Float allocation */
/**********************************************************************/
#ifdef LISP_FLOAT_TYPE
DECLARE_FIXED_TYPE_ALLOC (float, struct Lisp_Float);
#define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_float 1000
Lisp_Object
make_float (double float_value)
{
Lisp_Object val;
struct Lisp_Float *f;
ALLOCATE_FIXED_TYPE (float, struct Lisp_Float, f);
f->lheader.implementation = lrecord_float;
float_next (f) = ((struct Lisp_Float *) -1);
float_data (f) = float_value;
XSETFLOAT (val, f);
return (val);
}
#endif /* LISP_FLOAT_TYPE */
/**********************************************************************/
/* Vector allocation */
/**********************************************************************/
static Lisp_Object all_vectors;
/* #### should allocate `small' vectors from a frob-block */
static struct Lisp_Vector *
make_vector_internal (int sizei)
{
int sizem = (sizeof (struct Lisp_Vector)
/* -1 because struct Lisp_Vector includes 1 slot,
* +1 to account for vector_next */
+ (sizei - 1 + 1) * sizeof (Lisp_Object)
);
struct Lisp_Vector *p = allocate_lisp_storage (sizem);
#ifdef LRECORD_VECTOR
set_lheader_implementation (&(p->lheader), lrecord_vector);
#endif
INCREMENT_CONS_COUNTER (sizem);
p->size = sizei;
vector_next (p) = all_vectors;
XSETVECTOR (all_vectors, p);
return (p);
}
Lisp_Object
make_vector (int length, Lisp_Object init)
{
int elt;
Lisp_Object vector = Qnil;
struct Lisp_Vector *p;
if (length < 0)
length = XINT (wrong_type_argument (Qnatnump, make_number (length)));
p = make_vector_internal (length);
XSETVECTOR (vector, p);
#if 0
/* Initialize big arrays full of 0's quickly, for what that's worth */
{
char *travesty = (char *) &init;
for (i = 1; i < sizeof (Lisp_Object); i++)
{
if (travesty[i] != travesty[0])
goto fill;
}
memset (vector_data (p), travesty[0], length * sizeof (Lisp_Object));
return (vector);
}
fill:
#endif
for (elt = 0; elt < length; elt++)
vector_data(p)[elt] = init;
return (vector);
}
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)
Lisp_Object length, init;
{
if (!INTP (length) || XINT (length) < 0)
length = wrong_type_argument (Qnatnump, length);
return (make_vector (XINT (length), init));
}
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)
int nargs;
Lisp_Object *args;
{
Lisp_Object vector = Qnil;
int elt;
struct Lisp_Vector *p;
p = make_vector_internal (nargs);
XSETVECTOR (vector, p);
for (elt = 0; elt < nargs; elt++)
vector_data(p)[elt] = args[elt];
return (vector);
}
Lisp_Object
vector1 (Lisp_Object obj0)
{
return Fvector (1, &obj0);
}
Lisp_Object
vector2 (Lisp_Object obj0, Lisp_Object obj1)
{
Lisp_Object args[2];
args[0] = obj0;
args[1] = obj1;
return Fvector (2, args);
}
Lisp_Object
vector3 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2)
{
Lisp_Object args[3];
args[0] = obj0;
args[1] = obj1;
args[2] = obj2;
return Fvector (3, args);
}
Lisp_Object
vector4 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
Lisp_Object obj3)
{
Lisp_Object args[4];
args[0] = obj0;
args[1] = obj1;
args[2] = obj2;
args[3] = obj3;
return Fvector (4, args);
}
Lisp_Object
vector5 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
Lisp_Object obj3, Lisp_Object obj4)
{
Lisp_Object args[5];
args[0] = obj0;
args[1] = obj1;
args[2] = obj2;
args[3] = obj3;
args[4] = obj4;
return Fvector (5, args);
}
Lisp_Object
vector6 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
Lisp_Object obj3, Lisp_Object obj4, Lisp_Object obj5)
{
Lisp_Object args[6];
args[0] = obj0;
args[1] = obj1;
args[2] = obj2;
args[3] = obj3;
args[4] = obj4;
args[5] = obj5;
return Fvector (6, args);
}
Lisp_Object
vector7 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
Lisp_Object obj3, Lisp_Object obj4, Lisp_Object obj5,
Lisp_Object obj6)
{
Lisp_Object args[7];
args[0] = obj0;
args[1] = obj1;
args[2] = obj2;
args[3] = obj3;
args[4] = obj4;
args[5] = obj5;
args[6] = obj6;
return Fvector (7, args);
}
Lisp_Object
vector8 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2,
Lisp_Object obj3, Lisp_Object obj4, Lisp_Object obj5,
Lisp_Object obj6, Lisp_Object obj7)
{
Lisp_Object args[8];
args[0] = obj0;
args[1] = obj1;
args[2] = obj2;
args[3] = obj3;
args[4] = obj4;
args[5] = obj5;
args[6] = obj6;
args[7] = obj7;
return Fvector (8, args);
}
/**********************************************************************/
/* Bytecode (aka "compiled-function") allocation */
/**********************************************************************/
DECLARE_FIXED_TYPE_ALLOC (bytecode, struct Lisp_Bytecode);
#define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_bytecode 1000
static Lisp_Object
make_bytecode (int make_pure)
{
struct Lisp_Bytecode *b;
Lisp_Object new;
int size = sizeof (struct Lisp_Bytecode);
if (make_pure && check_purespace (size))
{
b = (struct Lisp_Bytecode *) (PUREBEG + pureptr);
set_lheader_implementation (&(b->lheader), lrecord_bytecode);
pureptr += size;
bump_purestat (&purestat_bytecode, size);
}
else
{
ALLOCATE_FIXED_TYPE (bytecode, struct Lisp_Bytecode, b);
set_lheader_implementation (&(b->lheader), lrecord_bytecode);
}
b->maxdepth = 0;
b->flags.documentationp = 0;
b->flags.interactivep = 0;
b->flags.domainp = 0; /* I18N3 */
b->bytecodes = Qzero;
b->constants = Qzero;
b->arglist = Qnil;
b->doc_and_interactive = Qnil;
XSETBYTECODE (new, b);
return (new);
}
DEFUN ("make-byte-code", Fmake_byte_code, Smake_byte_code, 4, MANY, 0,
"Create a compiled-function object.\n\
Usage: (arglist instructions constants stack-size\n\
&optional doc-string interactive-spec)\n\
Note that, unlike all other emacs-lisp functions, calling this with five\n\
arguments is NOT the same as calling it with six arguments, the last of\n\
which is nil. If the INTERACTIVE arg is specified as nil, then that means\n\
that this function was defined with `(interactive)'. If the arg is not\n\
specified, then that means the function is not interactive.\n\
This is terrible behavior which is retained for compatibility with old\n\
`.elc' files which expected these semantics.")
(nargs, args)
int nargs;
Lisp_Object *args;
{
/* In a non-insane world this function would have this arglist...
(arglist, instructions, constants, stack_size, doc_string, interactive)
Lisp_Object arglist, instructions, constants, stack_size, doc_string,
interactive;
*/
Lisp_Object arglist = args[0];
Lisp_Object instructions = args[1];
Lisp_Object constants = args[2];
Lisp_Object stack_size = args[3];
Lisp_Object doc_string = ((nargs > 4) ? args[4] : Qnil);
Lisp_Object interactive = ((nargs > 5) ? args[5] : Qunbound);
if (nargs > 6)
return Fsignal (Qwrong_number_of_arguments,
list2 (intern ("make-byte-code"), make_number (nargs)));
CHECK_LIST (arglist, 0);
CHECK_STRING (instructions, 0);
CHECK_VECTOR (constants, 0);
CHECK_NATNUM (stack_size, 0);
/* doc_string may be nil, string, or int. */
/* interactive may be list or string (or unbound). */
if (purify_flag)
{
if (!purified (arglist))
arglist = Fpurecopy (arglist);
if (!purified (instructions))
instructions = Fpurecopy (instructions);
if (!purified (doc_string))
doc_string = Fpurecopy (doc_string);
if (!purified (interactive) && !EQ (interactive, Qunbound))
interactive = Fpurecopy (interactive);
/* Statistics are kept differently for the constants */
if (!purified (constants))
#ifdef PURESTAT
{
int old = purecopying_for_bytecode;
purecopying_for_bytecode = 1;
constants = Fpurecopy (constants);
purecopying_for_bytecode = old;
}
#else
constants = Fpurecopy (constants);
#endif /* PURESTAT */
#ifdef PURESTAT
if (STRINGP (instructions))
bump_purestat (&purestat_string_bytecodes, pure_sizeof (instructions));
if (VECTORP (constants))
bump_purestat (&purestat_vector_bytecode_constants,
pure_sizeof (constants));
if (STRINGP (doc_string))
/* These should be have been snagged by make-docfile... */
bump_purestat (&purestat_string_documentation,
pure_sizeof (doc_string));
if (STRINGP (interactive))
bump_purestat (&purestat_string_interactive,
pure_sizeof (interactive));
#endif /* PURESTAT */
}
{
int docp = !NILP (doc_string);
int intp = !EQ (interactive, Qunbound);
#ifdef I18N3
int domp = !NILP (Vfile_domain);
#endif
Lisp_Object val = make_bytecode (purify_flag);
struct Lisp_Bytecode *b = XBYTECODE (val);
b->flags.documentationp = docp;
b->flags.interactivep = intp;
#ifdef I18N3
b->flags.domainp = domp;
#endif
b->maxdepth = XINT (stack_size);
b->bytecodes = instructions;
b->constants = constants;
b->arglist = arglist;
#ifdef I18N3
if (docp && intp && domp)
b->doc_and_interactive = (((purify_flag) ? pure_cons : Fcons)
(doc_string,
(((purify_flag) ? pure_cons : Fcons)
(interactive, Vfile_domain))));
else if (docp && domp)
b->doc_and_interactive = (((purify_flag) ? pure_cons : Fcons)
(doc_string, Vfile_domain));
else if (intp && domp)
b->doc_and_interactive = (((purify_flag) ? pure_cons : Fcons)
(interactive, Vfile_domain));
else
#endif
if (docp && intp)
b->doc_and_interactive = (((purify_flag) ? pure_cons : Fcons)
(doc_string, interactive));
else if (intp)
b->doc_and_interactive = interactive;
#ifdef I18N3
else if (domp)
b->doc_and_interactive = Vfile_domain;
#endif
else
b->doc_and_interactive = doc_string;
return (val);
}
}
/**********************************************************************/
/* Symbol allocation */
/**********************************************************************/
DECLARE_FIXED_TYPE_ALLOC (symbol, struct Lisp_Symbol);
#define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_symbol 1000
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.")
(str)
Lisp_Object str;
{
Lisp_Object val;
struct Lisp_Symbol *p;
CHECK_STRING (str, 0);
ALLOCATE_FIXED_TYPE (symbol, struct Lisp_Symbol, p);
#ifdef LRECORD_SYMBOL
set_lheader_implementation (&(p->lheader), lrecord_symbol);
#endif
p->name = XSTRING (str);
p->plist = Qnil;
p->value = Qunbound;
p->function = Qunbound;
symbol_next (p) = 0;
XSETSYMBOL (val, p);
return val;
}
/**********************************************************************/
/* Extent allocation */
/**********************************************************************/
DECLARE_FIXED_TYPE_ALLOC (extent, struct extent);
#define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_extent 1000
struct extent *
make_extent (void)
{
struct extent *e;
ALLOCATE_FIXED_TYPE (extent, struct extent, e);
/* memset (e, 0, sizeof (struct extent)); */
set_lheader_implementation (&(e->lheader), lrecord_extent);
extent_object (e) = Qnil;
set_extent_start (e, 0);
set_extent_end (e, 0);
e->plist = Qnil;
memset (&e->flags, 0, sizeof (e->flags));
extent_face (e) = Qnil;
e->flags.end_open = 1; /* default is for endpoints to behave like markers */
e->flags.detachable = 1;
return (e);
}
/**********************************************************************/
/* Extent replica allocation */
/**********************************************************************/
DECLARE_FIXED_TYPE_ALLOC (extent_replica, struct extent_replica);
#define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_extent_replica 1000
struct extent_replica *
make_extent_replica (Lisp_Object extent, Bufpos start, Bufpos end)
{
struct extent_replica *r;
ALLOCATE_FIXED_TYPE (extent_replica, struct extent_replica, r);
/* memset (r, 0, sizeof (struct extent_replica)); */
set_lheader_implementation (&(r->lheader), lrecord_extent_replica);
extent_replica_extent (r) = extent;
set_extent_replica_start (r, (start >= 0) ? start : 0);
set_extent_replica_end (r, (end >= start) ? end : start);
return (r);
}
/**********************************************************************/
/* Event allocation */
/**********************************************************************/
DECLARE_FIXED_TYPE_ALLOC (event, struct Lisp_Event);
#define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_event 1000
Lisp_Object
make_event (void)
{
Lisp_Object val;
struct Lisp_Event *e;
ALLOCATE_FIXED_TYPE (event, struct Lisp_Event, e);
set_lheader_implementation (&(e->lheader), lrecord_event);
XSETEVENT (val, e);
return val;
}
/**********************************************************************/
/* Marker allocation */
/**********************************************************************/
DECLARE_FIXED_TYPE_ALLOC (marker, struct Lisp_Marker);
#define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_marker 1000
DEFUN ("make-marker", Fmake_marker, Smake_marker, 0, 0, 0,
"Return a newly allocated marker which does not point at any place.")
()
{
Lisp_Object val;
struct Lisp_Marker *p;
ALLOCATE_FIXED_TYPE (marker, struct Lisp_Marker, p);
set_lheader_implementation (&(p->lheader), lrecord_marker);
p->buffer = 0;
p->memind = 0;
marker_next (p) = 0;
XSETMARKER (val, p);
return val;
}
/**********************************************************************/
/* String allocation */
/**********************************************************************/
/* The data for "short" strings generally resides inside of structs of type
string_chars_block. The Lisp_String structure is allocated just like any
other Lisp object (except for vectors), and these are freelisted when
they get garbage collected. The data for short strings get compacted,
but the data for large strings do not.
Previously Lisp_String structures were relocated, but this caused a lot
of bus-errors because the C code didn't include enough GCPRO's for
strings (since EVERY REFERENCE to a short string needed to be GCPRO'd so
that the reference would get relocated).
This new method makes things somewhat bigger, but it is MUCH safer. */
DECLARE_FIXED_TYPE_ALLOC (string, struct Lisp_String);
/* strings are used and freed quite often */
/* #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_string 10000 */
#define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_string 1000
/* String blocks contain this many useful bytes. */
#define STRING_CHARS_BLOCK_SIZE \
(8192 - MALLOC_OVERHEAD - ((2 * sizeof (struct string_chars_block *)) \
+ sizeof (LISP_WORD_TYPE)))
/* Block header for small strings. */
struct string_chars_block
{
LISP_WORD_TYPE pos;
struct string_chars_block *next;
struct string_chars_block *prev;
/* Contents of string_chars_block->string_chars are interleaved
string_chars structures (see below) and the actual string data */
unsigned char string_chars[STRING_CHARS_BLOCK_SIZE];
};
struct string_chars_block *first_string_chars_block;
struct string_chars_block *current_string_chars_block;
/* If SIZE is the length of a string, this returns how many bytes
* the string occupies in string_chars_block->string_chars
* (including alignment padding).
*/
#define STRING_FULLSIZE(s) \
ALIGN_SIZE (((s) + 1 + sizeof (struct Lisp_String *)),\
ALIGNOF (struct Lisp_String *))
#define BIG_STRING_FULLSIZE_P(fullsize) ((fullsize) >= STRING_CHARS_BLOCK_SIZE)
#define BIG_STRING_SIZE_P(size) (BIG_STRING_FULLSIZE_P (STRING_FULLSIZE(size)))
#define CHARS_TO_STRING_CHAR(x) \
((struct string_chars *) \
(((char *) (x)) - (slot_offset (struct string_chars, chars))))
struct string_chars
{
struct Lisp_String *string;
unsigned char chars[1];
};
static void
init_string_chars_alloc (void)
{
first_string_chars_block =
(struct string_chars_block *) xmalloc (sizeof (struct string_chars_block));
first_string_chars_block->prev = 0;
first_string_chars_block->next = 0;
first_string_chars_block->pos = 0;
current_string_chars_block = first_string_chars_block;
}
Lisp_Object
make_uninit_string (Bytecount length)
{
struct Lisp_String *s;
struct string_chars *s_chars;
int fullsize = STRING_FULLSIZE (length);
Lisp_Object val;
if ((length < 0) || (fullsize <= 0))
abort ();
/* Allocate the string header */
ALLOCATE_FIXED_TYPE (string, struct Lisp_String, s);
/* Allocate the string's actual data */
if (BIG_STRING_FULLSIZE_P (fullsize))
{
s_chars = (struct string_chars *) xmalloc (fullsize);
}
else if (fullsize <=
(countof (current_string_chars_block->string_chars)
- current_string_chars_block->pos))
{
/* This string can fit in the current string chars block */
s_chars = (struct string_chars *)
(current_string_chars_block->string_chars
+ current_string_chars_block->pos);
current_string_chars_block->pos += fullsize;
}
else
{
/* Make a new current string chars block */
struct string_chars_block *new
= (struct string_chars_block *)
xmalloc (sizeof (struct string_chars_block));
current_string_chars_block->next = new;
new->prev = current_string_chars_block;
new->next = 0;
current_string_chars_block = new;
new->pos = fullsize;
s_chars = (struct string_chars *)
current_string_chars_block->string_chars;
}
s_chars->string = s;
set_string_data (s, &(s_chars->chars[0]));
set_string_length (s, length);
s->plist = Qnil;
set_string_byte (s, length, 0);
INCREMENT_CONS_COUNTER (fullsize);
XSETSTRING (val, s);
return (val);
}
DEFUN ("make-string", Fmake_string, Smake_string, 2, 2, 0,
"Return a newly created string of length LENGTH, with each element being INIT.\n\
LENGTH must be an integer and INIT must be a character.")
(length, init)
Lisp_Object length, init;
{
Lisp_Object val;
CHECK_NATNUM (length, 0);
CHECK_COERCE_CHAR (init, 1);
#ifdef MULE
{
Bufbyte str[MAX_EMCHAR_LEN];
int len = emchar_to_charptr (XINT (init), str);
val = make_uninit_string (len * XINT (length));
if (len == 1)
/* Optimize the single-byte case */
memset (string_data (XSTRING (val)), XINT (init),
string_length (XSTRING (val)));
else
{
int i, j, k;
Bufbyte *ptr = string_data (XSTRING (val));
k = 0;
for (i = 0; i < XINT (length); i++)
for (j = 0; j < len; j++)
ptr[k++] = str[j];
}
}
#else
/* !!#### remove this after 19.13 */
val = make_uninit_string (XINT (length));
memset (string_data (XSTRING (val)), XINT (init),
string_length (XSTRING (val)));
#endif
return (val);
}
Lisp_Object
make_string (CONST Bufbyte *contents, Bytecount length)
{
Lisp_Object val;
val = make_uninit_string (length);
memcpy (string_data (XSTRING (val)), contents, length);
return (val);
}
Lisp_Object
make_ext_string (CONST char *contents, int length)
{
Bufbyte *intstr;
Bytecount intlen;
intstr = charptr_from_external (contents, length, &intlen);
return make_string (intstr, intlen);
}
Lisp_Object
build_string (CONST char *str)
{
return make_string ((Bufbyte *) str, strlen (str));
}
Lisp_Object
build_ext_string (CONST char *str)
{
return build_string (c_charptr_from_external (str));
}
Lisp_Object
build_translated_string (CONST char *str)
{
return build_string (GETTEXT (str));
}
/**********************************************************************/
/* Purity of essence, peace on earth */
/**********************************************************************/
static int symbols_initialized;
Lisp_Object
make_pure_string (CONST Bufbyte *data, Bytecount length,
int no_need_to_copy_data)
{
Lisp_Object new;
struct Lisp_String *s;
int size = (sizeof (struct Lisp_String) + ((no_need_to_copy_data)
? 0
/* + 1 for terminating 0 */
: (length + 1)));
size = ALIGN_SIZE (size, ALIGNOF (Lisp_Object));
if (symbols_initialized && !pure_lossage)
{
/* Try to share some names. Saves a few kbytes. */
Lisp_Object tem = oblookup (Vobarray, data, length);
if (SYMBOLP (tem))
{
s = XSYMBOL (tem)->name;
if (!PURIFIED (s)) abort ();
XSETSTRING (new, s);
return (new);
}
}
if (!check_purespace (size))
return (make_string (data, length));
s = (struct Lisp_String *) (PUREBEG + pureptr);
set_string_length (s, length);
if (no_need_to_copy_data)
{
set_string_data (s, (Bufbyte *) data);
}
else
{
set_string_data (s, (Bufbyte *) s + sizeof (struct Lisp_String));
memcpy (string_data (s), data, length);
set_string_byte (s, length, 0);
}
/* A waste: always Qnil in pure strings. */
s->plist = Qnil;
pureptr += size;
#ifdef PURESTAT
bump_purestat (&purestat_string_all, size);
if (purecopying_for_bytecode)
bump_purestat (&purestat_string_other_function, size);
#endif
XSETSTRING (new, s);
return (new);
}
Lisp_Object
make_pure_pname (CONST Bufbyte *data, Bytecount length,
int no_need_to_copy_data)
{
Lisp_Object name = make_pure_string (data, length, no_need_to_copy_data);
bump_purestat (&purestat_string_pname, pure_sizeof (name));
/* We've made (at least) Qnil now, and Vobarray will soon be set up. */
symbols_initialized = 1;
return (name);
}
Lisp_Object
pure_cons (Lisp_Object car, Lisp_Object cdr)
{
Lisp_Object new;
if (!check_purespace (sizeof (struct Lisp_Cons)))
return (Fcons (Fpurecopy (car), Fpurecopy (cdr)));
XSETCONS (new, PUREBEG + pureptr);
pureptr += sizeof (struct Lisp_Cons);
bump_purestat (&purestat_cons, sizeof (struct Lisp_Cons));
XCAR (new) = Fpurecopy (car);
XCDR (new) = Fpurecopy (cdr);
return (new);
}
#ifdef LISP_FLOAT_TYPE
Lisp_Object
make_pure_float (double num)
{
struct Lisp_Float *f;
Lisp_Object val;
/* Make sure that PUREBEG + pureptr is aligned on at least a sizeof
(double) boundary. Some architectures (like the sparc) require
this, and I suspect that floats are rare enough that it's no
tragedy for those that don't. */
{
#if defined (__GNUC__) && (__GNUC__ >= 2)
/* In gcc, we can directly ask what the alignment constraints of a
structure are, but in general, that's not possible... Arrgh!!
*/
int alignment = __alignof (struct Lisp_Float);
#else /* !GNUC */
/* Best guess is to make the `double' slot be aligned to the size
of double (which is probably 8 bytes). This assumes that it's
ok to align the beginning of the structure to the same boundary
that the `double' slot in it is supposed to be aligned to; this
should be ok because presumably there is padding in the layout
of the struct to account for this.
*/
int alignment = sizeof (float_data (f));
#endif
char *p = ((char *) PUREBEG + pureptr);
p = (char *) (((unsigned LISP_WORD_TYPE) p + alignment - 1) & - alignment);
pureptr = p - (char *) PUREBEG;
}
if (!check_purespace (sizeof (struct Lisp_Float)))
return (make_float (num));
f = (struct Lisp_Float *) (PUREBEG + pureptr);
set_lheader_implementation (&(f->lheader), lrecord_float);
pureptr += sizeof (struct Lisp_Float);
bump_purestat (&purestat_float, sizeof (struct Lisp_Float));
float_next (f) = ((struct Lisp_Float *) -1);
float_data (f) = num;
XSETFLOAT (val, f);
return (val);
}
#endif /* LISP_FLOAT_TYPE */
Lisp_Object
make_pure_vector (int len, Lisp_Object init)
{
Lisp_Object new;
int size = (sizeof (struct Lisp_Vector)
+ (len - 1) * sizeof (Lisp_Object));
init = Fpurecopy (init);
if (!check_purespace (size))
return (make_vector (len, init));
XSETVECTOR (new, PUREBEG + pureptr);
pureptr += size;
bump_purestat (&purestat_vector_all, size);
XVECTOR (new)->size = len;
for (size = 0; size < len; size++)
vector_data (XVECTOR (new))[size] = init;
return (new);
}
#if 0
/* Presently unused */
void *
alloc_pure_lrecord (int size, struct lrecord_implementation *implementation)
{
struct lrecord_header *header = (void *) (PUREBEG + pureptr);
if (pureptr + size > PURESIZE)
pure_storage_exhausted ();
set_lheader_implementation (header, implementation);
header->next = 0;
return (header);
}
#endif
DEFUN ("purecopy", Fpurecopy, Spurecopy, 1, 1, 0,
"Make a copy of OBJECT in pure storage.\n\
Recursively copies contents of vectors and cons cells.\n\
Does not copy symbols.")
(obj)
Lisp_Object obj;
{
int i;
if (!purify_flag)
return (obj);
if (!POINTER_TYPE_P (XTYPE (obj))
|| PURIFIED (XPNTR (obj)))
return (obj);
switch (XTYPE (obj))
{
case Lisp_Cons:
return pure_cons (XCAR (obj), XCDR (obj));
case Lisp_String:
/* #### also needs to copy the string properties, esp.
so that I18N3 translation will work properly. */
return make_pure_string (string_data (XSTRING (obj)),
string_length (XSTRING (obj)),
0);
case Lisp_Vector:
{
struct Lisp_Vector *o = XVECTOR (obj);
Lisp_Object new = make_pure_vector (vector_length (o), Qnil);
for (i = 0; i < vector_length (o); i++)
vector_data (XVECTOR (new))[i] = Fpurecopy (o->contents[i]);
return (new);
}
default:
{
if (BYTECODEP (obj))
{
struct Lisp_Bytecode *o = XBYTECODE (obj);
Lisp_Object new = make_bytecode (1);
struct Lisp_Bytecode *n = XBYTECODE (obj);
n->flags = o->flags;
n->bytecodes = Fpurecopy (o->bytecodes);
n->constants = Fpurecopy (o->constants);
n->arglist = Fpurecopy (o->arglist);
n->doc_and_interactive = Fpurecopy (o->doc_and_interactive);
return (new);
}
#ifdef LISP_FLOAT_TYPE
else if (FLOATP (obj))
return make_pure_float (float_data (XFLOAT (obj)));
#endif /* LISP_FLOAT_TYPE */
else if (!SYMBOLP (obj))
signal_simple_error ("Can't purecopy %S", obj);
}
}
return (obj);
}
void
report_pure_usage (int report_impurities,
int die_if_pure_storage_exceeded)
{
if (pure_lossage)
{
CONST long report_round = 5000;
message ("\n****\tPure Lisp storage exhausted!\n"
"\tCheck whether you are loading .el files when .elc files were intended.\n"
"\tOtherwise, increase PURESIZE in puresize.h and relink.\n\n"
"\tPURESIZE is presently %ld.\n"
"\tAn additional %ld bytes will guarantee enough pure space;\n"
"\ta smaller increment may work (due to structure-sharing).\n"
"****",
(long) PURESIZE,
(((pure_lossage + report_round - 1)
/ report_round) * report_round));
}
else
{
int lost = (PURESIZE - pureptr) / 1024;
char buf[200];
sprintf (buf, "Purespace usage: %ld of %ld (%d%%",
pureptr, (long) PURESIZE,
(int) (pureptr / (PURESIZE / 100.0) + 0.5));
if (lost > 2)
sprintf (buf + strlen (buf), " -- %dk wasted", lost);
strcat (buf, ").");
message ("%s", buf);
}
#ifdef PURESTAT
{
int iii;
purestat_vector_other.nbytes =
purestat_vector_all.nbytes - purestat_vector_bytecode_constants.nbytes;
purestat_vector_other.nobjects =
purestat_vector_all.nobjects - purestat_vector_bytecode_constants.nobjects;
purestat_string_other.nbytes =
purestat_string_all.nbytes - (purestat_string_pname.nbytes +
purestat_string_bytecodes.nbytes +
purestat_string_interactive.nbytes +
purestat_string_documentation.nbytes +
#ifdef I18N3
purestat_string_domain.nbytes +
#endif
purestat_string_other_function.nbytes);
purestat_string_other.nobjects =
purestat_string_all.nobjects - (purestat_string_pname.nobjects +
purestat_string_bytecodes.nobjects +
purestat_string_interactive.nobjects +
purestat_string_documentation.nobjects +
#ifdef I18N3
purestat_string_domain.nobjects +
#endif
purestat_string_other_function.nobjects);
message (" %-24stotal: bytes:", "");
for (iii = 0; iii < countof (purestats); iii++)
if (!purestats[iii])
message ("");
else
message (" %-24s%5d %7d %2d%%",
purestats[iii]->name,
purestats[iii]->nobjects,
purestats[iii]->nbytes,
(int) (purestats[iii]->nbytes / (pureptr / 100.0) + 0.5));
}
#endif /* PURESTAT */
if (report_impurities)
{
Lisp_Object tem = Felt (Fgarbage_collect (), make_number (5));
struct gcpro gcpro1;
GCPRO1 (tem);
message ("\nImpurities:");
while (!NILP (tem))
{
if (CONSP (tem) && SYMBOLP (Fcar (tem)) && CONSP (Fcdr (tem)))
{
int total = XINT (Fcar (Fcdr (tem)));
if (total > 0)
{
char buf [100];
char *s = buf;
memcpy (buf, string_data (XSYMBOL (Fcar (tem))->name),
string_length (XSYMBOL (Fcar (tem))->name) + 1);
while (*s++) if (*s == '-') *s = ' ';
s--; *s++ = ':'; *s = 0;
message (" %-32s%6d", buf, total);
}
tem = Fcdr (Fcdr (tem));
}
else /* WTF?! */
{
Fprin1 (tem, Qexternal_debugging_output);
tem = Qnil;
}
}
UNGCPRO;
garbage_collect_1 (); /* GC garbage_collect's garbage */
}
message ("");
if (pure_lossage && die_if_pure_storage_exceeded)
fatal ("Pure storage exhausted");
}
/**********************************************************************/
/* staticpro */
/**********************************************************************/
struct gcpro *gcprolist;
/* 415 used Mly 29-Jun-93 */
#define NSTATICS 1500
/* Not "static" because of linker lossage on some systems */
Lisp_Object *staticvec[NSTATICS]
/* Force it into data space! */
= {0};
static int staticidx;
/* Put an entry in staticvec, pointing at the variable whose address is given
*/
void
staticpro (Lisp_Object *varaddress)
{
if (staticidx >= countof (staticvec))
abort ();
staticvec[staticidx++] = varaddress;
}
/* Mark reference to a Lisp_Object. If the object referred to has not been
seen yet, recursively mark all the references contained in it. */
static void
mark_object (Lisp_Object obj)
{
tail_recurse:
if (!POINTER_TYPE_P (XGCTYPE (obj)))
return;
if (PURIFIED (XPNTR (obj)))
return;
switch (XGCTYPE (obj))
{
case Lisp_Cons:
{
struct Lisp_Cons *ptr = XCONS (obj);
if (XMARKBIT (ptr->car))
break;
XMARK (ptr->car);
/* If the cdr is nil, tail-recurse on the car. */
if (EQ (ptr->cdr, Qnil))
{
obj = ptr->car;
}
else
{
mark_object (ptr->car);
obj = ptr->cdr;
}
goto tail_recurse;
}
case Lisp_Record:
/* case Lisp_Symbol_Value_Magic: */
{
struct lrecord_header *lheader = XRECORD_LHEADER (obj);
CONST struct lrecord_implementation *implementation
= lheader->implementation;
if (! MARKED_RECORD_HEADER_P (lheader) &&
! UNMARKABLE_RECORD_HEADER_P (lheader))
{
MARK_RECORD_HEADER (lheader);
if (implementation->marker != 0)
{
obj = ((implementation->marker) (obj, mark_object));
if (!NILP (obj)) goto tail_recurse;
}
}
}
break;
case Lisp_String:
{
struct Lisp_String *ptr = XSTRING (obj);
if (!XMARKBIT (ptr->plist))
{
XMARK (ptr->plist);
obj = ptr->plist;
goto tail_recurse;
}
}
break;
case Lisp_Vector:
{
struct Lisp_Vector *ptr = XVECTOR (obj);
int len = vector_length (ptr);
int i;
if (len < 0)
break; /* Already marked */
ptr->size = -1 - len; /* Else mark it */
for (i = 0; i < len - 1; i++) /* and then mark its elements */
mark_object (ptr->contents[i]);
if (len > 0)
{
obj = ptr->contents[len - 1];
goto tail_recurse;
}
}
break;
#ifndef LRECORD_SYMBOL
case Lisp_Symbol:
{
struct Lisp_Symbol *sym = XSYMBOL (obj);
while (!XMARKBIT (sym->plist))
{
XMARK (sym->plist);
mark_object (sym->value);
mark_object (sym->function);
{
/* Open-code mark_string */
/* symbol->name is a struct Lisp_String *, not a Lisp_Object */
struct Lisp_String *pname = sym->name;
if (!PURIFIED (pname)
&& !XMARKBIT (pname->plist))
{
XMARK (pname->plist);
mark_object (pname->plist);
}
}
if (!symbol_next (sym))
{
obj = sym->plist;
goto tail_recurse;
}
mark_object (sym->plist);
/* Mark the rest of the symbols in the hash-chain */
sym = symbol_next (sym);
}
}
break;
#endif /* !LRECORD_SYMBOL */
default:
abort ();
}
}
#ifdef PURESTAT
/* Simpler than mark-object, because pure structure can't
have any circularities
*/
#if 0 /* unused */
static int idiot_c_doesnt_have_closures;
static void
idiot_c (Lisp_Object obj)
{
idiot_c_doesnt_have_closures += pure_sizeof (obj, 1);
}
#endif /* unused */
/* recurse arg isn't actually used */
static int
pure_sizeof (Lisp_Object obj /*, int recurse */)
{
int total = 0;
/*tail_recurse: */
if (!POINTER_TYPE_P (XTYPE (obj))
|| !PURIFIED (XPNTR (obj)))
return (total);
/* symbol's sizes are accounted for separately */
if (SYMBOLP (obj))
return (total);
switch (XTYPE (obj))
{
case Lisp_String:
{
struct Lisp_String *ptr = XSTRING (obj);
int size = string_length (ptr);
if (string_data (ptr) !=
(unsigned char *) ptr + sizeof (struct Lisp_String))
{
/* string-data not allocated contiguously.
Probably (better be!!) a pointer constant "C" data. */
size = sizeof (struct Lisp_String);
}
else
{
size = sizeof (struct Lisp_String) + size + 1;
size = ALIGN_SIZE (size, sizeof (Lisp_Object));
}
total += size;
}
break;
case Lisp_Vector:
{
struct Lisp_Vector *ptr = XVECTOR (obj);
int len = vector_length (ptr);
total += (sizeof (struct Lisp_Vector)
+ (len - 1) * sizeof (Lisp_Object));
#if 0 /* unused */
if (!recurse)
break;
{
int i;
for (i = 0; i < len - 1; i++)
total += pure_sizeof (ptr->contents[i], 1);
}
if (len > 0)
{
obj = ptr->contents[len - 1];
goto tail_recurse;
}
#endif /* unused */
}
break;
case Lisp_Record:
{
struct lrecord_header *lheader = XRECORD_LHEADER (obj);
CONST struct lrecord_implementation *implementation
= lheader->implementation;
if (implementation->size_in_bytes_method)
total += ((implementation->size_in_bytes_method) (lheader));
else
total += implementation->static_size;
#if 0 /* unused */
if (!recurse)
break;
if (implementation->marker != 0)
{
int old = idiot_c_doesnt_have_closures;
idiot_c_doesnt_have_closures = 0;
obj = ((implementation->marker) (obj, idiot_c));
total += idiot_c_doesnt_have_closures;
idiot_c_doesnt_have_closures = old;
if (!NILP (obj)) goto tail_recurse;
}
#endif /* unused */
}
break;
case Lisp_Cons:
{
struct Lisp_Cons *ptr = XCONS (obj);
total += sizeof (*ptr);
#if 0 /* unused */
if (!recurse)
break;
/* If the cdr is nil, tail-recurse on the car. */
if (EQ (ptr->cdr, Qnil))
{
obj = ptr->car;
}
else
{
total += pure_sizeof (ptr->car, 1);
obj = ptr->cdr;
}
goto tail_recurse;
#endif /* unused */
}
break;
/* Others can't be purified */
default:
abort ();
}
return (total);
}
#endif /* PURESTAT */
/* Find all structures not marked, and free them. */
static int gc_count_num_vector_used, gc_count_vector_total_size;
static int gc_count_vector_storage;
static int gc_count_num_short_string_in_use;
static int gc_count_string_total_size;
static int gc_count_short_string_total_size;
/* static int gc_count_total_records_used, gc_count_records_total_size; */
/* This will be used more extensively In The Future */
static int last_lrecord_type_index_assigned;
static CONST struct lrecord_implementation *lrecord_implementations_table[128];
#define max_lrecord_type (countof (lrecord_implementations_table) - 1)
static int
lrecord_type_index (CONST struct lrecord_implementation *implementation)
{
int type_index = *(implementation->lrecord_type_index);
/* Have to do this circuitous and validation test because of problems
dumping out initialized variables (ie can't set xxx_type_index to -1
because that would make xxx_type_index read-only in a dumped emacs. */
if (type_index < 0 || type_index > max_lrecord_type
|| lrecord_implementations_table[type_index] != implementation)
{
if (last_lrecord_type_index_assigned == max_lrecord_type)
abort ();
type_index = ++last_lrecord_type_index_assigned;
lrecord_implementations_table[type_index] = implementation;
*(implementation->lrecord_type_index) = type_index;
}
return (type_index);
}
/* stats on lcrecords in use - kinda kludgy */
static struct
{
int instances_in_use;
int bytes_in_use;
int instances_freed;
int bytes_freed;
} lcrecord_stats [countof (lrecord_implementations_table)];
static void
reset_lcrecord_stats (void)
{
int i;
for (i = 0; i < countof (lcrecord_stats); i++)
{
lcrecord_stats[i].instances_in_use = 0;
lcrecord_stats[i].bytes_in_use = 0;
lcrecord_stats[i].instances_freed = 0;
lcrecord_stats[i].bytes_freed = 0;
}
}
static void
tick_lcrecord_stats (CONST struct lrecord_header *h, int free_p)
{
CONST struct lrecord_implementation *implementation = h->implementation;
int type_index = lrecord_type_index (implementation);
unsigned int sz = (implementation->size_in_bytes_method
? ((implementation->size_in_bytes_method) (h))
: implementation->static_size);
if (free_p)
{
lcrecord_stats[type_index].instances_freed++;
lcrecord_stats[type_index].bytes_freed += sz;
}
else
{
lcrecord_stats[type_index].instances_in_use++;
lcrecord_stats[type_index].bytes_in_use += sz;
}
}
/* Free all unmarked records */
static void
sweep_lcrecords_1 (struct lcrecord_header **prev, int *used)
{
struct lcrecord_header *header;
int num_used = 0;
/* int total_size = 0; */
reset_lcrecord_stats ();
for (header = *prev; header; )
{
struct lrecord_header *h = &(header->lheader);
if (MARKED_RECORD_HEADER_P (h))
{
UNMARK_RECORD_HEADER (h);
num_used++;
/* total_size += ((n->implementation->size_in_bytes) (h));*/
prev = &(header->next);
header = *prev;
tick_lcrecord_stats (h, 0);
}
else
{
struct lcrecord_header *next = header->next;
*prev = next;
tick_lcrecord_stats (h, 1);
if (h->implementation->finalizer)
((h->implementation->finalizer) (h, 0));
xfree (header);
header = next;
}
}
*used = num_used;
/* *total = total_size; */
}
static void
sweep_vectors_1 (Lisp_Object *prev,
int *used, int *total, int *storage)
{
Lisp_Object vector;
int num_used = 0;
int total_size = 0;
int total_storage = 0;
for (vector = *prev; VECTORP (vector); )
{
struct Lisp_Vector *v = XVECTOR (vector);
int len = v->size;
if (len < 0) /* marked */
{
len = - (len + 1);
v->size = len;
total_size += len;
total_storage += (MALLOC_OVERHEAD
+ sizeof (struct Lisp_Vector)
+ (len - 1 + 1) * sizeof (Lisp_Object));
num_used++;
prev = &(vector_next (v));
vector = *prev;
}
else
{
Lisp_Object next = vector_next (v);
*prev = next;
xfree (v);
vector = next;
}
}
*used = num_used;
*total = total_size;
*storage = total_storage;
}
/* And the Lord said: Thou shalt use the `c-backslash-region' command
to make macros prettier. */
#ifdef ERROR_CHECK_GC
#define SWEEP_FIXED_TYPE_BLOCK(typename, obj_type) \
do { \
struct typename##_block *_frob_current; \
struct typename##_block **_frob_prev; \
int _frob_limit; \
int num_free = 0, num_used = 0; \
\
for (_frob_prev = ¤t_##typename##_block, \
_frob_current = current_##typename##_block, \
_frob_limit = current_##typename##_block_index; \
_frob_current; \
) \
{ \
int _frob_iii; \
\
for (_frob_iii = 0; _frob_iii < _frob_limit; _frob_iii++) \
{ \
obj_type *_frob_victim = &(_frob_current->block[_frob_iii]); \
\
if (FREE_STRUCT_P (_frob_victim)) \
{ \
num_free++; \
} \
else if (!MARKED_##typename##_P (_frob_victim)) \
{ \
num_free++; \
FREE_FIXED_TYPE (typename, obj_type, _frob_victim); \
} \
else \
{ \
num_used++; \
UNMARK_##typename (_frob_victim); \
} \
} \
_frob_prev = &(_frob_current->prev); \
_frob_current = _frob_current->prev; \
_frob_limit = countof (current_##typename##_block->block); \
} \
\
gc_count_num_##typename##_in_use = num_used; \
gc_count_num_##typename##_freelist = num_free; \
} while (0)
#else
#define SWEEP_FIXED_TYPE_BLOCK(typename, obj_type) \
do { \
struct typename##_block *_frob_current; \
struct typename##_block **_frob_prev; \
int _frob_limit; \
int num_free = 0, num_used = 0; \
\
typename##_free_list = 0; \
\
for (_frob_prev = ¤t_##typename##_block, \
_frob_current = current_##typename##_block, \
_frob_limit = current_##typename##_block_index; \
_frob_current; \
) \
{ \
int _frob_iii; \
int _frob_empty = 1; \
obj_type *_frob_old_free_list = typename##_free_list; \
\
for (_frob_iii = 0; _frob_iii < _frob_limit; _frob_iii++) \
{ \
obj_type *_frob_victim = &(_frob_current->block[_frob_iii]); \
\
if (FREE_STRUCT_P (_frob_victim)) \
{ \
num_free++; \
PUT_FIXED_TYPE_ON_FREE_LIST (typename, obj_type, _frob_victim); \
} \
else if (!MARKED_##typename##_P (_frob_victim)) \
{ \
num_free++; \
FREE_FIXED_TYPE (typename, obj_type, _frob_victim); \
} \
else \
{ \
_frob_empty = 0; \
num_used++; \
UNMARK_##typename (_frob_victim); \
} \
} \
if (!_frob_empty) \
{ \
_frob_prev = &(_frob_current->prev); \
_frob_current = _frob_current->prev; \
} \
else if (_frob_current == current_##typename##_block \
&& !_frob_current->prev) \
{ \
/* No real point in freeing sole allocation block */ \
break; \
} \
else \
{ \
struct typename##_block *_frob_victim_block = _frob_current; \
if (_frob_victim_block == current_##typename##_block) \
current_##typename##_block_index \
= countof (current_##typename##_block->block); \
_frob_current = _frob_current->prev; \
{ \
*_frob_prev = _frob_current; \
xfree (_frob_victim_block); \
/* Restore free list to what it was before victim was swept */ \
typename##_free_list = _frob_old_free_list; \
num_free -= _frob_limit; \
} \
} \
_frob_limit = countof (current_##typename##_block->block); \
} \
\
gc_count_num_##typename##_in_use = num_used; \
gc_count_num_##typename##_freelist = num_free; \
} while (0)
#endif
static void
sweep_conses (void)
{
#define MARKED_cons_P(ptr) XMARKBIT ((ptr)->car)
#define UNMARK_cons(ptr) do { XUNMARK ((ptr)->car); } while (0)
#define ADDITIONAL_FREE_cons(ptr)
SWEEP_FIXED_TYPE_BLOCK (cons, struct Lisp_Cons);
}
/* Explicitly free a cons cell. */
void
free_cons (struct Lisp_Cons *ptr)
{
#ifdef ERROR_CHECK_GC
/* If the CAR is not an int, then it will be a pointer, which will
always be four-byte aligned. If this cons cell has already been
placed on the free list, however, its car will probably contain
a chain pointer to the next cons on the list, which has cleverly
had all its 0's and 1's inverted. This allows for a quick
check to make sure we're not freeing something already freed. */
if (!INTP (ptr->car))
assert ((((int) XPNTR (ptr->car)) & 3) == 0);
#endif
#ifndef ALLOC_NO_POOLS
FREE_FIXED_TYPE (cons, struct Lisp_Cons, ptr);
/* This isn't completely necessary because the counts are recalculated
each GC, but it helps the ERROR_CHECK_GC case be more accurate */
gc_count_num_cons_freelist++;
#endif /* ALLOC_NO_POOLS */
}
/* explicitly free a list. You **must make sure** that you have
created all the cons cells that make up this list and that there
are no pointers to any of these cons cells anywhere else. If there
are, you will lose. */
void
free_list (Lisp_Object list)
{
Lisp_Object rest, next;
for (rest = list; !NILP (rest); rest = next)
{
next = XCDR (rest);
free_cons (XCONS (rest));
}
}
/* explicitly free an alist. You **must make sure** that you have
created all the cons cells that make up this alist and that there
are no pointers to any of these cons cells anywhere else. If there
are, you will lose. */
void
free_alist (Lisp_Object alist)
{
Lisp_Object rest, next;
for (rest = alist; !NILP (rest); rest = next)
{
next = XCDR (rest);
free_cons (XCONS (XCAR (rest)));
free_cons (XCONS (rest));
}
}
static void
sweep_bytecodes (void)
{
#define MARKED_bytecode_P(ptr) MARKED_RECORD_HEADER_P (&((ptr)->lheader))
#define UNMARK_bytecode(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
#define ADDITIONAL_FREE_bytecode(ptr)
SWEEP_FIXED_TYPE_BLOCK (bytecode, struct Lisp_Bytecode);
}
#ifdef LISP_FLOAT_TYPE
static void
sweep_floats (void)
{
#define MARKED_float_P(ptr) MARKED_RECORD_HEADER_P (&((ptr)->lheader))
#define UNMARK_float(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
#define ADDITIONAL_FREE_float(ptr)
SWEEP_FIXED_TYPE_BLOCK (float, struct Lisp_Float);
}
#endif /* LISP_FLOAT_TYPE */
static void
sweep_symbols (void)
{
#ifndef LRECORD_SYMBOL
# define MARKED_symbol_P(ptr) XMARKBIT ((ptr)->plist)
# define UNMARK_symbol(ptr) do { XUNMARK ((ptr)->plist); } while (0)
#else
# define MARKED_symbol_P(ptr) MARKED_RECORD_HEADER_P (&((ptr)->lheader))
# define UNMARK_symbol(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
#endif /* !LRECORD_SYMBOL */
#define ADDITIONAL_FREE_symbol(ptr)
SWEEP_FIXED_TYPE_BLOCK (symbol, struct Lisp_Symbol);
}
#ifndef standalone
#ifdef ENERGIZE
extern void energize_extent_finalization (struct extent *);
#else
#define energize_extent_finalization(extent) /* Empty */
#endif
static void
sweep_extents (void)
{
#define MARKED_extent_P(ptr) MARKED_RECORD_HEADER_P (&((ptr)->lheader))
#define UNMARK_extent(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
#define ADDITIONAL_FREE_extent(ptr) energize_extent_finalization (ptr)
SWEEP_FIXED_TYPE_BLOCK (extent, struct extent);
}
static void
sweep_extent_replicas (void)
{
#define MARKED_extent_replica_P(ptr) MARKED_RECORD_HEADER_P(&((ptr)->lheader))
#define UNMARK_extent_replica(ptr) UNMARK_RECORD_HEADER(&((ptr)->lheader))
#define ADDITIONAL_FREE_extent_replica(ptr)
SWEEP_FIXED_TYPE_BLOCK (extent_replica, struct extent_replica);
}
static void
sweep_events (void)
{
#define MARKED_event_P(ptr) MARKED_RECORD_HEADER_P (&((ptr)->lheader))
#define UNMARK_event(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
#define ADDITIONAL_FREE_event(ptr)
SWEEP_FIXED_TYPE_BLOCK (event, struct Lisp_Event);
}
static void
sweep_markers (void)
{
#define MARKED_marker_P(ptr) MARKED_RECORD_HEADER_P (&((ptr)->lheader))
#define UNMARK_marker(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader))
#define ADDITIONAL_FREE_marker(ptr) \
do { Lisp_Object tem; \
XSETMARKER (tem, ptr); \
unchain_marker (tem); \
} while (0)
SWEEP_FIXED_TYPE_BLOCK (marker, struct Lisp_Marker);
}
#endif /* not standalone */
/* Compactify string chars, relocating the reference to each --
free any empty string_chars_block we see. */
static void
compact_string_chars (void)
{
struct string_chars_block *to_sb = first_string_chars_block;
int to_pos = 0;
struct string_chars_block *from_sb;
/* Scan each existing string block sequentially, string by string. */
for (from_sb = first_string_chars_block; from_sb; from_sb = from_sb->next)
{
int from_pos = 0;
/* FROM_POS is the index of the next string in the block. */
while (from_pos < from_sb->pos)
{
struct string_chars *from_s_chars =
(struct string_chars *) &(from_sb->string_chars[from_pos]);
struct string_chars *to_s_chars;
struct Lisp_String *string = from_s_chars->string;
int size;
int fullsize;
/* skip completely if this cell is empty. */
if (FREE_STRUCT_P (string))
continue;
size = string_length (string);
fullsize = STRING_FULLSIZE (size);
if (BIG_STRING_FULLSIZE_P (fullsize))
abort ();
/* Just skip it if it isn't marked. */
if (!XMARKBIT (string->plist))
{
from_pos += fullsize;
continue;
}
/* If it won't fit in what's left of TO_SB, close TO_SB out
and go on to the next string_chars_block. We know that TO_SB
cannot advance past FROM_SB here since FROM_SB is large enough
to currently contain this string. */
if ((to_pos + fullsize) > countof (to_sb->string_chars))
{
to_sb->pos = to_pos;
to_sb = to_sb->next;
to_pos = 0;
}
/* Compute new address of this string
and update TO_POS for the space being used. */
to_s_chars = (struct string_chars *) &(to_sb->string_chars[to_pos]);
/* Copy the string_chars to the new place. */
if (from_s_chars != to_s_chars)
memcpy (to_s_chars, from_s_chars, fullsize);
/* Relocate FROM_S_CHARS's reference */
set_string_data (string, &(to_s_chars->chars[0]));
from_pos += fullsize;
to_pos += fullsize;
}
}
/* Set current to the last string chars block still used and
free any that follow. */
{
struct string_chars_block *victim;
for (victim = to_sb->next; victim; )
{
struct string_chars_block *next = victim->next;
xfree (victim);
victim = next;
}
current_string_chars_block = to_sb;
current_string_chars_block->pos = to_pos;
current_string_chars_block->next = 0;
}
}
#if 1 /* Hack to debug missing purecopy's */
static int debug_string_purity;
static void
debug_string_purity_print (struct Lisp_String *p)
{
Charcount i;
Charcount s = string_char_length (p);
putc ('\"', stderr);
for (i = 0; i < s; i++)
{
Emchar ch = string_char (p, i);
if (ch < 32 || ch >= 126)
stderr_out ("\\%03o", ch);
else if (ch == '\\' || ch == '\"')
stderr_out ("\\%c", ch);
else
stderr_out ("%c", ch);
}
stderr_out ("\"\n");
}
#endif
static void
sweep_strings (void)
{
int num_small_used = 0, num_small_bytes = 0, num_bytes = 0;
int debug = debug_string_purity;
#define MARKED_string_P(ptr) XMARKBIT ((ptr)->plist)
#define UNMARK_string(ptr) \
do { struct Lisp_String *p = (ptr); \
int size = string_length (p); \
XUNMARK (p->plist); \
num_bytes += size; \
if (!BIG_STRING_SIZE_P (size)) \
{ num_small_bytes += size; \
num_small_used++; \
} \
if (debug) debug_string_purity_print (p); \
} while (0)
#define ADDITIONAL_FREE_string(p) \
do { int size = string_length (p); \
if (BIG_STRING_SIZE_P (size)) \
xfree_1 (CHARS_TO_STRING_CHAR (string_data (p))); \
} while (0)
SWEEP_FIXED_TYPE_BLOCK (string, struct Lisp_String);
gc_count_num_short_string_in_use = num_small_used;
gc_count_string_total_size = num_bytes;
gc_count_short_string_total_size = num_small_bytes;
}
/* I hate duplicating all this crap! */
static int
marked_p (Lisp_Object obj)
{
if (!POINTER_TYPE_P (XGCTYPE (obj))) return 1;
if (PURIFIED (XPNTR (obj))) return 1;
switch (XGCTYPE (obj))
{
case Lisp_Cons:
return XMARKBIT (XCAR (obj));
case Lisp_Record:
return MARKED_RECORD_HEADER_P (XRECORD_LHEADER (obj));
case Lisp_String:
return XMARKBIT (XSTRING (obj)->plist);
case Lisp_Vector:
return (vector_length (XVECTOR (obj)) < 0);
#ifndef LRECORD_SYMBOL
case Lisp_Symbol:
return XMARKBIT (XSYMBOL (obj)->plist);
#endif
default:
abort ();
}
return 0; /* suppress compiler warning */
}
static void
gc_sweep (void)
{
compact_string_chars ();
/* Put all unmarked strings on free list, free'ing the string chars
of large unmarked strings */
sweep_strings ();
/* Put all unmarked conses on free list */
sweep_conses ();
/* Free all unmarked records */
{
int ignored;
sweep_lcrecords_1 (&all_lcrecords, &ignored);
}
/* Free all unmarked vectors */
sweep_vectors_1 (&all_vectors,
&gc_count_num_vector_used, &gc_count_vector_total_size,
&gc_count_vector_storage);
/* Free all unmarked bytecode objects */
sweep_bytecodes ();
#ifdef LISP_FLOAT_TYPE
/* Put all unmarked floats on free list */
sweep_floats ();
#endif
/* Put all unmarked symbols on free list */
sweep_symbols ();
#ifndef standalone
/* Put all unmarked extents on free list */
sweep_extents ();
/* put all extent replicas on a free_list */
sweep_extent_replicas ();
/* Put all unmarked markers on free list.
Dechain each one first from the buffer into which it points. */
sweep_markers ();
sweep_events ();
#endif
}
/* Clearing for disksave. */
extern Lisp_Object Vprocess_environment;
extern Lisp_Object Vdoc_directory;
extern Lisp_Object Vconfigure_info_directory;
extern Lisp_Object Vload_path;
extern Lisp_Object Vload_history;
extern Lisp_Object Vshell_file_name;
void
disksave_object_finalization (void)
{
/* It's important that certain information from the environment not get
dumped with the executable (pathnames, environment variables, etc.).
To make it easier to tell when this has happend with strings(1) we
clear some known-to-be-garbage blocks of memory, so that leftover
results of old evaluation don't look like potential problems.
But first we set some notable variables to nil and do one more GC,
to turn those strings into garbage.
*/
/* Yeah, this list is pretty ad-hoc... */
Vprocess_environment = Qnil;
Vexec_directory = Qnil;
Vdata_directory = Qnil;
Vdoc_directory = Qnil;
Vconfigure_info_directory = Qnil;
Vexec_path = Qnil;
Vload_path = Qnil;
/* Vdump_load_path = Qnil; */
Vload_history = Qnil;
Vshell_file_name = Qnil;
garbage_collect_1 ();
/* Run the disksave finalization methods of all live objects. */
disksave_object_finalization_1 ();
/* Zero out the unused portion of purespace */
if (!pure_lossage)
memset ( (char *) (PUREBEG + pureptr), 0,
(((char *) (PUREBEG + PURESIZE)) -
((char *) (PUREBEG + pureptr))));
/* Zero out the uninitialized (really, unused) part of the containers
for the live strings. */
{
struct string_chars_block *scb;
for (scb = first_string_chars_block; scb; scb = scb->next)
/* from the block's fill ptr to the end */
memset ((scb->string_chars + scb->pos), 0,
sizeof (scb->string_chars) - scb->pos);
}
/* There, that ought to be enough... */
}
Lisp_Object
restore_gc_inhibit (Lisp_Object val)
{
gc_currently_forbidden = XINT (val);
return val;
}
/* Maybe we want to use this when doing a "panic" gc after memory_full()? */
static int gc_hooks_inhibited;
void
garbage_collect_1 (void)
{
char stack_top_variable;
extern char *stack_bottom;
int i;
#ifdef HAVE_WINDOW_SYSTEM
struct frame *f = selected_frame ();
#endif /* HAVE_WINDOW_SYSTEM */
int speccount = specpdl_depth ();
#ifdef HAVE_WINDOW_SYSTEM
int cursor_changed = 0;
#endif /* HAVE_WINDOW_SYSTEM */
if (gc_in_progress != 0)
return;
if (gc_currently_forbidden || in_display)
return;
/* Very important to prevent GC during any of the following
stuff that might run Lisp code; otherwise, we'll likely
have infinite GC recursion. */
record_unwind_protect (restore_gc_inhibit,
make_number (gc_currently_forbidden));
gc_currently_forbidden = 1;
if (!gc_hooks_inhibited)
run_hook_trapping_errors ("Error in pre-gc-hook", Qpre_gc_hook);
if (!noninteractive)
{
#ifdef HAVE_WINDOW_SYSTEM
if (!NILP (Vgc_message) &&
!STRINGP (Vgc_message))
{
/* #### show_gc_cursor should be a device method. */
#ifdef HAVE_X_WINDOWS
if (DEVICE_IS_X (XDEVICE (Vselected_device)))
cursor_changed = x_show_gc_cursor (f, Vgc_message);
#endif /* HAVE_X_WINDOWS */
#ifdef HAVE_NEXTSTEP
if (DEVICE_IS_NS (XDEVICE (Vselected_device)))
cursor_changed = ns_show_gc_cursor (f, Vgc_message);
#endif /* HAVE_NEXTSTEP */
}
/* Don't print messages to the stream device unless we are
actually running in batch mode. */
if (!cursor_changed
&& (!DEVICE_IS_STREAM (XDEVICE (Fselected_device ()))
|| noninteractive))
#endif /* HAVE_WINDOW_SYSTEM */
{
char *msg = (STRINGP (Vgc_message)
? GETTEXT ((char *) string_data (XSTRING (Vgc_message)))
: GETTEXT ((char *) gc_default_message));
Lisp_Object args[2], whole_msg;
args[0] = build_string (msg);
args[1] = build_string ("...");
whole_msg = Fconcat (2, args);
echo_area_message (selected_frame (), (Bufbyte *) 0,
whole_msg, 0, string_length (XSTRING (whole_msg)),
Qgarbage_collecting);
}
}
/***** Now we actually start the garbage collection. */
gc_in_progress = 1;
gc_generation_number[0]++;
#if MAX_SAVE_STACK > 0
/* Save a copy of the contents of the stack, for debugging. */
if (!purify_flag)
{
i = &stack_top_variable - stack_bottom;
if (i < 0) i = -i;
if (i < MAX_SAVE_STACK)
{
if (stack_copy == 0)
stack_copy = (char *) malloc (stack_copy_size = i);
else if (stack_copy_size < i)
stack_copy = (char *) realloc (stack_copy, (stack_copy_size = i));
if (stack_copy)
{
if ((int) (&stack_top_variable - stack_bottom) > 0)
memcpy (stack_copy, stack_bottom, i);
else
memcpy (stack_copy, &stack_top_variable, i);
}
}
}
#endif /* MAX_SAVE_STACK > 0 */
/* Do some totally ad-hoc resource clearing. */
/* #### generalize this? */
clear_event_resource ();
cleanup_specifiers ();
/* Mark all the special slots that serve as the roots of accessibility. */
{
struct gcpro *tail;
struct catchtag *catch;
struct backtrace *backlist;
struct specbinding *bind;
for (i = 0; i < staticidx; i++)
mark_object (*(staticvec[i]));
for (tail = gcprolist; tail; tail = tail->next)
{
for (i = 0; i < tail->nvars; i++)
mark_object (tail->var[i]);
}
for (bind = specpdl; bind != specpdl_ptr; bind++)
{
mark_object (bind->symbol);
mark_object (bind->old_value);
}
for (catch = catchlist; catch; catch = catch->next)
{
mark_object (catch->tag);
mark_object (catch->val);
}
for (backlist = backtrace_list; backlist; backlist = backlist->next)
{
int nargs = backlist->nargs;
mark_object (*backlist->function);
if (nargs == UNEVALLED || nargs == MANY)
mark_object (backlist->args[0]);
else
for (i = 0; i < nargs; i++)
mark_object (backlist->args[i]);
}
mark_redisplay (mark_object);
}
/* OK, now do the after-mark stuff. This is for things that
are only marked when something else is marked (e.g. weak hashtables). */
{
int did_mark;
/* Need to iterate until there's nothing more to mark, in case
of chains of mark dependencies. */
do
{
did_mark = 0;
did_mark += !!finish_marking_weak_hashtables (marked_p, mark_object);
did_mark += !!finish_marking_specifiers (marked_p, mark_object);
}
while (did_mark);
}
/* And prune (this needs to be called after everything else has been
marked and before we do any sweeping). */
prune_weak_hashtables (marked_p);
prune_specifiers (marked_p);
gc_sweep ();
consing_since_gc = 0;
#ifndef DEBUG_XEMACS
/* Allow you to set it really fucking low if you really want ... */
if (gc_cons_threshold < 10000)
gc_cons_threshold = 10000;
#endif
gc_in_progress = 0;
/******* End of garbage collection ********/
run_hook_trapping_errors ("Error in post-gc-hook", Qpost_gc_hook);
if (!noninteractive)
{
#ifdef HAVE_WINDOW_SYSTEM
if (cursor_changed)
{
/* #### show_gc_cursor should be a device method. */
#ifdef HAVE_X_WINDOWS
if (DEVICE_IS_X (XDEVICE (Vselected_device)))
x_show_gc_cursor (f, Qnil);
#endif /* HAVE_X_WINDOWS */
#ifdef HAVE_NEXTSTEP
if (DEVICE_IS_NS (XDEVICE (Vselected_device)))
ns_show_gc_cursor (f, Qnil);
#endif /* HAVE_NEXTSTEP */
}
if (!cursor_changed
&& (!DEVICE_IS_STREAM (XDEVICE (Fselected_device ()))
|| noninteractive))
#endif /* HAVE_WINDOW_SYSTEM */
{
char *msg = (STRINGP (Vgc_message)
? GETTEXT ((char *) string_data (XSTRING (Vgc_message)))
: GETTEXT ((char *) gc_default_message));
/* Show "...done" only if the echo area would otherwise be empty. */
if (NILP (clear_echo_area (selected_frame (),
Qgarbage_collecting, 0)))
{
Lisp_Object args[2], whole_msg;
args[0] = build_string (msg);
args[1] = build_string ("... done");
whole_msg = Fconcat (2, args);
echo_area_message (selected_frame (), (Bufbyte *) 0,
whole_msg, 0,
string_length (XSTRING (whole_msg)),
Qgarbage_collecting);
}
}
}
/* now stop inhibiting GC */
unbind_to (speccount, Qnil);
if (!breathing_space)
{
breathing_space = (void *) malloc (4096 - MALLOC_OVERHEAD);
}
return;
}
#ifdef EMACS_BTL
/* This isn't actually called. BTL recognises the stack frame of the top
of the garbage collector by noting that PC is between &garbage_collect_1
and &BTL_after_garbage_collect_1_stub. So this fn must be right here.
There's not any other way to know the address of the end of a function.
*/
void BTL_after_garbage_collect_1_stub () { abort (); }
#endif
/* Debugging aids. */
static Lisp_Object
gc_plist_hack (CONST char *name, int value, Lisp_Object tail)
{
/* C doesn't have local functions (or closures, or GC, or readable syntax,
or portable numeric datatypes, or bit-vectors, or characters, or
arrays, or exceptions, or ...) */
return (cons3 (intern (name), make_number (value), tail));
}
#define HACK_O_MATIC(type, name, pl) \
{ \
int s = 0; \
struct type##_block *x = current_##type##_block; \
while (x) { s += sizeof (*x) + MALLOC_OVERHEAD; x = x->prev; } \
(pl) = gc_plist_hack ((name), s, (pl)); \
}
DEFUN ("garbage-collect", Fgarbage_collect, Sgarbage_collect, 0, 0, "",
"Reclaim storage for Lisp objects no longer needed.\n\
Returns info on amount of space in use:\n\
((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)\n\
(USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS\n\
PLIST) \n\
where `PLIST' is a list of alternating keyword/value pairs providing\n\
more detailed information.\n\
Garbage collection happens automatically if you cons more than\n\
`gc-cons-threshold' bytes of Lisp data since previous garbage collection.")
()
{
Lisp_Object pl = Qnil;
Lisp_Object ret[6];
int i;
garbage_collect_1 ();
for (i = 0; i < last_lrecord_type_index_assigned; i++)
{
if (lcrecord_stats[i].bytes_in_use != 0
|| lcrecord_stats[i].bytes_freed != 0)
{
char buf [255];
CONST char *name = lrecord_implementations_table[i]->name;
int len = strlen (name);
sprintf (buf, "%s-storage", name);
pl = gc_plist_hack (buf, lcrecord_stats[i].bytes_in_use, pl);
/* Okay, simple pluralization check for `symbol-value-varalias' */
if (name[len-1] == 's')
sprintf (buf, "%ses-freed", name);
else
sprintf (buf, "%ss-freed", name);
if (lcrecord_stats[i].instances_freed != 0)
pl = gc_plist_hack (buf, lcrecord_stats[i].instances_freed, pl);
if (name[len-1] == 's')
sprintf (buf, "%ses-used", name);
else
sprintf (buf, "%ss-used", name);
pl = gc_plist_hack (buf, lcrecord_stats[i].instances_in_use, pl);
}
}
HACK_O_MATIC (extent_replica, "extent-duplicate-storage", pl);
pl = gc_plist_hack ("extent-duplicates-free",
gc_count_num_extent_replica_freelist, pl);
pl = gc_plist_hack ("extent-duplicates-used",
gc_count_num_extent_replica_in_use, pl);
HACK_O_MATIC (extent, "extent-storage", pl);
pl = gc_plist_hack ("extents-free", gc_count_num_extent_freelist, pl);
pl = gc_plist_hack ("extents-used", gc_count_num_extent_in_use, pl);
HACK_O_MATIC (event, "event-storage", pl);
pl = gc_plist_hack ("events-free", gc_count_num_event_freelist, pl);
pl = gc_plist_hack ("events-used", gc_count_num_event_in_use, pl);
HACK_O_MATIC (marker, "marker-storage", pl);
pl = gc_plist_hack ("markers-free", gc_count_num_marker_freelist, pl);
pl = gc_plist_hack ("markers-used", gc_count_num_marker_in_use, pl);
#ifdef LISP_FLOAT_TYPE
HACK_O_MATIC (float, "float-storage", pl);
pl = gc_plist_hack ("floats-free", gc_count_num_float_freelist, pl);
pl = gc_plist_hack ("floats-used", gc_count_num_float_in_use, pl);
#endif /* LISP_FLOAT_TYPE */
HACK_O_MATIC (string, "string-header-storage", pl);
pl = gc_plist_hack ("long-strings-total-length",
gc_count_string_total_size
- gc_count_short_string_total_size, pl);
HACK_O_MATIC (string_chars, "short-string-storage", pl);
pl = gc_plist_hack ("short-strings-total-length",
gc_count_short_string_total_size, pl);
pl = gc_plist_hack ("strings-free", gc_count_num_string_freelist, pl);
pl = gc_plist_hack ("long-strings-used",
gc_count_num_string_in_use
- gc_count_num_short_string_in_use, pl);
pl = gc_plist_hack ("short-strings-used",
gc_count_num_short_string_in_use, pl);
HACK_O_MATIC (bytecode, "bytecode-storage", pl);
pl = gc_plist_hack ("bytecodes-free", gc_count_num_bytecode_freelist, pl);
pl = gc_plist_hack ("bytecodes-used", gc_count_num_bytecode_in_use, pl);
pl = gc_plist_hack ("vector-storage", gc_count_vector_storage, pl);
pl = gc_plist_hack ("vectors-total-length",
gc_count_vector_total_size, pl);
pl = gc_plist_hack ("vectors-used", gc_count_num_vector_used, pl);
HACK_O_MATIC (symbol, "symbol-storage", pl);
pl = gc_plist_hack ("symbols-free", gc_count_num_symbol_freelist, pl);
pl = gc_plist_hack ("symbols-used", gc_count_num_symbol_in_use, pl);
HACK_O_MATIC (cons, "cons-storage", pl);
pl = gc_plist_hack ("conses-free", gc_count_num_cons_freelist, pl);
pl = gc_plist_hack ("conses-used", gc_count_num_cons_in_use, pl);
/* The things we do for backwards-compatibility */
ret[0] = Fcons (make_number (gc_count_num_cons_in_use),
make_number (gc_count_num_cons_freelist));
ret[1] = Fcons (make_number (gc_count_num_symbol_in_use),
make_number (gc_count_num_symbol_freelist));
ret[2] = Fcons (make_number (gc_count_num_marker_in_use),
make_number (gc_count_num_marker_freelist));
ret[3] = make_number (gc_count_string_total_size);
ret[4] = make_number (gc_count_vector_total_size);
ret[5] = pl;
return (Flist (6, ret));
}
#undef HACK_O_MATIC
DEFUN ("consing-since-gc", Fconsing_since_gc, Sconsing_since_gc, 0, 0, "",
"Return the number of bytes consed since the last garbage collection.")
()
{
return (make_number (consing_since_gc));
}
DEFUN ("memory-limit", Fmemory_limit, Smemory_limit, 0, 0, "",
"Return the address of the last byte Emacs has allocated, divided by 1024.\n\
This may be helpful in debugging Emacs's memory usage.\n\
The value is divided by 1024 to make sure it will fit in a lisp integer.")
()
{
return (make_number ((LISP_WORD_TYPE) sbrk (0) / 1024));
}
/* Initialization */
void
init_alloc_once_early (void)
{
int iii;
#ifdef PURESTAT
for (iii = 0; iii < countof (purestats); iii++)
{
if (! purestats[iii]) continue;
purestats[iii]->nobjects = 0;
purestats[iii]->nbytes = 0;
}
purecopying_for_bytecode = 0;
#endif
last_lrecord_type_index_assigned = -1;
for (iii = 0; iii < countof (lrecord_implementations_table); iii++)
{
lrecord_implementations_table[iii] = 0;
}
symbols_initialized = 0;
gc_generation_number[0] = 0;
/* purify_flag 1 is correct even if CANNOT_DUMP.
* loadup.el will set to nil at end. */
purify_flag = 1;
pureptr = 0;
pure_lossage = 0;
breathing_space = 0;
XSETINT (all_vectors, 0); /* Qzero may not be set yet. */
XSETINT (Vgc_message, 0);
all_lcrecords = 0;
ignore_malloc_warnings = 1;
init_string_alloc ();
init_string_chars_alloc ();
init_cons_alloc ();
init_symbol_alloc ();
init_bytecode_alloc ();
#ifdef LISP_FLOAT_TYPE
init_float_alloc ();
#endif /* LISP_FLOAT_TYPE */
#ifndef standalone
init_marker_alloc ();
init_extent_alloc ();
init_extent_replica_alloc ();
init_event_alloc ();
#endif
ignore_malloc_warnings = 0;
staticidx = 0;
consing_since_gc = 0;
#if 1
gc_cons_threshold = 500000; /* XEmacs change */
#else
gc_cons_threshold = 5000; /* debugging */
#endif
#ifdef VIRT_ADDR_VARIES
malloc_sbrk_unused = 1<<22; /* A large number */
malloc_sbrk_used = 100000; /* as reasonable as any number */
#endif /* VIRT_ADDR_VARIES */
lrecord_uid_counter = 259;
debug_string_purity = 0;
gcprolist = 0;
gc_currently_forbidden = 0;
gc_hooks_inhibited = 0;
}
void
reinit_alloc (void)
{
gcprolist = 0;
}
void
syms_of_alloc (void)
{
defsymbol (&Qpre_gc_hook, "pre-gc-hook");
defsymbol (&Qpost_gc_hook, "post-gc-hook");
defsymbol (&Qgarbage_collecting, "garbage-collecting");
defsubr (&Scons);
defsubr (&Slist);
defsubr (&Svector);
defsubr (&Smake_byte_code);
defsubr (&Smake_list);
defsubr (&Smake_vector);
defsubr (&Smake_string);
defsubr (&Smake_symbol);
defsubr (&Smake_marker);
defsubr (&Spurecopy);
defsubr (&Sgarbage_collect);
defsubr (&Smemory_limit);
defsubr (&Sconsing_since_gc);
}
void
vars_of_alloc (void)
{
DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold,
"*Number of bytes of consing between garbage collections.\n\
Garbage collection can happen automatically once this many bytes have been\n\
allocated since the last garbage collection. All data types count.\n\n\
Garbage collection happens automatically when `eval' or `funcall' are\n\
called. (Note that `funcall' is called implicitly as part of evaluation.)\n\
By binding this temporarily to a large number, you can effectively\n\
prevent garbage collection during a part of the program.");
DEFVAR_INT ("pure-bytes-used", &pureptr,
"Number of bytes of sharable Lisp data allocated so far.");
#if 0
DEFVAR_INT ("data-bytes-used", &malloc_sbrk_used,
"Number of bytes of unshared memory allocated in this session.");
DEFVAR_INT ("data-bytes-free", &malloc_sbrk_unused,
"Number of bytes of unshared memory remaining available in this session.");
#endif
DEFVAR_BOOL ("purify-flag", &purify_flag,
"Non-nil means loading Lisp code in order to dump an executable.\n\
This means that certain objects should be allocated in shared (pure) space.");
DEFVAR_LISP ("pre-gc-hook", &Vpre_gc_hook,
"Function or functions to be run just before each garbage collection.\n\
Interrupts, garbage collection, and errors are inhibited while this hook\n\
runs, so be extremely careful in what you add here. In particular, avoid\n\
consing, and do not interact with the user.");
Vpre_gc_hook = Qnil;
DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook,
"Function or functions to be run just after each garbage collection.\n\
Interrupts, garbage collection, and errors are inhibited while this hook\n\
runs, so be extremely careful in what you add here. In particular, avoid\n\
consing, and do not interact with the user.");
Vpost_gc_hook = Qnil;
DEFVAR_LISP ("gc-message", &Vgc_message,
"What to display to indicate that a garbage collection is in progress.\n\
If this is a string, it is printed in the echo area.\n\
If this is a cursor object, the mouse pointer of the selected frame is\n\
changed to that cursor for the duration of the garbage collection.\n\
See the variable `x-gc-pointer-shape', which is used to control this.");
Vgc_message = make_pure_string ((Bufbyte *) gc_default_message,
countof (gc_default_message) - 1, 1);
}
These are the contents of the former NiCE NeXT User Group NeXTSTEP/OpenStep software archive, currently hosted by Netfuture.ch.