Mercurial > hg > xemacs-beta
annotate src/alloc.c @ 4921:17362f371cc2
add more byte-code assertions and better failure output
-------------------- ChangeLog entries follow: --------------------
src/ChangeLog addition:
2010-02-03 Ben Wing <ben@xemacs.org>
* alloc.c (Fmake_byte_code):
* bytecode.h:
* lisp.h:
* lread.c:
* lread.c (readevalloop):
* lread.c (Fread):
* lread.c (Fread_from_string):
* lread.c (read_list_conser):
* lread.c (read_list):
* lread.c (vars_of_lread):
* symbols.c:
* symbols.c (Fdefine_function):
Turn on the "compiled-function annotation hack". Implement it
properly by hooking into Fdefalias(). Note in the docstring to
`defalias' that we do this. Remove some old broken code and
change code that implemented the old kludgy way of hooking into
the Lisp reader into bracketed by `#ifdef
COMPILED_FUNCTION_ANNOTATION_HACK_OLD_WAY', which is not enabled.
Also enable byte-code metering when DEBUG_XEMACS -- this is a form
of profiling for computing histograms of which sequences of two
bytecodes are used most often.
* bytecode-ops.h:
* bytecode-ops.h (OPCODE):
New file. Extract out all the opcodes and declare them using
OPCODE(), a bit like frame slots and such. This way the file can
be included multiple times if necessary to iterate multiple times
over the byte opcodes.
* bytecode.c:
* bytecode.c (NUM_REMEMBERED_BYTE_OPS):
* bytecode.c (OPCODE):
* bytecode.c (assert_failed_with_remembered_ops):
* bytecode.c (READ_UINT_2):
* bytecode.c (READ_INT_1):
* bytecode.c (READ_INT_2):
* bytecode.c (PEEK_INT_1):
* bytecode.c (PEEK_INT_2):
* bytecode.c (JUMP_RELATIVE):
* bytecode.c (JUMP_NEXT):
* bytecode.c (PUSH):
* bytecode.c (POP_WITH_MULTIPLE_VALUES):
* bytecode.c (DISCARD):
* bytecode.c (UNUSED):
* bytecode.c (optimize_byte_code):
* bytecode.c (optimize_compiled_function):
* bytecode.c (Fbyte_code):
* bytecode.c (vars_of_bytecode):
* bytecode.c (init_opcode_table_multi_op):
* bytecode.c (reinit_vars_of_bytecode):
* emacs.c (main_1):
* eval.c (funcall_compiled_function):
* symsinit.h:
Any time we change either the instruction pointer or the stack
pointer, assert that we're going to move it to a valid location.
This should catch failures right when they occur rather than
sometime later. This requires that we pass in another couple of
parameters into some functions (only with error-checking enabled,
see below).
Also keep track, using a circular queue, of the last 100 byte
opcodes seen, and when we hit an assert failure during byte-code
execution, output the contents of the queue in a nice readable
fashion. This requires that bytecode-ops.h be included a second
time so that a table mapping opcodes to the name of their operation
can be constructed. This table is constructed in new function
reinit_vars_of_bytecode().
Everything in the last two paras happens only when
ERROR_CHECK_BYTE_CODE.
Add some longish comments describing how the arrays that hold the
stack and instructions, and the pointers used to access them, work.
* gc.c:
Import some code from my `latest-fix' workspace to mark the
staticpro's in order from lowest to highest, rather than highest to
lowest, so it's easier to debug when something goes wrong.
* lisp.h (abort_with_message): Renamed from abort_with_msg().
* symbols.c (defsymbol_massage_name_1):
* symbols.c (defsymbol_nodump):
* symbols.c (defsymbol):
* symbols.c (defkeyword):
* symeval.h (DEFVAR_SYMVAL_FWD_OBJECT):
Make the various calls to staticpro() instead call staticpro_1(),
passing in the name of the C var being staticpro'ed, so that it
shows up in staticpro_names. Otherwise staticpro_names just has
1000+ copies of the word `location'.
| author | Ben Wing <ben@xemacs.org> |
|---|---|
| date | Wed, 03 Feb 2010 08:01:55 -0600 |
| parents | 6ef8256a020a |
| children | 8ee3c10d1ed5 |
| rev | line source |
|---|---|
| 428 | 1 /* Storage allocation and gc for XEmacs Lisp interpreter. |
| 2 Copyright (C) 1985-1998 Free Software Foundation, Inc. | |
| 3 Copyright (C) 1995 Sun Microsystems, Inc. | |
|
4880
ae81a2c00f4f
try harder to avoid crashing when debug-printing
Ben Wing <ben@xemacs.org>
parents:
4803
diff
changeset
|
4 Copyright (C) 1995, 1996, 2001, 2002, 2003, 2004, 2005, 2010 Ben Wing. |
| 428 | 5 |
| 6 This file is part of XEmacs. | |
| 7 | |
| 8 XEmacs is free software; you can redistribute it and/or modify it | |
| 9 under the terms of the GNU General Public License as published by the | |
| 10 Free Software Foundation; either version 2, or (at your option) any | |
| 11 later version. | |
| 12 | |
| 13 XEmacs is distributed in the hope that it will be useful, but WITHOUT | |
| 14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 16 for more details. | |
| 17 | |
| 18 You should have received a copy of the GNU General Public License | |
| 19 along with XEmacs; see the file COPYING. If not, write to | |
| 20 the Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
| 21 Boston, MA 02111-1307, USA. */ | |
| 22 | |
| 23 /* Synched up with: FSF 19.28, Mule 2.0. Substantially different from | |
| 24 FSF. */ | |
| 25 | |
| 26 /* Authorship: | |
| 27 | |
| 28 FSF: Original version; a long time ago. | |
| 29 Mly: Significantly rewritten to use new 3-bit tags and | |
| 30 nicely abstracted object definitions, for 19.8. | |
| 31 JWZ: Improved code to keep track of purespace usage and | |
| 32 issue nice purespace and GC stats. | |
| 33 Ben Wing: Cleaned up frob-block lrecord code, added error-checking | |
| 34 and various changes for Mule, for 19.12. | |
| 35 Added bit vectors for 19.13. | |
| 36 Added lcrecord lists for 19.14. | |
| 37 slb: Lots of work on the purification and dump time code. | |
| 38 Synched Doug Lea malloc support from Emacs 20.2. | |
| 442 | 39 og: Killed the purespace. Portable dumper (moved to dumper.c) |
| 428 | 40 */ |
| 41 | |
| 42 #include <config.h> | |
| 43 #include "lisp.h" | |
| 44 | |
| 45 #include "backtrace.h" | |
| 46 #include "buffer.h" | |
| 47 #include "bytecode.h" | |
| 48 #include "chartab.h" | |
| 49 #include "device.h" | |
| 50 #include "elhash.h" | |
| 51 #include "events.h" | |
| 872 | 52 #include "extents-impl.h" |
| 1204 | 53 #include "file-coding.h" |
| 872 | 54 #include "frame-impl.h" |
| 3092 | 55 #include "gc.h" |
| 428 | 56 #include "glyphs.h" |
| 57 #include "opaque.h" | |
| 1204 | 58 #include "lstream.h" |
| 872 | 59 #include "process.h" |
| 1292 | 60 #include "profile.h" |
| 428 | 61 #include "redisplay.h" |
| 62 #include "specifier.h" | |
| 63 #include "sysfile.h" | |
| 442 | 64 #include "sysdep.h" |
| 428 | 65 #include "window.h" |
| 3092 | 66 #ifdef NEW_GC |
| 67 #include "vdb.h" | |
| 68 #endif /* NEW_GC */ | |
| 428 | 69 #include "console-stream.h" |
| 70 | |
| 71 #ifdef DOUG_LEA_MALLOC | |
| 72 #include <malloc.h> | |
| 73 #endif | |
|
4803
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
74 #ifdef USE_VALGRIND |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
75 #include <valgrind/memcheck.h> |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
76 #endif |
| 428 | 77 |
| 78 EXFUN (Fgarbage_collect, 0); | |
| 79 | |
| 80 #if 0 /* this is _way_ too slow to be part of the standard debug options */ | |
| 81 #if defined(DEBUG_XEMACS) && defined(MULE) | |
| 82 #define VERIFY_STRING_CHARS_INTEGRITY | |
| 83 #endif | |
| 84 #endif | |
| 85 | |
| 86 /* Define this to use malloc/free with no freelist for all datatypes, | |
| 87 the hope being that some debugging tools may help detect | |
| 88 freed memory references */ | |
| 89 #ifdef USE_DEBUG_MALLOC /* Taking the above comment at face value -slb */ | |
| 90 #include <dmalloc.h> | |
| 91 #define ALLOC_NO_POOLS | |
| 92 #endif | |
| 93 | |
| 94 #ifdef DEBUG_XEMACS | |
| 458 | 95 static Fixnum debug_allocation; |
| 96 static Fixnum debug_allocation_backtrace_length; | |
| 428 | 97 #endif |
| 98 | |
| 851 | 99 int need_to_check_c_alloca; |
| 887 | 100 int need_to_signal_post_gc; |
| 851 | 101 int funcall_allocation_flag; |
| 102 Bytecount __temp_alloca_size__; | |
| 103 Bytecount funcall_alloca_count; | |
| 814 | 104 |
| 105 /* Determine now whether we need to garbage collect or not, to make | |
| 106 Ffuncall() faster */ | |
| 107 #define INCREMENT_CONS_COUNTER_1(size) \ | |
| 108 do \ | |
| 109 { \ | |
| 110 consing_since_gc += (size); \ | |
| 1292 | 111 total_consing += (size); \ |
| 112 if (profiling_active) \ | |
| 113 profile_record_consing (size); \ | |
| 814 | 114 recompute_need_to_garbage_collect (); \ |
| 115 } while (0) | |
| 428 | 116 |
| 117 #define debug_allocation_backtrace() \ | |
| 118 do { \ | |
| 119 if (debug_allocation_backtrace_length > 0) \ | |
| 120 debug_short_backtrace (debug_allocation_backtrace_length); \ | |
| 121 } while (0) | |
| 122 | |
| 123 #ifdef DEBUG_XEMACS | |
| 801 | 124 #define INCREMENT_CONS_COUNTER(foosize, type) \ |
| 125 do { \ | |
| 126 if (debug_allocation) \ | |
| 127 { \ | |
| 128 stderr_out ("allocating %s (size %ld)\n", type, \ | |
| 129 (long) foosize); \ | |
| 130 debug_allocation_backtrace (); \ | |
| 131 } \ | |
| 132 INCREMENT_CONS_COUNTER_1 (foosize); \ | |
| 428 | 133 } while (0) |
| 134 #define NOSEEUM_INCREMENT_CONS_COUNTER(foosize, type) \ | |
| 135 do { \ | |
| 136 if (debug_allocation > 1) \ | |
| 137 { \ | |
| 801 | 138 stderr_out ("allocating noseeum %s (size %ld)\n", type, \ |
| 139 (long) foosize); \ | |
| 428 | 140 debug_allocation_backtrace (); \ |
| 141 } \ | |
| 142 INCREMENT_CONS_COUNTER_1 (foosize); \ | |
| 143 } while (0) | |
| 144 #else | |
| 145 #define INCREMENT_CONS_COUNTER(size, type) INCREMENT_CONS_COUNTER_1 (size) | |
| 146 #define NOSEEUM_INCREMENT_CONS_COUNTER(size, type) \ | |
| 147 INCREMENT_CONS_COUNTER_1 (size) | |
| 148 #endif | |
| 149 | |
| 3092 | 150 #ifdef NEW_GC |
| 151 /* The call to recompute_need_to_garbage_collect is moved to | |
| 152 free_lrecord, since DECREMENT_CONS_COUNTER is extensively called | |
| 153 during sweep and recomputing need_to_garbage_collect all the time | |
| 154 is not needed. */ | |
| 155 #define DECREMENT_CONS_COUNTER(size) do { \ | |
| 156 consing_since_gc -= (size); \ | |
| 157 total_consing -= (size); \ | |
| 158 if (profiling_active) \ | |
| 159 profile_record_unconsing (size); \ | |
| 160 if (consing_since_gc < 0) \ | |
| 161 consing_since_gc = 0; \ | |
| 162 } while (0) | |
| 163 #else /* not NEW_GC */ | |
| 428 | 164 #define DECREMENT_CONS_COUNTER(size) do { \ |
| 165 consing_since_gc -= (size); \ | |
| 1292 | 166 total_consing -= (size); \ |
| 167 if (profiling_active) \ | |
| 168 profile_record_unconsing (size); \ | |
| 428 | 169 if (consing_since_gc < 0) \ |
| 170 consing_since_gc = 0; \ | |
| 814 | 171 recompute_need_to_garbage_collect (); \ |
| 428 | 172 } while (0) |
| 3092 | 173 #endif /*not NEW_GC */ |
| 428 | 174 |
| 175 /* This is just for use by the printer, to allow things to print uniquely */ | |
| 3063 | 176 int lrecord_uid_counter; |
| 428 | 177 |
| 178 /* Non-zero means we're in the process of doing the dump */ | |
| 179 int purify_flag; | |
| 180 | |
| 1204 | 181 /* Non-zero means we're pdumping out or in */ |
| 182 #ifdef PDUMP | |
| 183 int in_pdump; | |
| 184 #endif | |
| 185 | |
| 800 | 186 #ifdef ERROR_CHECK_TYPES |
| 428 | 187 |
| 793 | 188 Error_Behavior ERROR_ME, ERROR_ME_NOT, ERROR_ME_WARN, ERROR_ME_DEBUG_WARN; |
| 428 | 189 |
| 190 #endif | |
| 191 | |
| 801 | 192 /* Very cheesy ways of figuring out how much memory is being used for |
| 193 data. #### Need better (system-dependent) ways. */ | |
| 194 void *minimum_address_seen; | |
| 195 void *maximum_address_seen; | |
| 196 | |
| 3263 | 197 #ifndef NEW_GC |
| 428 | 198 int |
| 199 c_readonly (Lisp_Object obj) | |
| 200 { | |
| 201 return POINTER_TYPE_P (XTYPE (obj)) && C_READONLY (obj); | |
| 202 } | |
| 3263 | 203 #endif /* not NEW_GC */ |
| 428 | 204 |
| 205 int | |
| 206 lisp_readonly (Lisp_Object obj) | |
| 207 { | |
| 208 return POINTER_TYPE_P (XTYPE (obj)) && LISP_READONLY (obj); | |
| 209 } | |
| 210 | |
| 211 | |
| 212 /* Maximum amount of C stack to save when a GC happens. */ | |
| 213 | |
| 214 #ifndef MAX_SAVE_STACK | |
| 215 #define MAX_SAVE_STACK 0 /* 16000 */ | |
| 216 #endif | |
| 217 | |
| 218 /* Non-zero means ignore malloc warnings. Set during initialization. */ | |
| 219 int ignore_malloc_warnings; | |
| 220 | |
| 221 | |
| 3263 | 222 #ifndef NEW_GC |
| 3092 | 223 void *breathing_space; |
| 428 | 224 |
| 225 void | |
| 226 release_breathing_space (void) | |
| 227 { | |
| 228 if (breathing_space) | |
| 229 { | |
| 230 void *tmp = breathing_space; | |
| 231 breathing_space = 0; | |
| 1726 | 232 xfree (tmp, void *); |
| 428 | 233 } |
| 234 } | |
| 3263 | 235 #endif /* not NEW_GC */ |
| 428 | 236 |
| 801 | 237 static void |
| 238 set_alloc_mins_and_maxes (void *val, Bytecount size) | |
| 239 { | |
| 240 if (!val) | |
| 241 return; | |
| 242 if ((char *) val + size > (char *) maximum_address_seen) | |
| 243 maximum_address_seen = (char *) val + size; | |
| 244 if (!minimum_address_seen) | |
| 245 minimum_address_seen = | |
| 246 #if SIZEOF_VOID_P == 8 | |
| 247 (void *) 0xFFFFFFFFFFFFFFFF; | |
| 248 #else | |
| 249 (void *) 0xFFFFFFFF; | |
| 250 #endif | |
| 251 if ((char *) val < (char *) minimum_address_seen) | |
| 252 minimum_address_seen = (char *) val; | |
| 253 } | |
| 254 | |
| 1315 | 255 #ifdef ERROR_CHECK_MALLOC |
| 3176 | 256 static int in_malloc; |
| 1333 | 257 extern int regex_malloc_disallowed; |
| 2367 | 258 |
| 259 #define MALLOC_BEGIN() \ | |
| 260 do \ | |
| 261 { \ | |
| 3176 | 262 assert (!in_malloc); \ |
| 2367 | 263 assert (!regex_malloc_disallowed); \ |
| 264 in_malloc = 1; \ | |
| 265 } \ | |
| 266 while (0) | |
| 267 | |
| 3263 | 268 #ifdef NEW_GC |
| 2720 | 269 #define FREE_OR_REALLOC_BEGIN(block) \ |
| 270 do \ | |
| 271 { \ | |
| 272 /* Unbelievably, calling free() on 0xDEADBEEF doesn't cause an \ | |
| 273 error until much later on for many system mallocs, such as \ | |
| 274 the one that comes with Solaris 2.3. FMH!! */ \ | |
| 275 assert (block != (void *) 0xDEADBEEF); \ | |
| 276 MALLOC_BEGIN (); \ | |
| 277 } \ | |
| 278 while (0) | |
| 3263 | 279 #else /* not NEW_GC */ |
| 2367 | 280 #define FREE_OR_REALLOC_BEGIN(block) \ |
| 281 do \ | |
| 282 { \ | |
| 283 /* Unbelievably, calling free() on 0xDEADBEEF doesn't cause an \ | |
| 284 error until much later on for many system mallocs, such as \ | |
| 285 the one that comes with Solaris 2.3. FMH!! */ \ | |
| 286 assert (block != (void *) 0xDEADBEEF); \ | |
| 287 /* You cannot free something within dumped space, because there is \ | |
| 288 no longer any sort of malloc structure associated with the block. \ | |
| 289 If you are tripping this, you may need to conditionalize on \ | |
| 290 DUMPEDP. */ \ | |
| 291 assert (!DUMPEDP (block)); \ | |
| 292 MALLOC_BEGIN (); \ | |
| 293 } \ | |
| 294 while (0) | |
| 3263 | 295 #endif /* not NEW_GC */ |
| 2367 | 296 |
| 297 #define MALLOC_END() \ | |
| 298 do \ | |
| 299 { \ | |
| 300 in_malloc = 0; \ | |
| 301 } \ | |
| 302 while (0) | |
| 303 | |
| 304 #else /* ERROR_CHECK_MALLOC */ | |
| 305 | |
| 2658 | 306 #define MALLOC_BEGIN() |
| 2367 | 307 #define FREE_OR_REALLOC_BEGIN(block) |
| 308 #define MALLOC_END() | |
| 309 | |
| 310 #endif /* ERROR_CHECK_MALLOC */ | |
| 311 | |
| 312 static void | |
| 313 malloc_after (void *val, Bytecount size) | |
| 314 { | |
| 315 if (!val && size != 0) | |
| 316 memory_full (); | |
| 317 set_alloc_mins_and_maxes (val, size); | |
| 318 } | |
| 319 | |
| 3305 | 320 /* malloc calls this if it finds we are near exhausting storage */ |
| 321 void | |
| 322 malloc_warning (const char *str) | |
| 323 { | |
| 324 if (ignore_malloc_warnings) | |
| 325 return; | |
| 326 | |
| 327 /* Remove the malloc lock here, because warn_when_safe may allocate | |
| 328 again. It is safe to remove the malloc lock here, because malloc | |
| 329 is already finished (malloc_warning is called via | |
| 330 after_morecore_hook -> check_memory_limits -> save_warn_fun -> | |
| 331 malloc_warning). */ | |
| 332 MALLOC_END (); | |
| 333 | |
| 334 warn_when_safe | |
| 335 (Qmemory, Qemergency, | |
| 336 "%s\n" | |
| 337 "Killing some buffers may delay running out of memory.\n" | |
| 338 "However, certainly by the time you receive the 95%% warning,\n" | |
| 339 "you should clean up, kill this Emacs, and start a new one.", | |
| 340 str); | |
| 341 } | |
| 342 | |
| 343 /* Called if malloc returns zero */ | |
| 344 DOESNT_RETURN | |
| 345 memory_full (void) | |
| 346 { | |
| 347 /* Force a GC next time eval is called. | |
| 348 It's better to loop garbage-collecting (we might reclaim enough | |
| 349 to win) than to loop beeping and barfing "Memory exhausted" | |
| 350 */ | |
| 351 consing_since_gc = gc_cons_threshold + 1; | |
| 352 recompute_need_to_garbage_collect (); | |
| 353 #ifdef NEW_GC | |
| 354 /* Put mc-alloc into memory shortage mode. This may keep XEmacs | |
| 355 alive until the garbage collector can free enough memory to get | |
| 356 us out of the memory exhaustion. If already in memory shortage | |
| 357 mode, we are in a loop and hopelessly lost. */ | |
| 358 if (memory_shortage) | |
| 359 { | |
| 360 fprintf (stderr, "Memory full, cannot recover.\n"); | |
| 361 ABORT (); | |
| 362 } | |
| 363 fprintf (stderr, | |
| 364 "Memory full, try to recover.\n" | |
| 365 "You should clean up, kill this Emacs, and start a new one.\n"); | |
| 366 memory_shortage++; | |
| 367 #else /* not NEW_GC */ | |
| 368 release_breathing_space (); | |
| 369 #endif /* not NEW_GC */ | |
| 370 | |
| 371 /* Flush some histories which might conceivably contain garbalogical | |
| 372 inhibitors. */ | |
| 373 if (!NILP (Fboundp (Qvalues))) | |
| 374 Fset (Qvalues, Qnil); | |
| 375 Vcommand_history = Qnil; | |
| 376 | |
| 377 out_of_memory ("Memory exhausted", Qunbound); | |
| 378 } | |
| 379 | |
| 2367 | 380 /* like malloc, calloc, realloc, free but: |
| 381 | |
| 382 -- check for no memory left | |
| 383 -- set internal mins and maxes | |
| 384 -- with error-checking on, check for reentrancy, invalid freeing, etc. | |
| 385 */ | |
| 1292 | 386 |
| 428 | 387 #undef xmalloc |
| 388 void * | |
| 665 | 389 xmalloc (Bytecount size) |
| 428 | 390 { |
| 1292 | 391 void *val; |
| 2367 | 392 MALLOC_BEGIN (); |
| 1292 | 393 val = malloc (size); |
| 2367 | 394 MALLOC_END (); |
| 395 malloc_after (val, size); | |
| 428 | 396 return val; |
| 397 } | |
| 398 | |
| 399 #undef xcalloc | |
| 400 static void * | |
| 665 | 401 xcalloc (Elemcount nelem, Bytecount elsize) |
| 428 | 402 { |
| 1292 | 403 void *val; |
| 2367 | 404 MALLOC_BEGIN (); |
| 1292 | 405 val= calloc (nelem, elsize); |
| 2367 | 406 MALLOC_END (); |
| 407 malloc_after (val, nelem * elsize); | |
| 428 | 408 return val; |
| 409 } | |
| 410 | |
| 411 void * | |
| 665 | 412 xmalloc_and_zero (Bytecount size) |
| 428 | 413 { |
| 414 return xcalloc (size, sizeof (char)); | |
| 415 } | |
| 416 | |
| 417 #undef xrealloc | |
| 418 void * | |
| 665 | 419 xrealloc (void *block, Bytecount size) |
| 428 | 420 { |
| 2367 | 421 FREE_OR_REALLOC_BEGIN (block); |
| 551 | 422 block = realloc (block, size); |
| 2367 | 423 MALLOC_END (); |
| 424 malloc_after (block, size); | |
| 551 | 425 return block; |
| 428 | 426 } |
| 427 | |
| 428 void | |
| 429 xfree_1 (void *block) | |
| 430 { | |
| 431 #ifdef ERROR_CHECK_MALLOC | |
| 432 assert (block); | |
| 433 #endif /* ERROR_CHECK_MALLOC */ | |
| 2367 | 434 FREE_OR_REALLOC_BEGIN (block); |
| 428 | 435 free (block); |
| 2367 | 436 MALLOC_END (); |
| 428 | 437 } |
| 438 | |
| 439 #ifdef ERROR_CHECK_GC | |
| 440 | |
| 3263 | 441 #ifndef NEW_GC |
| 428 | 442 static void |
| 665 | 443 deadbeef_memory (void *ptr, Bytecount size) |
| 428 | 444 { |
| 826 | 445 UINT_32_BIT *ptr4 = (UINT_32_BIT *) ptr; |
| 665 | 446 Bytecount beefs = size >> 2; |
| 428 | 447 |
| 448 /* In practice, size will always be a multiple of four. */ | |
| 449 while (beefs--) | |
| 1204 | 450 (*ptr4++) = 0xDEADBEEF; /* -559038737 base 10 */ |
| 428 | 451 } |
| 3263 | 452 #endif /* not NEW_GC */ |
| 428 | 453 |
| 454 #else /* !ERROR_CHECK_GC */ | |
| 455 | |
| 456 | |
| 457 #define deadbeef_memory(ptr, size) | |
| 458 | |
| 459 #endif /* !ERROR_CHECK_GC */ | |
| 460 | |
| 461 #undef xstrdup | |
| 462 char * | |
| 442 | 463 xstrdup (const char *str) |
| 428 | 464 { |
| 465 int len = strlen (str) + 1; /* for stupid terminating 0 */ | |
| 466 void *val = xmalloc (len); | |
| 771 | 467 |
| 428 | 468 if (val == 0) return 0; |
| 469 return (char *) memcpy (val, str, len); | |
| 470 } | |
| 471 | |
| 472 #ifdef NEED_STRDUP | |
| 473 char * | |
| 442 | 474 strdup (const char *s) |
| 428 | 475 { |
| 476 return xstrdup (s); | |
| 477 } | |
| 478 #endif /* NEED_STRDUP */ | |
| 479 | |
| 480 | |
| 3263 | 481 #ifndef NEW_GC |
| 428 | 482 static void * |
| 665 | 483 allocate_lisp_storage (Bytecount size) |
| 428 | 484 { |
| 793 | 485 void *val = xmalloc (size); |
| 486 /* We don't increment the cons counter anymore. Calling functions do | |
| 487 that now because we have two different kinds of cons counters -- one | |
| 488 for normal objects, and one for no-see-um conses (and possibly others | |
| 489 similar) where the conses are used totally internally, never escape, | |
| 490 and are created and then freed and shouldn't logically increment the | |
| 491 cons counting. #### (Or perhaps, we should decrement it when an object | |
| 492 get freed?) */ | |
| 493 | |
| 494 /* But we do now (as of 3-27-02) go and zero out the memory. This is a | |
| 495 good thing, as it will guarantee we won't get any intermittent bugs | |
| 1204 | 496 coming from an uninitiated field. The speed loss is unnoticeable, |
| 497 esp. as the objects are not large -- large stuff like buffer text and | |
| 498 redisplay structures are allocated separately. */ | |
| 793 | 499 memset (val, 0, size); |
| 851 | 500 |
| 501 if (need_to_check_c_alloca) | |
| 502 xemacs_c_alloca (0); | |
| 503 | |
| 793 | 504 return val; |
| 428 | 505 } |
| 3263 | 506 #endif /* not NEW_GC */ |
| 507 | |
| 508 #if defined (NEW_GC) && defined (ALLOC_TYPE_STATS) | |
| 2720 | 509 static struct |
| 510 { | |
| 511 int instances_in_use; | |
| 512 int bytes_in_use; | |
| 513 int bytes_in_use_including_overhead; | |
| 3461 | 514 } lrecord_stats [countof (lrecord_implementations_table)]; |
| 2720 | 515 |
| 516 void | |
| 517 init_lrecord_stats () | |
| 518 { | |
| 519 xzero (lrecord_stats); | |
| 520 } | |
| 521 | |
| 522 void | |
| 523 inc_lrecord_stats (Bytecount size, const struct lrecord_header *h) | |
| 524 { | |
| 525 int type_index = h->type; | |
| 526 if (!size) | |
| 527 size = detagged_lisp_object_size (h); | |
| 528 | |
| 529 lrecord_stats[type_index].instances_in_use++; | |
| 530 lrecord_stats[type_index].bytes_in_use += size; | |
| 531 lrecord_stats[type_index].bytes_in_use_including_overhead | |
| 532 #ifdef MEMORY_USAGE_STATS | |
| 533 += mc_alloced_storage_size (size, 0); | |
| 534 #else /* not MEMORY_USAGE_STATS */ | |
| 535 += size; | |
| 536 #endif /* not MEMORY_USAGE_STATS */ | |
| 537 } | |
| 538 | |
| 539 void | |
| 540 dec_lrecord_stats (Bytecount size_including_overhead, | |
| 541 const struct lrecord_header *h) | |
| 542 { | |
| 543 int type_index = h->type; | |
| 2775 | 544 int size = detagged_lisp_object_size (h); |
| 2720 | 545 |
| 546 lrecord_stats[type_index].instances_in_use--; | |
| 2775 | 547 lrecord_stats[type_index].bytes_in_use -= size; |
| 2720 | 548 lrecord_stats[type_index].bytes_in_use_including_overhead |
| 549 -= size_including_overhead; | |
| 550 | |
| 2775 | 551 DECREMENT_CONS_COUNTER (size); |
| 2720 | 552 } |
| 3092 | 553 |
| 554 int | |
| 555 lrecord_stats_heap_size (void) | |
| 556 { | |
| 557 int i; | |
| 558 int size = 0; | |
| 3461 | 559 for (i = 0; i < countof (lrecord_implementations_table); i++) |
| 3092 | 560 size += lrecord_stats[i].bytes_in_use; |
| 561 return size; | |
| 562 } | |
| 3263 | 563 #endif /* NEW_GC && ALLOC_TYPE_STATS */ |
| 564 | |
| 565 #ifndef NEW_GC | |
| 442 | 566 /* lcrecords are chained together through their "next" field. |
| 567 After doing the mark phase, GC will walk this linked list | |
| 568 and free any lcrecord which hasn't been marked. */ | |
| 3024 | 569 static struct old_lcrecord_header *all_lcrecords; |
| 3263 | 570 #endif /* not NEW_GC */ |
| 571 | |
| 572 #ifdef NEW_GC | |
| 2720 | 573 /* The basic lrecord allocation functions. See lrecord.h for details. */ |
| 574 void * | |
| 575 alloc_lrecord (Bytecount size, | |
| 576 const struct lrecord_implementation *implementation) | |
| 577 { | |
| 578 struct lrecord_header *lheader; | |
| 579 | |
| 580 type_checking_assert | |
| 581 ((implementation->static_size == 0 ? | |
| 582 implementation->size_in_bytes_method != NULL : | |
| 583 implementation->static_size == size)); | |
| 584 | |
| 585 lheader = (struct lrecord_header *) mc_alloc (size); | |
| 586 gc_checking_assert (LRECORD_FREE_P (lheader)); | |
| 587 set_lheader_implementation (lheader, implementation); | |
| 2994 | 588 #ifdef ALLOC_TYPE_STATS |
| 2720 | 589 inc_lrecord_stats (size, lheader); |
| 2994 | 590 #endif /* ALLOC_TYPE_STATS */ |
| 3263 | 591 if (implementation->finalizer) |
| 592 add_finalizable_obj (wrap_pointer_1 (lheader)); | |
| 2720 | 593 INCREMENT_CONS_COUNTER (size, implementation->name); |
| 594 return lheader; | |
| 595 } | |
| 596 | |
| 3092 | 597 |
| 2720 | 598 void * |
| 599 noseeum_alloc_lrecord (Bytecount size, | |
| 600 const struct lrecord_implementation *implementation) | |
| 601 { | |
| 602 struct lrecord_header *lheader; | |
| 603 | |
| 604 type_checking_assert | |
| 605 ((implementation->static_size == 0 ? | |
| 606 implementation->size_in_bytes_method != NULL : | |
| 607 implementation->static_size == size)); | |
| 608 | |
| 609 lheader = (struct lrecord_header *) mc_alloc (size); | |
| 610 gc_checking_assert (LRECORD_FREE_P (lheader)); | |
| 611 set_lheader_implementation (lheader, implementation); | |
| 2994 | 612 #ifdef ALLOC_TYPE_STATS |
| 2720 | 613 inc_lrecord_stats (size, lheader); |
| 2994 | 614 #endif /* ALLOC_TYPE_STATS */ |
| 3263 | 615 if (implementation->finalizer) |
| 616 add_finalizable_obj (wrap_pointer_1 (lheader)); | |
| 2720 | 617 NOSEEUM_INCREMENT_CONS_COUNTER (size, implementation->name); |
| 618 return lheader; | |
| 619 } | |
| 620 | |
| 3092 | 621 void * |
| 622 alloc_lrecord_array (Bytecount size, int elemcount, | |
| 623 const struct lrecord_implementation *implementation) | |
| 624 { | |
| 625 struct lrecord_header *lheader; | |
| 626 Rawbyte *start, *stop; | |
| 627 | |
| 628 type_checking_assert | |
| 629 ((implementation->static_size == 0 ? | |
| 630 implementation->size_in_bytes_method != NULL : | |
| 631 implementation->static_size == size)); | |
| 632 | |
| 633 lheader = (struct lrecord_header *) mc_alloc_array (size, elemcount); | |
| 634 gc_checking_assert (LRECORD_FREE_P (lheader)); | |
| 635 | |
| 636 for (start = (Rawbyte *) lheader, | |
| 637 stop = ((Rawbyte *) lheader) + (size * elemcount -1); | |
| 638 start < stop; start += size) | |
| 639 { | |
| 640 struct lrecord_header *lh = (struct lrecord_header *) start; | |
| 641 set_lheader_implementation (lh, implementation); | |
| 642 lh->uid = lrecord_uid_counter++; | |
| 643 #ifdef ALLOC_TYPE_STATS | |
| 644 inc_lrecord_stats (size, lh); | |
| 645 #endif /* not ALLOC_TYPE_STATS */ | |
| 3263 | 646 if (implementation->finalizer) |
| 647 add_finalizable_obj (wrap_pointer_1 (lh)); | |
| 3092 | 648 } |
| 649 INCREMENT_CONS_COUNTER (size * elemcount, implementation->name); | |
| 650 return lheader; | |
| 651 } | |
| 652 | |
| 2720 | 653 void |
| 3263 | 654 free_lrecord (Lisp_Object UNUSED (lrecord)) |
| 2720 | 655 { |
| 3263 | 656 /* Manual frees are not allowed with asynchronous finalization */ |
| 657 return; | |
| 2720 | 658 } |
| 3263 | 659 #else /* not NEW_GC */ |
| 428 | 660 |
| 1204 | 661 /* The most basic of the lcrecord allocation functions. Not usually called |
| 662 directly. Allocates an lrecord not managed by any lcrecord-list, of a | |
| 663 specified size. See lrecord.h. */ | |
| 664 | |
| 428 | 665 void * |
| 3024 | 666 old_basic_alloc_lcrecord (Bytecount size, |
| 667 const struct lrecord_implementation *implementation) | |
| 668 { | |
| 669 struct old_lcrecord_header *lcheader; | |
| 428 | 670 |
| 442 | 671 type_checking_assert |
| 672 ((implementation->static_size == 0 ? | |
| 673 implementation->size_in_bytes_method != NULL : | |
| 674 implementation->static_size == size) | |
| 675 && | |
| 676 (! implementation->basic_p) | |
| 677 && | |
| 678 (! (implementation->hash == NULL && implementation->equal != NULL))); | |
| 428 | 679 |
| 3024 | 680 lcheader = (struct old_lcrecord_header *) allocate_lisp_storage (size); |
| 442 | 681 set_lheader_implementation (&lcheader->lheader, implementation); |
| 428 | 682 lcheader->next = all_lcrecords; |
| 683 #if 1 /* mly prefers to see small ID numbers */ | |
| 684 lcheader->uid = lrecord_uid_counter++; | |
| 685 #else /* jwz prefers to see real addrs */ | |
| 686 lcheader->uid = (int) &lcheader; | |
| 687 #endif | |
| 688 lcheader->free = 0; | |
| 689 all_lcrecords = lcheader; | |
| 690 INCREMENT_CONS_COUNTER (size, implementation->name); | |
| 691 return lcheader; | |
| 692 } | |
| 693 | |
| 694 #if 0 /* Presently unused */ | |
| 695 /* Very, very poor man's EGC? | |
| 696 * This may be slow and thrash pages all over the place. | |
| 697 * Only call it if you really feel you must (and if the | |
| 698 * lrecord was fairly recently allocated). | |
| 699 * Otherwise, just let the GC do its job -- that's what it's there for | |
| 700 */ | |
| 701 void | |
| 3024 | 702 very_old_free_lcrecord (struct old_lcrecord_header *lcrecord) |
| 428 | 703 { |
| 704 if (all_lcrecords == lcrecord) | |
| 705 { | |
| 706 all_lcrecords = lcrecord->next; | |
| 707 } | |
| 708 else | |
| 709 { | |
| 3024 | 710 struct old_lcrecord_header *header = all_lcrecords; |
| 428 | 711 for (;;) |
| 712 { | |
| 3024 | 713 struct old_lcrecord_header *next = header->next; |
| 428 | 714 if (next == lcrecord) |
| 715 { | |
| 716 header->next = lrecord->next; | |
| 717 break; | |
| 718 } | |
| 719 else if (next == 0) | |
| 2500 | 720 ABORT (); |
| 428 | 721 else |
| 722 header = next; | |
| 723 } | |
| 724 } | |
| 725 if (lrecord->implementation->finalizer) | |
| 726 lrecord->implementation->finalizer (lrecord, 0); | |
| 727 xfree (lrecord); | |
| 728 return; | |
| 729 } | |
| 730 #endif /* Unused */ | |
| 3263 | 731 #endif /* not NEW_GC */ |
| 428 | 732 |
| 733 | |
| 734 static void | |
| 735 disksave_object_finalization_1 (void) | |
| 736 { | |
| 3263 | 737 #ifdef NEW_GC |
| 2720 | 738 mc_finalize_for_disksave (); |
| 3263 | 739 #else /* not NEW_GC */ |
| 3024 | 740 struct old_lcrecord_header *header; |
| 428 | 741 |
| 742 for (header = all_lcrecords; header; header = header->next) | |
| 743 { | |
| 442 | 744 if (LHEADER_IMPLEMENTATION (&header->lheader)->finalizer && |
| 428 | 745 !header->free) |
| 442 | 746 LHEADER_IMPLEMENTATION (&header->lheader)->finalizer (header, 1); |
| 428 | 747 } |
| 3263 | 748 #endif /* not NEW_GC */ |
| 428 | 749 } |
| 750 | |
| 1204 | 751 /* Bitwise copy all parts of a Lisp object other than the header */ |
| 752 | |
| 753 void | |
| 754 copy_lisp_object (Lisp_Object dst, Lisp_Object src) | |
| 755 { | |
| 756 const struct lrecord_implementation *imp = | |
| 757 XRECORD_LHEADER_IMPLEMENTATION (src); | |
| 758 Bytecount size = lisp_object_size (src); | |
| 759 | |
| 760 assert (imp == XRECORD_LHEADER_IMPLEMENTATION (dst)); | |
| 761 assert (size == lisp_object_size (dst)); | |
| 762 | |
| 3263 | 763 #ifdef NEW_GC |
| 2720 | 764 memcpy ((char *) XRECORD_LHEADER (dst) + sizeof (struct lrecord_header), |
| 765 (char *) XRECORD_LHEADER (src) + sizeof (struct lrecord_header), | |
| 766 size - sizeof (struct lrecord_header)); | |
| 3263 | 767 #else /* not NEW_GC */ |
| 1204 | 768 if (imp->basic_p) |
| 769 memcpy ((char *) XRECORD_LHEADER (dst) + sizeof (struct lrecord_header), | |
| 770 (char *) XRECORD_LHEADER (src) + sizeof (struct lrecord_header), | |
| 771 size - sizeof (struct lrecord_header)); | |
| 772 else | |
| 3024 | 773 memcpy ((char *) XRECORD_LHEADER (dst) + |
| 774 sizeof (struct old_lcrecord_header), | |
| 775 (char *) XRECORD_LHEADER (src) + | |
| 776 sizeof (struct old_lcrecord_header), | |
| 777 size - sizeof (struct old_lcrecord_header)); | |
| 3263 | 778 #endif /* not NEW_GC */ |
| 1204 | 779 } |
| 780 | |
| 428 | 781 |
| 782 /************************************************************************/ | |
| 783 /* Debugger support */ | |
| 784 /************************************************************************/ | |
| 785 /* Give gdb/dbx enough information to decode Lisp Objects. We make | |
| 786 sure certain symbols are always defined, so gdb doesn't complain | |
| 438 | 787 about expressions in src/.gdbinit. See src/.gdbinit or src/.dbxrc |
| 788 to see how this is used. */ | |
| 428 | 789 |
| 458 | 790 EMACS_UINT dbg_valmask = ((1UL << VALBITS) - 1) << GCBITS; |
| 791 EMACS_UINT dbg_typemask = (1UL << GCTYPEBITS) - 1; | |
| 428 | 792 |
| 793 #ifdef USE_UNION_TYPE | |
| 458 | 794 unsigned char dbg_USE_UNION_TYPE = 1; |
| 428 | 795 #else |
| 458 | 796 unsigned char dbg_USE_UNION_TYPE = 0; |
| 428 | 797 #endif |
| 798 | |
| 458 | 799 unsigned char dbg_valbits = VALBITS; |
| 800 unsigned char dbg_gctypebits = GCTYPEBITS; | |
| 801 | |
| 802 /* On some systems, the above definitions will be optimized away by | |
| 803 the compiler or linker unless they are referenced in some function. */ | |
| 804 long dbg_inhibit_dbg_symbol_deletion (void); | |
| 805 long | |
| 806 dbg_inhibit_dbg_symbol_deletion (void) | |
| 807 { | |
| 808 return | |
| 809 (dbg_valmask + | |
| 810 dbg_typemask + | |
| 811 dbg_USE_UNION_TYPE + | |
| 812 dbg_valbits + | |
| 813 dbg_gctypebits); | |
| 814 } | |
| 428 | 815 |
| 816 /* Macros turned into functions for ease of debugging. | |
| 817 Debuggers don't know about macros! */ | |
| 818 int dbg_eq (Lisp_Object obj1, Lisp_Object obj2); | |
| 819 int | |
| 820 dbg_eq (Lisp_Object obj1, Lisp_Object obj2) | |
| 821 { | |
| 822 return EQ (obj1, obj2); | |
| 823 } | |
| 824 | |
| 825 | |
| 3263 | 826 #ifdef NEW_GC |
| 3017 | 827 #define DECLARE_FIXED_TYPE_ALLOC(type, structture) struct __foo__ |
| 828 #else | |
| 428 | 829 /************************************************************************/ |
| 830 /* Fixed-size type macros */ | |
| 831 /************************************************************************/ | |
| 832 | |
| 833 /* For fixed-size types that are commonly used, we malloc() large blocks | |
| 834 of memory at a time and subdivide them into chunks of the correct | |
| 835 size for an object of that type. This is more efficient than | |
| 836 malloc()ing each object separately because we save on malloc() time | |
| 837 and overhead due to the fewer number of malloc()ed blocks, and | |
| 838 also because we don't need any extra pointers within each object | |
| 839 to keep them threaded together for GC purposes. For less common | |
| 840 (and frequently large-size) types, we use lcrecords, which are | |
| 841 malloc()ed individually and chained together through a pointer | |
| 842 in the lcrecord header. lcrecords do not need to be fixed-size | |
| 843 (i.e. two objects of the same type need not have the same size; | |
| 844 however, the size of a particular object cannot vary dynamically). | |
| 845 It is also much easier to create a new lcrecord type because no | |
| 846 additional code needs to be added to alloc.c. Finally, lcrecords | |
| 847 may be more efficient when there are only a small number of them. | |
| 848 | |
| 849 The types that are stored in these large blocks (or "frob blocks") | |
| 1983 | 850 are cons, all number types except fixnum, compiled-function, symbol, |
| 851 marker, extent, event, and string. | |
| 428 | 852 |
| 853 Note that strings are special in that they are actually stored in | |
| 854 two parts: a structure containing information about the string, and | |
| 855 the actual data associated with the string. The former structure | |
| 856 (a struct Lisp_String) is a fixed-size structure and is managed the | |
| 857 same way as all the other such types. This structure contains a | |
| 858 pointer to the actual string data, which is stored in structures of | |
| 859 type struct string_chars_block. Each string_chars_block consists | |
| 860 of a pointer to a struct Lisp_String, followed by the data for that | |
| 440 | 861 string, followed by another pointer to a Lisp_String, followed by |
| 862 the data for that string, etc. At GC time, the data in these | |
| 863 blocks is compacted by searching sequentially through all the | |
| 428 | 864 blocks and compressing out any holes created by unmarked strings. |
| 865 Strings that are more than a certain size (bigger than the size of | |
| 866 a string_chars_block, although something like half as big might | |
| 867 make more sense) are malloc()ed separately and not stored in | |
| 868 string_chars_blocks. Furthermore, no one string stretches across | |
| 869 two string_chars_blocks. | |
| 870 | |
| 1204 | 871 Vectors are each malloc()ed separately as lcrecords. |
| 428 | 872 |
| 873 In the following discussion, we use conses, but it applies equally | |
| 874 well to the other fixed-size types. | |
| 875 | |
| 876 We store cons cells inside of cons_blocks, allocating a new | |
| 877 cons_block with malloc() whenever necessary. Cons cells reclaimed | |
| 878 by GC are put on a free list to be reallocated before allocating | |
| 879 any new cons cells from the latest cons_block. Each cons_block is | |
| 880 just under 2^n - MALLOC_OVERHEAD bytes long, since malloc (at least | |
| 881 the versions in malloc.c and gmalloc.c) really allocates in units | |
| 882 of powers of two and uses 4 bytes for its own overhead. | |
| 883 | |
| 884 What GC actually does is to search through all the cons_blocks, | |
| 885 from the most recently allocated to the oldest, and put all | |
| 886 cons cells that are not marked (whether or not they're already | |
| 887 free) on a cons_free_list. The cons_free_list is a stack, and | |
| 888 so the cons cells in the oldest-allocated cons_block end up | |
| 889 at the head of the stack and are the first to be reallocated. | |
| 890 If any cons_block is entirely free, it is freed with free() | |
| 891 and its cons cells removed from the cons_free_list. Because | |
| 892 the cons_free_list ends up basically in memory order, we have | |
| 893 a high locality of reference (assuming a reasonable turnover | |
| 894 of allocating and freeing) and have a reasonable probability | |
| 895 of entirely freeing up cons_blocks that have been more recently | |
| 896 allocated. This stage is called the "sweep stage" of GC, and | |
| 897 is executed after the "mark stage", which involves starting | |
| 898 from all places that are known to point to in-use Lisp objects | |
| 899 (e.g. the obarray, where are all symbols are stored; the | |
| 900 current catches and condition-cases; the backtrace list of | |
| 901 currently executing functions; the gcpro list; etc.) and | |
| 902 recursively marking all objects that are accessible. | |
| 903 | |
| 454 | 904 At the beginning of the sweep stage, the conses in the cons blocks |
| 905 are in one of three states: in use and marked, in use but not | |
| 906 marked, and not in use (already freed). Any conses that are marked | |
| 907 have been marked in the mark stage just executed, because as part | |
| 908 of the sweep stage we unmark any marked objects. The way we tell | |
| 909 whether or not a cons cell is in use is through the LRECORD_FREE_P | |
| 910 macro. This uses a special lrecord type `lrecord_type_free', | |
| 911 which is never associated with any valid object. | |
| 912 | |
| 913 Conses on the free_cons_list are threaded through a pointer stored | |
| 914 in the conses themselves. Because the cons is still in a | |
| 915 cons_block and needs to remain marked as not in use for the next | |
| 916 time that GC happens, we need room to store both the "free" | |
| 917 indicator and the chaining pointer. So this pointer is stored | |
| 918 after the lrecord header (actually where C places a pointer after | |
| 919 the lrecord header; they are not necessarily contiguous). This | |
| 920 implies that all fixed-size types must be big enough to contain at | |
| 921 least one pointer. This is true for all current fixed-size types, | |
| 922 with the possible exception of Lisp_Floats, for which we define the | |
| 923 meat of the struct using a union of a pointer and a double to | |
| 924 ensure adequate space for the free list chain pointer. | |
| 428 | 925 |
| 926 Some types of objects need additional "finalization" done | |
| 927 when an object is converted from in use to not in use; | |
| 928 this is the purpose of the ADDITIONAL_FREE_type macro. | |
| 929 For example, markers need to be removed from the chain | |
| 930 of markers that is kept in each buffer. This is because | |
| 931 markers in a buffer automatically disappear if the marker | |
| 932 is no longer referenced anywhere (the same does not | |
| 933 apply to extents, however). | |
| 934 | |
| 935 WARNING: Things are in an extremely bizarre state when | |
| 936 the ADDITIONAL_FREE_type macros are called, so beware! | |
| 937 | |
| 454 | 938 When ERROR_CHECK_GC is defined, we do things differently so as to |
| 939 maximize our chances of catching places where there is insufficient | |
| 940 GCPROing. The thing we want to avoid is having an object that | |
| 941 we're using but didn't GCPRO get freed by GC and then reallocated | |
| 942 while we're in the process of using it -- this will result in | |
| 943 something seemingly unrelated getting trashed, and is extremely | |
| 944 difficult to track down. If the object gets freed but not | |
| 945 reallocated, we can usually catch this because we set most of the | |
| 946 bytes of a freed object to 0xDEADBEEF. (The lisp object type is set | |
| 947 to the invalid type `lrecord_type_free', however, and a pointer | |
| 948 used to chain freed objects together is stored after the lrecord | |
| 949 header; we play some tricks with this pointer to make it more | |
| 428 | 950 bogus, so crashes are more likely to occur right away.) |
| 951 | |
| 952 We want freed objects to stay free as long as possible, | |
| 953 so instead of doing what we do above, we maintain the | |
| 954 free objects in a first-in first-out queue. We also | |
| 955 don't recompute the free list each GC, unlike above; | |
| 956 this ensures that the queue ordering is preserved. | |
| 957 [This means that we are likely to have worse locality | |
| 958 of reference, and that we can never free a frob block | |
| 959 once it's allocated. (Even if we know that all cells | |
| 960 in it are free, there's no easy way to remove all those | |
| 961 cells from the free list because the objects on the | |
| 962 free list are unlikely to be in memory order.)] | |
| 963 Furthermore, we never take objects off the free list | |
| 964 unless there's a large number (usually 1000, but | |
| 965 varies depending on type) of them already on the list. | |
| 966 This way, we ensure that an object that gets freed will | |
| 967 remain free for the next 1000 (or whatever) times that | |
| 440 | 968 an object of that type is allocated. */ |
| 428 | 969 |
| 970 #if !defined(HAVE_MMAP) || defined(DOUG_LEA_MALLOC) | |
| 971 /* If we released our reserve (due to running out of memory), | |
| 972 and we have a fair amount free once again, | |
| 973 try to set aside another reserve in case we run out once more. | |
| 974 | |
| 975 This is called when a relocatable block is freed in ralloc.c. */ | |
| 976 void refill_memory_reserve (void); | |
| 977 void | |
| 442 | 978 refill_memory_reserve (void) |
| 428 | 979 { |
| 980 if (breathing_space == 0) | |
| 981 breathing_space = (char *) malloc (4096 - MALLOC_OVERHEAD); | |
| 982 } | |
| 983 #endif | |
| 984 | |
| 985 #ifdef ALLOC_NO_POOLS | |
| 986 # define TYPE_ALLOC_SIZE(type, structtype) 1 | |
| 987 #else | |
| 988 # define TYPE_ALLOC_SIZE(type, structtype) \ | |
| 989 ((2048 - MALLOC_OVERHEAD - sizeof (struct type##_block *)) \ | |
| 990 / sizeof (structtype)) | |
| 991 #endif /* ALLOC_NO_POOLS */ | |
| 992 | |
| 993 #define DECLARE_FIXED_TYPE_ALLOC(type, structtype) \ | |
| 994 \ | |
| 995 struct type##_block \ | |
| 996 { \ | |
| 997 struct type##_block *prev; \ | |
| 998 structtype block[TYPE_ALLOC_SIZE (type, structtype)]; \ | |
| 999 }; \ | |
| 1000 \ | |
| 1001 static struct type##_block *current_##type##_block; \ | |
| 1002 static int current_##type##_block_index; \ | |
| 1003 \ | |
| 454 | 1004 static Lisp_Free *type##_free_list; \ |
| 1005 static Lisp_Free *type##_free_list_tail; \ | |
| 428 | 1006 \ |
| 1007 static void \ | |
| 1008 init_##type##_alloc (void) \ | |
| 1009 { \ | |
| 1010 current_##type##_block = 0; \ | |
| 1011 current_##type##_block_index = \ | |
| 1012 countof (current_##type##_block->block); \ | |
| 1013 type##_free_list = 0; \ | |
| 1014 type##_free_list_tail = 0; \ | |
| 1015 } \ | |
| 1016 \ | |
| 1017 static int gc_count_num_##type##_in_use; \ | |
| 1018 static int gc_count_num_##type##_freelist | |
| 1019 | |
| 1020 #define ALLOCATE_FIXED_TYPE_FROM_BLOCK(type, result) do { \ | |
| 1021 if (current_##type##_block_index \ | |
| 1022 == countof (current_##type##_block->block)) \ | |
| 1023 { \ | |
| 1024 struct type##_block *AFTFB_new = (struct type##_block *) \ | |
| 1025 allocate_lisp_storage (sizeof (struct type##_block)); \ | |
| 1026 AFTFB_new->prev = current_##type##_block; \ | |
| 1027 current_##type##_block = AFTFB_new; \ | |
| 1028 current_##type##_block_index = 0; \ | |
| 1029 } \ | |
| 1030 (result) = \ | |
| 1031 &(current_##type##_block->block[current_##type##_block_index++]); \ | |
| 1032 } while (0) | |
| 1033 | |
| 1034 /* Allocate an instance of a type that is stored in blocks. | |
| 1035 TYPE is the "name" of the type, STRUCTTYPE is the corresponding | |
| 1036 structure type. */ | |
| 1037 | |
| 1038 #ifdef ERROR_CHECK_GC | |
| 1039 | |
| 1040 /* Note: if you get crashes in this function, suspect incorrect calls | |
| 1041 to free_cons() and friends. This happened once because the cons | |
| 1042 cell was not GC-protected and was getting collected before | |
| 1043 free_cons() was called. */ | |
| 1044 | |
| 454 | 1045 #define ALLOCATE_FIXED_TYPE_1(type, structtype, result) do { \ |
| 1046 if (gc_count_num_##type##_freelist > \ | |
| 1047 MINIMUM_ALLOWED_FIXED_TYPE_CELLS_##type) \ | |
| 1048 { \ | |
| 1049 result = (structtype *) type##_free_list; \ | |
| 1204 | 1050 assert (LRECORD_FREE_P (result)); \ |
| 1051 /* Before actually using the chain pointer, we complement \ | |
| 1052 all its bits; see PUT_FIXED_TYPE_ON_FREE_LIST(). */ \ | |
| 454 | 1053 type##_free_list = (Lisp_Free *) \ |
| 1054 (~ (EMACS_UINT) (type##_free_list->chain)); \ | |
| 1055 gc_count_num_##type##_freelist--; \ | |
| 1056 } \ | |
| 1057 else \ | |
| 1058 ALLOCATE_FIXED_TYPE_FROM_BLOCK (type, result); \ | |
| 1059 MARK_LRECORD_AS_NOT_FREE (result); \ | |
| 428 | 1060 } while (0) |
| 1061 | |
| 1062 #else /* !ERROR_CHECK_GC */ | |
| 1063 | |
| 454 | 1064 #define ALLOCATE_FIXED_TYPE_1(type, structtype, result) do { \ |
| 428 | 1065 if (type##_free_list) \ |
| 1066 { \ | |
| 454 | 1067 result = (structtype *) type##_free_list; \ |
| 1068 type##_free_list = type##_free_list->chain; \ | |
| 428 | 1069 } \ |
| 1070 else \ | |
| 1071 ALLOCATE_FIXED_TYPE_FROM_BLOCK (type, result); \ | |
| 454 | 1072 MARK_LRECORD_AS_NOT_FREE (result); \ |
| 428 | 1073 } while (0) |
| 1074 | |
| 1075 #endif /* !ERROR_CHECK_GC */ | |
| 1076 | |
| 454 | 1077 |
| 428 | 1078 #define ALLOCATE_FIXED_TYPE(type, structtype, result) \ |
| 1079 do \ | |
| 1080 { \ | |
| 1081 ALLOCATE_FIXED_TYPE_1 (type, structtype, result); \ | |
| 1082 INCREMENT_CONS_COUNTER (sizeof (structtype), #type); \ | |
| 1083 } while (0) | |
| 1084 | |
| 1085 #define NOSEEUM_ALLOCATE_FIXED_TYPE(type, structtype, result) \ | |
| 1086 do \ | |
| 1087 { \ | |
| 1088 ALLOCATE_FIXED_TYPE_1 (type, structtype, result); \ | |
| 1089 NOSEEUM_INCREMENT_CONS_COUNTER (sizeof (structtype), #type); \ | |
| 1090 } while (0) | |
| 1091 | |
| 454 | 1092 /* Lisp_Free is the type to represent a free list member inside a frob |
| 1093 block of any lisp object type. */ | |
| 1094 typedef struct Lisp_Free | |
| 1095 { | |
| 1096 struct lrecord_header lheader; | |
| 1097 struct Lisp_Free *chain; | |
| 1098 } Lisp_Free; | |
| 1099 | |
| 1100 #define LRECORD_FREE_P(ptr) \ | |
| 771 | 1101 (((struct lrecord_header *) ptr)->type == lrecord_type_free) |
| 454 | 1102 |
| 1103 #define MARK_LRECORD_AS_FREE(ptr) \ | |
| 771 | 1104 ((void) (((struct lrecord_header *) ptr)->type = lrecord_type_free)) |
| 454 | 1105 |
| 1106 #ifdef ERROR_CHECK_GC | |
| 1107 #define MARK_LRECORD_AS_NOT_FREE(ptr) \ | |
| 771 | 1108 ((void) (((struct lrecord_header *) ptr)->type = lrecord_type_undefined)) |
| 428 | 1109 #else |
| 454 | 1110 #define MARK_LRECORD_AS_NOT_FREE(ptr) DO_NOTHING |
| 428 | 1111 #endif |
| 1112 | |
| 1113 #ifdef ERROR_CHECK_GC | |
| 1114 | |
| 454 | 1115 #define PUT_FIXED_TYPE_ON_FREE_LIST(type, structtype, ptr) do { \ |
| 1116 if (type##_free_list_tail) \ | |
| 1117 { \ | |
| 1118 /* When we store the chain pointer, we complement all \ | |
| 1119 its bits; this should significantly increase its \ | |
| 1120 bogosity in case someone tries to use the value, and \ | |
| 1121 should make us crash faster if someone overwrites the \ | |
| 1122 pointer because when it gets un-complemented in \ | |
| 1123 ALLOCATED_FIXED_TYPE(), the resulting pointer will be \ | |
| 1124 extremely bogus. */ \ | |
| 1125 type##_free_list_tail->chain = \ | |
| 1126 (Lisp_Free *) ~ (EMACS_UINT) (ptr); \ | |
| 1127 } \ | |
| 1128 else \ | |
| 1129 type##_free_list = (Lisp_Free *) (ptr); \ | |
| 1130 type##_free_list_tail = (Lisp_Free *) (ptr); \ | |
| 1131 } while (0) | |
| 428 | 1132 |
| 1133 #else /* !ERROR_CHECK_GC */ | |
| 1134 | |
| 454 | 1135 #define PUT_FIXED_TYPE_ON_FREE_LIST(type, structtype, ptr) do { \ |
| 1136 ((Lisp_Free *) (ptr))->chain = type##_free_list; \ | |
| 1137 type##_free_list = (Lisp_Free *) (ptr); \ | |
| 1138 } while (0) \ | |
| 428 | 1139 |
| 1140 #endif /* !ERROR_CHECK_GC */ | |
| 1141 | |
| 1142 /* TYPE and STRUCTTYPE are the same as in ALLOCATE_FIXED_TYPE(). */ | |
| 1143 | |
| 1144 #define FREE_FIXED_TYPE(type, structtype, ptr) do { \ | |
| 1145 structtype *FFT_ptr = (ptr); \ | |
| 1204 | 1146 gc_checking_assert (!LRECORD_FREE_P (FFT_ptr)); \ |
| 2367 | 1147 gc_checking_assert (!DUMPEDP (FFT_ptr)); \ |
| 428 | 1148 ADDITIONAL_FREE_##type (FFT_ptr); \ |
| 1149 deadbeef_memory (FFT_ptr, sizeof (structtype)); \ | |
| 1150 PUT_FIXED_TYPE_ON_FREE_LIST (type, structtype, FFT_ptr); \ | |
| 454 | 1151 MARK_LRECORD_AS_FREE (FFT_ptr); \ |
| 428 | 1152 } while (0) |
| 1153 | |
| 1154 /* Like FREE_FIXED_TYPE() but used when we are explicitly | |
| 1155 freeing a structure through free_cons(), free_marker(), etc. | |
| 1156 rather than through the normal process of sweeping. | |
| 1157 We attempt to undo the changes made to the allocation counters | |
| 1158 as a result of this structure being allocated. This is not | |
| 1159 completely necessary but helps keep things saner: e.g. this way, | |
| 1160 repeatedly allocating and freeing a cons will not result in | |
| 1161 the consing-since-gc counter advancing, which would cause a GC | |
| 1204 | 1162 and somewhat defeat the purpose of explicitly freeing. |
| 1163 | |
| 1164 We also disable this mechanism entirely when ALLOC_NO_POOLS is | |
| 1165 set, which is used for Purify and the like. */ | |
| 1166 | |
| 1167 #ifndef ALLOC_NO_POOLS | |
| 428 | 1168 #define FREE_FIXED_TYPE_WHEN_NOT_IN_GC(type, structtype, ptr) \ |
| 1169 do { FREE_FIXED_TYPE (type, structtype, ptr); \ | |
| 1170 DECREMENT_CONS_COUNTER (sizeof (structtype)); \ | |
| 1171 gc_count_num_##type##_freelist++; \ | |
| 1172 } while (0) | |
| 1204 | 1173 #else |
| 1174 #define FREE_FIXED_TYPE_WHEN_NOT_IN_GC(type, structtype, ptr) | |
| 1175 #endif | |
| 3263 | 1176 #endif /* NEW_GC */ |
| 1177 | |
| 1178 #ifdef NEW_GC | |
| 3017 | 1179 #define ALLOCATE_FIXED_TYPE_AND_SET_IMPL(type, lisp_type, var, lrec_ptr) \ |
| 1180 do { \ | |
| 1181 (var) = alloc_lrecord_type (lisp_type, lrec_ptr); \ | |
| 1182 } while (0) | |
| 1183 #define NOSEEUM_ALLOCATE_FIXED_TYPE_AND_SET_IMPL(type, lisp_type, var, \ | |
| 1184 lrec_ptr) \ | |
| 1185 do { \ | |
| 1186 (var) = noseeum_alloc_lrecord_type (lisp_type, lrec_ptr); \ | |
| 1187 } while (0) | |
| 3263 | 1188 #else /* not NEW_GC */ |
| 3017 | 1189 #define ALLOCATE_FIXED_TYPE_AND_SET_IMPL(type, lisp_type, var, lrec_ptr) \ |
| 1190 do \ | |
| 1191 { \ | |
| 1192 ALLOCATE_FIXED_TYPE (type, lisp_type, var); \ | |
| 1193 set_lheader_implementation (&(var)->lheader, lrec_ptr); \ | |
| 1194 } while (0) | |
| 1195 #define NOSEEUM_ALLOCATE_FIXED_TYPE_AND_SET_IMPL(type, lisp_type, var, \ | |
| 1196 lrec_ptr) \ | |
| 1197 do \ | |
| 1198 { \ | |
| 1199 NOSEEUM_ALLOCATE_FIXED_TYPE (type, lisp_type, var); \ | |
| 1200 set_lheader_implementation (&(var)->lheader, lrec_ptr); \ | |
| 1201 } while (0) | |
| 3263 | 1202 #endif /* not NEW_GC */ |
| 3017 | 1203 |
| 428 | 1204 |
| 1205 | |
| 1206 /************************************************************************/ | |
| 1207 /* Cons allocation */ | |
| 1208 /************************************************************************/ | |
| 1209 | |
| 440 | 1210 DECLARE_FIXED_TYPE_ALLOC (cons, Lisp_Cons); |
| 428 | 1211 /* conses are used and freed so often that we set this really high */ |
| 1212 /* #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_cons 20000 */ | |
| 1213 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_cons 2000 | |
| 1214 | |
| 1215 static Lisp_Object | |
| 1216 mark_cons (Lisp_Object obj) | |
| 1217 { | |
| 1218 if (NILP (XCDR (obj))) | |
| 1219 return XCAR (obj); | |
| 1220 | |
| 1221 mark_object (XCAR (obj)); | |
| 1222 return XCDR (obj); | |
| 1223 } | |
| 1224 | |
| 1225 static int | |
|
4906
6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
Ben Wing <ben@xemacs.org>
parents:
4880
diff
changeset
|
1226 cons_equal (Lisp_Object ob1, Lisp_Object ob2, int depth, int foldcase) |
| 428 | 1227 { |
| 442 | 1228 depth++; |
|
4906
6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
Ben Wing <ben@xemacs.org>
parents:
4880
diff
changeset
|
1229 while (internal_equal_0 (XCAR (ob1), XCAR (ob2), depth, foldcase)) |
| 428 | 1230 { |
| 1231 ob1 = XCDR (ob1); | |
| 1232 ob2 = XCDR (ob2); | |
| 1233 if (! CONSP (ob1) || ! CONSP (ob2)) | |
|
4906
6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
Ben Wing <ben@xemacs.org>
parents:
4880
diff
changeset
|
1234 return internal_equal_0 (ob1, ob2, depth, foldcase); |
| 428 | 1235 } |
| 1236 return 0; | |
| 1237 } | |
| 1238 | |
| 1204 | 1239 static const struct memory_description cons_description[] = { |
| 853 | 1240 { XD_LISP_OBJECT, offsetof (Lisp_Cons, car_) }, |
| 1241 { XD_LISP_OBJECT, offsetof (Lisp_Cons, cdr_) }, | |
| 428 | 1242 { XD_END } |
| 1243 }; | |
| 1244 | |
| 934 | 1245 DEFINE_BASIC_LRECORD_IMPLEMENTATION ("cons", cons, |
| 1246 1, /*dumpable-flag*/ | |
| 1247 mark_cons, print_cons, 0, | |
| 1248 cons_equal, | |
| 1249 /* | |
| 1250 * No `hash' method needed. | |
| 1251 * internal_hash knows how to | |
| 1252 * handle conses. | |
| 1253 */ | |
| 1254 0, | |
| 1255 cons_description, | |
| 1256 Lisp_Cons); | |
| 428 | 1257 |
| 1258 DEFUN ("cons", Fcons, 2, 2, 0, /* | |
| 3355 | 1259 Create a new cons cell, give it CAR and CDR as components, and return it. |
| 1260 | |
| 1261 A cons cell is a Lisp object (an area in memory) made up of two pointers | |
| 1262 called the CAR and the CDR. Each of these pointers can point to any other | |
| 1263 Lisp object. The common Lisp data type, the list, is a specially-structured | |
| 1264 series of cons cells. | |
| 1265 | |
| 1266 The pointers are accessed from Lisp with `car' and `cdr', and mutated with | |
| 1267 `setcar' and `setcdr' respectively. For historical reasons, the aliases | |
| 1268 `rplaca' and `rplacd' (for `setcar' and `setcdr') are supported. | |
| 428 | 1269 */ |
| 1270 (car, cdr)) | |
| 1271 { | |
| 1272 /* This cannot GC. */ | |
| 1273 Lisp_Object val; | |
| 440 | 1274 Lisp_Cons *c; |
| 1275 | |
| 3017 | 1276 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (cons, Lisp_Cons, c, &lrecord_cons); |
| 793 | 1277 val = wrap_cons (c); |
| 853 | 1278 XSETCAR (val, car); |
| 1279 XSETCDR (val, cdr); | |
| 428 | 1280 return val; |
| 1281 } | |
| 1282 | |
| 1283 /* This is identical to Fcons() but it used for conses that we're | |
| 1284 going to free later, and is useful when trying to track down | |
| 1285 "real" consing. */ | |
| 1286 Lisp_Object | |
| 1287 noseeum_cons (Lisp_Object car, Lisp_Object cdr) | |
| 1288 { | |
| 1289 Lisp_Object val; | |
| 440 | 1290 Lisp_Cons *c; |
| 1291 | |
| 3017 | 1292 NOSEEUM_ALLOCATE_FIXED_TYPE_AND_SET_IMPL (cons, Lisp_Cons, c, &lrecord_cons); |
| 793 | 1293 val = wrap_cons (c); |
| 428 | 1294 XCAR (val) = car; |
| 1295 XCDR (val) = cdr; | |
| 1296 return val; | |
| 1297 } | |
| 1298 | |
| 1299 DEFUN ("list", Flist, 0, MANY, 0, /* | |
|
4693
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
1300 Return a newly created list with specified ARGS as elements. |
| 428 | 1301 Any number of arguments, even zero arguments, are allowed. |
|
4693
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
1302 |
|
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
1303 arguments: (&rest ARGS) |
| 428 | 1304 */ |
| 1305 (int nargs, Lisp_Object *args)) | |
| 1306 { | |
| 1307 Lisp_Object val = Qnil; | |
| 1308 Lisp_Object *argp = args + nargs; | |
| 1309 | |
| 1310 while (argp > args) | |
| 1311 val = Fcons (*--argp, val); | |
| 1312 return val; | |
| 1313 } | |
| 1314 | |
| 1315 Lisp_Object | |
| 1316 list1 (Lisp_Object obj0) | |
| 1317 { | |
| 1318 /* This cannot GC. */ | |
| 1319 return Fcons (obj0, Qnil); | |
| 1320 } | |
| 1321 | |
| 1322 Lisp_Object | |
| 1323 list2 (Lisp_Object obj0, Lisp_Object obj1) | |
| 1324 { | |
| 1325 /* This cannot GC. */ | |
| 1326 return Fcons (obj0, Fcons (obj1, Qnil)); | |
| 1327 } | |
| 1328 | |
| 1329 Lisp_Object | |
| 1330 list3 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2) | |
| 1331 { | |
| 1332 /* This cannot GC. */ | |
| 1333 return Fcons (obj0, Fcons (obj1, Fcons (obj2, Qnil))); | |
| 1334 } | |
| 1335 | |
| 1336 Lisp_Object | |
| 1337 cons3 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2) | |
| 1338 { | |
| 1339 /* This cannot GC. */ | |
| 1340 return Fcons (obj0, Fcons (obj1, obj2)); | |
| 1341 } | |
| 1342 | |
| 1343 Lisp_Object | |
| 1344 acons (Lisp_Object key, Lisp_Object value, Lisp_Object alist) | |
| 1345 { | |
| 1346 return Fcons (Fcons (key, value), alist); | |
| 1347 } | |
| 1348 | |
| 1349 Lisp_Object | |
| 1350 list4 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, Lisp_Object obj3) | |
| 1351 { | |
| 1352 /* This cannot GC. */ | |
| 1353 return Fcons (obj0, Fcons (obj1, Fcons (obj2, Fcons (obj3, Qnil)))); | |
| 1354 } | |
| 1355 | |
| 1356 Lisp_Object | |
| 1357 list5 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, Lisp_Object obj3, | |
| 1358 Lisp_Object obj4) | |
| 1359 { | |
| 1360 /* This cannot GC. */ | |
| 1361 return Fcons (obj0, Fcons (obj1, Fcons (obj2, Fcons (obj3, Fcons (obj4, Qnil))))); | |
| 1362 } | |
| 1363 | |
| 1364 Lisp_Object | |
| 1365 list6 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, Lisp_Object obj3, | |
| 1366 Lisp_Object obj4, Lisp_Object obj5) | |
| 1367 { | |
| 1368 /* This cannot GC. */ | |
| 1369 return Fcons (obj0, Fcons (obj1, Fcons (obj2, Fcons (obj3, Fcons (obj4, Fcons (obj5, Qnil)))))); | |
| 1370 } | |
| 1371 | |
| 1372 DEFUN ("make-list", Fmake_list, 2, 2, 0, /* | |
| 444 | 1373 Return a new list of length LENGTH, with each element being OBJECT. |
| 428 | 1374 */ |
| 444 | 1375 (length, object)) |
| 428 | 1376 { |
| 1377 CHECK_NATNUM (length); | |
| 1378 | |
| 1379 { | |
| 1380 Lisp_Object val = Qnil; | |
| 647 | 1381 EMACS_INT size = XINT (length); |
| 428 | 1382 |
| 1383 while (size--) | |
| 444 | 1384 val = Fcons (object, val); |
| 428 | 1385 return val; |
| 1386 } | |
| 1387 } | |
| 1388 | |
| 1389 | |
| 1390 /************************************************************************/ | |
| 1391 /* Float allocation */ | |
| 1392 /************************************************************************/ | |
| 1393 | |
| 1983 | 1394 /*** With enhanced number support, these are short floats */ |
| 1395 | |
| 440 | 1396 DECLARE_FIXED_TYPE_ALLOC (float, Lisp_Float); |
| 428 | 1397 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_float 1000 |
| 1398 | |
| 1399 Lisp_Object | |
| 1400 make_float (double float_value) | |
| 1401 { | |
| 440 | 1402 Lisp_Float *f; |
| 1403 | |
| 3017 | 1404 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (float, Lisp_Float, f, &lrecord_float); |
| 440 | 1405 |
| 1406 /* Avoid dump-time `uninitialized memory read' purify warnings. */ | |
| 1407 if (sizeof (struct lrecord_header) + sizeof (double) != sizeof (*f)) | |
| 3017 | 1408 zero_lrecord (f); |
| 1409 | |
| 428 | 1410 float_data (f) = float_value; |
| 793 | 1411 return wrap_float (f); |
| 428 | 1412 } |
| 1413 | |
| 1414 | |
| 1415 /************************************************************************/ | |
| 1983 | 1416 /* Enhanced number allocation */ |
| 1417 /************************************************************************/ | |
| 1418 | |
| 1419 /*** Bignum ***/ | |
| 1420 #ifdef HAVE_BIGNUM | |
| 1421 DECLARE_FIXED_TYPE_ALLOC (bignum, Lisp_Bignum); | |
| 1422 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_bignum 250 | |
| 1423 | |
| 1424 /* WARNING: This function returns a bignum even if its argument fits into a | |
| 1425 fixnum. See Fcanonicalize_number(). */ | |
| 1426 Lisp_Object | |
| 1427 make_bignum (long bignum_value) | |
| 1428 { | |
| 1429 Lisp_Bignum *b; | |
| 1430 | |
| 3017 | 1431 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (bignum, Lisp_Bignum, b, &lrecord_bignum); |
| 1983 | 1432 bignum_init (bignum_data (b)); |
| 1433 bignum_set_long (bignum_data (b), bignum_value); | |
| 1434 return wrap_bignum (b); | |
| 1435 } | |
| 1436 | |
| 1437 /* WARNING: This function returns a bignum even if its argument fits into a | |
| 1438 fixnum. See Fcanonicalize_number(). */ | |
| 1439 Lisp_Object | |
| 1440 make_bignum_bg (bignum bg) | |
| 1441 { | |
| 1442 Lisp_Bignum *b; | |
| 1443 | |
| 3017 | 1444 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (bignum, Lisp_Bignum, b, &lrecord_bignum); |
| 1983 | 1445 bignum_init (bignum_data (b)); |
| 1446 bignum_set (bignum_data (b), bg); | |
| 1447 return wrap_bignum (b); | |
| 1448 } | |
| 1449 #endif /* HAVE_BIGNUM */ | |
| 1450 | |
| 1451 /*** Ratio ***/ | |
| 1452 #ifdef HAVE_RATIO | |
| 1453 DECLARE_FIXED_TYPE_ALLOC (ratio, Lisp_Ratio); | |
| 1454 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_ratio 250 | |
| 1455 | |
| 1456 Lisp_Object | |
| 1457 make_ratio (long numerator, unsigned long denominator) | |
| 1458 { | |
| 1459 Lisp_Ratio *r; | |
| 1460 | |
| 3017 | 1461 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (ratio, Lisp_Ratio, r, &lrecord_ratio); |
| 1983 | 1462 ratio_init (ratio_data (r)); |
| 1463 ratio_set_long_ulong (ratio_data (r), numerator, denominator); | |
| 1464 ratio_canonicalize (ratio_data (r)); | |
| 1465 return wrap_ratio (r); | |
| 1466 } | |
| 1467 | |
| 1468 Lisp_Object | |
| 1469 make_ratio_bg (bignum numerator, bignum denominator) | |
| 1470 { | |
| 1471 Lisp_Ratio *r; | |
| 1472 | |
| 3017 | 1473 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (ratio, Lisp_Ratio, r, &lrecord_ratio); |
| 1983 | 1474 ratio_init (ratio_data (r)); |
| 1475 ratio_set_bignum_bignum (ratio_data (r), numerator, denominator); | |
| 1476 ratio_canonicalize (ratio_data (r)); | |
| 1477 return wrap_ratio (r); | |
| 1478 } | |
| 1479 | |
| 1480 Lisp_Object | |
| 1481 make_ratio_rt (ratio rat) | |
| 1482 { | |
| 1483 Lisp_Ratio *r; | |
| 1484 | |
| 3017 | 1485 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (ratio, Lisp_Ratio, r, &lrecord_ratio); |
| 1983 | 1486 ratio_init (ratio_data (r)); |
| 1487 ratio_set (ratio_data (r), rat); | |
| 1488 return wrap_ratio (r); | |
| 1489 } | |
| 1490 #endif /* HAVE_RATIO */ | |
| 1491 | |
| 1492 /*** Bigfloat ***/ | |
| 1493 #ifdef HAVE_BIGFLOAT | |
| 1494 DECLARE_FIXED_TYPE_ALLOC (bigfloat, Lisp_Bigfloat); | |
| 1495 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_bigfloat 250 | |
| 1496 | |
| 1497 /* This function creates a bigfloat with the default precision if the | |
| 1498 PRECISION argument is zero. */ | |
| 1499 Lisp_Object | |
| 1500 make_bigfloat (double float_value, unsigned long precision) | |
| 1501 { | |
| 1502 Lisp_Bigfloat *f; | |
| 1503 | |
| 3017 | 1504 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (bigfloat, Lisp_Bigfloat, f, &lrecord_bigfloat); |
| 1983 | 1505 if (precision == 0UL) |
| 1506 bigfloat_init (bigfloat_data (f)); | |
| 1507 else | |
| 1508 bigfloat_init_prec (bigfloat_data (f), precision); | |
| 1509 bigfloat_set_double (bigfloat_data (f), float_value); | |
| 1510 return wrap_bigfloat (f); | |
| 1511 } | |
| 1512 | |
| 1513 /* This function creates a bigfloat with the precision of its argument */ | |
| 1514 Lisp_Object | |
| 1515 make_bigfloat_bf (bigfloat float_value) | |
| 1516 { | |
| 1517 Lisp_Bigfloat *f; | |
| 1518 | |
| 3017 | 1519 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (bigfloat, Lisp_Bigfloat, f, &lrecord_bigfloat); |
| 1983 | 1520 bigfloat_init_prec (bigfloat_data (f), bigfloat_get_prec (float_value)); |
| 1521 bigfloat_set (bigfloat_data (f), float_value); | |
| 1522 return wrap_bigfloat (f); | |
| 1523 } | |
| 1524 #endif /* HAVE_BIGFLOAT */ | |
| 1525 | |
| 1526 /************************************************************************/ | |
| 428 | 1527 /* Vector allocation */ |
| 1528 /************************************************************************/ | |
| 1529 | |
| 1530 static Lisp_Object | |
| 1531 mark_vector (Lisp_Object obj) | |
| 1532 { | |
| 1533 Lisp_Vector *ptr = XVECTOR (obj); | |
| 1534 int len = vector_length (ptr); | |
| 1535 int i; | |
| 1536 | |
| 1537 for (i = 0; i < len - 1; i++) | |
| 1538 mark_object (ptr->contents[i]); | |
| 1539 return (len > 0) ? ptr->contents[len - 1] : Qnil; | |
| 1540 } | |
| 1541 | |
| 665 | 1542 static Bytecount |
| 442 | 1543 size_vector (const void *lheader) |
| 428 | 1544 { |
| 456 | 1545 return FLEXIBLE_ARRAY_STRUCT_SIZEOF (Lisp_Vector, Lisp_Object, contents, |
| 442 | 1546 ((Lisp_Vector *) lheader)->size); |
| 428 | 1547 } |
| 1548 | |
| 1549 static int | |
|
4906
6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
Ben Wing <ben@xemacs.org>
parents:
4880
diff
changeset
|
1550 vector_equal (Lisp_Object obj1, Lisp_Object obj2, int depth, int foldcase) |
| 428 | 1551 { |
| 1552 int len = XVECTOR_LENGTH (obj1); | |
| 1553 if (len != XVECTOR_LENGTH (obj2)) | |
| 1554 return 0; | |
| 1555 | |
| 1556 { | |
| 1557 Lisp_Object *ptr1 = XVECTOR_DATA (obj1); | |
| 1558 Lisp_Object *ptr2 = XVECTOR_DATA (obj2); | |
| 1559 while (len--) | |
|
4906
6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
Ben Wing <ben@xemacs.org>
parents:
4880
diff
changeset
|
1560 if (!internal_equal_0 (*ptr1++, *ptr2++, depth + 1, foldcase)) |
| 428 | 1561 return 0; |
| 1562 } | |
| 1563 return 1; | |
| 1564 } | |
| 1565 | |
| 665 | 1566 static Hashcode |
| 442 | 1567 vector_hash (Lisp_Object obj, int depth) |
| 1568 { | |
| 1569 return HASH2 (XVECTOR_LENGTH (obj), | |
| 1570 internal_array_hash (XVECTOR_DATA (obj), | |
| 1571 XVECTOR_LENGTH (obj), | |
| 1572 depth + 1)); | |
| 1573 } | |
| 1574 | |
| 1204 | 1575 static const struct memory_description vector_description[] = { |
| 440 | 1576 { XD_LONG, offsetof (Lisp_Vector, size) }, |
| 1577 { XD_LISP_OBJECT_ARRAY, offsetof (Lisp_Vector, contents), XD_INDIRECT(0, 0) }, | |
| 428 | 1578 { XD_END } |
| 1579 }; | |
| 1580 | |
| 1204 | 1581 DEFINE_LRECORD_SEQUENCE_IMPLEMENTATION ("vector", vector, |
| 1582 1, /*dumpable-flag*/ | |
| 1583 mark_vector, print_vector, 0, | |
| 1584 vector_equal, | |
| 1585 vector_hash, | |
| 1586 vector_description, | |
| 1587 size_vector, Lisp_Vector); | |
| 428 | 1588 /* #### should allocate `small' vectors from a frob-block */ |
| 1589 static Lisp_Vector * | |
| 665 | 1590 make_vector_internal (Elemcount sizei) |
| 428 | 1591 { |
| 1204 | 1592 /* no `next' field; we use lcrecords */ |
| 665 | 1593 Bytecount sizem = FLEXIBLE_ARRAY_STRUCT_SIZEOF (Lisp_Vector, Lisp_Object, |
| 1204 | 1594 contents, sizei); |
| 1595 Lisp_Vector *p = | |
| 3017 | 1596 (Lisp_Vector *) BASIC_ALLOC_LCRECORD (sizem, &lrecord_vector); |
| 428 | 1597 |
| 1598 p->size = sizei; | |
| 1599 return p; | |
| 1600 } | |
| 1601 | |
| 1602 Lisp_Object | |
| 665 | 1603 make_vector (Elemcount length, Lisp_Object object) |
| 428 | 1604 { |
| 1605 Lisp_Vector *vecp = make_vector_internal (length); | |
| 1606 Lisp_Object *p = vector_data (vecp); | |
| 1607 | |
| 1608 while (length--) | |
| 444 | 1609 *p++ = object; |
| 428 | 1610 |
| 793 | 1611 return wrap_vector (vecp); |
| 428 | 1612 } |
| 1613 | |
| 1614 DEFUN ("make-vector", Fmake_vector, 2, 2, 0, /* | |
| 444 | 1615 Return a new vector of length LENGTH, with each element being OBJECT. |
| 428 | 1616 See also the function `vector'. |
| 1617 */ | |
| 444 | 1618 (length, object)) |
| 428 | 1619 { |
| 1620 CONCHECK_NATNUM (length); | |
| 444 | 1621 return make_vector (XINT (length), object); |
| 428 | 1622 } |
| 1623 | |
| 1624 DEFUN ("vector", Fvector, 0, MANY, 0, /* | |
|
4693
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
1625 Return a newly created vector with specified ARGS as elements. |
| 428 | 1626 Any number of arguments, even zero arguments, are allowed. |
|
4693
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
1627 |
|
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
1628 arguments: (&rest ARGS) |
| 428 | 1629 */ |
| 1630 (int nargs, Lisp_Object *args)) | |
| 1631 { | |
| 1632 Lisp_Vector *vecp = make_vector_internal (nargs); | |
| 1633 Lisp_Object *p = vector_data (vecp); | |
| 1634 | |
| 1635 while (nargs--) | |
| 1636 *p++ = *args++; | |
| 1637 | |
| 793 | 1638 return wrap_vector (vecp); |
| 428 | 1639 } |
| 1640 | |
| 1641 Lisp_Object | |
| 1642 vector1 (Lisp_Object obj0) | |
| 1643 { | |
| 1644 return Fvector (1, &obj0); | |
| 1645 } | |
| 1646 | |
| 1647 Lisp_Object | |
| 1648 vector2 (Lisp_Object obj0, Lisp_Object obj1) | |
| 1649 { | |
| 1650 Lisp_Object args[2]; | |
| 1651 args[0] = obj0; | |
| 1652 args[1] = obj1; | |
| 1653 return Fvector (2, args); | |
| 1654 } | |
| 1655 | |
| 1656 Lisp_Object | |
| 1657 vector3 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2) | |
| 1658 { | |
| 1659 Lisp_Object args[3]; | |
| 1660 args[0] = obj0; | |
| 1661 args[1] = obj1; | |
| 1662 args[2] = obj2; | |
| 1663 return Fvector (3, args); | |
| 1664 } | |
| 1665 | |
| 1666 #if 0 /* currently unused */ | |
| 1667 | |
| 1668 Lisp_Object | |
| 1669 vector4 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, | |
| 1670 Lisp_Object obj3) | |
| 1671 { | |
| 1672 Lisp_Object args[4]; | |
| 1673 args[0] = obj0; | |
| 1674 args[1] = obj1; | |
| 1675 args[2] = obj2; | |
| 1676 args[3] = obj3; | |
| 1677 return Fvector (4, args); | |
| 1678 } | |
| 1679 | |
| 1680 Lisp_Object | |
| 1681 vector5 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, | |
| 1682 Lisp_Object obj3, Lisp_Object obj4) | |
| 1683 { | |
| 1684 Lisp_Object args[5]; | |
| 1685 args[0] = obj0; | |
| 1686 args[1] = obj1; | |
| 1687 args[2] = obj2; | |
| 1688 args[3] = obj3; | |
| 1689 args[4] = obj4; | |
| 1690 return Fvector (5, args); | |
| 1691 } | |
| 1692 | |
| 1693 Lisp_Object | |
| 1694 vector6 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, | |
| 1695 Lisp_Object obj3, Lisp_Object obj4, Lisp_Object obj5) | |
| 1696 { | |
| 1697 Lisp_Object args[6]; | |
| 1698 args[0] = obj0; | |
| 1699 args[1] = obj1; | |
| 1700 args[2] = obj2; | |
| 1701 args[3] = obj3; | |
| 1702 args[4] = obj4; | |
| 1703 args[5] = obj5; | |
| 1704 return Fvector (6, args); | |
| 1705 } | |
| 1706 | |
| 1707 Lisp_Object | |
| 1708 vector7 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, | |
| 1709 Lisp_Object obj3, Lisp_Object obj4, Lisp_Object obj5, | |
| 1710 Lisp_Object obj6) | |
| 1711 { | |
| 1712 Lisp_Object args[7]; | |
| 1713 args[0] = obj0; | |
| 1714 args[1] = obj1; | |
| 1715 args[2] = obj2; | |
| 1716 args[3] = obj3; | |
| 1717 args[4] = obj4; | |
| 1718 args[5] = obj5; | |
| 1719 args[6] = obj6; | |
| 1720 return Fvector (7, args); | |
| 1721 } | |
| 1722 | |
| 1723 Lisp_Object | |
| 1724 vector8 (Lisp_Object obj0, Lisp_Object obj1, Lisp_Object obj2, | |
| 1725 Lisp_Object obj3, Lisp_Object obj4, Lisp_Object obj5, | |
| 1726 Lisp_Object obj6, Lisp_Object obj7) | |
| 1727 { | |
| 1728 Lisp_Object args[8]; | |
| 1729 args[0] = obj0; | |
| 1730 args[1] = obj1; | |
| 1731 args[2] = obj2; | |
| 1732 args[3] = obj3; | |
| 1733 args[4] = obj4; | |
| 1734 args[5] = obj5; | |
| 1735 args[6] = obj6; | |
| 1736 args[7] = obj7; | |
| 1737 return Fvector (8, args); | |
| 1738 } | |
| 1739 #endif /* unused */ | |
| 1740 | |
| 1741 /************************************************************************/ | |
| 1742 /* Bit Vector allocation */ | |
| 1743 /************************************************************************/ | |
| 1744 | |
| 1745 /* #### should allocate `small' bit vectors from a frob-block */ | |
| 440 | 1746 static Lisp_Bit_Vector * |
| 665 | 1747 make_bit_vector_internal (Elemcount sizei) |
| 428 | 1748 { |
| 1204 | 1749 /* no `next' field; we use lcrecords */ |
| 665 | 1750 Elemcount num_longs = BIT_VECTOR_LONG_STORAGE (sizei); |
| 1751 Bytecount sizem = FLEXIBLE_ARRAY_STRUCT_SIZEOF (Lisp_Bit_Vector, | |
| 1204 | 1752 unsigned long, |
| 1753 bits, num_longs); | |
| 1754 Lisp_Bit_Vector *p = (Lisp_Bit_Vector *) | |
| 3017 | 1755 BASIC_ALLOC_LCRECORD (sizem, &lrecord_bit_vector); |
| 428 | 1756 |
| 1757 bit_vector_length (p) = sizei; | |
| 1758 return p; | |
| 1759 } | |
| 1760 | |
| 1761 Lisp_Object | |
| 665 | 1762 make_bit_vector (Elemcount length, Lisp_Object bit) |
| 428 | 1763 { |
| 440 | 1764 Lisp_Bit_Vector *p = make_bit_vector_internal (length); |
| 665 | 1765 Elemcount num_longs = BIT_VECTOR_LONG_STORAGE (length); |
| 428 | 1766 |
| 444 | 1767 CHECK_BIT (bit); |
| 1768 | |
| 1769 if (ZEROP (bit)) | |
| 428 | 1770 memset (p->bits, 0, num_longs * sizeof (long)); |
| 1771 else | |
| 1772 { | |
| 665 | 1773 Elemcount bits_in_last = length & (LONGBITS_POWER_OF_2 - 1); |
| 428 | 1774 memset (p->bits, ~0, num_longs * sizeof (long)); |
| 1775 /* But we have to make sure that the unused bits in the | |
| 1776 last long are 0, so that equal/hash is easy. */ | |
| 1777 if (bits_in_last) | |
| 1778 p->bits[num_longs - 1] &= (1 << bits_in_last) - 1; | |
| 1779 } | |
| 1780 | |
| 793 | 1781 return wrap_bit_vector (p); |
| 428 | 1782 } |
| 1783 | |
| 1784 Lisp_Object | |
| 665 | 1785 make_bit_vector_from_byte_vector (unsigned char *bytevec, Elemcount length) |
| 428 | 1786 { |
| 665 | 1787 Elemcount i; |
| 428 | 1788 Lisp_Bit_Vector *p = make_bit_vector_internal (length); |
| 1789 | |
| 1790 for (i = 0; i < length; i++) | |
| 1791 set_bit_vector_bit (p, i, bytevec[i]); | |
| 1792 | |
| 793 | 1793 return wrap_bit_vector (p); |
| 428 | 1794 } |
| 1795 | |
| 1796 DEFUN ("make-bit-vector", Fmake_bit_vector, 2, 2, 0, /* | |
| 444 | 1797 Return a new bit vector of length LENGTH. with each bit set to BIT. |
| 1798 BIT must be one of the integers 0 or 1. See also the function `bit-vector'. | |
| 428 | 1799 */ |
| 444 | 1800 (length, bit)) |
| 428 | 1801 { |
| 1802 CONCHECK_NATNUM (length); | |
| 1803 | |
| 444 | 1804 return make_bit_vector (XINT (length), bit); |
| 428 | 1805 } |
| 1806 | |
| 1807 DEFUN ("bit-vector", Fbit_vector, 0, MANY, 0, /* | |
|
4693
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
1808 Return a newly created bit vector with specified ARGS as elements. |
| 428 | 1809 Any number of arguments, even zero arguments, are allowed. |
| 444 | 1810 Each argument must be one of the integers 0 or 1. |
|
4693
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
1811 |
|
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
1812 arguments: (&rest ARGS) |
| 428 | 1813 */ |
| 1814 (int nargs, Lisp_Object *args)) | |
| 1815 { | |
| 1816 int i; | |
| 1817 Lisp_Bit_Vector *p = make_bit_vector_internal (nargs); | |
| 1818 | |
| 1819 for (i = 0; i < nargs; i++) | |
| 1820 { | |
| 1821 CHECK_BIT (args[i]); | |
| 1822 set_bit_vector_bit (p, i, !ZEROP (args[i])); | |
| 1823 } | |
| 1824 | |
| 793 | 1825 return wrap_bit_vector (p); |
| 428 | 1826 } |
| 1827 | |
| 1828 | |
| 1829 /************************************************************************/ | |
| 1830 /* Compiled-function allocation */ | |
| 1831 /************************************************************************/ | |
| 1832 | |
| 1833 DECLARE_FIXED_TYPE_ALLOC (compiled_function, Lisp_Compiled_Function); | |
| 1834 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_compiled_function 1000 | |
| 1835 | |
| 1836 static Lisp_Object | |
| 1837 make_compiled_function (void) | |
| 1838 { | |
| 1839 Lisp_Compiled_Function *f; | |
| 1840 | |
| 3017 | 1841 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (compiled_function, Lisp_Compiled_Function, |
| 1842 f, &lrecord_compiled_function); | |
| 428 | 1843 |
| 1844 f->stack_depth = 0; | |
| 1845 f->specpdl_depth = 0; | |
| 1846 f->flags.documentationp = 0; | |
| 1847 f->flags.interactivep = 0; | |
| 1848 f->flags.domainp = 0; /* I18N3 */ | |
| 1849 f->instructions = Qzero; | |
| 1850 f->constants = Qzero; | |
| 1851 f->arglist = Qnil; | |
| 3092 | 1852 #ifdef NEW_GC |
| 1853 f->arguments = Qnil; | |
| 1854 #else /* not NEW_GC */ | |
| 1739 | 1855 f->args = NULL; |
| 3092 | 1856 #endif /* not NEW_GC */ |
| 1739 | 1857 f->max_args = f->min_args = f->args_in_array = 0; |
| 428 | 1858 f->doc_and_interactive = Qnil; |
| 1859 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK | |
| 1860 f->annotated = Qnil; | |
| 1861 #endif | |
| 793 | 1862 return wrap_compiled_function (f); |
| 428 | 1863 } |
| 1864 | |
| 1865 DEFUN ("make-byte-code", Fmake_byte_code, 4, MANY, 0, /* | |
| 1866 Return a new compiled-function object. | |
| 1867 Note that, unlike all other emacs-lisp functions, calling this with five | |
| 1868 arguments is NOT the same as calling it with six arguments, the last of | |
| 1869 which is nil. If the INTERACTIVE arg is specified as nil, then that means | |
| 1870 that this function was defined with `(interactive)'. If the arg is not | |
| 1871 specified, then that means the function is not interactive. | |
| 1872 This is terrible behavior which is retained for compatibility with old | |
| 1873 `.elc' files which expect these semantics. | |
|
4693
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
1874 |
|
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
1875 arguments: (ARGLIST INSTRUCTIONS CONSTANTS STACK-DEPTH &optional DOC-STRING INTERACTIVE) |
| 428 | 1876 */ |
| 1877 (int nargs, Lisp_Object *args)) | |
| 1878 { | |
| 1879 /* In a non-insane world this function would have this arglist... | |
| 1880 (arglist instructions constants stack_depth &optional doc_string interactive) | |
| 1881 */ | |
| 1882 Lisp_Object fun = make_compiled_function (); | |
| 1883 Lisp_Compiled_Function *f = XCOMPILED_FUNCTION (fun); | |
| 1884 | |
| 1885 Lisp_Object arglist = args[0]; | |
| 1886 Lisp_Object instructions = args[1]; | |
| 1887 Lisp_Object constants = args[2]; | |
| 1888 Lisp_Object stack_depth = args[3]; | |
| 1889 Lisp_Object doc_string = (nargs > 4) ? args[4] : Qnil; | |
| 1890 Lisp_Object interactive = (nargs > 5) ? args[5] : Qunbound; | |
| 1891 | |
| 1892 if (nargs < 4 || nargs > 6) | |
| 1893 return Fsignal (Qwrong_number_of_arguments, | |
| 1894 list2 (intern ("make-byte-code"), make_int (nargs))); | |
| 1895 | |
| 1896 /* Check for valid formal parameter list now, to allow us to use | |
| 1897 SPECBIND_FAST_UNSAFE() later in funcall_compiled_function(). */ | |
| 1898 { | |
| 814 | 1899 EXTERNAL_LIST_LOOP_2 (symbol, arglist) |
| 428 | 1900 { |
| 1901 CHECK_SYMBOL (symbol); | |
| 1902 if (EQ (symbol, Qt) || | |
| 1903 EQ (symbol, Qnil) || | |
| 1904 SYMBOL_IS_KEYWORD (symbol)) | |
| 563 | 1905 invalid_constant_2 |
| 428 | 1906 ("Invalid constant symbol in formal parameter list", |
| 1907 symbol, arglist); | |
| 1908 } | |
| 1909 } | |
| 1910 f->arglist = arglist; | |
| 1911 | |
| 1912 /* `instructions' is a string or a cons (string . int) for a | |
| 1913 lazy-loaded function. */ | |
| 1914 if (CONSP (instructions)) | |
| 1915 { | |
| 1916 CHECK_STRING (XCAR (instructions)); | |
| 1917 CHECK_INT (XCDR (instructions)); | |
| 1918 } | |
| 1919 else | |
| 1920 { | |
| 1921 CHECK_STRING (instructions); | |
| 1922 } | |
| 1923 f->instructions = instructions; | |
| 1924 | |
| 1925 if (!NILP (constants)) | |
| 1926 CHECK_VECTOR (constants); | |
| 1927 f->constants = constants; | |
| 1928 | |
| 1929 CHECK_NATNUM (stack_depth); | |
| 442 | 1930 f->stack_depth = (unsigned short) XINT (stack_depth); |
| 428 | 1931 |
| 1932 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK | |
|
4921
17362f371cc2
add more byte-code assertions and better failure output
Ben Wing <ben@xemacs.org>
parents:
4906
diff
changeset
|
1933 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK_OLD_WAY |
| 428 | 1934 if (!NILP (Vcurrent_compiled_function_annotation)) |
|
4921
17362f371cc2
add more byte-code assertions and better failure output
Ben Wing <ben@xemacs.org>
parents:
4906
diff
changeset
|
1935 f->annotated = Vcurrent_compiled_function_annotation; |
|
17362f371cc2
add more byte-code assertions and better failure output
Ben Wing <ben@xemacs.org>
parents:
4906
diff
changeset
|
1936 else |
|
17362f371cc2
add more byte-code assertions and better failure output
Ben Wing <ben@xemacs.org>
parents:
4906
diff
changeset
|
1937 #endif /* COMPILED_FUNCTION_ANNOTATION_HACK_OLD_WAY */ |
|
17362f371cc2
add more byte-code assertions and better failure output
Ben Wing <ben@xemacs.org>
parents:
4906
diff
changeset
|
1938 f->annotated = Vload_file_name_internal; |
| 428 | 1939 #endif /* COMPILED_FUNCTION_ANNOTATION_HACK */ |
| 1940 | |
| 1941 /* doc_string may be nil, string, int, or a cons (string . int). | |
| 1942 interactive may be list or string (or unbound). */ | |
| 1943 f->doc_and_interactive = Qunbound; | |
| 1944 #ifdef I18N3 | |
| 1945 if ((f->flags.domainp = !NILP (Vfile_domain)) != 0) | |
| 1946 f->doc_and_interactive = Vfile_domain; | |
| 1947 #endif | |
| 1948 if ((f->flags.interactivep = !UNBOUNDP (interactive)) != 0) | |
| 1949 { | |
| 1950 f->doc_and_interactive | |
| 1951 = (UNBOUNDP (f->doc_and_interactive) ? interactive : | |
| 1952 Fcons (interactive, f->doc_and_interactive)); | |
| 1953 } | |
| 1954 if ((f->flags.documentationp = !NILP (doc_string)) != 0) | |
| 1955 { | |
| 1956 f->doc_and_interactive | |
| 1957 = (UNBOUNDP (f->doc_and_interactive) ? doc_string : | |
| 1958 Fcons (doc_string, f->doc_and_interactive)); | |
| 1959 } | |
| 1960 if (UNBOUNDP (f->doc_and_interactive)) | |
| 1961 f->doc_and_interactive = Qnil; | |
| 1962 | |
| 1963 return fun; | |
| 1964 } | |
| 1965 | |
| 1966 | |
| 1967 /************************************************************************/ | |
| 1968 /* Symbol allocation */ | |
| 1969 /************************************************************************/ | |
| 1970 | |
| 440 | 1971 DECLARE_FIXED_TYPE_ALLOC (symbol, Lisp_Symbol); |
| 428 | 1972 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_symbol 1000 |
| 1973 | |
| 1974 DEFUN ("make-symbol", Fmake_symbol, 1, 1, 0, /* | |
| 1975 Return a newly allocated uninterned symbol whose name is NAME. | |
| 1976 Its value and function definition are void, and its property list is nil. | |
| 1977 */ | |
| 1978 (name)) | |
| 1979 { | |
| 440 | 1980 Lisp_Symbol *p; |
| 428 | 1981 |
| 1982 CHECK_STRING (name); | |
| 1983 | |
| 3017 | 1984 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (symbol, Lisp_Symbol, p, &lrecord_symbol); |
| 793 | 1985 p->name = name; |
| 428 | 1986 p->plist = Qnil; |
| 1987 p->value = Qunbound; | |
| 1988 p->function = Qunbound; | |
| 1989 symbol_next (p) = 0; | |
| 793 | 1990 return wrap_symbol (p); |
| 428 | 1991 } |
| 1992 | |
| 1993 | |
| 1994 /************************************************************************/ | |
| 1995 /* Extent allocation */ | |
| 1996 /************************************************************************/ | |
| 1997 | |
| 1998 DECLARE_FIXED_TYPE_ALLOC (extent, struct extent); | |
| 1999 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_extent 1000 | |
| 2000 | |
| 2001 struct extent * | |
| 2002 allocate_extent (void) | |
| 2003 { | |
| 2004 struct extent *e; | |
| 2005 | |
| 3017 | 2006 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (extent, struct extent, e, &lrecord_extent); |
| 428 | 2007 extent_object (e) = Qnil; |
| 2008 set_extent_start (e, -1); | |
| 2009 set_extent_end (e, -1); | |
| 2010 e->plist = Qnil; | |
| 2011 | |
| 2012 xzero (e->flags); | |
| 2013 | |
| 2014 extent_face (e) = Qnil; | |
| 2015 e->flags.end_open = 1; /* default is for endpoints to behave like markers */ | |
| 2016 e->flags.detachable = 1; | |
| 2017 | |
| 2018 return e; | |
| 2019 } | |
| 2020 | |
| 2021 | |
| 2022 /************************************************************************/ | |
| 2023 /* Event allocation */ | |
| 2024 /************************************************************************/ | |
| 2025 | |
| 440 | 2026 DECLARE_FIXED_TYPE_ALLOC (event, Lisp_Event); |
| 428 | 2027 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_event 1000 |
| 2028 | |
| 2029 Lisp_Object | |
| 2030 allocate_event (void) | |
| 2031 { | |
| 440 | 2032 Lisp_Event *e; |
| 2033 | |
| 3017 | 2034 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (event, Lisp_Event, e, &lrecord_event); |
| 428 | 2035 |
| 793 | 2036 return wrap_event (e); |
| 428 | 2037 } |
| 2038 | |
| 1204 | 2039 #ifdef EVENT_DATA_AS_OBJECTS |
| 934 | 2040 DECLARE_FIXED_TYPE_ALLOC (key_data, Lisp_Key_Data); |
| 2041 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_key_data 1000 | |
| 2042 | |
| 2043 Lisp_Object | |
| 1204 | 2044 make_key_data (void) |
| 934 | 2045 { |
| 2046 Lisp_Key_Data *d; | |
| 2047 | |
| 3017 | 2048 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (key_data, Lisp_Key_Data, d, |
| 2049 &lrecord_key_data); | |
| 2050 zero_lrecord (d); | |
| 1204 | 2051 d->keysym = Qnil; |
| 2052 | |
| 2053 return wrap_key_data (d); | |
| 934 | 2054 } |
| 2055 | |
| 2056 DECLARE_FIXED_TYPE_ALLOC (button_data, Lisp_Button_Data); | |
| 2057 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_button_data 1000 | |
| 2058 | |
| 2059 Lisp_Object | |
| 1204 | 2060 make_button_data (void) |
| 934 | 2061 { |
| 2062 Lisp_Button_Data *d; | |
| 2063 | |
| 3017 | 2064 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (button_data, Lisp_Button_Data, d, &lrecord_button_data); |
| 2065 zero_lrecord (d); | |
| 1204 | 2066 return wrap_button_data (d); |
| 934 | 2067 } |
| 2068 | |
| 2069 DECLARE_FIXED_TYPE_ALLOC (motion_data, Lisp_Motion_Data); | |
| 2070 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_motion_data 1000 | |
| 2071 | |
| 2072 Lisp_Object | |
| 1204 | 2073 make_motion_data (void) |
| 934 | 2074 { |
| 2075 Lisp_Motion_Data *d; | |
| 2076 | |
| 3017 | 2077 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (motion_data, Lisp_Motion_Data, d, &lrecord_motion_data); |
| 2078 zero_lrecord (d); | |
| 934 | 2079 |
| 1204 | 2080 return wrap_motion_data (d); |
| 934 | 2081 } |
| 2082 | |
| 2083 DECLARE_FIXED_TYPE_ALLOC (process_data, Lisp_Process_Data); | |
| 2084 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_process_data 1000 | |
| 2085 | |
| 2086 Lisp_Object | |
| 1204 | 2087 make_process_data (void) |
| 934 | 2088 { |
| 2089 Lisp_Process_Data *d; | |
| 2090 | |
| 3017 | 2091 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (process_data, Lisp_Process_Data, d, &lrecord_process_data); |
| 2092 zero_lrecord (d); | |
| 1204 | 2093 d->process = Qnil; |
| 2094 | |
| 2095 return wrap_process_data (d); | |
| 934 | 2096 } |
| 2097 | |
| 2098 DECLARE_FIXED_TYPE_ALLOC (timeout_data, Lisp_Timeout_Data); | |
| 2099 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_timeout_data 1000 | |
| 2100 | |
| 2101 Lisp_Object | |
| 1204 | 2102 make_timeout_data (void) |
| 934 | 2103 { |
| 2104 Lisp_Timeout_Data *d; | |
| 2105 | |
| 3017 | 2106 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (timeout_data, Lisp_Timeout_Data, d, &lrecord_timeout_data); |
| 2107 zero_lrecord (d); | |
| 1204 | 2108 d->function = Qnil; |
| 2109 d->object = Qnil; | |
| 2110 | |
| 2111 return wrap_timeout_data (d); | |
| 934 | 2112 } |
| 2113 | |
| 2114 DECLARE_FIXED_TYPE_ALLOC (magic_data, Lisp_Magic_Data); | |
| 2115 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_magic_data 1000 | |
| 2116 | |
| 2117 Lisp_Object | |
| 1204 | 2118 make_magic_data (void) |
| 934 | 2119 { |
| 2120 Lisp_Magic_Data *d; | |
| 2121 | |
| 3017 | 2122 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (magic_data, Lisp_Magic_Data, d, &lrecord_magic_data); |
| 2123 zero_lrecord (d); | |
| 934 | 2124 |
| 1204 | 2125 return wrap_magic_data (d); |
| 934 | 2126 } |
| 2127 | |
| 2128 DECLARE_FIXED_TYPE_ALLOC (magic_eval_data, Lisp_Magic_Eval_Data); | |
| 2129 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_magic_eval_data 1000 | |
| 2130 | |
| 2131 Lisp_Object | |
| 1204 | 2132 make_magic_eval_data (void) |
| 934 | 2133 { |
| 2134 Lisp_Magic_Eval_Data *d; | |
| 2135 | |
| 3017 | 2136 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (magic_eval_data, Lisp_Magic_Eval_Data, d, &lrecord_magic_eval_data); |
| 2137 zero_lrecord (d); | |
| 1204 | 2138 d->object = Qnil; |
| 2139 | |
| 2140 return wrap_magic_eval_data (d); | |
| 934 | 2141 } |
| 2142 | |
| 2143 DECLARE_FIXED_TYPE_ALLOC (eval_data, Lisp_Eval_Data); | |
| 2144 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_eval_data 1000 | |
| 2145 | |
| 2146 Lisp_Object | |
| 1204 | 2147 make_eval_data (void) |
| 934 | 2148 { |
| 2149 Lisp_Eval_Data *d; | |
| 2150 | |
| 3017 | 2151 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (eval_data, Lisp_Eval_Data, d, &lrecord_eval_data); |
| 2152 zero_lrecord (d); | |
| 1204 | 2153 d->function = Qnil; |
| 2154 d->object = Qnil; | |
| 2155 | |
| 2156 return wrap_eval_data (d); | |
| 934 | 2157 } |
| 2158 | |
| 2159 DECLARE_FIXED_TYPE_ALLOC (misc_user_data, Lisp_Misc_User_Data); | |
| 2160 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_misc_user_data 1000 | |
| 2161 | |
| 2162 Lisp_Object | |
| 1204 | 2163 make_misc_user_data (void) |
| 934 | 2164 { |
| 2165 Lisp_Misc_User_Data *d; | |
| 2166 | |
| 3017 | 2167 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (misc_user_data, Lisp_Misc_User_Data, d, &lrecord_misc_user_data); |
| 2168 zero_lrecord (d); | |
| 1204 | 2169 d->function = Qnil; |
| 2170 d->object = Qnil; | |
| 2171 | |
| 2172 return wrap_misc_user_data (d); | |
| 934 | 2173 } |
| 1204 | 2174 |
| 2175 #endif /* EVENT_DATA_AS_OBJECTS */ | |
| 428 | 2176 |
| 2177 /************************************************************************/ | |
| 2178 /* Marker allocation */ | |
| 2179 /************************************************************************/ | |
| 2180 | |
| 440 | 2181 DECLARE_FIXED_TYPE_ALLOC (marker, Lisp_Marker); |
| 428 | 2182 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_marker 1000 |
| 2183 | |
| 2184 DEFUN ("make-marker", Fmake_marker, 0, 0, 0, /* | |
| 2185 Return a new marker which does not point at any place. | |
| 2186 */ | |
| 2187 ()) | |
| 2188 { | |
| 440 | 2189 Lisp_Marker *p; |
| 2190 | |
| 3017 | 2191 ALLOCATE_FIXED_TYPE_AND_SET_IMPL (marker, Lisp_Marker, p, &lrecord_marker); |
| 428 | 2192 p->buffer = 0; |
| 665 | 2193 p->membpos = 0; |
| 428 | 2194 marker_next (p) = 0; |
| 2195 marker_prev (p) = 0; | |
| 2196 p->insertion_type = 0; | |
| 793 | 2197 return wrap_marker (p); |
| 428 | 2198 } |
| 2199 | |
| 2200 Lisp_Object | |
| 2201 noseeum_make_marker (void) | |
| 2202 { | |
| 440 | 2203 Lisp_Marker *p; |
| 2204 | |
| 3017 | 2205 NOSEEUM_ALLOCATE_FIXED_TYPE_AND_SET_IMPL (marker, Lisp_Marker, p, |
| 2206 &lrecord_marker); | |
| 428 | 2207 p->buffer = 0; |
| 665 | 2208 p->membpos = 0; |
| 428 | 2209 marker_next (p) = 0; |
| 2210 marker_prev (p) = 0; | |
| 2211 p->insertion_type = 0; | |
| 793 | 2212 return wrap_marker (p); |
| 428 | 2213 } |
| 2214 | |
| 2215 | |
| 2216 /************************************************************************/ | |
| 2217 /* String allocation */ | |
| 2218 /************************************************************************/ | |
| 2219 | |
| 2220 /* The data for "short" strings generally resides inside of structs of type | |
| 2221 string_chars_block. The Lisp_String structure is allocated just like any | |
| 1204 | 2222 other basic lrecord, and these are freelisted when they get garbage |
| 2223 collected. The data for short strings get compacted, but the data for | |
| 2224 large strings do not. | |
| 428 | 2225 |
| 2226 Previously Lisp_String structures were relocated, but this caused a lot | |
| 2227 of bus-errors because the C code didn't include enough GCPRO's for | |
| 2228 strings (since EVERY REFERENCE to a short string needed to be GCPRO'd so | |
| 2229 that the reference would get relocated). | |
| 2230 | |
| 2231 This new method makes things somewhat bigger, but it is MUCH safer. */ | |
| 2232 | |
| 438 | 2233 DECLARE_FIXED_TYPE_ALLOC (string, Lisp_String); |
| 428 | 2234 /* strings are used and freed quite often */ |
| 2235 /* #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_string 10000 */ | |
| 2236 #define MINIMUM_ALLOWED_FIXED_TYPE_CELLS_string 1000 | |
| 2237 | |
| 2238 static Lisp_Object | |
| 2239 mark_string (Lisp_Object obj) | |
| 2240 { | |
| 793 | 2241 if (CONSP (XSTRING_PLIST (obj)) && EXTENT_INFOP (XCAR (XSTRING_PLIST (obj)))) |
| 2242 flush_cached_extent_info (XCAR (XSTRING_PLIST (obj))); | |
| 2243 return XSTRING_PLIST (obj); | |
| 428 | 2244 } |
| 2245 | |
| 2246 static int | |
|
4906
6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
Ben Wing <ben@xemacs.org>
parents:
4880
diff
changeset
|
2247 string_equal (Lisp_Object obj1, Lisp_Object obj2, int UNUSED (depth), |
|
6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
Ben Wing <ben@xemacs.org>
parents:
4880
diff
changeset
|
2248 int foldcase) |
| 428 | 2249 { |
| 2250 Bytecount len; | |
|
4906
6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
Ben Wing <ben@xemacs.org>
parents:
4880
diff
changeset
|
2251 if (foldcase) |
|
6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
Ben Wing <ben@xemacs.org>
parents:
4880
diff
changeset
|
2252 return !lisp_strcasecmp_i18n (obj1, obj2); |
|
6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
Ben Wing <ben@xemacs.org>
parents:
4880
diff
changeset
|
2253 else |
|
6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
Ben Wing <ben@xemacs.org>
parents:
4880
diff
changeset
|
2254 return (((len = XSTRING_LENGTH (obj1)) == XSTRING_LENGTH (obj2)) && |
|
6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
Ben Wing <ben@xemacs.org>
parents:
4880
diff
changeset
|
2255 !memcmp (XSTRING_DATA (obj1), XSTRING_DATA (obj2), len)); |
| 428 | 2256 } |
| 2257 | |
| 1204 | 2258 static const struct memory_description string_description[] = { |
| 3092 | 2259 #ifdef NEW_GC |
| 2260 { XD_LISP_OBJECT, offsetof (Lisp_String, data_object) }, | |
| 2261 #else /* not NEW_GC */ | |
| 793 | 2262 { XD_BYTECOUNT, offsetof (Lisp_String, size_) }, |
| 2263 { XD_OPAQUE_DATA_PTR, offsetof (Lisp_String, data_), XD_INDIRECT(0, 1) }, | |
| 3092 | 2264 #endif /* not NEW_GC */ |
| 440 | 2265 { XD_LISP_OBJECT, offsetof (Lisp_String, plist) }, |
| 428 | 2266 { XD_END } |
| 2267 }; | |
| 2268 | |
| 442 | 2269 /* We store the string's extent info as the first element of the string's |
| 2270 property list; and the string's MODIFF as the first or second element | |
| 2271 of the string's property list (depending on whether the extent info | |
| 2272 is present), but only if the string has been modified. This is ugly | |
| 2273 but it reduces the memory allocated for the string in the vast | |
| 2274 majority of cases, where the string is never modified and has no | |
| 2275 extent info. | |
| 2276 | |
| 2277 #### This means you can't use an int as a key in a string's plist. */ | |
| 2278 | |
| 2279 static Lisp_Object * | |
| 2280 string_plist_ptr (Lisp_Object string) | |
| 2281 { | |
| 793 | 2282 Lisp_Object *ptr = &XSTRING_PLIST (string); |
| 442 | 2283 |
| 2284 if (CONSP (*ptr) && EXTENT_INFOP (XCAR (*ptr))) | |
| 2285 ptr = &XCDR (*ptr); | |
| 2286 if (CONSP (*ptr) && INTP (XCAR (*ptr))) | |
| 2287 ptr = &XCDR (*ptr); | |
| 2288 return ptr; | |
| 2289 } | |
| 2290 | |
| 2291 static Lisp_Object | |
| 2292 string_getprop (Lisp_Object string, Lisp_Object property) | |
| 2293 { | |
| 2294 return external_plist_get (string_plist_ptr (string), property, 0, ERROR_ME); | |
| 2295 } | |
| 2296 | |
| 2297 static int | |
| 2298 string_putprop (Lisp_Object string, Lisp_Object property, Lisp_Object value) | |
| 2299 { | |
| 2300 external_plist_put (string_plist_ptr (string), property, value, 0, ERROR_ME); | |
| 2301 return 1; | |
| 2302 } | |
| 2303 | |
| 2304 static int | |
| 2305 string_remprop (Lisp_Object string, Lisp_Object property) | |
| 2306 { | |
| 2307 return external_remprop (string_plist_ptr (string), property, 0, ERROR_ME); | |
| 2308 } | |
| 2309 | |
| 2310 static Lisp_Object | |
| 2311 string_plist (Lisp_Object string) | |
| 2312 { | |
| 2313 return *string_plist_ptr (string); | |
| 2314 } | |
| 2315 | |
| 3263 | 2316 #ifndef NEW_GC |
| 442 | 2317 /* No `finalize', or `hash' methods. |
| 2318 internal_hash() already knows how to hash strings and finalization | |
| 2319 is done with the ADDITIONAL_FREE_string macro, which is the | |
| 2320 standard way to do finalization when using | |
| 2321 SWEEP_FIXED_TYPE_BLOCK(). */ | |
| 2720 | 2322 |
| 934 | 2323 DEFINE_BASIC_LRECORD_IMPLEMENTATION_WITH_PROPS ("string", string, |
| 2324 1, /*dumpable-flag*/ | |
| 2325 mark_string, print_string, | |
| 2326 0, string_equal, 0, | |
| 2327 string_description, | |
| 2328 string_getprop, | |
| 2329 string_putprop, | |
| 2330 string_remprop, | |
| 2331 string_plist, | |
| 2332 Lisp_String); | |
| 3263 | 2333 #endif /* not NEW_GC */ |
| 2720 | 2334 |
| 3092 | 2335 #ifdef NEW_GC |
| 2336 #define STRING_FULLSIZE(size) \ | |
| 2337 ALIGN_SIZE (FLEXIBLE_ARRAY_STRUCT_SIZEOF (Lisp_String_Direct_Data, Lisp_Object, data, (size) + 1), sizeof (Lisp_Object *)); | |
| 2338 #else /* not NEW_GC */ | |
| 428 | 2339 /* String blocks contain this many useful bytes. */ |
| 2340 #define STRING_CHARS_BLOCK_SIZE \ | |
| 814 | 2341 ((Bytecount) (8192 - MALLOC_OVERHEAD - \ |
| 2342 ((2 * sizeof (struct string_chars_block *)) \ | |
| 2343 + sizeof (EMACS_INT)))) | |
| 428 | 2344 /* Block header for small strings. */ |
| 2345 struct string_chars_block | |
| 2346 { | |
| 2347 EMACS_INT pos; | |
| 2348 struct string_chars_block *next; | |
| 2349 struct string_chars_block *prev; | |
| 2350 /* Contents of string_chars_block->string_chars are interleaved | |
| 2351 string_chars structures (see below) and the actual string data */ | |
| 2352 unsigned char string_chars[STRING_CHARS_BLOCK_SIZE]; | |
| 2353 }; | |
| 2354 | |
| 2355 static struct string_chars_block *first_string_chars_block; | |
| 2356 static struct string_chars_block *current_string_chars_block; | |
| 2357 | |
| 2358 /* If SIZE is the length of a string, this returns how many bytes | |
| 2359 * the string occupies in string_chars_block->string_chars | |
| 2360 * (including alignment padding). | |
| 2361 */ | |
| 438 | 2362 #define STRING_FULLSIZE(size) \ |
| 826 | 2363 ALIGN_FOR_TYPE (((size) + 1 + sizeof (Lisp_String *)), Lisp_String *) |
| 428 | 2364 |
| 2365 #define BIG_STRING_FULLSIZE_P(fullsize) ((fullsize) >= STRING_CHARS_BLOCK_SIZE) | |
| 2366 #define BIG_STRING_SIZE_P(size) (BIG_STRING_FULLSIZE_P (STRING_FULLSIZE(size))) | |
| 2367 | |
| 454 | 2368 #define STRING_CHARS_FREE_P(ptr) ((ptr)->string == NULL) |
| 2369 #define MARK_STRING_CHARS_AS_FREE(ptr) ((void) ((ptr)->string = NULL)) | |
| 3092 | 2370 #endif /* not NEW_GC */ |
| 454 | 2371 |
| 3263 | 2372 #ifdef NEW_GC |
| 3092 | 2373 DEFINE_LRECORD_IMPLEMENTATION_WITH_PROPS ("string", string, |
| 2374 1, /*dumpable-flag*/ | |
| 2375 mark_string, print_string, | |
| 2376 0, | |
| 2377 string_equal, 0, | |
| 2378 string_description, | |
| 2379 string_getprop, | |
| 2380 string_putprop, | |
| 2381 string_remprop, | |
| 2382 string_plist, | |
| 2383 Lisp_String); | |
| 2384 | |
| 2385 | |
| 2386 static const struct memory_description string_direct_data_description[] = { | |
| 3514 | 2387 { XD_BYTECOUNT, offsetof (Lisp_String_Direct_Data, size) }, |
| 3092 | 2388 { XD_END } |
| 2389 }; | |
| 2390 | |
| 2391 static Bytecount | |
| 2392 size_string_direct_data (const void *lheader) | |
| 2393 { | |
| 2394 return STRING_FULLSIZE (((Lisp_String_Direct_Data *) lheader)->size); | |
| 2395 } | |
| 2396 | |
| 2397 | |
| 2398 DEFINE_LRECORD_SEQUENCE_IMPLEMENTATION ("string-direct-data", | |
| 2399 string_direct_data, | |
| 2400 1, /*dumpable-flag*/ | |
| 2401 0, 0, 0, 0, 0, | |
| 2402 string_direct_data_description, | |
| 2403 size_string_direct_data, | |
| 2404 Lisp_String_Direct_Data); | |
| 2405 | |
| 2406 | |
| 2407 static const struct memory_description string_indirect_data_description[] = { | |
| 2408 { XD_BYTECOUNT, offsetof (Lisp_String_Indirect_Data, size) }, | |
| 2409 { XD_OPAQUE_DATA_PTR, offsetof (Lisp_String_Indirect_Data, data), | |
| 2410 XD_INDIRECT(0, 1) }, | |
| 2411 { XD_END } | |
| 2412 }; | |
| 2413 | |
| 2414 DEFINE_LRECORD_IMPLEMENTATION ("string-indirect-data", | |
| 2415 string_indirect_data, | |
| 2416 1, /*dumpable-flag*/ | |
| 2417 0, 0, 0, 0, 0, | |
| 2418 string_indirect_data_description, | |
| 2419 Lisp_String_Indirect_Data); | |
| 2420 #endif /* NEW_GC */ | |
| 2720 | 2421 |
| 3092 | 2422 #ifndef NEW_GC |
| 428 | 2423 struct string_chars |
| 2424 { | |
| 438 | 2425 Lisp_String *string; |
| 428 | 2426 unsigned char chars[1]; |
| 2427 }; | |
| 2428 | |
| 2429 struct unused_string_chars | |
| 2430 { | |
| 438 | 2431 Lisp_String *string; |
| 428 | 2432 EMACS_INT fullsize; |
| 2433 }; | |
| 2434 | |
| 2435 static void | |
| 2436 init_string_chars_alloc (void) | |
| 2437 { | |
| 2438 first_string_chars_block = xnew (struct string_chars_block); | |
| 2439 first_string_chars_block->prev = 0; | |
| 2440 first_string_chars_block->next = 0; | |
| 2441 first_string_chars_block->pos = 0; | |
| 2442 current_string_chars_block = first_string_chars_block; | |
| 2443 } | |
| 2444 | |
| 1550 | 2445 static Ibyte * |
| 2446 allocate_big_string_chars (Bytecount length) | |
| 2447 { | |
| 2448 Ibyte *p = xnew_array (Ibyte, length); | |
| 2449 INCREMENT_CONS_COUNTER (length, "string chars"); | |
| 2450 return p; | |
| 2451 } | |
| 2452 | |
| 428 | 2453 static struct string_chars * |
| 793 | 2454 allocate_string_chars_struct (Lisp_Object string_it_goes_with, |
| 814 | 2455 Bytecount fullsize) |
| 428 | 2456 { |
| 2457 struct string_chars *s_chars; | |
| 2458 | |
| 438 | 2459 if (fullsize <= |
| 2460 (countof (current_string_chars_block->string_chars) | |
| 2461 - current_string_chars_block->pos)) | |
| 428 | 2462 { |
| 2463 /* This string can fit in the current string chars block */ | |
| 2464 s_chars = (struct string_chars *) | |
| 2465 (current_string_chars_block->string_chars | |
| 2466 + current_string_chars_block->pos); | |
| 2467 current_string_chars_block->pos += fullsize; | |
| 2468 } | |
| 2469 else | |
| 2470 { | |
| 2471 /* Make a new current string chars block */ | |
| 2472 struct string_chars_block *new_scb = xnew (struct string_chars_block); | |
| 2473 | |
| 2474 current_string_chars_block->next = new_scb; | |
| 2475 new_scb->prev = current_string_chars_block; | |
| 2476 new_scb->next = 0; | |
| 2477 current_string_chars_block = new_scb; | |
| 2478 new_scb->pos = fullsize; | |
| 2479 s_chars = (struct string_chars *) | |
| 2480 current_string_chars_block->string_chars; | |
| 2481 } | |
| 2482 | |
| 793 | 2483 s_chars->string = XSTRING (string_it_goes_with); |
| 428 | 2484 |
| 2485 INCREMENT_CONS_COUNTER (fullsize, "string chars"); | |
| 2486 | |
| 2487 return s_chars; | |
| 2488 } | |
| 3092 | 2489 #endif /* not NEW_GC */ |
| 428 | 2490 |
| 771 | 2491 #ifdef SLEDGEHAMMER_CHECK_ASCII_BEGIN |
| 2492 void | |
| 2493 sledgehammer_check_ascii_begin (Lisp_Object str) | |
| 2494 { | |
| 2495 Bytecount i; | |
| 2496 | |
| 2497 for (i = 0; i < XSTRING_LENGTH (str); i++) | |
| 2498 { | |
| 826 | 2499 if (!byte_ascii_p (string_byte (str, i))) |
| 771 | 2500 break; |
| 2501 } | |
| 2502 | |
| 2503 assert (i == (Bytecount) XSTRING_ASCII_BEGIN (str) || | |
| 2504 (i > MAX_STRING_ASCII_BEGIN && | |
| 2505 (Bytecount) XSTRING_ASCII_BEGIN (str) == | |
| 2506 (Bytecount) MAX_STRING_ASCII_BEGIN)); | |
| 2507 } | |
| 2508 #endif | |
| 2509 | |
| 2510 /* You do NOT want to be calling this! (And if you do, you must call | |
| 851 | 2511 XSET_STRING_ASCII_BEGIN() after modifying the string.) Use ALLOCA () |
| 771 | 2512 instead and then call make_string() like the rest of the world. */ |
| 2513 | |
| 428 | 2514 Lisp_Object |
| 2515 make_uninit_string (Bytecount length) | |
| 2516 { | |
| 438 | 2517 Lisp_String *s; |
| 814 | 2518 Bytecount fullsize = STRING_FULLSIZE (length); |
| 428 | 2519 |
| 438 | 2520 assert (length >= 0 && fullsize > 0); |
| 428 | 2521 |
| 3263 | 2522 #ifdef NEW_GC |
| 2720 | 2523 s = alloc_lrecord_type (Lisp_String, &lrecord_string); |
| 3263 | 2524 #else /* not NEW_GC */ |
| 428 | 2525 /* Allocate the string header */ |
| 438 | 2526 ALLOCATE_FIXED_TYPE (string, Lisp_String, s); |
| 793 | 2527 xzero (*s); |
| 771 | 2528 set_lheader_implementation (&s->u.lheader, &lrecord_string); |
| 3263 | 2529 #endif /* not NEW_GC */ |
| 2720 | 2530 |
| 3063 | 2531 /* The above allocations set the UID field, which overlaps with the |
| 2532 ascii-length field, to some non-zero value. We need to zero it. */ | |
| 2533 XSET_STRING_ASCII_BEGIN (wrap_string (s), 0); | |
| 2534 | |
| 3092 | 2535 #ifdef NEW_GC |
| 3304 | 2536 set_lispstringp_direct (s); |
| 3092 | 2537 STRING_DATA_OBJECT (s) = |
| 2538 wrap_string_direct_data (alloc_lrecord (fullsize, | |
| 2539 &lrecord_string_direct_data)); | |
| 2540 #else /* not NEW_GC */ | |
| 826 | 2541 set_lispstringp_data (s, BIG_STRING_FULLSIZE_P (fullsize) |
| 2720 | 2542 ? allocate_big_string_chars (length + 1) |
| 2543 : allocate_string_chars_struct (wrap_string (s), | |
| 2544 fullsize)->chars); | |
| 3092 | 2545 #endif /* not NEW_GC */ |
| 438 | 2546 |
| 826 | 2547 set_lispstringp_length (s, length); |
| 428 | 2548 s->plist = Qnil; |
| 793 | 2549 set_string_byte (wrap_string (s), length, 0); |
| 2550 | |
| 2551 return wrap_string (s); | |
| 428 | 2552 } |
| 2553 | |
| 2554 #ifdef VERIFY_STRING_CHARS_INTEGRITY | |
| 2555 static void verify_string_chars_integrity (void); | |
| 2556 #endif | |
| 2557 | |
| 2558 /* Resize the string S so that DELTA bytes can be inserted starting | |
| 2559 at POS. If DELTA < 0, it means deletion starting at POS. If | |
| 2560 POS < 0, resize the string but don't copy any characters. Use | |
| 2561 this if you're planning on completely overwriting the string. | |
| 2562 */ | |
| 2563 | |
| 2564 void | |
| 793 | 2565 resize_string (Lisp_Object s, Bytecount pos, Bytecount delta) |
| 428 | 2566 { |
| 3092 | 2567 #ifdef NEW_GC |
| 2568 Bytecount newfullsize, len; | |
| 2569 #else /* not NEW_GC */ | |
| 438 | 2570 Bytecount oldfullsize, newfullsize; |
| 3092 | 2571 #endif /* not NEW_GC */ |
| 428 | 2572 #ifdef VERIFY_STRING_CHARS_INTEGRITY |
| 2573 verify_string_chars_integrity (); | |
| 2574 #endif | |
| 800 | 2575 #ifdef ERROR_CHECK_TEXT |
| 428 | 2576 if (pos >= 0) |
| 2577 { | |
| 793 | 2578 assert (pos <= XSTRING_LENGTH (s)); |
| 428 | 2579 if (delta < 0) |
| 793 | 2580 assert (pos + (-delta) <= XSTRING_LENGTH (s)); |
| 428 | 2581 } |
| 2582 else | |
| 2583 { | |
| 2584 if (delta < 0) | |
| 793 | 2585 assert ((-delta) <= XSTRING_LENGTH (s)); |
| 428 | 2586 } |
| 800 | 2587 #endif /* ERROR_CHECK_TEXT */ |
| 428 | 2588 |
| 2589 if (delta == 0) | |
| 2590 /* simplest case: no size change. */ | |
| 2591 return; | |
| 438 | 2592 |
| 2593 if (pos >= 0 && delta < 0) | |
| 2594 /* If DELTA < 0, the functions below will delete the characters | |
| 2595 before POS. We want to delete characters *after* POS, however, | |
| 2596 so convert this to the appropriate form. */ | |
| 2597 pos += -delta; | |
| 2598 | |
| 3092 | 2599 #ifdef NEW_GC |
| 2600 newfullsize = STRING_FULLSIZE (XSTRING_LENGTH (s) + delta); | |
| 2601 | |
| 2602 len = XSTRING_LENGTH (s) + 1 - pos; | |
| 2603 | |
| 2604 if (delta < 0 && pos >= 0) | |
| 2605 memmove (XSTRING_DATA (s) + pos + delta, | |
| 2606 XSTRING_DATA (s) + pos, len); | |
| 2607 | |
| 2608 XSTRING_DATA_OBJECT (s) = | |
| 2609 wrap_string_direct_data (mc_realloc (XPNTR (XSTRING_DATA_OBJECT (s)), | |
| 2610 newfullsize)); | |
| 2611 if (delta > 0 && pos >= 0) | |
| 2612 memmove (XSTRING_DATA (s) + pos + delta, XSTRING_DATA (s) + pos, | |
| 2613 len); | |
| 2614 | |
| 3263 | 2615 #else /* not NEW_GC */ |
| 793 | 2616 oldfullsize = STRING_FULLSIZE (XSTRING_LENGTH (s)); |
| 2617 newfullsize = STRING_FULLSIZE (XSTRING_LENGTH (s) + delta); | |
| 438 | 2618 |
| 2619 if (BIG_STRING_FULLSIZE_P (oldfullsize)) | |
| 428 | 2620 { |
| 438 | 2621 if (BIG_STRING_FULLSIZE_P (newfullsize)) |
| 428 | 2622 { |
| 440 | 2623 /* Both strings are big. We can just realloc(). |
| 2624 But careful! If the string is shrinking, we have to | |
| 2625 memmove() _before_ realloc(), and if growing, we have to | |
| 2626 memmove() _after_ realloc() - otherwise the access is | |
| 2627 illegal, and we might crash. */ | |
| 793 | 2628 Bytecount len = XSTRING_LENGTH (s) + 1 - pos; |
| 440 | 2629 |
| 2630 if (delta < 0 && pos >= 0) | |
| 793 | 2631 memmove (XSTRING_DATA (s) + pos + delta, |
| 2632 XSTRING_DATA (s) + pos, len); | |
| 2633 XSET_STRING_DATA | |
| 867 | 2634 (s, (Ibyte *) xrealloc (XSTRING_DATA (s), |
| 793 | 2635 XSTRING_LENGTH (s) + delta + 1)); |
| 440 | 2636 if (delta > 0 && pos >= 0) |
| 793 | 2637 memmove (XSTRING_DATA (s) + pos + delta, XSTRING_DATA (s) + pos, |
| 2638 len); | |
| 1550 | 2639 /* Bump the cons counter. |
| 2640 Conservative; Martin let the increment be delta. */ | |
| 2641 INCREMENT_CONS_COUNTER (newfullsize, "string chars"); | |
| 428 | 2642 } |
| 438 | 2643 else /* String has been demoted from BIG_STRING. */ |
| 428 | 2644 { |
| 867 | 2645 Ibyte *new_data = |
| 438 | 2646 allocate_string_chars_struct (s, newfullsize)->chars; |
| 867 | 2647 Ibyte *old_data = XSTRING_DATA (s); |
| 438 | 2648 |
| 2649 if (pos >= 0) | |
| 2650 { | |
| 2651 memcpy (new_data, old_data, pos); | |
| 2652 memcpy (new_data + pos + delta, old_data + pos, | |
| 793 | 2653 XSTRING_LENGTH (s) + 1 - pos); |
| 438 | 2654 } |
| 793 | 2655 XSET_STRING_DATA (s, new_data); |
| 1726 | 2656 xfree (old_data, Ibyte *); |
| 438 | 2657 } |
| 2658 } | |
| 2659 else /* old string is small */ | |
| 2660 { | |
| 2661 if (oldfullsize == newfullsize) | |
| 2662 { | |
| 2663 /* special case; size change but the necessary | |
| 2664 allocation size won't change (up or down; code | |
| 2665 somewhere depends on there not being any unused | |
| 2666 allocation space, modulo any alignment | |
| 2667 constraints). */ | |
| 428 | 2668 if (pos >= 0) |
| 2669 { | |
| 867 | 2670 Ibyte *addroff = pos + XSTRING_DATA (s); |
| 428 | 2671 |
| 2672 memmove (addroff + delta, addroff, | |
| 2673 /* +1 due to zero-termination. */ | |
| 793 | 2674 XSTRING_LENGTH (s) + 1 - pos); |
| 428 | 2675 } |
| 2676 } | |
| 2677 else | |
| 2678 { | |
| 867 | 2679 Ibyte *old_data = XSTRING_DATA (s); |
| 2680 Ibyte *new_data = | |
| 438 | 2681 BIG_STRING_FULLSIZE_P (newfullsize) |
| 1550 | 2682 ? allocate_big_string_chars (XSTRING_LENGTH (s) + delta + 1) |
| 438 | 2683 : allocate_string_chars_struct (s, newfullsize)->chars; |
| 2684 | |
| 428 | 2685 if (pos >= 0) |
| 2686 { | |
| 438 | 2687 memcpy (new_data, old_data, pos); |
| 2688 memcpy (new_data + pos + delta, old_data + pos, | |
| 793 | 2689 XSTRING_LENGTH (s) + 1 - pos); |
| 428 | 2690 } |
| 793 | 2691 XSET_STRING_DATA (s, new_data); |
| 438 | 2692 |
|
4776
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2693 if (!DUMPEDP (old_data)) /* Can't free dumped data. */ |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2694 { |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2695 /* We need to mark this chunk of the string_chars_block |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2696 as unused so that compact_string_chars() doesn't |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2697 freak. */ |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2698 struct string_chars *old_s_chars = (struct string_chars *) |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2699 ((char *) old_data - offsetof (struct string_chars, chars)); |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2700 /* Sanity check to make sure we aren't hosed by strange |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2701 alignment/padding. */ |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2702 assert (old_s_chars->string == XSTRING (s)); |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2703 MARK_STRING_CHARS_AS_FREE (old_s_chars); |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2704 ((struct unused_string_chars *) old_s_chars)->fullsize = |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2705 oldfullsize; |
|
73e8632018ad
Don't attempt to free dumped data, alloc.c:resize_string()
Aidan Kehoe <kehoea@parhasard.net>
parents:
4735
diff
changeset
|
2706 } |
| 428 | 2707 } |
| 438 | 2708 } |
| 3092 | 2709 #endif /* not NEW_GC */ |
| 438 | 2710 |
| 793 | 2711 XSET_STRING_LENGTH (s, XSTRING_LENGTH (s) + delta); |
| 438 | 2712 /* If pos < 0, the string won't be zero-terminated. |
| 2713 Terminate now just to make sure. */ | |
| 793 | 2714 XSTRING_DATA (s)[XSTRING_LENGTH (s)] = '\0'; |
| 438 | 2715 |
| 2716 if (pos >= 0) | |
| 793 | 2717 /* We also have to adjust all of the extent indices after the |
| 2718 place we did the change. We say "pos - 1" because | |
| 2719 adjust_extents() is exclusive of the starting position | |
| 2720 passed to it. */ | |
| 2721 adjust_extents (s, pos - 1, XSTRING_LENGTH (s), delta); | |
| 428 | 2722 |
| 2723 #ifdef VERIFY_STRING_CHARS_INTEGRITY | |
| 2724 verify_string_chars_integrity (); | |
| 2725 #endif | |
| 2726 } | |
| 2727 | |
| 2728 #ifdef MULE | |
| 2729 | |
| 771 | 2730 /* WARNING: If you modify an existing string, you must call |
| 2731 CHECK_LISP_WRITEABLE() before and bump_string_modiff() afterwards. */ | |
| 428 | 2732 void |
| 867 | 2733 set_string_char (Lisp_Object s, Charcount i, Ichar c) |
| 428 | 2734 { |
| 867 | 2735 Ibyte newstr[MAX_ICHAR_LEN]; |
| 771 | 2736 Bytecount bytoff = string_index_char_to_byte (s, i); |
| 867 | 2737 Bytecount oldlen = itext_ichar_len (XSTRING_DATA (s) + bytoff); |
| 2738 Bytecount newlen = set_itext_ichar (newstr, c); | |
| 428 | 2739 |
| 793 | 2740 sledgehammer_check_ascii_begin (s); |
| 428 | 2741 if (oldlen != newlen) |
| 2742 resize_string (s, bytoff, newlen - oldlen); | |
| 793 | 2743 /* Remember, XSTRING_DATA (s) might have changed so we can't cache it. */ |
| 2744 memcpy (XSTRING_DATA (s) + bytoff, newstr, newlen); | |
| 771 | 2745 if (oldlen != newlen) |
| 2746 { | |
| 793 | 2747 if (newlen > 1 && i <= (Charcount) XSTRING_ASCII_BEGIN (s)) |
| 771 | 2748 /* Everything starting with the new char is no longer part of |
| 2749 ascii_begin */ | |
| 793 | 2750 XSET_STRING_ASCII_BEGIN (s, i); |
| 2751 else if (newlen == 1 && i == (Charcount) XSTRING_ASCII_BEGIN (s)) | |
| 771 | 2752 /* We've extended ascii_begin, and we have to figure out how much by */ |
| 2753 { | |
| 2754 Bytecount j; | |
| 814 | 2755 for (j = (Bytecount) i + 1; j < XSTRING_LENGTH (s); j++) |
| 771 | 2756 { |
| 826 | 2757 if (!byte_ascii_p (XSTRING_DATA (s)[j])) |
| 771 | 2758 break; |
| 2759 } | |
| 814 | 2760 XSET_STRING_ASCII_BEGIN (s, min (j, (Bytecount) MAX_STRING_ASCII_BEGIN)); |
| 771 | 2761 } |
| 2762 } | |
| 793 | 2763 sledgehammer_check_ascii_begin (s); |
| 428 | 2764 } |
| 2765 | |
| 2766 #endif /* MULE */ | |
| 2767 | |
| 2768 DEFUN ("make-string", Fmake_string, 2, 2, 0, /* | |
| 444 | 2769 Return a new string consisting of LENGTH copies of CHARACTER. |
| 2770 LENGTH must be a non-negative integer. | |
| 428 | 2771 */ |
| 444 | 2772 (length, character)) |
| 428 | 2773 { |
| 2774 CHECK_NATNUM (length); | |
| 444 | 2775 CHECK_CHAR_COERCE_INT (character); |
| 428 | 2776 { |
| 867 | 2777 Ibyte init_str[MAX_ICHAR_LEN]; |
| 2778 int len = set_itext_ichar (init_str, XCHAR (character)); | |
| 428 | 2779 Lisp_Object val = make_uninit_string (len * XINT (length)); |
| 2780 | |
| 2781 if (len == 1) | |
| 771 | 2782 { |
| 2783 /* Optimize the single-byte case */ | |
| 2784 memset (XSTRING_DATA (val), XCHAR (character), XSTRING_LENGTH (val)); | |
| 793 | 2785 XSET_STRING_ASCII_BEGIN (val, min (MAX_STRING_ASCII_BEGIN, |
| 2786 len * XINT (length))); | |
| 771 | 2787 } |
| 428 | 2788 else |
| 2789 { | |
| 647 | 2790 EMACS_INT i; |
| 867 | 2791 Ibyte *ptr = XSTRING_DATA (val); |
| 428 | 2792 |
| 2793 for (i = XINT (length); i; i--) | |
| 2794 { | |
| 867 | 2795 Ibyte *init_ptr = init_str; |
| 428 | 2796 switch (len) |
| 2797 { | |
| 2798 case 4: *ptr++ = *init_ptr++; | |
| 2799 case 3: *ptr++ = *init_ptr++; | |
| 2800 case 2: *ptr++ = *init_ptr++; | |
| 2801 case 1: *ptr++ = *init_ptr++; | |
| 2802 } | |
| 2803 } | |
| 2804 } | |
| 771 | 2805 sledgehammer_check_ascii_begin (val); |
| 428 | 2806 return val; |
| 2807 } | |
| 2808 } | |
| 2809 | |
| 2810 DEFUN ("string", Fstring, 0, MANY, 0, /* | |
| 2811 Concatenate all the argument characters and make the result a string. | |
|
4693
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
2812 |
|
80cd90837ac5
Add argument information to remaining MANY or UNEVALLED C subrs.
Aidan Kehoe <kehoea@parhasard.net>
parents:
3514
diff
changeset
|
2813 arguments: (&rest ARGS) |
| 428 | 2814 */ |
| 2815 (int nargs, Lisp_Object *args)) | |
| 2816 { | |
| 2367 | 2817 Ibyte *storage = alloca_ibytes (nargs * MAX_ICHAR_LEN); |
| 867 | 2818 Ibyte *p = storage; |
| 428 | 2819 |
| 2820 for (; nargs; nargs--, args++) | |
| 2821 { | |
| 2822 Lisp_Object lisp_char = *args; | |
| 2823 CHECK_CHAR_COERCE_INT (lisp_char); | |
| 867 | 2824 p += set_itext_ichar (p, XCHAR (lisp_char)); |
| 428 | 2825 } |
| 2826 return make_string (storage, p - storage); | |
| 2827 } | |
| 2828 | |
| 771 | 2829 /* Initialize the ascii_begin member of a string to the correct value. */ |
| 2830 | |
| 2831 void | |
| 2832 init_string_ascii_begin (Lisp_Object string) | |
| 2833 { | |
| 2834 #ifdef MULE | |
| 2835 int i; | |
| 2836 Bytecount length = XSTRING_LENGTH (string); | |
| 867 | 2837 Ibyte *contents = XSTRING_DATA (string); |
| 771 | 2838 |
| 2839 for (i = 0; i < length; i++) | |
| 2840 { | |
| 826 | 2841 if (!byte_ascii_p (contents[i])) |
| 771 | 2842 break; |
| 2843 } | |
| 793 | 2844 XSET_STRING_ASCII_BEGIN (string, min (i, MAX_STRING_ASCII_BEGIN)); |
| 771 | 2845 #else |
| 793 | 2846 XSET_STRING_ASCII_BEGIN (string, min (XSTRING_LENGTH (string), |
| 2847 MAX_STRING_ASCII_BEGIN)); | |
| 771 | 2848 #endif |
| 2849 sledgehammer_check_ascii_begin (string); | |
| 2850 } | |
| 428 | 2851 |
| 2852 /* Take some raw memory, which MUST already be in internal format, | |
| 2853 and package it up into a Lisp string. */ | |
| 2854 Lisp_Object | |
| 867 | 2855 make_string (const Ibyte *contents, Bytecount length) |
| 428 | 2856 { |
| 2857 Lisp_Object val; | |
| 2858 | |
| 2859 /* Make sure we find out about bad make_string's when they happen */ | |
| 800 | 2860 #if defined (ERROR_CHECK_TEXT) && defined (MULE) |
| 428 | 2861 bytecount_to_charcount (contents, length); /* Just for the assertions */ |
| 2862 #endif | |
| 2863 | |
| 2864 val = make_uninit_string (length); | |
| 2865 memcpy (XSTRING_DATA (val), contents, length); | |
| 771 | 2866 init_string_ascii_begin (val); |
| 2867 sledgehammer_check_ascii_begin (val); | |
| 428 | 2868 return val; |
| 2869 } | |
| 2870 | |
| 2871 /* Take some raw memory, encoded in some external data format, | |
| 2872 and convert it into a Lisp string. */ | |
| 2873 Lisp_Object | |
| 442 | 2874 make_ext_string (const Extbyte *contents, EMACS_INT length, |
| 440 | 2875 Lisp_Object coding_system) |
| 428 | 2876 { |
| 440 | 2877 Lisp_Object string; |
| 2878 TO_INTERNAL_FORMAT (DATA, (contents, length), | |
| 2879 LISP_STRING, string, | |
| 2880 coding_system); | |
| 2881 return string; | |
| 428 | 2882 } |
| 2883 | |
| 2884 Lisp_Object | |
| 867 | 2885 build_intstring (const Ibyte *str) |
| 771 | 2886 { |
| 2887 /* Some strlen's crash and burn if passed null. */ | |
| 814 | 2888 return make_string (str, (str ? qxestrlen (str) : (Bytecount) 0)); |
| 771 | 2889 } |
| 2890 | |
| 2891 Lisp_Object | |
| 867 | 2892 build_string (const CIbyte *str) |
| 428 | 2893 { |
| 2894 /* Some strlen's crash and burn if passed null. */ | |
| 867 | 2895 return make_string ((const Ibyte *) str, (str ? strlen (str) : 0)); |
| 428 | 2896 } |
| 2897 | |
| 2898 Lisp_Object | |
| 593 | 2899 build_ext_string (const Extbyte *str, Lisp_Object coding_system) |
| 428 | 2900 { |
| 2901 /* Some strlen's crash and burn if passed null. */ | |
| 2367 | 2902 return make_ext_string ((const Extbyte *) str, |
| 2903 (str ? dfc_external_data_len (str, coding_system) : | |
| 2904 0), | |
| 440 | 2905 coding_system); |
| 428 | 2906 } |
| 2907 | |
| 2908 Lisp_Object | |
| 867 | 2909 build_msg_intstring (const Ibyte *str) |
| 428 | 2910 { |
| 771 | 2911 return build_intstring (GETTEXT (str)); |
| 2912 } | |
| 2913 | |
| 2914 Lisp_Object | |
| 867 | 2915 build_msg_string (const CIbyte *str) |
| 771 | 2916 { |
| 2917 return build_string (CGETTEXT (str)); | |
| 428 | 2918 } |
| 2919 | |
| 2920 Lisp_Object | |
| 867 | 2921 make_string_nocopy (const Ibyte *contents, Bytecount length) |
| 428 | 2922 { |
| 438 | 2923 Lisp_String *s; |
| 428 | 2924 Lisp_Object val; |
| 2925 | |
| 2926 /* Make sure we find out about bad make_string_nocopy's when they happen */ | |
| 800 | 2927 #if defined (ERROR_CHECK_TEXT) && defined (MULE) |
| 428 | 2928 bytecount_to_charcount (contents, length); /* Just for the assertions */ |
| 2929 #endif | |
| 2930 | |
| 3263 | 2931 #ifdef NEW_GC |
| 2720 | 2932 s = alloc_lrecord_type (Lisp_String, &lrecord_string); |
| 2933 mcpro (wrap_pointer_1 (s)); /* otherwise nocopy_strings get | |
| 2934 collected and static data is tried to | |
| 2935 be freed. */ | |
| 3263 | 2936 #else /* not NEW_GC */ |
| 428 | 2937 /* Allocate the string header */ |
| 438 | 2938 ALLOCATE_FIXED_TYPE (string, Lisp_String, s); |
| 771 | 2939 set_lheader_implementation (&s->u.lheader, &lrecord_string); |
| 2940 SET_C_READONLY_RECORD_HEADER (&s->u.lheader); | |
| 3263 | 2941 #endif /* not NEW_GC */ |
| 3063 | 2942 /* Don't need to XSET_STRING_ASCII_BEGIN() here because it happens in |
| 2943 init_string_ascii_begin(). */ | |
| 428 | 2944 s->plist = Qnil; |
| 3092 | 2945 #ifdef NEW_GC |
| 2946 set_lispstringp_indirect (s); | |
| 2947 STRING_DATA_OBJECT (s) = | |
| 2948 wrap_string_indirect_data | |
| 2949 (alloc_lrecord_type (Lisp_String_Indirect_Data, | |
| 2950 &lrecord_string_indirect_data)); | |
| 2951 XSTRING_INDIRECT_DATA_DATA (STRING_DATA_OBJECT (s)) = (Ibyte *) contents; | |
| 2952 XSTRING_INDIRECT_DATA_SIZE (STRING_DATA_OBJECT (s)) = length; | |
| 2953 #else /* not NEW_GC */ | |
| 867 | 2954 set_lispstringp_data (s, (Ibyte *) contents); |
| 826 | 2955 set_lispstringp_length (s, length); |
| 3092 | 2956 #endif /* not NEW_GC */ |
| 793 | 2957 val = wrap_string (s); |
| 771 | 2958 init_string_ascii_begin (val); |
| 2959 sledgehammer_check_ascii_begin (val); | |
| 2960 | |
| 428 | 2961 return val; |
| 2962 } | |
| 2963 | |
| 2964 | |
| 3263 | 2965 #ifndef NEW_GC |
| 428 | 2966 /************************************************************************/ |
| 2967 /* lcrecord lists */ | |
| 2968 /************************************************************************/ | |
| 2969 | |
| 2970 /* Lcrecord lists are used to manage the allocation of particular | |
| 3024 | 2971 sorts of lcrecords, to avoid calling BASIC_ALLOC_LCRECORD() (and thus |
| 428 | 2972 malloc() and garbage-collection junk) as much as possible. |
| 2973 It is similar to the Blocktype class. | |
| 2974 | |
| 1204 | 2975 See detailed comment in lcrecord.h. |
| 2976 */ | |
| 2977 | |
| 2978 const struct memory_description free_description[] = { | |
| 2551 | 2979 { XD_LISP_OBJECT, offsetof (struct free_lcrecord_header, chain), 0, { 0 }, |
| 1204 | 2980 XD_FLAG_FREE_LISP_OBJECT }, |
| 2981 { XD_END } | |
| 2982 }; | |
| 2983 | |
| 2984 DEFINE_LRECORD_IMPLEMENTATION ("free", free, | |
| 2985 0, /*dumpable-flag*/ | |
| 2986 0, internal_object_printer, | |
| 2987 0, 0, 0, free_description, | |
| 2988 struct free_lcrecord_header); | |
| 2989 | |
| 2990 const struct memory_description lcrecord_list_description[] = { | |
| 2551 | 2991 { XD_LISP_OBJECT, offsetof (struct lcrecord_list, free), 0, { 0 }, |
| 1204 | 2992 XD_FLAG_FREE_LISP_OBJECT }, |
| 2993 { XD_END } | |
| 2994 }; | |
| 428 | 2995 |
| 2996 static Lisp_Object | |
| 2997 mark_lcrecord_list (Lisp_Object obj) | |
| 2998 { | |
| 2999 struct lcrecord_list *list = XLCRECORD_LIST (obj); | |
| 3000 Lisp_Object chain = list->free; | |
| 3001 | |
| 3002 while (!NILP (chain)) | |
| 3003 { | |
| 3004 struct lrecord_header *lheader = XRECORD_LHEADER (chain); | |
| 3005 struct free_lcrecord_header *free_header = | |
| 3006 (struct free_lcrecord_header *) lheader; | |
| 3007 | |
| 442 | 3008 gc_checking_assert |
| 3009 (/* There should be no other pointers to the free list. */ | |
| 3010 ! MARKED_RECORD_HEADER_P (lheader) | |
| 3011 && | |
| 3012 /* Only lcrecords should be here. */ | |
| 1204 | 3013 ! list->implementation->basic_p |
| 442 | 3014 && |
| 3015 /* Only free lcrecords should be here. */ | |
| 3016 free_header->lcheader.free | |
| 3017 && | |
| 3018 /* The type of the lcrecord must be right. */ | |
| 1204 | 3019 lheader->type == lrecord_type_free |
| 442 | 3020 && |
| 3021 /* So must the size. */ | |
| 1204 | 3022 (list->implementation->static_size == 0 || |
| 3023 list->implementation->static_size == list->size) | |
| 442 | 3024 ); |
| 428 | 3025 |
| 3026 MARK_RECORD_HEADER (lheader); | |
| 3027 chain = free_header->chain; | |
| 3028 } | |
| 3029 | |
| 3030 return Qnil; | |
| 3031 } | |
| 3032 | |
| 934 | 3033 DEFINE_LRECORD_IMPLEMENTATION ("lcrecord-list", lcrecord_list, |
| 3034 0, /*dumpable-flag*/ | |
| 3035 mark_lcrecord_list, internal_object_printer, | |
| 1204 | 3036 0, 0, 0, lcrecord_list_description, |
| 3037 struct lcrecord_list); | |
| 934 | 3038 |
| 428 | 3039 Lisp_Object |
| 665 | 3040 make_lcrecord_list (Elemcount size, |
| 442 | 3041 const struct lrecord_implementation *implementation) |
| 428 | 3042 { |
| 3024 | 3043 /* Don't use old_alloc_lcrecord_type() avoid infinite recursion |
| 1204 | 3044 allocating this, */ |
| 3045 struct lcrecord_list *p = (struct lcrecord_list *) | |
| 3024 | 3046 old_basic_alloc_lcrecord (sizeof (struct lcrecord_list), |
| 3047 &lrecord_lcrecord_list); | |
| 428 | 3048 |
| 3049 p->implementation = implementation; | |
| 3050 p->size = size; | |
| 3051 p->free = Qnil; | |
| 793 | 3052 return wrap_lcrecord_list (p); |
| 428 | 3053 } |
| 3054 | |
| 3055 Lisp_Object | |
| 1204 | 3056 alloc_managed_lcrecord (Lisp_Object lcrecord_list) |
| 428 | 3057 { |
| 3058 struct lcrecord_list *list = XLCRECORD_LIST (lcrecord_list); | |
| 3059 if (!NILP (list->free)) | |
| 3060 { | |
| 3061 Lisp_Object val = list->free; | |
| 3062 struct free_lcrecord_header *free_header = | |
| 3063 (struct free_lcrecord_header *) XPNTR (val); | |
| 1204 | 3064 struct lrecord_header *lheader = &free_header->lcheader.lheader; |
| 428 | 3065 |
| 3066 #ifdef ERROR_CHECK_GC | |
| 1204 | 3067 /* Major overkill here. */ |
| 428 | 3068 /* There should be no other pointers to the free list. */ |
| 442 | 3069 assert (! MARKED_RECORD_HEADER_P (lheader)); |
| 428 | 3070 /* Only free lcrecords should be here. */ |
| 3071 assert (free_header->lcheader.free); | |
| 1204 | 3072 assert (lheader->type == lrecord_type_free); |
| 3073 /* Only lcrecords should be here. */ | |
| 3074 assert (! (list->implementation->basic_p)); | |
| 3075 #if 0 /* Not used anymore, now that we set the type of the header to | |
| 3076 lrecord_type_free. */ | |
| 428 | 3077 /* The type of the lcrecord must be right. */ |
| 442 | 3078 assert (LHEADER_IMPLEMENTATION (lheader) == list->implementation); |
| 1204 | 3079 #endif /* 0 */ |
| 428 | 3080 /* So must the size. */ |
| 1204 | 3081 assert (list->implementation->static_size == 0 || |
| 3082 list->implementation->static_size == list->size); | |
| 428 | 3083 #endif /* ERROR_CHECK_GC */ |
| 442 | 3084 |
| 428 | 3085 list->free = free_header->chain; |
| 3086 free_header->lcheader.free = 0; | |
| 1204 | 3087 /* Put back the correct type, as we set it to lrecord_type_free. */ |
| 3088 lheader->type = list->implementation->lrecord_type_index; | |
| 3024 | 3089 old_zero_sized_lcrecord (free_header, list->size); |
| 428 | 3090 return val; |
| 3091 } | |
| 3092 else | |
| 3024 | 3093 return wrap_pointer_1 (old_basic_alloc_lcrecord (list->size, |
| 3094 list->implementation)); | |
| 428 | 3095 } |
| 3096 | |
| 771 | 3097 /* "Free" a Lisp object LCRECORD by placing it on its associated free list |
| 1204 | 3098 LCRECORD_LIST; next time alloc_managed_lcrecord() is called with the |
| 771 | 3099 same LCRECORD_LIST as its parameter, it will return an object from the |
| 3100 free list, which may be this one. Be VERY VERY SURE there are no | |
| 3101 pointers to this object hanging around anywhere where they might be | |
| 3102 used! | |
| 3103 | |
| 3104 The first thing this does before making any global state change is to | |
| 3105 call the finalize method of the object, if it exists. */ | |
| 3106 | |
| 428 | 3107 void |
| 3108 free_managed_lcrecord (Lisp_Object lcrecord_list, Lisp_Object lcrecord) | |
| 3109 { | |
| 3110 struct lcrecord_list *list = XLCRECORD_LIST (lcrecord_list); | |
| 3111 struct free_lcrecord_header *free_header = | |
| 3112 (struct free_lcrecord_header *) XPNTR (lcrecord); | |
| 442 | 3113 struct lrecord_header *lheader = &free_header->lcheader.lheader; |
| 3114 const struct lrecord_implementation *implementation | |
| 428 | 3115 = LHEADER_IMPLEMENTATION (lheader); |
| 3116 | |
|
4880
ae81a2c00f4f
try harder to avoid crashing when debug-printing
Ben Wing <ben@xemacs.org>
parents:
4803
diff
changeset
|
3117 /* If we try to debug-print during GC, we'll likely get a crash on the |
|
ae81a2c00f4f
try harder to avoid crashing when debug-printing
Ben Wing <ben@xemacs.org>
parents:
4803
diff
changeset
|
3118 following assert (called from Lstream_delete(), from prin1_to_string()). |
|
ae81a2c00f4f
try harder to avoid crashing when debug-printing
Ben Wing <ben@xemacs.org>
parents:
4803
diff
changeset
|
3119 Instead, just don't do anything. Worst comes to worst, we have a |
|
ae81a2c00f4f
try harder to avoid crashing when debug-printing
Ben Wing <ben@xemacs.org>
parents:
4803
diff
changeset
|
3120 small memory leak -- and programs being debugged usually won't be |
|
ae81a2c00f4f
try harder to avoid crashing when debug-printing
Ben Wing <ben@xemacs.org>
parents:
4803
diff
changeset
|
3121 super long-lived afterwards, anyway. */ |
|
ae81a2c00f4f
try harder to avoid crashing when debug-printing
Ben Wing <ben@xemacs.org>
parents:
4803
diff
changeset
|
3122 if (gc_in_progress && in_debug_print) |
|
ae81a2c00f4f
try harder to avoid crashing when debug-printing
Ben Wing <ben@xemacs.org>
parents:
4803
diff
changeset
|
3123 return; |
|
ae81a2c00f4f
try harder to avoid crashing when debug-printing
Ben Wing <ben@xemacs.org>
parents:
4803
diff
changeset
|
3124 |
| 771 | 3125 /* Finalizer methods may try to free objects within them, which typically |
| 3126 won't be marked and thus are scheduled for demolition. Putting them | |
| 3127 on the free list would be very bad, as we'd have xfree()d memory in | |
| 3128 the list. Even if for some reason the objects are still live | |
| 3129 (generally a logic error!), we still will have problems putting such | |
| 3130 an object on the free list right now (e.g. we'd have to avoid calling | |
| 3131 the finalizer twice, etc.). So basically, those finalizers should not | |
| 3132 be freeing any objects if during GC. Abort now to catch those | |
| 3133 problems. */ | |
| 3134 gc_checking_assert (!gc_in_progress); | |
| 3135 | |
| 428 | 3136 /* Make sure the size is correct. This will catch, for example, |
| 3137 putting a window configuration on the wrong free list. */ | |
| 1204 | 3138 gc_checking_assert (detagged_lisp_object_size (lheader) == list->size); |
| 771 | 3139 /* Make sure the object isn't already freed. */ |
| 3140 gc_checking_assert (!free_header->lcheader.free); | |
| 2367 | 3141 /* Freeing stuff in dumped memory is bad. If you trip this, you |
| 3142 may need to check for this before freeing. */ | |
| 3143 gc_checking_assert (!OBJECT_DUMPED_P (lcrecord)); | |
| 771 | 3144 |
| 428 | 3145 if (implementation->finalizer) |
| 3146 implementation->finalizer (lheader, 0); | |
| 1204 | 3147 /* Yes, there are two ways to indicate freeness -- the type is |
| 3148 lrecord_type_free or the ->free flag is set. We used to do only the | |
| 3149 latter; now we do the former as well for KKCC purposes. Probably | |
| 3150 safer in any case, as we will lose quicker this way than keeping | |
| 3151 around an lrecord of apparently correct type but bogus junk in it. */ | |
| 3152 MARK_LRECORD_AS_FREE (lheader); | |
| 428 | 3153 free_header->chain = list->free; |
| 3154 free_header->lcheader.free = 1; | |
| 3155 list->free = lcrecord; | |
| 3156 } | |
| 3157 | |
| 771 | 3158 static Lisp_Object all_lcrecord_lists[countof (lrecord_implementations_table)]; |
| 3159 | |
| 3160 void * | |
| 3161 alloc_automanaged_lcrecord (Bytecount size, | |
| 3162 const struct lrecord_implementation *imp) | |
| 3163 { | |
| 3164 if (EQ (all_lcrecord_lists[imp->lrecord_type_index], Qzero)) | |
| 3165 all_lcrecord_lists[imp->lrecord_type_index] = | |
| 3166 make_lcrecord_list (size, imp); | |
| 3167 | |
| 1204 | 3168 return XPNTR (alloc_managed_lcrecord |
| 771 | 3169 (all_lcrecord_lists[imp->lrecord_type_index])); |
| 3170 } | |
| 3171 | |
| 3172 void | |
| 3024 | 3173 old_free_lcrecord (Lisp_Object rec) |
| 771 | 3174 { |
| 3175 int type = XRECORD_LHEADER (rec)->type; | |
| 3176 | |
| 3177 assert (!EQ (all_lcrecord_lists[type], Qzero)); | |
| 3178 | |
| 3179 free_managed_lcrecord (all_lcrecord_lists[type], rec); | |
| 3180 } | |
| 3263 | 3181 #endif /* not NEW_GC */ |
| 428 | 3182 |
| 3183 | |
| 3184 DEFUN ("purecopy", Fpurecopy, 1, 1, 0, /* | |
| 3185 Kept for compatibility, returns its argument. | |
| 3186 Old: | |
| 3187 Make a copy of OBJECT in pure storage. | |
| 3188 Recursively copies contents of vectors and cons cells. | |
| 3189 Does not copy symbols. | |
| 3190 */ | |
| 444 | 3191 (object)) |
| 428 | 3192 { |
| 444 | 3193 return object; |
| 428 | 3194 } |
| 3195 | |
| 3196 | |
| 3197 /************************************************************************/ | |
| 3198 /* Garbage Collection */ | |
| 3199 /************************************************************************/ | |
| 3200 | |
| 442 | 3201 /* All the built-in lisp object types are enumerated in `enum lrecord_type'. |
| 3202 Additional ones may be defined by a module (none yet). We leave some | |
| 3203 room in `lrecord_implementations_table' for such new lisp object types. */ | |
| 647 | 3204 const struct lrecord_implementation *lrecord_implementations_table[(int)lrecord_type_last_built_in_type + MODULE_DEFINABLE_TYPE_COUNT]; |
| 3205 int lrecord_type_count = lrecord_type_last_built_in_type; | |
| 1676 | 3206 #ifndef USE_KKCC |
| 442 | 3207 /* Object marker functions are in the lrecord_implementation structure. |
| 3208 But copying them to a parallel array is much more cache-friendly. | |
| 3209 This hack speeds up (garbage-collect) by about 5%. */ | |
| 3210 Lisp_Object (*lrecord_markers[countof (lrecord_implementations_table)]) (Lisp_Object); | |
| 1676 | 3211 #endif /* not USE_KKCC */ |
| 428 | 3212 |
| 3213 struct gcpro *gcprolist; | |
| 3214 | |
| 771 | 3215 /* We want the staticpro list relocated, but not the pointers found |
| 3216 therein, because they refer to locations in the global data segment, not | |
| 3217 in the heap; we only dump heap objects. Hence we use a trivial | |
| 3218 description, as for pointerless objects. (Note that the data segment | |
| 3219 objects, which are global variables like Qfoo or Vbar, themselves are | |
| 3220 pointers to heap objects. Each needs to be described to pdump as a | |
| 3221 "root pointer"; this happens in the call to staticpro(). */ | |
| 1204 | 3222 static const struct memory_description staticpro_description_1[] = { |
| 452 | 3223 { XD_END } |
| 3224 }; | |
| 3225 | |
| 1204 | 3226 static const struct sized_memory_description staticpro_description = { |
| 452 | 3227 sizeof (Lisp_Object *), |
| 3228 staticpro_description_1 | |
| 3229 }; | |
| 3230 | |
| 1204 | 3231 static const struct memory_description staticpros_description_1[] = { |
| 452 | 3232 XD_DYNARR_DESC (Lisp_Object_ptr_dynarr, &staticpro_description), |
| 3233 { XD_END } | |
| 3234 }; | |
| 3235 | |
| 1204 | 3236 static const struct sized_memory_description staticpros_description = { |
| 452 | 3237 sizeof (Lisp_Object_ptr_dynarr), |
| 3238 staticpros_description_1 | |
| 3239 }; | |
| 3240 | |
| 771 | 3241 #ifdef DEBUG_XEMACS |
| 3242 | |
| 1204 | 3243 static const struct memory_description staticpro_one_name_description_1[] = { |
| 2367 | 3244 { XD_ASCII_STRING, 0 }, |
| 771 | 3245 { XD_END } |
| 3246 }; | |
| 3247 | |
| 1204 | 3248 static const struct sized_memory_description staticpro_one_name_description = { |
| 771 | 3249 sizeof (char *), |
| 3250 staticpro_one_name_description_1 | |
| 3251 }; | |
| 3252 | |
| 1204 | 3253 static const struct memory_description staticpro_names_description_1[] = { |
| 771 | 3254 XD_DYNARR_DESC (char_ptr_dynarr, &staticpro_one_name_description), |
| 3255 { XD_END } | |
| 3256 }; | |
| 3257 | |
| 1204 | 3258 |
| 3259 extern const struct sized_memory_description staticpro_names_description; | |
| 3260 | |
| 3261 const struct sized_memory_description staticpro_names_description = { | |
| 771 | 3262 sizeof (char_ptr_dynarr), |
| 3263 staticpro_names_description_1 | |
| 3264 }; | |
| 3265 | |
| 3266 /* Help debug crashes gc-marking a staticpro'ed object. */ | |
| 3267 | |
| 3268 Lisp_Object_ptr_dynarr *staticpros; | |
| 3269 char_ptr_dynarr *staticpro_names; | |
| 3270 | |
| 3271 /* Mark the Lisp_Object at non-heap VARADDRESS as a root object for | |
| 3272 garbage collection, and for dumping. */ | |
| 3273 void | |
| 3274 staticpro_1 (Lisp_Object *varaddress, char *varname) | |
| 3275 { | |
| 3276 Dynarr_add (staticpros, varaddress); | |
| 3277 Dynarr_add (staticpro_names, varname); | |
| 1204 | 3278 dump_add_root_lisp_object (varaddress); |
| 771 | 3279 } |
| 3280 | |
| 3281 | |
| 3282 Lisp_Object_ptr_dynarr *staticpros_nodump; | |
| 3283 char_ptr_dynarr *staticpro_nodump_names; | |
| 3284 | |
| 3285 /* Mark the Lisp_Object at heap VARADDRESS as a root object for | |
| 3286 garbage collection, but not for dumping. (See below.) */ | |
| 3287 void | |
| 3288 staticpro_nodump_1 (Lisp_Object *varaddress, char *varname) | |
| 3289 { | |
| 3290 Dynarr_add (staticpros_nodump, varaddress); | |
| 3291 Dynarr_add (staticpro_nodump_names, varname); | |
| 3292 } | |
| 3293 | |
| 996 | 3294 #ifdef HAVE_SHLIB |
| 3295 /* Stop treating the Lisp_Object at non-heap VARADDRESS as a root object | |
| 3296 for garbage collection, but not for dumping. */ | |
| 3297 void | |
| 3298 unstaticpro_nodump_1 (Lisp_Object *varaddress, char *varname) | |
| 3299 { | |
| 3300 Dynarr_delete_object (staticpros, varaddress); | |
| 3301 Dynarr_delete_object (staticpro_names, varname); | |
| 3302 } | |
| 3303 #endif | |
| 3304 | |
| 771 | 3305 #else /* not DEBUG_XEMACS */ |
| 3306 | |
| 452 | 3307 Lisp_Object_ptr_dynarr *staticpros; |
| 3308 | |
| 3309 /* Mark the Lisp_Object at non-heap VARADDRESS as a root object for | |
| 3310 garbage collection, and for dumping. */ | |
| 428 | 3311 void |
| 3312 staticpro (Lisp_Object *varaddress) | |
| 3313 { | |
| 452 | 3314 Dynarr_add (staticpros, varaddress); |
| 1204 | 3315 dump_add_root_lisp_object (varaddress); |
| 428 | 3316 } |
| 3317 | |
| 442 | 3318 |
| 452 | 3319 Lisp_Object_ptr_dynarr *staticpros_nodump; |
| 3320 | |
| 771 | 3321 /* Mark the Lisp_Object at heap VARADDRESS as a root object for garbage |
| 3322 collection, but not for dumping. This is used for objects where the | |
| 3323 only sure pointer is in the heap (rather than in the global data | |
| 3324 segment, as must be the case for pdump root pointers), but not inside of | |
| 3325 another Lisp object (where it will be marked as a result of that Lisp | |
| 3326 object's mark method). The call to staticpro_nodump() must occur *BOTH* | |
| 3327 at initialization time and at "reinitialization" time (startup, after | |
| 3328 pdump load.) (For example, this is the case with the predicate symbols | |
| 3329 for specifier and coding system types. The pointer to this symbol is | |
| 3330 inside of a methods structure, which is allocated on the heap. The | |
| 3331 methods structure will be written out to the pdump data file, and may be | |
| 3332 reloaded at a different address.) | |
| 3333 | |
| 3334 #### The necessity for reinitialization is a bug in pdump. Pdump should | |
| 3335 automatically regenerate the staticpro()s for these symbols when it | |
| 3336 loads the data in. */ | |
| 3337 | |
| 428 | 3338 void |
| 3339 staticpro_nodump (Lisp_Object *varaddress) | |
| 3340 { | |
| 452 | 3341 Dynarr_add (staticpros_nodump, varaddress); |
| 428 | 3342 } |
| 3343 | |
| 996 | 3344 #ifdef HAVE_SHLIB |
| 3345 /* Unmark the Lisp_Object at non-heap VARADDRESS as a root object for | |
| 3346 garbage collection, but not for dumping. */ | |
| 3347 void | |
| 3348 unstaticpro_nodump (Lisp_Object *varaddress) | |
| 3349 { | |
| 3350 Dynarr_delete_object (staticpros, varaddress); | |
| 3351 } | |
| 3352 #endif | |
| 3353 | |
| 771 | 3354 #endif /* not DEBUG_XEMACS */ |
| 3355 | |
| 2720 | 3356 |
| 3357 | |
| 3358 | |
| 3359 | |
| 3263 | 3360 #ifdef NEW_GC |
| 2720 | 3361 static const struct memory_description mcpro_description_1[] = { |
| 3362 { XD_END } | |
| 3363 }; | |
| 3364 | |
| 3365 static const struct sized_memory_description mcpro_description = { | |
| 3366 sizeof (Lisp_Object *), | |
| 3367 mcpro_description_1 | |
| 3368 }; | |
| 3369 | |
| 3370 static const struct memory_description mcpros_description_1[] = { | |
| 3371 XD_DYNARR_DESC (Lisp_Object_dynarr, &mcpro_description), | |
| 3372 { XD_END } | |
| 3373 }; | |
| 3374 | |
| 3375 static const struct sized_memory_description mcpros_description = { | |
| 3376 sizeof (Lisp_Object_dynarr), | |
| 3377 mcpros_description_1 | |
| 3378 }; | |
| 3379 | |
| 3380 #ifdef DEBUG_XEMACS | |
| 3381 | |
| 3382 static const struct memory_description mcpro_one_name_description_1[] = { | |
| 3383 { XD_ASCII_STRING, 0 }, | |
| 3384 { XD_END } | |
| 3385 }; | |
| 3386 | |
| 3387 static const struct sized_memory_description mcpro_one_name_description = { | |
| 3388 sizeof (char *), | |
| 3389 mcpro_one_name_description_1 | |
| 3390 }; | |
| 3391 | |
| 3392 static const struct memory_description mcpro_names_description_1[] = { | |
| 3393 XD_DYNARR_DESC (char_ptr_dynarr, &mcpro_one_name_description), | |
| 3394 { XD_END } | |
| 3395 }; | |
| 3396 | |
| 3397 extern const struct sized_memory_description mcpro_names_description; | |
| 3398 | |
| 3399 const struct sized_memory_description mcpro_names_description = { | |
| 3400 sizeof (char_ptr_dynarr), | |
| 3401 mcpro_names_description_1 | |
| 3402 }; | |
| 3403 | |
| 3404 /* Help debug crashes gc-marking a mcpro'ed object. */ | |
| 3405 | |
| 3406 Lisp_Object_dynarr *mcpros; | |
| 3407 char_ptr_dynarr *mcpro_names; | |
| 3408 | |
| 3409 /* Mark the Lisp_Object at non-heap VARADDRESS as a root object for | |
| 3410 garbage collection, and for dumping. */ | |
| 3411 void | |
| 3412 mcpro_1 (Lisp_Object varaddress, char *varname) | |
| 3413 { | |
| 3414 Dynarr_add (mcpros, varaddress); | |
| 3415 Dynarr_add (mcpro_names, varname); | |
| 3416 } | |
| 3417 | |
| 3418 #else /* not DEBUG_XEMACS */ | |
| 3419 | |
| 3420 Lisp_Object_dynarr *mcpros; | |
| 3421 | |
| 3422 /* Mark the Lisp_Object at non-heap VARADDRESS as a root object for | |
| 3423 garbage collection, and for dumping. */ | |
| 3424 void | |
| 3425 mcpro (Lisp_Object varaddress) | |
| 3426 { | |
| 3427 Dynarr_add (mcpros, varaddress); | |
| 3428 } | |
| 3429 | |
| 3430 #endif /* not DEBUG_XEMACS */ | |
| 3263 | 3431 #endif /* NEW_GC */ |
| 3432 | |
| 3433 | |
| 3434 #ifndef NEW_GC | |
| 428 | 3435 static int gc_count_num_short_string_in_use; |
| 647 | 3436 static Bytecount gc_count_string_total_size; |
| 3437 static Bytecount gc_count_short_string_total_size; | |
| 428 | 3438 |
| 3439 /* static int gc_count_total_records_used, gc_count_records_total_size; */ | |
| 3440 | |
| 3441 | |
| 3442 /* stats on lcrecords in use - kinda kludgy */ | |
| 3443 | |
| 3444 static struct | |
| 3445 { | |
| 3446 int instances_in_use; | |
| 3447 int bytes_in_use; | |
| 3448 int instances_freed; | |
| 3449 int bytes_freed; | |
| 3450 int instances_on_free_list; | |
| 3461 | 3451 } lcrecord_stats [countof (lrecord_implementations_table)]; |
| 428 | 3452 |
| 3453 static void | |
| 442 | 3454 tick_lcrecord_stats (const struct lrecord_header *h, int free_p) |
| 428 | 3455 { |
| 647 | 3456 int type_index = h->type; |
| 428 | 3457 |
| 3024 | 3458 if (((struct old_lcrecord_header *) h)->free) |
| 428 | 3459 { |
| 442 | 3460 gc_checking_assert (!free_p); |
| 428 | 3461 lcrecord_stats[type_index].instances_on_free_list++; |
| 3462 } | |
| 3463 else | |
| 3464 { | |
| 1204 | 3465 Bytecount sz = detagged_lisp_object_size (h); |
| 3466 | |
| 428 | 3467 if (free_p) |
| 3468 { | |
| 3469 lcrecord_stats[type_index].instances_freed++; | |
| 3470 lcrecord_stats[type_index].bytes_freed += sz; | |
| 3471 } | |
| 3472 else | |
| 3473 { | |
| 3474 lcrecord_stats[type_index].instances_in_use++; | |
| 3475 lcrecord_stats[type_index].bytes_in_use += sz; | |
| 3476 } | |
| 3477 } | |
| 3478 } | |
| 3263 | 3479 #endif /* not NEW_GC */ |
| 428 | 3480 |
| 3481 | |
| 3263 | 3482 #ifndef NEW_GC |
| 428 | 3483 /* Free all unmarked records */ |
| 3484 static void | |
| 3024 | 3485 sweep_lcrecords_1 (struct old_lcrecord_header **prev, int *used) |
| 3486 { | |
| 3487 struct old_lcrecord_header *header; | |
| 428 | 3488 int num_used = 0; |
| 3489 /* int total_size = 0; */ | |
| 3490 | |
| 3491 xzero (lcrecord_stats); /* Reset all statistics to 0. */ | |
| 3492 | |
| 3493 /* First go through and call all the finalize methods. | |
| 3494 Then go through and free the objects. There used to | |
| 3495 be only one loop here, with the call to the finalizer | |
| 3496 occurring directly before the xfree() below. That | |
| 3497 is marginally faster but much less safe -- if the | |
| 3498 finalize method for an object needs to reference any | |
| 3499 other objects contained within it (and many do), | |
| 3500 we could easily be screwed by having already freed that | |
| 3501 other object. */ | |
| 3502 | |
| 3503 for (header = *prev; header; header = header->next) | |
| 3504 { | |
| 3505 struct lrecord_header *h = &(header->lheader); | |
| 442 | 3506 |
| 3507 GC_CHECK_LHEADER_INVARIANTS (h); | |
| 3508 | |
| 3509 if (! MARKED_RECORD_HEADER_P (h) && ! header->free) | |
| 428 | 3510 { |
| 3511 if (LHEADER_IMPLEMENTATION (h)->finalizer) | |
| 3512 LHEADER_IMPLEMENTATION (h)->finalizer (h, 0); | |
| 3513 } | |
| 3514 } | |
| 3515 | |
| 3516 for (header = *prev; header; ) | |
| 3517 { | |
| 3518 struct lrecord_header *h = &(header->lheader); | |
| 442 | 3519 if (MARKED_RECORD_HEADER_P (h)) |
| 428 | 3520 { |
| 442 | 3521 if (! C_READONLY_RECORD_HEADER_P (h)) |
| 428 | 3522 UNMARK_RECORD_HEADER (h); |
| 3523 num_used++; | |
| 3524 /* total_size += n->implementation->size_in_bytes (h);*/ | |
| 440 | 3525 /* #### May modify header->next on a C_READONLY lcrecord */ |
| 428 | 3526 prev = &(header->next); |
| 3527 header = *prev; | |
| 3528 tick_lcrecord_stats (h, 0); | |
| 3529 } | |
| 3530 else | |
| 3531 { | |
| 3024 | 3532 struct old_lcrecord_header *next = header->next; |
| 428 | 3533 *prev = next; |
| 3534 tick_lcrecord_stats (h, 1); | |
| 3535 /* used to call finalizer right here. */ | |
| 3024 | 3536 xfree (header, struct old_lcrecord_header *); |
| 428 | 3537 header = next; |
| 3538 } | |
| 3539 } | |
| 3540 *used = num_used; | |
| 3541 /* *total = total_size; */ | |
| 3542 } | |
| 3543 | |
| 3544 /* And the Lord said: Thou shalt use the `c-backslash-region' command | |
| 3545 to make macros prettier. */ | |
| 3546 | |
| 3547 #ifdef ERROR_CHECK_GC | |
| 3548 | |
| 771 | 3549 #define SWEEP_FIXED_TYPE_BLOCK_1(typename, obj_type, lheader) \ |
| 428 | 3550 do { \ |
| 3551 struct typename##_block *SFTB_current; \ | |
| 3552 int SFTB_limit; \ | |
| 3553 int num_free = 0, num_used = 0; \ | |
| 3554 \ | |
| 444 | 3555 for (SFTB_current = current_##typename##_block, \ |
| 428 | 3556 SFTB_limit = current_##typename##_block_index; \ |
| 3557 SFTB_current; \ | |
| 3558 ) \ | |
| 3559 { \ | |
| 3560 int SFTB_iii; \ | |
| 3561 \ | |
| 3562 for (SFTB_iii = 0; SFTB_iii < SFTB_limit; SFTB_iii++) \ | |
| 3563 { \ | |
| 3564 obj_type *SFTB_victim = &(SFTB_current->block[SFTB_iii]); \ | |
| 3565 \ | |
| 454 | 3566 if (LRECORD_FREE_P (SFTB_victim)) \ |
| 428 | 3567 { \ |
| 3568 num_free++; \ | |
| 3569 } \ | |
| 3570 else if (C_READONLY_RECORD_HEADER_P (&SFTB_victim->lheader)) \ | |
| 3571 { \ | |
| 3572 num_used++; \ | |
| 3573 } \ | |
| 442 | 3574 else if (! MARKED_RECORD_HEADER_P (&SFTB_victim->lheader)) \ |
| 428 | 3575 { \ |
| 3576 num_free++; \ | |
| 3577 FREE_FIXED_TYPE (typename, obj_type, SFTB_victim); \ | |
| 3578 } \ | |
| 3579 else \ | |
| 3580 { \ | |
| 3581 num_used++; \ | |
| 3582 UNMARK_##typename (SFTB_victim); \ | |
| 3583 } \ | |
| 3584 } \ | |
| 3585 SFTB_current = SFTB_current->prev; \ | |
| 3586 SFTB_limit = countof (current_##typename##_block->block); \ | |
| 3587 } \ | |
| 3588 \ | |
| 3589 gc_count_num_##typename##_in_use = num_used; \ | |
| 3590 gc_count_num_##typename##_freelist = num_free; \ | |
| 3591 } while (0) | |
| 3592 | |
| 3593 #else /* !ERROR_CHECK_GC */ | |
| 3594 | |
| 771 | 3595 #define SWEEP_FIXED_TYPE_BLOCK_1(typename, obj_type, lheader) \ |
| 3596 do { \ | |
| 3597 struct typename##_block *SFTB_current; \ | |
| 3598 struct typename##_block **SFTB_prev; \ | |
| 3599 int SFTB_limit; \ | |
| 3600 int num_free = 0, num_used = 0; \ | |
| 3601 \ | |
| 3602 typename##_free_list = 0; \ | |
| 3603 \ | |
| 3604 for (SFTB_prev = ¤t_##typename##_block, \ | |
| 3605 SFTB_current = current_##typename##_block, \ | |
| 3606 SFTB_limit = current_##typename##_block_index; \ | |
| 3607 SFTB_current; \ | |
| 3608 ) \ | |
| 3609 { \ | |
| 3610 int SFTB_iii; \ | |
| 3611 int SFTB_empty = 1; \ | |
| 3612 Lisp_Free *SFTB_old_free_list = typename##_free_list; \ | |
| 3613 \ | |
| 3614 for (SFTB_iii = 0; SFTB_iii < SFTB_limit; SFTB_iii++) \ | |
| 3615 { \ | |
| 3616 obj_type *SFTB_victim = &(SFTB_current->block[SFTB_iii]); \ | |
| 3617 \ | |
| 3618 if (LRECORD_FREE_P (SFTB_victim)) \ | |
| 3619 { \ | |
| 3620 num_free++; \ | |
| 3621 PUT_FIXED_TYPE_ON_FREE_LIST (typename, obj_type, SFTB_victim); \ | |
| 3622 } \ | |
| 3623 else if (C_READONLY_RECORD_HEADER_P (&SFTB_victim->lheader)) \ | |
| 3624 { \ | |
| 3625 SFTB_empty = 0; \ | |
| 3626 num_used++; \ | |
| 3627 } \ | |
| 3628 else if (! MARKED_RECORD_HEADER_P (&SFTB_victim->lheader)) \ | |
| 3629 { \ | |
| 3630 num_free++; \ | |
| 3631 FREE_FIXED_TYPE (typename, obj_type, SFTB_victim); \ | |
| 3632 } \ | |
| 3633 else \ | |
| 3634 { \ | |
| 3635 SFTB_empty = 0; \ | |
| 3636 num_used++; \ | |
| 3637 UNMARK_##typename (SFTB_victim); \ | |
| 3638 } \ | |
| 3639 } \ | |
| 3640 if (!SFTB_empty) \ | |
| 3641 { \ | |
| 3642 SFTB_prev = &(SFTB_current->prev); \ | |
| 3643 SFTB_current = SFTB_current->prev; \ | |
| 3644 } \ | |
| 3645 else if (SFTB_current == current_##typename##_block \ | |
| 3646 && !SFTB_current->prev) \ | |
| 3647 { \ | |
| 3648 /* No real point in freeing sole allocation block */ \ | |
| 3649 break; \ | |
| 3650 } \ | |
| 3651 else \ | |
| 3652 { \ | |
| 3653 struct typename##_block *SFTB_victim_block = SFTB_current; \ | |
| 3654 if (SFTB_victim_block == current_##typename##_block) \ | |
| 3655 current_##typename##_block_index \ | |
| 3656 = countof (current_##typename##_block->block); \ | |
| 3657 SFTB_current = SFTB_current->prev; \ | |
| 3658 { \ | |
| 3659 *SFTB_prev = SFTB_current; \ | |
| 1726 | 3660 xfree (SFTB_victim_block, struct typename##_block *); \ |
| 771 | 3661 /* Restore free list to what it was before victim was swept */ \ |
| 3662 typename##_free_list = SFTB_old_free_list; \ | |
| 3663 num_free -= SFTB_limit; \ | |
| 3664 } \ | |
| 3665 } \ | |
| 3666 SFTB_limit = countof (current_##typename##_block->block); \ | |
| 3667 } \ | |
| 3668 \ | |
| 3669 gc_count_num_##typename##_in_use = num_used; \ | |
| 3670 gc_count_num_##typename##_freelist = num_free; \ | |
| 428 | 3671 } while (0) |
| 3672 | |
| 3673 #endif /* !ERROR_CHECK_GC */ | |
| 3674 | |
| 771 | 3675 #define SWEEP_FIXED_TYPE_BLOCK(typename, obj_type) \ |
| 3676 SWEEP_FIXED_TYPE_BLOCK_1 (typename, obj_type, lheader) | |
| 3677 | |
| 3263 | 3678 #endif /* not NEW_GC */ |
| 2720 | 3679 |
| 428 | 3680 |
| 3263 | 3681 #ifndef NEW_GC |
| 428 | 3682 static void |
| 3683 sweep_conses (void) | |
| 3684 { | |
| 3685 #define UNMARK_cons(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3686 #define ADDITIONAL_FREE_cons(ptr) | |
| 3687 | |
| 440 | 3688 SWEEP_FIXED_TYPE_BLOCK (cons, Lisp_Cons); |
| 428 | 3689 } |
| 3263 | 3690 #endif /* not NEW_GC */ |
| 428 | 3691 |
| 3692 /* Explicitly free a cons cell. */ | |
| 3693 void | |
| 853 | 3694 free_cons (Lisp_Object cons) |
| 428 | 3695 { |
| 3263 | 3696 #ifndef NEW_GC /* to avoid compiler warning */ |
| 853 | 3697 Lisp_Cons *ptr = XCONS (cons); |
| 3263 | 3698 #endif /* not NEW_GC */ |
| 853 | 3699 |
| 428 | 3700 #ifdef ERROR_CHECK_GC |
| 3263 | 3701 #ifdef NEW_GC |
| 2720 | 3702 Lisp_Cons *ptr = XCONS (cons); |
| 3263 | 3703 #endif /* NEW_GC */ |
| 428 | 3704 /* If the CAR is not an int, then it will be a pointer, which will |
| 3705 always be four-byte aligned. If this cons cell has already been | |
| 3706 placed on the free list, however, its car will probably contain | |
| 3707 a chain pointer to the next cons on the list, which has cleverly | |
| 3708 had all its 0's and 1's inverted. This allows for a quick | |
| 1204 | 3709 check to make sure we're not freeing something already freed. |
| 3710 | |
| 3711 NOTE: This check may not be necessary. Freeing an object sets its | |
| 3712 type to lrecord_type_free, which will trip up the XCONS() above -- as | |
| 3713 well as a check in FREE_FIXED_TYPE(). */ | |
| 853 | 3714 if (POINTER_TYPE_P (XTYPE (cons_car (ptr)))) |
| 3715 ASSERT_VALID_POINTER (XPNTR (cons_car (ptr))); | |
| 428 | 3716 #endif /* ERROR_CHECK_GC */ |
| 3717 | |
| 3263 | 3718 #ifdef NEW_GC |
| 2720 | 3719 free_lrecord (cons); |
| 3263 | 3720 #else /* not NEW_GC */ |
| 440 | 3721 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (cons, Lisp_Cons, ptr); |
| 3263 | 3722 #endif /* not NEW_GC */ |
| 428 | 3723 } |
| 3724 | |
| 3725 /* explicitly free a list. You **must make sure** that you have | |
| 3726 created all the cons cells that make up this list and that there | |
| 3727 are no pointers to any of these cons cells anywhere else. If there | |
| 3728 are, you will lose. */ | |
| 3729 | |
| 3730 void | |
| 3731 free_list (Lisp_Object list) | |
| 3732 { | |
| 3733 Lisp_Object rest, next; | |
| 3734 | |
| 3735 for (rest = list; !NILP (rest); rest = next) | |
| 3736 { | |
| 3737 next = XCDR (rest); | |
| 853 | 3738 free_cons (rest); |
| 428 | 3739 } |
| 3740 } | |
| 3741 | |
| 3742 /* explicitly free an alist. You **must make sure** that you have | |
| 3743 created all the cons cells that make up this alist and that there | |
| 3744 are no pointers to any of these cons cells anywhere else. If there | |
| 3745 are, you will lose. */ | |
| 3746 | |
| 3747 void | |
| 3748 free_alist (Lisp_Object alist) | |
| 3749 { | |
| 3750 Lisp_Object rest, next; | |
| 3751 | |
| 3752 for (rest = alist; !NILP (rest); rest = next) | |
| 3753 { | |
| 3754 next = XCDR (rest); | |
| 853 | 3755 free_cons (XCAR (rest)); |
| 3756 free_cons (rest); | |
| 428 | 3757 } |
| 3758 } | |
| 3759 | |
| 3263 | 3760 #ifndef NEW_GC |
| 428 | 3761 static void |
| 3762 sweep_compiled_functions (void) | |
| 3763 { | |
| 3764 #define UNMARK_compiled_function(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 945 | 3765 #define ADDITIONAL_FREE_compiled_function(ptr) \ |
| 1726 | 3766 if (ptr->args_in_array) xfree (ptr->args, Lisp_Object *) |
| 428 | 3767 |
| 3768 SWEEP_FIXED_TYPE_BLOCK (compiled_function, Lisp_Compiled_Function); | |
| 3769 } | |
| 3770 | |
| 3771 static void | |
| 3772 sweep_floats (void) | |
| 3773 { | |
| 3774 #define UNMARK_float(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3775 #define ADDITIONAL_FREE_float(ptr) | |
| 3776 | |
| 440 | 3777 SWEEP_FIXED_TYPE_BLOCK (float, Lisp_Float); |
| 428 | 3778 } |
| 3779 | |
| 1983 | 3780 #ifdef HAVE_BIGNUM |
| 3781 static void | |
| 3782 sweep_bignums (void) | |
| 3783 { | |
| 3784 #define UNMARK_bignum(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3785 #define ADDITIONAL_FREE_bignum(ptr) bignum_fini (ptr->data) | |
| 3786 | |
| 3787 SWEEP_FIXED_TYPE_BLOCK (bignum, Lisp_Bignum); | |
| 3788 } | |
| 3789 #endif /* HAVE_BIGNUM */ | |
| 3790 | |
| 3791 #ifdef HAVE_RATIO | |
| 3792 static void | |
| 3793 sweep_ratios (void) | |
| 3794 { | |
| 3795 #define UNMARK_ratio(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3796 #define ADDITIONAL_FREE_ratio(ptr) ratio_fini (ptr->data) | |
| 3797 | |
| 3798 SWEEP_FIXED_TYPE_BLOCK (ratio, Lisp_Ratio); | |
| 3799 } | |
| 3800 #endif /* HAVE_RATIO */ | |
| 3801 | |
| 3802 #ifdef HAVE_BIGFLOAT | |
| 3803 static void | |
| 3804 sweep_bigfloats (void) | |
| 3805 { | |
| 3806 #define UNMARK_bigfloat(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3807 #define ADDITIONAL_FREE_bigfloat(ptr) bigfloat_fini (ptr->bf) | |
| 3808 | |
| 3809 SWEEP_FIXED_TYPE_BLOCK (bigfloat, Lisp_Bigfloat); | |
| 3810 } | |
| 3811 #endif | |
| 3812 | |
| 428 | 3813 static void |
| 3814 sweep_symbols (void) | |
| 3815 { | |
| 3816 #define UNMARK_symbol(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3817 #define ADDITIONAL_FREE_symbol(ptr) | |
| 3818 | |
| 440 | 3819 SWEEP_FIXED_TYPE_BLOCK (symbol, Lisp_Symbol); |
| 428 | 3820 } |
| 3821 | |
| 3822 static void | |
| 3823 sweep_extents (void) | |
| 3824 { | |
| 3825 #define UNMARK_extent(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3826 #define ADDITIONAL_FREE_extent(ptr) | |
| 3827 | |
| 3828 SWEEP_FIXED_TYPE_BLOCK (extent, struct extent); | |
| 3829 } | |
| 3830 | |
| 3831 static void | |
| 3832 sweep_events (void) | |
| 3833 { | |
| 3834 #define UNMARK_event(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3835 #define ADDITIONAL_FREE_event(ptr) | |
| 3836 | |
| 440 | 3837 SWEEP_FIXED_TYPE_BLOCK (event, Lisp_Event); |
| 428 | 3838 } |
| 3263 | 3839 #endif /* not NEW_GC */ |
| 428 | 3840 |
| 1204 | 3841 #ifdef EVENT_DATA_AS_OBJECTS |
| 934 | 3842 |
| 3263 | 3843 #ifndef NEW_GC |
| 934 | 3844 static void |
| 3845 sweep_key_data (void) | |
| 3846 { | |
| 3847 #define UNMARK_key_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3848 #define ADDITIONAL_FREE_key_data(ptr) | |
| 3849 | |
| 3850 SWEEP_FIXED_TYPE_BLOCK (key_data, Lisp_Key_Data); | |
| 3851 } | |
| 3263 | 3852 #endif /* not NEW_GC */ |
| 934 | 3853 |
| 1204 | 3854 void |
| 3855 free_key_data (Lisp_Object ptr) | |
| 3856 { | |
| 3263 | 3857 #ifdef NEW_GC |
| 2720 | 3858 free_lrecord (ptr); |
| 3263 | 3859 #else /* not NEW_GC */ |
| 1204 | 3860 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (key_data, Lisp_Key_Data, XKEY_DATA (ptr)); |
| 3263 | 3861 #endif /* not NEW_GC */ |
| 2720 | 3862 } |
| 3863 | |
| 3263 | 3864 #ifndef NEW_GC |
| 934 | 3865 static void |
| 3866 sweep_button_data (void) | |
| 3867 { | |
| 3868 #define UNMARK_button_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3869 #define ADDITIONAL_FREE_button_data(ptr) | |
| 3870 | |
| 3871 SWEEP_FIXED_TYPE_BLOCK (button_data, Lisp_Button_Data); | |
| 3872 } | |
| 3263 | 3873 #endif /* not NEW_GC */ |
| 934 | 3874 |
| 1204 | 3875 void |
| 3876 free_button_data (Lisp_Object ptr) | |
| 3877 { | |
| 3263 | 3878 #ifdef NEW_GC |
| 2720 | 3879 free_lrecord (ptr); |
| 3263 | 3880 #else /* not NEW_GC */ |
| 1204 | 3881 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (button_data, Lisp_Button_Data, XBUTTON_DATA (ptr)); |
| 3263 | 3882 #endif /* not NEW_GC */ |
| 2720 | 3883 } |
| 3884 | |
| 3263 | 3885 #ifndef NEW_GC |
| 934 | 3886 static void |
| 3887 sweep_motion_data (void) | |
| 3888 { | |
| 3889 #define UNMARK_motion_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3890 #define ADDITIONAL_FREE_motion_data(ptr) | |
| 3891 | |
| 3892 SWEEP_FIXED_TYPE_BLOCK (motion_data, Lisp_Motion_Data); | |
| 3893 } | |
| 3263 | 3894 #endif /* not NEW_GC */ |
| 934 | 3895 |
| 1204 | 3896 void |
| 3897 free_motion_data (Lisp_Object ptr) | |
| 3898 { | |
| 3263 | 3899 #ifdef NEW_GC |
| 2720 | 3900 free_lrecord (ptr); |
| 3263 | 3901 #else /* not NEW_GC */ |
| 1204 | 3902 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (motion_data, Lisp_Motion_Data, XMOTION_DATA (ptr)); |
| 3263 | 3903 #endif /* not NEW_GC */ |
| 2720 | 3904 } |
| 3905 | |
| 3263 | 3906 #ifndef NEW_GC |
| 934 | 3907 static void |
| 3908 sweep_process_data (void) | |
| 3909 { | |
| 3910 #define UNMARK_process_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3911 #define ADDITIONAL_FREE_process_data(ptr) | |
| 3912 | |
| 3913 SWEEP_FIXED_TYPE_BLOCK (process_data, Lisp_Process_Data); | |
| 3914 } | |
| 3263 | 3915 #endif /* not NEW_GC */ |
| 934 | 3916 |
| 1204 | 3917 void |
| 3918 free_process_data (Lisp_Object ptr) | |
| 3919 { | |
| 3263 | 3920 #ifdef NEW_GC |
| 2720 | 3921 free_lrecord (ptr); |
| 3263 | 3922 #else /* not NEW_GC */ |
| 1204 | 3923 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (process_data, Lisp_Process_Data, XPROCESS_DATA (ptr)); |
| 3263 | 3924 #endif /* not NEW_GC */ |
| 2720 | 3925 } |
| 3926 | |
| 3263 | 3927 #ifndef NEW_GC |
| 934 | 3928 static void |
| 3929 sweep_timeout_data (void) | |
| 3930 { | |
| 3931 #define UNMARK_timeout_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3932 #define ADDITIONAL_FREE_timeout_data(ptr) | |
| 3933 | |
| 3934 SWEEP_FIXED_TYPE_BLOCK (timeout_data, Lisp_Timeout_Data); | |
| 3935 } | |
| 3263 | 3936 #endif /* not NEW_GC */ |
| 934 | 3937 |
| 1204 | 3938 void |
| 3939 free_timeout_data (Lisp_Object ptr) | |
| 3940 { | |
| 3263 | 3941 #ifdef NEW_GC |
| 2720 | 3942 free_lrecord (ptr); |
| 3263 | 3943 #else /* not NEW_GC */ |
| 1204 | 3944 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (timeout_data, Lisp_Timeout_Data, XTIMEOUT_DATA (ptr)); |
| 3263 | 3945 #endif /* not NEW_GC */ |
| 2720 | 3946 } |
| 3947 | |
| 3263 | 3948 #ifndef NEW_GC |
| 934 | 3949 static void |
| 3950 sweep_magic_data (void) | |
| 3951 { | |
| 3952 #define UNMARK_magic_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3953 #define ADDITIONAL_FREE_magic_data(ptr) | |
| 3954 | |
| 3955 SWEEP_FIXED_TYPE_BLOCK (magic_data, Lisp_Magic_Data); | |
| 3956 } | |
| 3263 | 3957 #endif /* not NEW_GC */ |
| 934 | 3958 |
| 1204 | 3959 void |
| 3960 free_magic_data (Lisp_Object ptr) | |
| 3961 { | |
| 3263 | 3962 #ifdef NEW_GC |
| 2720 | 3963 free_lrecord (ptr); |
| 3263 | 3964 #else /* not NEW_GC */ |
| 1204 | 3965 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (magic_data, Lisp_Magic_Data, XMAGIC_DATA (ptr)); |
| 3263 | 3966 #endif /* not NEW_GC */ |
| 2720 | 3967 } |
| 3968 | |
| 3263 | 3969 #ifndef NEW_GC |
| 934 | 3970 static void |
| 3971 sweep_magic_eval_data (void) | |
| 3972 { | |
| 3973 #define UNMARK_magic_eval_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3974 #define ADDITIONAL_FREE_magic_eval_data(ptr) | |
| 3975 | |
| 3976 SWEEP_FIXED_TYPE_BLOCK (magic_eval_data, Lisp_Magic_Eval_Data); | |
| 3977 } | |
| 3263 | 3978 #endif /* not NEW_GC */ |
| 934 | 3979 |
| 1204 | 3980 void |
| 3981 free_magic_eval_data (Lisp_Object ptr) | |
| 3982 { | |
| 3263 | 3983 #ifdef NEW_GC |
| 2720 | 3984 free_lrecord (ptr); |
| 3263 | 3985 #else /* not NEW_GC */ |
| 1204 | 3986 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (magic_eval_data, Lisp_Magic_Eval_Data, XMAGIC_EVAL_DATA (ptr)); |
| 3263 | 3987 #endif /* not NEW_GC */ |
| 2720 | 3988 } |
| 3989 | |
| 3263 | 3990 #ifndef NEW_GC |
| 934 | 3991 static void |
| 3992 sweep_eval_data (void) | |
| 3993 { | |
| 3994 #define UNMARK_eval_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 3995 #define ADDITIONAL_FREE_eval_data(ptr) | |
| 3996 | |
| 3997 SWEEP_FIXED_TYPE_BLOCK (eval_data, Lisp_Eval_Data); | |
| 3998 } | |
| 3263 | 3999 #endif /* not NEW_GC */ |
| 934 | 4000 |
| 1204 | 4001 void |
| 4002 free_eval_data (Lisp_Object ptr) | |
| 4003 { | |
| 3263 | 4004 #ifdef NEW_GC |
| 2720 | 4005 free_lrecord (ptr); |
| 3263 | 4006 #else /* not NEW_GC */ |
| 1204 | 4007 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (eval_data, Lisp_Eval_Data, XEVAL_DATA (ptr)); |
| 3263 | 4008 #endif /* not NEW_GC */ |
| 2720 | 4009 } |
| 4010 | |
| 3263 | 4011 #ifndef NEW_GC |
| 934 | 4012 static void |
| 4013 sweep_misc_user_data (void) | |
| 4014 { | |
| 4015 #define UNMARK_misc_user_data(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 4016 #define ADDITIONAL_FREE_misc_user_data(ptr) | |
| 4017 | |
| 4018 SWEEP_FIXED_TYPE_BLOCK (misc_user_data, Lisp_Misc_User_Data); | |
| 4019 } | |
| 3263 | 4020 #endif /* not NEW_GC */ |
| 934 | 4021 |
| 1204 | 4022 void |
| 4023 free_misc_user_data (Lisp_Object ptr) | |
| 4024 { | |
| 3263 | 4025 #ifdef NEW_GC |
| 2720 | 4026 free_lrecord (ptr); |
| 3263 | 4027 #else /* not NEW_GC */ |
| 1204 | 4028 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (misc_user_data, Lisp_Misc_User_Data, XMISC_USER_DATA (ptr)); |
| 3263 | 4029 #endif /* not NEW_GC */ |
| 1204 | 4030 } |
| 4031 | |
| 4032 #endif /* EVENT_DATA_AS_OBJECTS */ | |
| 934 | 4033 |
| 3263 | 4034 #ifndef NEW_GC |
| 428 | 4035 static void |
| 4036 sweep_markers (void) | |
| 4037 { | |
| 4038 #define UNMARK_marker(ptr) UNMARK_RECORD_HEADER (&((ptr)->lheader)) | |
| 4039 #define ADDITIONAL_FREE_marker(ptr) \ | |
| 4040 do { Lisp_Object tem; \ | |
| 793 | 4041 tem = wrap_marker (ptr); \ |
| 428 | 4042 unchain_marker (tem); \ |
| 4043 } while (0) | |
| 4044 | |
| 440 | 4045 SWEEP_FIXED_TYPE_BLOCK (marker, Lisp_Marker); |
| 428 | 4046 } |
| 3263 | 4047 #endif /* not NEW_GC */ |
| 428 | 4048 |
| 4049 /* Explicitly free a marker. */ | |
| 4050 void | |
| 1204 | 4051 free_marker (Lisp_Object ptr) |
| 428 | 4052 { |
| 3263 | 4053 #ifdef NEW_GC |
| 2720 | 4054 free_lrecord (ptr); |
| 3263 | 4055 #else /* not NEW_GC */ |
| 1204 | 4056 FREE_FIXED_TYPE_WHEN_NOT_IN_GC (marker, Lisp_Marker, XMARKER (ptr)); |
| 3263 | 4057 #endif /* not NEW_GC */ |
| 428 | 4058 } |
| 4059 | |
| 4060 | |
| 4061 #if defined (MULE) && defined (VERIFY_STRING_CHARS_INTEGRITY) | |
| 4062 | |
| 4063 static void | |
| 4064 verify_string_chars_integrity (void) | |
| 4065 { | |
| 4066 struct string_chars_block *sb; | |
| 4067 | |
| 4068 /* Scan each existing string block sequentially, string by string. */ | |
| 4069 for (sb = first_string_chars_block; sb; sb = sb->next) | |
| 4070 { | |
| 4071 int pos = 0; | |
| 4072 /* POS is the index of the next string in the block. */ | |
| 4073 while (pos < sb->pos) | |
| 4074 { | |
| 4075 struct string_chars *s_chars = | |
| 4076 (struct string_chars *) &(sb->string_chars[pos]); | |
| 438 | 4077 Lisp_String *string; |
| 428 | 4078 int size; |
| 4079 int fullsize; | |
| 4080 | |
| 454 | 4081 /* If the string_chars struct is marked as free (i.e. the |
| 4082 STRING pointer is NULL) then this is an unused chunk of | |
| 4083 string storage. (See below.) */ | |
| 4084 | |
| 4085 if (STRING_CHARS_FREE_P (s_chars)) | |
| 428 | 4086 { |
| 4087 fullsize = ((struct unused_string_chars *) s_chars)->fullsize; | |
| 4088 pos += fullsize; | |
| 4089 continue; | |
| 4090 } | |
| 4091 | |
| 4092 string = s_chars->string; | |
| 4093 /* Must be 32-bit aligned. */ | |
| 4094 assert ((((int) string) & 3) == 0); | |
| 4095 | |
| 793 | 4096 size = string->size_; |
| 428 | 4097 fullsize = STRING_FULLSIZE (size); |
| 4098 | |
| 4099 assert (!BIG_STRING_FULLSIZE_P (fullsize)); | |
| 2720 | 4100 assert (XSTRING_DATA (string) == s_chars->chars); |
| 428 | 4101 pos += fullsize; |
| 4102 } | |
| 4103 assert (pos == sb->pos); | |
| 4104 } | |
| 4105 } | |
| 4106 | |
| 1204 | 4107 #endif /* defined (MULE) && defined (VERIFY_STRING_CHARS_INTEGRITY) */ |
| 428 | 4108 |
| 3092 | 4109 #ifndef NEW_GC |
| 428 | 4110 /* Compactify string chars, relocating the reference to each -- |
| 4111 free any empty string_chars_block we see. */ | |
| 3092 | 4112 void |
| 428 | 4113 compact_string_chars (void) |
| 4114 { | |
| 4115 struct string_chars_block *to_sb = first_string_chars_block; | |
| 4116 int to_pos = 0; | |
| 4117 struct string_chars_block *from_sb; | |
| 4118 | |
| 4119 /* Scan each existing string block sequentially, string by string. */ | |
| 4120 for (from_sb = first_string_chars_block; from_sb; from_sb = from_sb->next) | |
| 4121 { | |
| 4122 int from_pos = 0; | |
| 4123 /* FROM_POS is the index of the next string in the block. */ | |
| 4124 while (from_pos < from_sb->pos) | |
| 4125 { | |
| 4126 struct string_chars *from_s_chars = | |
| 4127 (struct string_chars *) &(from_sb->string_chars[from_pos]); | |
| 4128 struct string_chars *to_s_chars; | |
| 438 | 4129 Lisp_String *string; |
| 428 | 4130 int size; |
| 4131 int fullsize; | |
| 4132 | |
| 454 | 4133 /* If the string_chars struct is marked as free (i.e. the |
| 4134 STRING pointer is NULL) then this is an unused chunk of | |
| 4135 string storage. This happens under Mule when a string's | |
| 4136 size changes in such a way that its fullsize changes. | |
| 4137 (Strings can change size because a different-length | |
| 4138 character can be substituted for another character.) | |
| 4139 In this case, after the bogus string pointer is the | |
| 4140 "fullsize" of this entry, i.e. how many bytes to skip. */ | |
| 4141 | |
| 4142 if (STRING_CHARS_FREE_P (from_s_chars)) | |
| 428 | 4143 { |
| 4144 fullsize = ((struct unused_string_chars *) from_s_chars)->fullsize; | |
| 4145 from_pos += fullsize; | |
| 4146 continue; | |
| 4147 } | |
| 4148 | |
| 4149 string = from_s_chars->string; | |
| 1204 | 4150 gc_checking_assert (!(LRECORD_FREE_P (string))); |
| 428 | 4151 |
| 793 | 4152 size = string->size_; |
| 428 | 4153 fullsize = STRING_FULLSIZE (size); |
| 4154 | |
| 442 | 4155 gc_checking_assert (! BIG_STRING_FULLSIZE_P (fullsize)); |
| 428 | 4156 |
| 4157 /* Just skip it if it isn't marked. */ | |
| 771 | 4158 if (! MARKED_RECORD_HEADER_P (&(string->u.lheader))) |
| 428 | 4159 { |
| 4160 from_pos += fullsize; | |
| 4161 continue; | |
| 4162 } | |
| 4163 | |
| 4164 /* If it won't fit in what's left of TO_SB, close TO_SB out | |
| 4165 and go on to the next string_chars_block. We know that TO_SB | |
| 4166 cannot advance past FROM_SB here since FROM_SB is large enough | |
| 4167 to currently contain this string. */ | |
| 4168 if ((to_pos + fullsize) > countof (to_sb->string_chars)) | |
| 4169 { | |
| 4170 to_sb->pos = to_pos; | |
| 4171 to_sb = to_sb->next; | |
| 4172 to_pos = 0; | |
| 4173 } | |
| 4174 | |
| 4175 /* Compute new address of this string | |
| 4176 and update TO_POS for the space being used. */ | |
| 4177 to_s_chars = (struct string_chars *) &(to_sb->string_chars[to_pos]); | |
| 4178 | |
| 4179 /* Copy the string_chars to the new place. */ | |
| 4180 if (from_s_chars != to_s_chars) | |
| 4181 memmove (to_s_chars, from_s_chars, fullsize); | |
| 4182 | |
| 4183 /* Relocate FROM_S_CHARS's reference */ | |
| 826 | 4184 set_lispstringp_data (string, &(to_s_chars->chars[0])); |
| 428 | 4185 |
| 4186 from_pos += fullsize; | |
| 4187 to_pos += fullsize; | |
| 4188 } | |
| 4189 } | |
| 4190 | |
| 4191 /* Set current to the last string chars block still used and | |
| 4192 free any that follow. */ | |
| 4193 { | |
| 4194 struct string_chars_block *victim; | |
| 4195 | |
| 4196 for (victim = to_sb->next; victim; ) | |
| 4197 { | |
| 4198 struct string_chars_block *next = victim->next; | |
| 1726 | 4199 xfree (victim, struct string_chars_block *); |
| 428 | 4200 victim = next; |
| 4201 } | |
| 4202 | |
| 4203 current_string_chars_block = to_sb; | |
| 4204 current_string_chars_block->pos = to_pos; | |
| 4205 current_string_chars_block->next = 0; | |
| 4206 } | |
| 4207 } | |
| 3092 | 4208 #endif /* not NEW_GC */ |
| 428 | 4209 |
| 3263 | 4210 #ifndef NEW_GC |
| 428 | 4211 #if 1 /* Hack to debug missing purecopy's */ |
| 4212 static int debug_string_purity; | |
| 4213 | |
| 4214 static void | |
| 793 | 4215 debug_string_purity_print (Lisp_Object p) |
| 428 | 4216 { |
| 4217 Charcount i; | |
| 826 | 4218 Charcount s = string_char_length (p); |
| 442 | 4219 stderr_out ("\""); |
| 428 | 4220 for (i = 0; i < s; i++) |
| 4221 { | |
| 867 | 4222 Ichar ch = string_ichar (p, i); |
| 428 | 4223 if (ch < 32 || ch >= 126) |
| 4224 stderr_out ("\\%03o", ch); | |
| 4225 else if (ch == '\\' || ch == '\"') | |
| 4226 stderr_out ("\\%c", ch); | |
| 4227 else | |
| 4228 stderr_out ("%c", ch); | |
| 4229 } | |
| 4230 stderr_out ("\"\n"); | |
| 4231 } | |
| 4232 #endif /* 1 */ | |
| 3263 | 4233 #endif /* not NEW_GC */ |
| 4234 | |
| 4235 #ifndef NEW_GC | |
| 428 | 4236 static void |
| 4237 sweep_strings (void) | |
| 4238 { | |
| 647 | 4239 int num_small_used = 0; |
| 4240 Bytecount num_small_bytes = 0, num_bytes = 0; | |
| 428 | 4241 int debug = debug_string_purity; |
| 4242 | |
| 793 | 4243 #define UNMARK_string(ptr) do { \ |
| 4244 Lisp_String *p = (ptr); \ | |
| 4245 Bytecount size = p->size_; \ | |
| 4246 UNMARK_RECORD_HEADER (&(p->u.lheader)); \ | |
| 4247 num_bytes += size; \ | |
| 4248 if (!BIG_STRING_SIZE_P (size)) \ | |
| 4249 { \ | |
| 4250 num_small_bytes += size; \ | |
| 4251 num_small_used++; \ | |
| 4252 } \ | |
| 4253 if (debug) \ | |
| 4254 debug_string_purity_print (wrap_string (p)); \ | |
| 438 | 4255 } while (0) |
| 4256 #define ADDITIONAL_FREE_string(ptr) do { \ | |
| 793 | 4257 Bytecount size = ptr->size_; \ |
| 438 | 4258 if (BIG_STRING_SIZE_P (size)) \ |
| 1726 | 4259 xfree (ptr->data_, Ibyte *); \ |
| 438 | 4260 } while (0) |
| 4261 | |
| 771 | 4262 SWEEP_FIXED_TYPE_BLOCK_1 (string, Lisp_String, u.lheader); |
| 428 | 4263 |
| 4264 gc_count_num_short_string_in_use = num_small_used; | |
| 4265 gc_count_string_total_size = num_bytes; | |
| 4266 gc_count_short_string_total_size = num_small_bytes; | |
| 4267 } | |
| 3263 | 4268 #endif /* not NEW_GC */ |
| 428 | 4269 |
| 3092 | 4270 #ifndef NEW_GC |
| 4271 void | |
| 4272 gc_sweep_1 (void) | |
| 428 | 4273 { |
| 4274 /* Free all unmarked records. Do this at the very beginning, | |
| 4275 before anything else, so that the finalize methods can safely | |
| 4276 examine items in the objects. sweep_lcrecords_1() makes | |
| 4277 sure to call all the finalize methods *before* freeing anything, | |
| 4278 to complete the safety. */ | |
| 4279 { | |
| 4280 int ignored; | |
| 4281 sweep_lcrecords_1 (&all_lcrecords, &ignored); | |
| 4282 } | |
| 4283 | |
| 4284 compact_string_chars (); | |
| 4285 | |
| 4286 /* Finalize methods below (called through the ADDITIONAL_FREE_foo | |
| 4287 macros) must be *extremely* careful to make sure they're not | |
| 4288 referencing freed objects. The only two existing finalize | |
| 4289 methods (for strings and markers) pass muster -- the string | |
| 4290 finalizer doesn't look at anything but its own specially- | |
| 4291 created block, and the marker finalizer only looks at live | |
| 4292 buffers (which will never be freed) and at the markers before | |
| 4293 and after it in the chain (which, by induction, will never be | |
| 4294 freed because if so, they would have already removed themselves | |
| 4295 from the chain). */ | |
| 4296 | |
| 4297 /* Put all unmarked strings on free list, free'ing the string chars | |
| 4298 of large unmarked strings */ | |
| 4299 sweep_strings (); | |
| 4300 | |
| 4301 /* Put all unmarked conses on free list */ | |
| 4302 sweep_conses (); | |
| 4303 | |
| 4304 /* Free all unmarked compiled-function objects */ | |
| 4305 sweep_compiled_functions (); | |
| 4306 | |
| 4307 /* Put all unmarked floats on free list */ | |
| 4308 sweep_floats (); | |
| 4309 | |
| 1983 | 4310 #ifdef HAVE_BIGNUM |
| 4311 /* Put all unmarked bignums on free list */ | |
| 4312 sweep_bignums (); | |
| 4313 #endif | |
| 4314 | |
| 4315 #ifdef HAVE_RATIO | |
| 4316 /* Put all unmarked ratios on free list */ | |
| 4317 sweep_ratios (); | |
| 4318 #endif | |
| 4319 | |
| 4320 #ifdef HAVE_BIGFLOAT | |
| 4321 /* Put all unmarked bigfloats on free list */ | |
| 4322 sweep_bigfloats (); | |
| 4323 #endif | |
| 4324 | |
| 428 | 4325 /* Put all unmarked symbols on free list */ |
| 4326 sweep_symbols (); | |
| 4327 | |
| 4328 /* Put all unmarked extents on free list */ | |
| 4329 sweep_extents (); | |
| 4330 | |
| 4331 /* Put all unmarked markers on free list. | |
| 4332 Dechain each one first from the buffer into which it points. */ | |
| 4333 sweep_markers (); | |
| 4334 | |
| 4335 sweep_events (); | |
| 4336 | |
| 1204 | 4337 #ifdef EVENT_DATA_AS_OBJECTS |
| 934 | 4338 sweep_key_data (); |
| 4339 sweep_button_data (); | |
| 4340 sweep_motion_data (); | |
| 4341 sweep_process_data (); | |
| 4342 sweep_timeout_data (); | |
| 4343 sweep_magic_data (); | |
| 4344 sweep_magic_eval_data (); | |
| 4345 sweep_eval_data (); | |
| 4346 sweep_misc_user_data (); | |
| 1204 | 4347 #endif /* EVENT_DATA_AS_OBJECTS */ |
| 3263 | 4348 #endif /* not NEW_GC */ |
| 4349 | |
| 4350 #ifndef NEW_GC | |
| 428 | 4351 #ifdef PDUMP |
| 442 | 4352 pdump_objects_unmark (); |
| 428 | 4353 #endif |
| 4354 } | |
| 3092 | 4355 #endif /* not NEW_GC */ |
| 428 | 4356 |
| 4357 /* Clearing for disksave. */ | |
| 4358 | |
| 4359 void | |
| 4360 disksave_object_finalization (void) | |
| 4361 { | |
| 4362 /* It's important that certain information from the environment not get | |
| 4363 dumped with the executable (pathnames, environment variables, etc.). | |
| 4364 To make it easier to tell when this has happened with strings(1) we | |
| 4365 clear some known-to-be-garbage blocks of memory, so that leftover | |
| 4366 results of old evaluation don't look like potential problems. | |
| 4367 But first we set some notable variables to nil and do one more GC, | |
| 4368 to turn those strings into garbage. | |
| 440 | 4369 */ |
| 428 | 4370 |
| 4371 /* Yeah, this list is pretty ad-hoc... */ | |
| 4372 Vprocess_environment = Qnil; | |
| 771 | 4373 env_initted = 0; |
| 428 | 4374 Vexec_directory = Qnil; |
| 4375 Vdata_directory = Qnil; | |
| 4376 Vsite_directory = Qnil; | |
| 4377 Vdoc_directory = Qnil; | |
| 4378 Vexec_path = Qnil; | |
| 4379 Vload_path = Qnil; | |
| 4380 /* Vdump_load_path = Qnil; */ | |
| 4381 /* Release hash tables for locate_file */ | |
| 4382 Flocate_file_clear_hashing (Qt); | |
| 771 | 4383 uncache_home_directory (); |
| 776 | 4384 zero_out_command_line_status_vars (); |
| 872 | 4385 clear_default_devices (); |
| 428 | 4386 |
| 4387 #if defined(LOADHIST) && !(defined(LOADHIST_DUMPED) || \ | |
| 4388 defined(LOADHIST_BUILTIN)) | |
| 4389 Vload_history = Qnil; | |
| 4390 #endif | |
| 4391 Vshell_file_name = Qnil; | |
| 4392 | |
| 3092 | 4393 #ifdef NEW_GC |
| 4394 gc_full (); | |
| 4395 #else /* not NEW_GC */ | |
| 428 | 4396 garbage_collect_1 (); |
| 3092 | 4397 #endif /* not NEW_GC */ |
| 428 | 4398 |
| 4399 /* Run the disksave finalization methods of all live objects. */ | |
| 4400 disksave_object_finalization_1 (); | |
| 4401 | |
| 3092 | 4402 #ifndef NEW_GC |
| 428 | 4403 /* Zero out the uninitialized (really, unused) part of the containers |
| 4404 for the live strings. */ | |
| 4405 { | |
| 4406 struct string_chars_block *scb; | |
| 4407 for (scb = first_string_chars_block; scb; scb = scb->next) | |
| 4408 { | |
| 4409 int count = sizeof (scb->string_chars) - scb->pos; | |
| 4410 | |
| 4411 assert (count >= 0 && count < STRING_CHARS_BLOCK_SIZE); | |
| 440 | 4412 if (count != 0) |
| 4413 { | |
| 4414 /* from the block's fill ptr to the end */ | |
| 4415 memset ((scb->string_chars + scb->pos), 0, count); | |
| 4416 } | |
| 428 | 4417 } |
| 4418 } | |
| 3092 | 4419 #endif /* not NEW_GC */ |
| 428 | 4420 |
| 4421 /* There, that ought to be enough... */ | |
| 4422 | |
| 4423 } | |
| 4424 | |
| 2994 | 4425 #ifdef ALLOC_TYPE_STATS |
| 4426 | |
| 2720 | 4427 static Lisp_Object |
| 2994 | 4428 gc_plist_hack (const Ascbyte *name, EMACS_INT value, Lisp_Object tail) |
| 2720 | 4429 { |
| 4430 /* C doesn't have local functions (or closures, or GC, or readable syntax, | |
| 4431 or portable numeric datatypes, or bit-vectors, or characters, or | |
| 4432 arrays, or exceptions, or ...) */ | |
| 4433 return cons3 (intern (name), make_int (value), tail); | |
| 4434 } | |
| 2775 | 4435 |
| 2994 | 4436 static Lisp_Object |
| 4437 object_memory_usage_stats (int set_total_gc_usage) | |
| 2720 | 4438 { |
| 4439 Lisp_Object pl = Qnil; | |
| 4440 int i; | |
| 2994 | 4441 EMACS_INT tgu_val = 0; |
| 4442 | |
| 3263 | 4443 #ifdef NEW_GC |
| 2775 | 4444 |
| 3461 | 4445 for (i = 0; i < countof (lrecord_implementations_table); i++) |
| 2720 | 4446 { |
| 4447 if (lrecord_stats[i].instances_in_use != 0) | |
| 4448 { | |
| 4449 char buf [255]; | |
| 4450 const char *name = lrecord_implementations_table[i]->name; | |
| 4451 int len = strlen (name); | |
| 4452 | |
| 4453 if (lrecord_stats[i].bytes_in_use_including_overhead != | |
| 4454 lrecord_stats[i].bytes_in_use) | |
| 4455 { | |
| 4456 sprintf (buf, "%s-storage-including-overhead", name); | |
| 4457 pl = gc_plist_hack (buf, | |
| 4458 lrecord_stats[i] | |
| 4459 .bytes_in_use_including_overhead, | |
| 4460 pl); | |
| 4461 } | |
| 4462 | |
| 4463 sprintf (buf, "%s-storage", name); | |
| 4464 pl = gc_plist_hack (buf, | |
| 4465 lrecord_stats[i].bytes_in_use, | |
| 4466 pl); | |
| 2994 | 4467 tgu_val += lrecord_stats[i].bytes_in_use_including_overhead; |
| 2720 | 4468 |
| 4469 if (name[len-1] == 's') | |
| 4470 sprintf (buf, "%ses-used", name); | |
| 4471 else | |
| 4472 sprintf (buf, "%ss-used", name); | |
| 4473 pl = gc_plist_hack (buf, lrecord_stats[i].instances_in_use, pl); | |
| 4474 } | |
| 4475 } | |
| 2994 | 4476 |
| 3263 | 4477 #else /* not NEW_GC */ |
| 428 | 4478 |
| 4479 #define HACK_O_MATIC(type, name, pl) do { \ | |
| 2994 | 4480 EMACS_INT s = 0; \ |
| 428 | 4481 struct type##_block *x = current_##type##_block; \ |
| 4482 while (x) { s += sizeof (*x) + MALLOC_OVERHEAD; x = x->prev; } \ | |
| 2994 | 4483 tgu_val += s; \ |
| 428 | 4484 (pl) = gc_plist_hack ((name), s, (pl)); \ |
| 4485 } while (0) | |
| 4486 | |
| 442 | 4487 for (i = 0; i < lrecord_type_count; i++) |
| 428 | 4488 { |
| 4489 if (lcrecord_stats[i].bytes_in_use != 0 | |
| 4490 || lcrecord_stats[i].bytes_freed != 0 | |
| 4491 || lcrecord_stats[i].instances_on_free_list != 0) | |
| 4492 { | |
| 4493 char buf [255]; | |
| 442 | 4494 const char *name = lrecord_implementations_table[i]->name; |
| 428 | 4495 int len = strlen (name); |
| 4496 | |
| 4497 sprintf (buf, "%s-storage", name); | |
| 4498 pl = gc_plist_hack (buf, lcrecord_stats[i].bytes_in_use, pl); | |
| 2994 | 4499 tgu_val += lcrecord_stats[i].bytes_in_use; |
| 428 | 4500 /* Okay, simple pluralization check for `symbol-value-varalias' */ |
| 4501 if (name[len-1] == 's') | |
| 4502 sprintf (buf, "%ses-freed", name); | |
| 4503 else | |
| 4504 sprintf (buf, "%ss-freed", name); | |
| 4505 if (lcrecord_stats[i].instances_freed != 0) | |
| 4506 pl = gc_plist_hack (buf, lcrecord_stats[i].instances_freed, pl); | |
| 4507 if (name[len-1] == 's') | |
| 4508 sprintf (buf, "%ses-on-free-list", name); | |
| 4509 else | |
| 4510 sprintf (buf, "%ss-on-free-list", name); | |
| 4511 if (lcrecord_stats[i].instances_on_free_list != 0) | |
| 4512 pl = gc_plist_hack (buf, lcrecord_stats[i].instances_on_free_list, | |
| 4513 pl); | |
| 4514 if (name[len-1] == 's') | |
| 4515 sprintf (buf, "%ses-used", name); | |
| 4516 else | |
| 4517 sprintf (buf, "%ss-used", name); | |
| 4518 pl = gc_plist_hack (buf, lcrecord_stats[i].instances_in_use, pl); | |
| 4519 } | |
| 4520 } | |
| 4521 | |
| 4522 HACK_O_MATIC (extent, "extent-storage", pl); | |
| 4523 pl = gc_plist_hack ("extents-free", gc_count_num_extent_freelist, pl); | |
| 4524 pl = gc_plist_hack ("extents-used", gc_count_num_extent_in_use, pl); | |
| 4525 HACK_O_MATIC (event, "event-storage", pl); | |
| 4526 pl = gc_plist_hack ("events-free", gc_count_num_event_freelist, pl); | |
| 4527 pl = gc_plist_hack ("events-used", gc_count_num_event_in_use, pl); | |
| 4528 HACK_O_MATIC (marker, "marker-storage", pl); | |
| 4529 pl = gc_plist_hack ("markers-free", gc_count_num_marker_freelist, pl); | |
| 4530 pl = gc_plist_hack ("markers-used", gc_count_num_marker_in_use, pl); | |
| 4531 HACK_O_MATIC (float, "float-storage", pl); | |
| 4532 pl = gc_plist_hack ("floats-free", gc_count_num_float_freelist, pl); | |
| 4533 pl = gc_plist_hack ("floats-used", gc_count_num_float_in_use, pl); | |
| 1983 | 4534 #ifdef HAVE_BIGNUM |
| 4535 HACK_O_MATIC (bignum, "bignum-storage", pl); | |
| 4536 pl = gc_plist_hack ("bignums-free", gc_count_num_bignum_freelist, pl); | |
| 4537 pl = gc_plist_hack ("bignums-used", gc_count_num_bignum_in_use, pl); | |
| 4538 #endif /* HAVE_BIGNUM */ | |
| 4539 #ifdef HAVE_RATIO | |
| 4540 HACK_O_MATIC (ratio, "ratio-storage", pl); | |
| 4541 pl = gc_plist_hack ("ratios-free", gc_count_num_ratio_freelist, pl); | |
| 4542 pl = gc_plist_hack ("ratios-used", gc_count_num_ratio_in_use, pl); | |
| 4543 #endif /* HAVE_RATIO */ | |
| 4544 #ifdef HAVE_BIGFLOAT | |
| 4545 HACK_O_MATIC (bigfloat, "bigfloat-storage", pl); | |
| 4546 pl = gc_plist_hack ("bigfloats-free", gc_count_num_bigfloat_freelist, pl); | |
| 4547 pl = gc_plist_hack ("bigfloats-used", gc_count_num_bigfloat_in_use, pl); | |
| 4548 #endif /* HAVE_BIGFLOAT */ | |
| 428 | 4549 HACK_O_MATIC (string, "string-header-storage", pl); |
| 4550 pl = gc_plist_hack ("long-strings-total-length", | |
| 4551 gc_count_string_total_size | |
| 4552 - gc_count_short_string_total_size, pl); | |
| 4553 HACK_O_MATIC (string_chars, "short-string-storage", pl); | |
| 4554 pl = gc_plist_hack ("short-strings-total-length", | |
| 4555 gc_count_short_string_total_size, pl); | |
| 4556 pl = gc_plist_hack ("strings-free", gc_count_num_string_freelist, pl); | |
| 4557 pl = gc_plist_hack ("long-strings-used", | |
| 4558 gc_count_num_string_in_use | |
| 4559 - gc_count_num_short_string_in_use, pl); | |
| 4560 pl = gc_plist_hack ("short-strings-used", | |
| 4561 gc_count_num_short_string_in_use, pl); | |
| 4562 | |
| 4563 HACK_O_MATIC (compiled_function, "compiled-function-storage", pl); | |
| 4564 pl = gc_plist_hack ("compiled-functions-free", | |
| 4565 gc_count_num_compiled_function_freelist, pl); | |
| 4566 pl = gc_plist_hack ("compiled-functions-used", | |
| 4567 gc_count_num_compiled_function_in_use, pl); | |
| 4568 | |
| 4569 HACK_O_MATIC (symbol, "symbol-storage", pl); | |
| 4570 pl = gc_plist_hack ("symbols-free", gc_count_num_symbol_freelist, pl); | |
| 4571 pl = gc_plist_hack ("symbols-used", gc_count_num_symbol_in_use, pl); | |
| 4572 | |
| 4573 HACK_O_MATIC (cons, "cons-storage", pl); | |
| 4574 pl = gc_plist_hack ("conses-free", gc_count_num_cons_freelist, pl); | |
| 4575 pl = gc_plist_hack ("conses-used", gc_count_num_cons_in_use, pl); | |
| 4576 | |
| 2994 | 4577 #undef HACK_O_MATIC |
| 4578 | |
| 3263 | 4579 #endif /* NEW_GC */ |
| 2994 | 4580 |
| 4581 if (set_total_gc_usage) | |
| 4582 { | |
| 4583 total_gc_usage = tgu_val; | |
| 4584 total_gc_usage_set = 1; | |
| 4585 } | |
| 4586 | |
| 4587 return pl; | |
| 4588 } | |
| 4589 | |
| 4590 DEFUN("object-memory-usage-stats", Fobject_memory_usage_stats, 0, 0 ,"", /* | |
| 4591 Return statistics about memory usage of Lisp objects. | |
| 4592 */ | |
| 4593 ()) | |
| 4594 { | |
| 4595 return object_memory_usage_stats (0); | |
| 4596 } | |
| 4597 | |
| 4598 #endif /* ALLOC_TYPE_STATS */ | |
| 4599 | |
| 4600 /* Debugging aids. */ | |
| 4601 | |
| 4602 DEFUN ("garbage-collect", Fgarbage_collect, 0, 0, "", /* | |
| 4603 Reclaim storage for Lisp objects no longer needed. | |
| 4604 Return info on amount of space in use: | |
| 4605 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS) | |
| 4606 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS | |
| 4607 PLIST) | |
| 4608 where `PLIST' is a list of alternating keyword/value pairs providing | |
| 4609 more detailed information. | |
| 4610 Garbage collection happens automatically if you cons more than | |
| 4611 `gc-cons-threshold' bytes of Lisp data since previous garbage collection. | |
| 4612 */ | |
| 4613 ()) | |
| 4614 { | |
| 4615 /* Record total usage for purposes of determining next GC */ | |
| 3092 | 4616 #ifdef NEW_GC |
| 4617 gc_full (); | |
| 4618 #else /* not NEW_GC */ | |
| 2994 | 4619 garbage_collect_1 (); |
| 3092 | 4620 #endif /* not NEW_GC */ |
| 2994 | 4621 |
| 4622 /* This will get set to 1, and total_gc_usage computed, as part of the | |
| 4623 call to object_memory_usage_stats() -- if ALLOC_TYPE_STATS is enabled. */ | |
| 4624 total_gc_usage_set = 0; | |
| 4625 #ifdef ALLOC_TYPE_STATS | |
| 428 | 4626 /* The things we do for backwards-compatibility */ |
| 3263 | 4627 #ifdef NEW_GC |
| 2994 | 4628 return |
| 4629 list6 | |
| 4630 (Fcons (make_int (lrecord_stats[lrecord_type_cons].instances_in_use), | |
| 4631 make_int (lrecord_stats[lrecord_type_cons] | |
| 4632 .bytes_in_use_including_overhead)), | |
| 4633 Fcons (make_int (lrecord_stats[lrecord_type_symbol].instances_in_use), | |
| 4634 make_int (lrecord_stats[lrecord_type_symbol] | |
| 4635 .bytes_in_use_including_overhead)), | |
| 4636 Fcons (make_int (lrecord_stats[lrecord_type_marker].instances_in_use), | |
| 4637 make_int (lrecord_stats[lrecord_type_marker] | |
| 4638 .bytes_in_use_including_overhead)), | |
| 4639 make_int (lrecord_stats[lrecord_type_string] | |
| 4640 .bytes_in_use_including_overhead), | |
| 4641 make_int (lrecord_stats[lrecord_type_vector] | |
| 4642 .bytes_in_use_including_overhead), | |
| 4643 object_memory_usage_stats (1)); | |
| 3263 | 4644 #else /* not NEW_GC */ |
| 428 | 4645 return |
| 4646 list6 (Fcons (make_int (gc_count_num_cons_in_use), | |
| 4647 make_int (gc_count_num_cons_freelist)), | |
| 4648 Fcons (make_int (gc_count_num_symbol_in_use), | |
| 4649 make_int (gc_count_num_symbol_freelist)), | |
| 4650 Fcons (make_int (gc_count_num_marker_in_use), | |
| 4651 make_int (gc_count_num_marker_freelist)), | |
| 4652 make_int (gc_count_string_total_size), | |
| 2994 | 4653 make_int (lcrecord_stats[lrecord_type_vector].bytes_in_use + |
| 4654 lcrecord_stats[lrecord_type_vector].bytes_freed), | |
| 4655 object_memory_usage_stats (1)); | |
| 3263 | 4656 #endif /* not NEW_GC */ |
| 2994 | 4657 #else /* not ALLOC_TYPE_STATS */ |
| 4658 return Qnil; | |
| 4659 #endif /* ALLOC_TYPE_STATS */ | |
| 4660 } | |
| 428 | 4661 |
| 4662 DEFUN ("consing-since-gc", Fconsing_since_gc, 0, 0, "", /* | |
| 4663 Return the number of bytes consed since the last garbage collection. | |
| 4664 \"Consed\" is a misnomer in that this actually counts allocation | |
| 4665 of all different kinds of objects, not just conses. | |
| 4666 | |
| 4667 If this value exceeds `gc-cons-threshold', a garbage collection happens. | |
| 4668 */ | |
| 4669 ()) | |
| 4670 { | |
| 4671 return make_int (consing_since_gc); | |
| 4672 } | |
| 4673 | |
| 440 | 4674 #if 0 |
| 444 | 4675 DEFUN ("memory-limit", Fmemory_limit, 0, 0, 0, /* |
| 801 | 4676 Return the address of the last byte XEmacs has allocated, divided by 1024. |
| 4677 This may be helpful in debugging XEmacs's memory usage. | |
| 428 | 4678 The value is divided by 1024 to make sure it will fit in a lisp integer. |
| 4679 */ | |
| 4680 ()) | |
| 4681 { | |
| 4682 return make_int ((EMACS_INT) sbrk (0) / 1024); | |
| 4683 } | |
| 440 | 4684 #endif |
| 428 | 4685 |
| 2994 | 4686 DEFUN ("total-memory-usage", Ftotal_memory_usage, 0, 0, 0, /* |
| 801 | 4687 Return the total number of bytes used by the data segment in XEmacs. |
| 4688 This may be helpful in debugging XEmacs's memory usage. | |
| 2994 | 4689 NOTE: This may or may not be accurate! It is hard to determine this |
| 4690 value in a system-independent fashion. On Windows, for example, the | |
| 4691 returned number tends to be much greater than reality. | |
| 801 | 4692 */ |
| 4693 ()) | |
| 4694 { | |
| 4695 return make_int (total_data_usage ()); | |
| 4696 } | |
| 4697 | |
| 2994 | 4698 #ifdef ALLOC_TYPE_STATS |
| 4699 DEFUN ("object-memory-usage", Fobject_memory_usage, 0, 0, 0, /* | |
| 4700 Return total number of bytes used for object storage in XEmacs. | |
| 4701 This may be helpful in debugging XEmacs's memory usage. | |
| 4702 See also `consing-since-gc' and `object-memory-usage-stats'. | |
| 4703 */ | |
| 4704 ()) | |
| 4705 { | |
| 4706 return make_int (total_gc_usage + consing_since_gc); | |
| 4707 } | |
| 4708 #endif /* ALLOC_TYPE_STATS */ | |
| 4709 | |
|
4803
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4710 #ifdef USE_VALGRIND |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4711 DEFUN ("valgrind-leak-check", Fvalgrind_leak_check, 0, 0, "", /* |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4712 Ask valgrind to perform a memory leak check. |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4713 The results of the leak check are sent to stderr. |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4714 */ |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4715 ()) |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4716 { |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4717 VALGRIND_DO_LEAK_CHECK; |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4718 return Qnil; |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4719 } |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4720 |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4721 DEFUN ("valgrind-quick-leak-check", Fvalgrind_quick_leak_check, 0, 0, "", /* |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4722 Ask valgrind to perform a quick memory leak check. |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4723 This just prints a summary of leaked memory, rather than all the details. |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4724 The results of the leak check are sent to stderr. |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4725 */ |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4726 ()) |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4727 { |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4728 VALGRIND_DO_QUICK_LEAK_CHECK; |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4729 return Qnil; |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4730 } |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4731 #endif /* USE_VALGRIND */ |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
4732 |
| 851 | 4733 void |
| 4734 recompute_funcall_allocation_flag (void) | |
| 4735 { | |
| 887 | 4736 funcall_allocation_flag = |
| 4737 need_to_garbage_collect || | |
| 4738 need_to_check_c_alloca || | |
| 4739 need_to_signal_post_gc; | |
| 851 | 4740 } |
| 4741 | |
| 428 | 4742 |
| 4743 int | |
| 4744 object_dead_p (Lisp_Object obj) | |
| 4745 { | |
| 4746 return ((BUFFERP (obj) && !BUFFER_LIVE_P (XBUFFER (obj))) || | |
| 4747 (FRAMEP (obj) && !FRAME_LIVE_P (XFRAME (obj))) || | |
| 4748 (WINDOWP (obj) && !WINDOW_LIVE_P (XWINDOW (obj))) || | |
| 4749 (DEVICEP (obj) && !DEVICE_LIVE_P (XDEVICE (obj))) || | |
| 4750 (CONSOLEP (obj) && !CONSOLE_LIVE_P (XCONSOLE (obj))) || | |
| 4751 (EVENTP (obj) && !EVENT_LIVE_P (XEVENT (obj))) || | |
| 4752 (EXTENTP (obj) && !EXTENT_LIVE_P (XEXTENT (obj)))); | |
| 4753 } | |
| 4754 | |
| 4755 #ifdef MEMORY_USAGE_STATS | |
| 4756 | |
| 4757 /* Attempt to determine the actual amount of space that is used for | |
| 4758 the block allocated starting at PTR, supposedly of size "CLAIMED_SIZE". | |
| 4759 | |
| 4760 It seems that the following holds: | |
| 4761 | |
| 4762 1. When using the old allocator (malloc.c): | |
| 4763 | |
| 4764 -- blocks are always allocated in chunks of powers of two. For | |
| 4765 each block, there is an overhead of 8 bytes if rcheck is not | |
| 4766 defined, 20 bytes if it is defined. In other words, a | |
| 4767 one-byte allocation needs 8 bytes of overhead for a total of | |
| 4768 9 bytes, and needs to have 16 bytes of memory chunked out for | |
| 4769 it. | |
| 4770 | |
| 4771 2. When using the new allocator (gmalloc.c): | |
| 4772 | |
| 4773 -- blocks are always allocated in chunks of powers of two up | |
| 4774 to 4096 bytes. Larger blocks are allocated in chunks of | |
| 4775 an integral multiple of 4096 bytes. The minimum block | |
| 4776 size is 2*sizeof (void *), or 16 bytes if SUNOS_LOCALTIME_BUG | |
| 4777 is defined. There is no per-block overhead, but there | |
| 4778 is an overhead of 3*sizeof (size_t) for each 4096 bytes | |
| 4779 allocated. | |
| 4780 | |
| 4781 3. When using the system malloc, anything goes, but they are | |
| 4782 generally slower and more space-efficient than the GNU | |
| 4783 allocators. One possibly reasonable assumption to make | |
| 4784 for want of better data is that sizeof (void *), or maybe | |
| 4785 2 * sizeof (void *), is required as overhead and that | |
| 4786 blocks are allocated in the minimum required size except | |
| 4787 that some minimum block size is imposed (e.g. 16 bytes). */ | |
| 4788 | |
| 665 | 4789 Bytecount |
| 2286 | 4790 malloced_storage_size (void *UNUSED (ptr), Bytecount claimed_size, |
| 428 | 4791 struct overhead_stats *stats) |
| 4792 { | |
| 665 | 4793 Bytecount orig_claimed_size = claimed_size; |
| 428 | 4794 |
|
4735
80d74fed5399
Remove "old" GNU malloc in src/malloc.c, and all references to it. Drop the
Jerry James <james@xemacs.org>
parents:
4693
diff
changeset
|
4795 #ifndef SYSTEM_MALLOC |
| 665 | 4796 if (claimed_size < (Bytecount) (2 * sizeof (void *))) |
| 428 | 4797 claimed_size = 2 * sizeof (void *); |
| 4798 # ifdef SUNOS_LOCALTIME_BUG | |
| 4799 if (claimed_size < 16) | |
| 4800 claimed_size = 16; | |
| 4801 # endif | |
| 4802 if (claimed_size < 4096) | |
| 4803 { | |
| 2260 | 4804 /* fxg: rename log->log2 to supress gcc3 shadow warning */ |
| 4805 int log2 = 1; | |
| 428 | 4806 |
| 4807 /* compute the log base two, more or less, then use it to compute | |
| 4808 the block size needed. */ | |
| 4809 claimed_size--; | |
| 4810 /* It's big, it's heavy, it's wood! */ | |
| 4811 while ((claimed_size /= 2) != 0) | |
| 2260 | 4812 ++log2; |
| 428 | 4813 claimed_size = 1; |
| 4814 /* It's better than bad, it's good! */ | |
| 2260 | 4815 while (log2 > 0) |
| 428 | 4816 { |
| 4817 claimed_size *= 2; | |
| 2260 | 4818 log2--; |
| 428 | 4819 } |
| 4820 /* We have to come up with some average about the amount of | |
| 4821 blocks used. */ | |
| 665 | 4822 if ((Bytecount) (rand () & 4095) < claimed_size) |
| 428 | 4823 claimed_size += 3 * sizeof (void *); |
| 4824 } | |
| 4825 else | |
| 4826 { | |
| 4827 claimed_size += 4095; | |
| 4828 claimed_size &= ~4095; | |
| 4829 claimed_size += (claimed_size / 4096) * 3 * sizeof (size_t); | |
| 4830 } | |
| 4831 | |
|
4735
80d74fed5399
Remove "old" GNU malloc in src/malloc.c, and all references to it. Drop the
Jerry James <james@xemacs.org>
parents:
4693
diff
changeset
|
4832 #else |
| 428 | 4833 |
| 4834 if (claimed_size < 16) | |
| 4835 claimed_size = 16; | |
| 4836 claimed_size += 2 * sizeof (void *); | |
| 4837 | |
|
4735
80d74fed5399
Remove "old" GNU malloc in src/malloc.c, and all references to it. Drop the
Jerry James <james@xemacs.org>
parents:
4693
diff
changeset
|
4838 #endif /* system allocator */ |
| 428 | 4839 |
| 4840 if (stats) | |
| 4841 { | |
| 4842 stats->was_requested += orig_claimed_size; | |
| 4843 stats->malloc_overhead += claimed_size - orig_claimed_size; | |
| 4844 } | |
| 4845 return claimed_size; | |
| 4846 } | |
| 4847 | |
| 3263 | 4848 #ifndef NEW_GC |
| 665 | 4849 Bytecount |
| 4850 fixed_type_block_overhead (Bytecount size) | |
| 428 | 4851 { |
| 665 | 4852 Bytecount per_block = TYPE_ALLOC_SIZE (cons, unsigned char); |
| 4853 Bytecount overhead = 0; | |
| 4854 Bytecount storage_size = malloced_storage_size (0, per_block, 0); | |
| 428 | 4855 while (size >= per_block) |
| 4856 { | |
| 4857 size -= per_block; | |
| 4858 overhead += sizeof (void *) + per_block - storage_size; | |
| 4859 } | |
| 4860 if (rand () % per_block < size) | |
| 4861 overhead += sizeof (void *) + per_block - storage_size; | |
| 4862 return overhead; | |
| 4863 } | |
| 3263 | 4864 #endif /* not NEW_GC */ |
| 428 | 4865 #endif /* MEMORY_USAGE_STATS */ |
| 4866 | |
| 4867 | |
| 4868 /* Initialization */ | |
| 771 | 4869 static void |
| 1204 | 4870 common_init_alloc_early (void) |
| 428 | 4871 { |
| 771 | 4872 #ifndef Qzero |
| 4873 Qzero = make_int (0); /* Only used if Lisp_Object is a union type */ | |
| 4874 #endif | |
| 4875 | |
| 4876 #ifndef Qnull_pointer | |
| 4877 /* C guarantees that Qnull_pointer will be initialized to all 0 bits, | |
| 4878 so the following is actually a no-op. */ | |
| 793 | 4879 Qnull_pointer = wrap_pointer_1 (0); |
| 771 | 4880 #endif |
| 4881 | |
| 3263 | 4882 #ifndef NEW_GC |
| 428 | 4883 breathing_space = 0; |
| 4884 all_lcrecords = 0; | |
| 3263 | 4885 #endif /* not NEW_GC */ |
| 428 | 4886 ignore_malloc_warnings = 1; |
| 4887 #ifdef DOUG_LEA_MALLOC | |
| 4888 mallopt (M_TRIM_THRESHOLD, 128*1024); /* trim threshold */ | |
| 4889 mallopt (M_MMAP_THRESHOLD, 64*1024); /* mmap threshold */ | |
| 4890 #if 0 /* Moved to emacs.c */ | |
| 4891 mallopt (M_MMAP_MAX, 64); /* max. number of mmap'ed areas */ | |
| 4892 #endif | |
| 4893 #endif | |
| 3092 | 4894 #ifndef NEW_GC |
| 2720 | 4895 init_string_chars_alloc (); |
| 428 | 4896 init_string_alloc (); |
| 4897 init_string_chars_alloc (); | |
| 4898 init_cons_alloc (); | |
| 4899 init_symbol_alloc (); | |
| 4900 init_compiled_function_alloc (); | |
| 4901 init_float_alloc (); | |
| 1983 | 4902 #ifdef HAVE_BIGNUM |
| 4903 init_bignum_alloc (); | |
| 4904 #endif | |
| 4905 #ifdef HAVE_RATIO | |
| 4906 init_ratio_alloc (); | |
| 4907 #endif | |
| 4908 #ifdef HAVE_BIGFLOAT | |
| 4909 init_bigfloat_alloc (); | |
| 4910 #endif | |
| 428 | 4911 init_marker_alloc (); |
| 4912 init_extent_alloc (); | |
| 4913 init_event_alloc (); | |
| 1204 | 4914 #ifdef EVENT_DATA_AS_OBJECTS |
| 934 | 4915 init_key_data_alloc (); |
| 4916 init_button_data_alloc (); | |
| 4917 init_motion_data_alloc (); | |
| 4918 init_process_data_alloc (); | |
| 4919 init_timeout_data_alloc (); | |
| 4920 init_magic_data_alloc (); | |
| 4921 init_magic_eval_data_alloc (); | |
| 4922 init_eval_data_alloc (); | |
| 4923 init_misc_user_data_alloc (); | |
| 1204 | 4924 #endif /* EVENT_DATA_AS_OBJECTS */ |
| 3263 | 4925 #endif /* not NEW_GC */ |
| 428 | 4926 |
| 4927 ignore_malloc_warnings = 0; | |
| 4928 | |
| 452 | 4929 if (staticpros_nodump) |
| 4930 Dynarr_free (staticpros_nodump); | |
| 4931 staticpros_nodump = Dynarr_new2 (Lisp_Object_ptr_dynarr, Lisp_Object *); | |
| 4932 Dynarr_resize (staticpros_nodump, 100); /* merely a small optimization */ | |
| 771 | 4933 #ifdef DEBUG_XEMACS |
| 4934 if (staticpro_nodump_names) | |
| 4935 Dynarr_free (staticpro_nodump_names); | |
| 4936 staticpro_nodump_names = Dynarr_new2 (char_ptr_dynarr, char *); | |
| 4937 Dynarr_resize (staticpro_nodump_names, 100); /* ditto */ | |
| 4938 #endif | |
| 428 | 4939 |
| 3263 | 4940 #ifdef NEW_GC |
| 2720 | 4941 mcpros = Dynarr_new2 (Lisp_Object_dynarr, Lisp_Object); |
| 4942 Dynarr_resize (mcpros, 1410); /* merely a small optimization */ | |
| 4943 dump_add_root_block_ptr (&mcpros, &mcpros_description); | |
| 4944 #ifdef DEBUG_XEMACS | |
| 4945 mcpro_names = Dynarr_new2 (char_ptr_dynarr, char *); | |
| 4946 Dynarr_resize (mcpro_names, 1410); /* merely a small optimization */ | |
| 4947 dump_add_root_block_ptr (&mcpro_names, &mcpro_names_description); | |
| 4948 #endif | |
| 3263 | 4949 #endif /* NEW_GC */ |
| 2720 | 4950 |
| 428 | 4951 consing_since_gc = 0; |
| 851 | 4952 need_to_check_c_alloca = 0; |
| 4953 funcall_allocation_flag = 0; | |
| 4954 funcall_alloca_count = 0; | |
| 814 | 4955 |
| 428 | 4956 lrecord_uid_counter = 259; |
| 3263 | 4957 #ifndef NEW_GC |
| 428 | 4958 debug_string_purity = 0; |
| 3263 | 4959 #endif /* not NEW_GC */ |
| 428 | 4960 |
| 800 | 4961 #ifdef ERROR_CHECK_TYPES |
| 428 | 4962 ERROR_ME.really_unlikely_name_to_have_accidentally_in_a_non_errb_structure = |
| 4963 666; | |
| 4964 ERROR_ME_NOT. | |
| 4965 really_unlikely_name_to_have_accidentally_in_a_non_errb_structure = 42; | |
| 4966 ERROR_ME_WARN. | |
| 4967 really_unlikely_name_to_have_accidentally_in_a_non_errb_structure = | |
| 4968 3333632; | |
| 793 | 4969 ERROR_ME_DEBUG_WARN. |
| 4970 really_unlikely_name_to_have_accidentally_in_a_non_errb_structure = | |
| 4971 8675309; | |
| 800 | 4972 #endif /* ERROR_CHECK_TYPES */ |
| 428 | 4973 } |
| 4974 | |
| 3263 | 4975 #ifndef NEW_GC |
| 771 | 4976 static void |
| 4977 init_lcrecord_lists (void) | |
| 4978 { | |
| 4979 int i; | |
| 4980 | |
| 4981 for (i = 0; i < countof (lrecord_implementations_table); i++) | |
| 4982 { | |
| 4983 all_lcrecord_lists[i] = Qzero; /* Qnil not yet set */ | |
| 4984 staticpro_nodump (&all_lcrecord_lists[i]); | |
| 4985 } | |
| 4986 } | |
| 3263 | 4987 #endif /* not NEW_GC */ |
| 771 | 4988 |
| 4989 void | |
| 1204 | 4990 init_alloc_early (void) |
| 771 | 4991 { |
| 1204 | 4992 #if defined (__cplusplus) && defined (ERROR_CHECK_GC) |
| 4993 static struct gcpro initial_gcpro; | |
| 4994 | |
| 4995 initial_gcpro.next = 0; | |
| 4996 initial_gcpro.var = &Qnil; | |
| 4997 initial_gcpro.nvars = 1; | |
| 4998 gcprolist = &initial_gcpro; | |
| 4999 #else | |
| 5000 gcprolist = 0; | |
| 5001 #endif /* defined (__cplusplus) && defined (ERROR_CHECK_GC) */ | |
| 5002 } | |
| 5003 | |
| 5004 void | |
| 5005 reinit_alloc_early (void) | |
| 5006 { | |
| 5007 common_init_alloc_early (); | |
| 3263 | 5008 #ifndef NEW_GC |
| 771 | 5009 init_lcrecord_lists (); |
| 3263 | 5010 #endif /* not NEW_GC */ |
| 771 | 5011 } |
| 5012 | |
| 428 | 5013 void |
| 5014 init_alloc_once_early (void) | |
| 5015 { | |
| 1204 | 5016 common_init_alloc_early (); |
| 428 | 5017 |
| 442 | 5018 { |
| 5019 int i; | |
| 5020 for (i = 0; i < countof (lrecord_implementations_table); i++) | |
| 5021 lrecord_implementations_table[i] = 0; | |
| 5022 } | |
| 5023 | |
| 5024 INIT_LRECORD_IMPLEMENTATION (cons); | |
| 5025 INIT_LRECORD_IMPLEMENTATION (vector); | |
| 5026 INIT_LRECORD_IMPLEMENTATION (string); | |
| 3092 | 5027 #ifdef NEW_GC |
| 5028 INIT_LRECORD_IMPLEMENTATION (string_indirect_data); | |
| 5029 INIT_LRECORD_IMPLEMENTATION (string_direct_data); | |
| 5030 #endif /* NEW_GC */ | |
| 3263 | 5031 #ifndef NEW_GC |
| 442 | 5032 INIT_LRECORD_IMPLEMENTATION (lcrecord_list); |
| 1204 | 5033 INIT_LRECORD_IMPLEMENTATION (free); |
| 3263 | 5034 #endif /* not NEW_GC */ |
| 428 | 5035 |
| 452 | 5036 staticpros = Dynarr_new2 (Lisp_Object_ptr_dynarr, Lisp_Object *); |
| 5037 Dynarr_resize (staticpros, 1410); /* merely a small optimization */ | |
| 2367 | 5038 dump_add_root_block_ptr (&staticpros, &staticpros_description); |
| 771 | 5039 #ifdef DEBUG_XEMACS |
| 5040 staticpro_names = Dynarr_new2 (char_ptr_dynarr, char *); | |
| 5041 Dynarr_resize (staticpro_names, 1410); /* merely a small optimization */ | |
| 2367 | 5042 dump_add_root_block_ptr (&staticpro_names, &staticpro_names_description); |
| 771 | 5043 #endif |
| 5044 | |
| 3263 | 5045 #ifdef NEW_GC |
| 2720 | 5046 mcpros = Dynarr_new2 (Lisp_Object_dynarr, Lisp_Object); |
| 5047 Dynarr_resize (mcpros, 1410); /* merely a small optimization */ | |
| 5048 dump_add_root_block_ptr (&mcpros, &mcpros_description); | |
| 5049 #ifdef DEBUG_XEMACS | |
| 5050 mcpro_names = Dynarr_new2 (char_ptr_dynarr, char *); | |
| 5051 Dynarr_resize (mcpro_names, 1410); /* merely a small optimization */ | |
| 5052 dump_add_root_block_ptr (&mcpro_names, &mcpro_names_description); | |
| 5053 #endif | |
| 3263 | 5054 #else /* not NEW_GC */ |
| 771 | 5055 init_lcrecord_lists (); |
| 3263 | 5056 #endif /* not NEW_GC */ |
| 428 | 5057 } |
| 5058 | |
| 5059 void | |
| 5060 syms_of_alloc (void) | |
| 5061 { | |
| 442 | 5062 DEFSYMBOL (Qgarbage_collecting); |
| 428 | 5063 |
| 5064 DEFSUBR (Fcons); | |
| 5065 DEFSUBR (Flist); | |
| 5066 DEFSUBR (Fvector); | |
| 5067 DEFSUBR (Fbit_vector); | |
| 5068 DEFSUBR (Fmake_byte_code); | |
| 5069 DEFSUBR (Fmake_list); | |
| 5070 DEFSUBR (Fmake_vector); | |
| 5071 DEFSUBR (Fmake_bit_vector); | |
| 5072 DEFSUBR (Fmake_string); | |
| 5073 DEFSUBR (Fstring); | |
| 5074 DEFSUBR (Fmake_symbol); | |
| 5075 DEFSUBR (Fmake_marker); | |
| 5076 DEFSUBR (Fpurecopy); | |
| 2994 | 5077 #ifdef ALLOC_TYPE_STATS |
| 5078 DEFSUBR (Fobject_memory_usage_stats); | |
| 5079 DEFSUBR (Fobject_memory_usage); | |
| 5080 #endif /* ALLOC_TYPE_STATS */ | |
| 428 | 5081 DEFSUBR (Fgarbage_collect); |
| 440 | 5082 #if 0 |
| 428 | 5083 DEFSUBR (Fmemory_limit); |
| 440 | 5084 #endif |
| 2994 | 5085 DEFSUBR (Ftotal_memory_usage); |
| 428 | 5086 DEFSUBR (Fconsing_since_gc); |
|
4803
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
5087 #ifdef USE_VALGRIND |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
5088 DEFSUBR (Fvalgrind_leak_check); |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
5089 DEFSUBR (Fvalgrind_quick_leak_check); |
|
5d120deb60ca
Enable rudimentary support for valgrind, including functions that tell valgrind
Jerry James <james@xemacs.org>
parents:
4776
diff
changeset
|
5090 #endif |
| 428 | 5091 } |
| 5092 | |
| 5093 void | |
| 5094 vars_of_alloc (void) | |
| 5095 { | |
| 5096 #ifdef DEBUG_XEMACS | |
| 5097 DEFVAR_INT ("debug-allocation", &debug_allocation /* | |
| 5098 If non-zero, print out information to stderr about all objects allocated. | |
| 5099 See also `debug-allocation-backtrace-length'. | |
| 5100 */ ); | |
| 5101 debug_allocation = 0; | |
| 5102 | |
| 5103 DEFVAR_INT ("debug-allocation-backtrace-length", | |
| 5104 &debug_allocation_backtrace_length /* | |
| 5105 Length (in stack frames) of short backtrace printed out by `debug-allocation'. | |
| 5106 */ ); | |
| 5107 debug_allocation_backtrace_length = 2; | |
| 5108 #endif | |
| 5109 | |
| 5110 DEFVAR_BOOL ("purify-flag", &purify_flag /* | |
| 5111 Non-nil means loading Lisp code in order to dump an executable. | |
| 5112 This means that certain objects should be allocated in readonly space. | |
| 5113 */ ); | |
| 5114 } |