2 * Copyright 1988, 1989 Hans-J. Boehm, Alan J. Demers
3 * Copyright (c) 1991-1995 by Xerox Corporation. All rights reserved.
4 * Copyright 1996-1999 by Silicon Graphics. All rights reserved.
5 * Copyright 1999 by Hewlett-Packard Company. All rights reserved.
7 * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
8 * OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
10 * Permission is hereby granted to use or copy this program
11 * for any purpose, provided the above notices are retained on all copies.
12 * Permission to modify the code and to distribute modified code is granted,
13 * provided the above notices are retained, and a notice that the code was
14 * modified is included with the above copyright notice.
18 * Note that this defines a large number of tuning hooks, which can
19 * safely be ignored in nearly all cases. For normal use it suffices
20 * to call only GC_MALLOC and perhaps GC_REALLOC.
21 * For better performance, also look at GC_MALLOC_ATOMIC, and
22 * GC_enable_incremental. If you need an action to be performed
23 * immediately before an object is collected, look at GC_register_finalizer.
24 * If you are using Solaris threads, look at the end of this file.
25 * Everything else is best ignored unless you encounter performance
33 # include "gc_config_macros.h"
35 # if defined(__STDC__) || defined(__cplusplus) || defined(_AIX)
36 # define GC_PROTO(args) args
37 typedef void * GC_PTR;
38 # define GC_CONST const
40 # define GC_PROTO(args) ()
41 typedef char * GC_PTR;
50 /* Define word and signed_word to be unsigned and signed types of the */
51 /* size as char * or void *. There seems to be no way to do this */
52 /* even semi-portably. The following is probably no better/worse */
53 /* than almost anything else. */
54 /* The ANSI standard suggests that size_t and ptr_diff_t might be */
55 /* better choices. But those had incorrect definitions on some older */
56 /* systems. Notably "typedef int size_t" is WRONG. */
58 typedef unsigned long GC_word;
59 typedef long GC_signed_word;
61 /* Win64 isn't really supported yet, but this is the first step. And */
62 /* it might cause error messages to show up in more plausible places. */
63 /* This needs basetsd.h, which is included by windows.h. */
64 typedef ULONG_PTR GC_word;
65 typedef LONG_PTR GC_word;
68 /* Public read-only variables */
70 GC_API GC_word GC_gc_no;/* Counter incremented per collection. */
71 /* Includes empty GCs at startup. */
73 GC_API int GC_parallel; /* GC is parallelized for performance on */
74 /* multiprocessors. Currently set only */
75 /* implicitly if collector is built with */
76 /* -DPARALLEL_MARK and if either: */
77 /* Env variable GC_NPROC is set to > 1, or */
78 /* GC_NPROC is not set and this is an MP. */
79 /* If GC_parallel is set, incremental */
80 /* collection is only partially functional, */
81 /* and may not be desirable. */
84 /* Public R/W variables */
86 GC_API GC_PTR (*GC_oom_fn) GC_PROTO((size_t bytes_requested));
87 /* When there is insufficient memory to satisfy */
88 /* an allocation request, we return */
89 /* (*GC_oom_fn)(). By default this just */
91 /* If it returns, it must return 0 or a valid */
92 /* pointer to a previously allocated heap */
95 GC_API int GC_find_leak;
96 /* Do not actually garbage collect, but simply */
97 /* report inaccessible memory that was not */
98 /* deallocated with GC_free. Initial value */
99 /* is determined by FIND_LEAK macro. */
101 GC_API int GC_all_interior_pointers;
102 /* Arrange for pointers to object interiors to */
103 /* be recognized as valid. May not be changed */
104 /* after GC initialization. */
105 /* Initial value is determined by */
106 /* -DALL_INTERIOR_POINTERS. */
107 /* Unless DONT_ADD_BYTE_AT_END is defined, this */
108 /* also affects whether sizes are increased by */
109 /* at least a byte to allow "off the end" */
110 /* pointer recognition. */
111 /* MUST BE 0 or 1. */
113 GC_API int GC_quiet; /* Disable statistics output. Only matters if */
114 /* collector has been compiled with statistics */
115 /* enabled. This involves a performance cost, */
116 /* and is thus not the default. */
118 GC_API int GC_finalize_on_demand;
119 /* If nonzero, finalizers will only be run in */
120 /* response to an explicit GC_invoke_finalizers */
121 /* call. The default is determined by whether */
122 /* the FINALIZE_ON_DEMAND macro is defined */
123 /* when the collector is built. */
125 GC_API int GC_java_finalization;
126 /* Mark objects reachable from finalizable */
127 /* objects in a separate postpass. This makes */
128 /* it a bit safer to use non-topologically- */
129 /* ordered finalization. Default value is */
130 /* determined by JAVA_FINALIZATION macro. */
132 GC_API void (* GC_finalizer_notifier) GC_PROTO((void));
133 /* Invoked by the collector when there are */
134 /* objects to be finalized. Invoked at most */
135 /* once per GC cycle. Never invoked unless */
136 /* GC_finalize_on_demand is set. */
137 /* Typically this will notify a finalization */
138 /* thread, which will call GC_invoke_finalizers */
141 GC_API int GC_dont_gc; /* != 0 ==> Dont collect. In versions 6.2a1+, */
142 /* this overrides explicit GC_gcollect() calls. */
143 /* Used as a counter, so that nested enabling */
144 /* and disabling work correctly. Should */
145 /* normally be updated with GC_enable() and */
146 /* GC_disable() calls. */
147 /* Direct assignment to GC_dont_gc is */
150 GC_API int GC_dont_expand;
151 /* Dont expand heap unless explicitly requested */
154 GC_API int GC_use_entire_heap;
155 /* Causes the nonincremental collector to use the */
156 /* entire heap before collecting. This was the only */
157 /* option for GC versions < 5.0. This sometimes */
158 /* results in more large block fragmentation, since */
159 /* very larg blocks will tend to get broken up */
160 /* during each GC cycle. It is likely to result in a */
161 /* larger working set, but lower collection */
162 /* frequencies, and hence fewer instructions executed */
163 /* in the collector. */
165 GC_API int GC_full_freq; /* Number of partial collections between */
166 /* full collections. Matters only if */
167 /* GC_incremental is set. */
168 /* Full collections are also triggered if */
169 /* the collector detects a substantial */
170 /* increase in the number of in-use heap */
171 /* blocks. Values in the tens are now */
172 /* perfectly reasonable, unlike for */
173 /* earlier GC versions. */
175 GC_API GC_word GC_non_gc_bytes;
176 /* Bytes not considered candidates for collection. */
177 /* Used only to control scheduling of collections. */
178 /* Updated by GC_malloc_uncollectable and GC_free. */
181 GC_API int GC_no_dls;
182 /* Don't register dynamic library data segments. */
183 /* Wizards only. Should be used only if the */
184 /* application explicitly registers all roots. */
185 /* In Microsoft Windows environments, this will */
186 /* usually also prevent registration of the */
187 /* main data segment as part of the root set. */
189 GC_API GC_word GC_free_space_divisor;
190 /* We try to make sure that we allocate at */
191 /* least N/GC_free_space_divisor bytes between */
192 /* collections, where N is the heap size plus */
193 /* a rough estimate of the root set size. */
194 /* Initially, GC_free_space_divisor = 3. */
195 /* Increasing its value will use less space */
196 /* but more collection time. Decreasing it */
197 /* will appreciably decrease collection time */
198 /* at the expense of space. */
199 /* GC_free_space_divisor = 1 will effectively */
200 /* disable collections. */
202 GC_API GC_word GC_max_retries;
203 /* The maximum number of GCs attempted before */
204 /* reporting out of memory after heap */
205 /* expansion fails. Initially 0. */
208 GC_API char *GC_stackbottom; /* Cool end of user stack. */
209 /* May be set in the client prior to */
210 /* calling any GC_ routines. This */
211 /* avoids some overhead, and */
212 /* potentially some signals that can */
213 /* confuse debuggers. Otherwise the */
214 /* collector attempts to set it */
216 /* For multithreaded code, this is the */
217 /* cold end of the stack for the */
218 /* primordial thread. */
220 GC_API int GC_dont_precollect; /* Don't collect as part of */
221 /* initialization. Should be set only */
222 /* if the client wants a chance to */
223 /* manually initialize the root set */
224 /* before the first collection. */
225 /* Interferes with blacklisting. */
228 GC_API unsigned long GC_time_limit;
229 /* If incremental collection is enabled, */
230 /* We try to terminate collections */
231 /* after this many milliseconds. Not a */
232 /* hard time bound. Setting this to */
233 /* GC_TIME_UNLIMITED will essentially */
234 /* disable incremental collection while */
235 /* leaving generational collection */
237 # define GC_TIME_UNLIMITED 999999
238 /* Setting GC_time_limit to this value */
239 /* will disable the "pause time exceeded"*/
242 /* Public procedures */
244 /* Initialize the collector. This is only required when using thread-local
245 * allocation, since unlike the regular allocation routines, GC_local_malloc
246 * is not self-initializing. If you use GC_local_malloc you should arrange
247 * to call this somehow (e.g. from a constructor) before doing any allocation.
248 * For win32 threads, it needs to be called explicitly.
250 GC_API void GC_init GC_PROTO((void));
252 /* Added for cacao */
258 * general purpose allocation routines, with roughly malloc calling conv.
259 * The atomic versions promise that no relevant pointers are contained
260 * in the object. The nonatomic versions guarantee that the new object
261 * is cleared. GC_malloc_stubborn promises that no changes to the object
262 * will occur after GC_end_stubborn_change has been called on the
263 * result of GC_malloc_stubborn. GC_malloc_uncollectable allocates an object
264 * that is scanned for pointers to collectable objects, but is not itself
265 * collectable. The object is scanned even if it does not appear to
266 * be reachable. GC_malloc_uncollectable and GC_free called on the resulting
267 * object implicitly update GC_non_gc_bytes appropriately.
269 * Note that the GC_malloc_stubborn support is stubbed out by default
270 * starting in 6.0. GC_malloc_stubborn is an alias for GC_malloc unless
271 * the collector is built with STUBBORN_ALLOC defined.
273 GC_API GC_PTR GC_malloc GC_PROTO((size_t size_in_bytes));
274 GC_API GC_PTR GC_malloc_atomic GC_PROTO((size_t size_in_bytes));
275 GC_API char *GC_strdup GC_PROTO((const char *str));
276 GC_API GC_PTR GC_malloc_uncollectable GC_PROTO((size_t size_in_bytes));
277 GC_API GC_PTR GC_malloc_stubborn GC_PROTO((size_t size_in_bytes));
279 /* The following is only defined if the library has been suitably */
281 GC_API GC_PTR GC_malloc_atomic_uncollectable GC_PROTO((size_t size_in_bytes));
283 /* Explicitly deallocate an object. Dangerous if used incorrectly. */
284 /* Requires a pointer to the base of an object. */
285 /* If the argument is stubborn, it should not be changeable when freed. */
286 /* An object should not be enable for finalization when it is */
287 /* explicitly deallocated. */
288 /* GC_free(0) is a no-op, as required by ANSI C for free. */
289 GC_API void GC_free GC_PROTO((GC_PTR object_addr));
292 * Stubborn objects may be changed only if the collector is explicitly informed.
293 * The collector is implicitly informed of coming change when such
294 * an object is first allocated. The following routines inform the
295 * collector that an object will no longer be changed, or that it will
296 * once again be changed. Only nonNIL pointer stores into the object
297 * are considered to be changes. The argument to GC_end_stubborn_change
298 * must be exacly the value returned by GC_malloc_stubborn or passed to
299 * GC_change_stubborn. (In the second case it may be an interior pointer
300 * within 512 bytes of the beginning of the objects.)
301 * There is a performance penalty for allowing more than
302 * one stubborn object to be changed at once, but it is acceptable to
303 * do so. The same applies to dropping stubborn objects that are still
306 GC_API void GC_change_stubborn GC_PROTO((GC_PTR));
307 GC_API void GC_end_stubborn_change GC_PROTO((GC_PTR));
309 /* Return a pointer to the base (lowest address) of an object given */
310 /* a pointer to a location within the object. */
311 /* I.e. map an interior pointer to the corresponding bas pointer. */
312 /* Note that with debugging allocation, this returns a pointer to the */
313 /* actual base of the object, i.e. the debug information, not to */
314 /* the base of the user object. */
315 /* Return 0 if displaced_pointer doesn't point to within a valid */
317 /* Note that a deallocated object in the garbage collected heap */
318 /* may be considered valid, even if it has been deallocated with */
320 GC_API GC_PTR GC_base GC_PROTO((GC_PTR displaced_pointer));
322 /* Given a pointer to the base of an object, return its size in bytes. */
323 /* The returned size may be slightly larger than what was originally */
325 GC_API size_t GC_size GC_PROTO((GC_PTR object_addr));
327 /* For compatibility with C library. This is occasionally faster than */
328 /* a malloc followed by a bcopy. But if you rely on that, either here */
329 /* or with the standard C library, your code is broken. In my */
330 /* opinion, it shouldn't have been invented, but now we're stuck. -HB */
331 /* The resulting object has the same kind as the original. */
332 /* If the argument is stubborn, the result will have changes enabled. */
333 /* It is an error to have changes enabled for the original object. */
334 /* Follows ANSI comventions for NULL old_object. */
335 GC_API GC_PTR GC_realloc
336 GC_PROTO((GC_PTR old_object, size_t new_size_in_bytes));
338 /* Explicitly increase the heap size. */
339 /* Returns 0 on failure, 1 on success. */
340 GC_API int GC_expand_hp GC_PROTO((size_t number_of_bytes));
342 /* Limit the heap size to n bytes. Useful when you're debugging, */
343 /* especially on systems that don't handle running out of memory well. */
344 /* n == 0 ==> unbounded. This is the default. */
345 GC_API void GC_set_max_heap_size GC_PROTO((GC_word n));
347 GC_API GC_word GC_get_max_heap_size GC_PROTO((void));
349 /* Inform the collector that a certain section of statically allocated */
350 /* memory contains no pointers to garbage collected memory. Thus it */
351 /* need not be scanned. This is sometimes important if the application */
352 /* maps large read/write files into the address space, which could be */
353 /* mistaken for dynamic library data segments on some systems. */
354 GC_API void GC_exclude_static_roots GC_PROTO((GC_PTR start, GC_PTR finish));
356 /* Clear the set of root segments. Wizards only. */
357 GC_API void GC_clear_roots GC_PROTO((void));
359 /* Add a root segment. Wizards only. */
360 GC_API void GC_add_roots GC_PROTO((char * low_address,
361 char * high_address_plus_1));
363 /* Remove a root segment. Wizards only. */
364 GC_API void GC_remove_roots GC_PROTO((char * low_address,
365 char * high_address_plus_1));
367 /* Add a displacement to the set of those considered valid by the */
368 /* collector. GC_register_displacement(n) means that if p was returned */
369 /* by GC_malloc, then (char *)p + n will be considered to be a valid */
370 /* pointer to p. N must be small and less than the size of p. */
371 /* (All pointers to the interior of objects from the stack are */
372 /* considered valid in any case. This applies to heap objects and */
374 /* Preferably, this should be called before any other GC procedures. */
375 /* Calling it later adds to the probability of excess memory */
377 /* This is a no-op if the collector has recognition of */
378 /* arbitrary interior pointers enabled, which is now the default. */
379 GC_API void GC_register_displacement GC_PROTO((GC_word n));
381 /* The following version should be used if any debugging allocation is */
383 GC_API void GC_debug_register_displacement GC_PROTO((GC_word n));
385 /* Explicitly trigger a full, world-stop collection. */
386 GC_API void GC_gcollect GC_PROTO((void));
388 /* Trigger a full world-stopped collection. Abort the collection if */
389 /* and when stop_func returns a nonzero value. Stop_func will be */
390 /* called frequently, and should be reasonably fast. This works even */
391 /* if virtual dirty bits, and hence incremental collection is not */
392 /* available for this architecture. Collections can be aborted faster */
393 /* than normal pause times for incremental collection. However, */
394 /* aborted collections do no useful work; the next collection needs */
395 /* to start from the beginning. */
396 /* Return 0 if the collection was aborted, 1 if it succeeded. */
397 typedef int (* GC_stop_func) GC_PROTO((void));
398 GC_API int GC_try_to_collect GC_PROTO((GC_stop_func stop_func));
400 /* Return the number of bytes in the heap. Excludes collector private */
401 /* data structures. Includes empty blocks and fragmentation loss. */
402 /* Includes some pages that were allocated but never written. */
403 GC_API size_t GC_get_heap_size GC_PROTO((void));
405 /* Return a lower bound on the number of free bytes in the heap. */
406 GC_API size_t GC_get_free_bytes GC_PROTO((void));
408 /* Return the number of bytes allocated since the last collection. */
409 GC_API size_t GC_get_bytes_since_gc GC_PROTO((void));
411 /* Return the total number of bytes allocated in this process. */
412 /* Never decreases, except due to wrapping. */
413 GC_API size_t GC_get_total_bytes GC_PROTO((void));
415 /* Disable garbage collection. Even GC_gcollect calls will be */
417 GC_API void GC_disable GC_PROTO((void));
419 /* Reenable garbage collection. GC_disable() and GC_enable() calls */
420 /* nest. Garbage collection is enabled if the number of calls to both */
421 /* both functions is equal. */
422 GC_API void GC_enable GC_PROTO((void));
424 /* Enable incremental/generational collection. */
425 /* Not advisable unless dirty bits are */
426 /* available or most heap objects are */
427 /* pointerfree(atomic) or immutable. */
428 /* Don't use in leak finding mode. */
429 /* Ignored if GC_dont_gc is true. */
430 /* Only the generational piece of this is */
431 /* functional if GC_parallel is TRUE */
432 /* or if GC_time_limit is GC_TIME_UNLIMITED. */
433 /* Causes GC_local_gcj_malloc() to revert to */
434 /* locked allocation. Must be called */
435 /* before any GC_local_gcj_malloc() calls. */
436 GC_API void GC_enable_incremental GC_PROTO((void));
438 /* Does incremental mode write-protect pages? Returns zero or */
439 /* more of the following, or'ed together: */
440 #define GC_PROTECTS_POINTER_HEAP 1 /* May protect non-atomic objs. */
441 #define GC_PROTECTS_PTRFREE_HEAP 2
442 #define GC_PROTECTS_STATIC_DATA 4 /* Curently never. */
443 #define GC_PROTECTS_STACK 8 /* Probably impractical. */
445 #define GC_PROTECTS_NONE 0
446 GC_API int GC_incremental_protection_needs GC_PROTO((void));
448 /* Perform some garbage collection work, if appropriate. */
449 /* Return 0 if there is no more work to be done. */
450 /* Typically performs an amount of work corresponding roughly */
451 /* to marking from one page. May do more work if further */
452 /* progress requires it, e.g. if incremental collection is */
453 /* disabled. It is reasonable to call this in a wait loop */
454 /* until it returns 0. */
455 GC_API int GC_collect_a_little GC_PROTO((void));
457 /* Allocate an object of size lb bytes. The client guarantees that */
458 /* as long as the object is live, it will be referenced by a pointer */
459 /* that points to somewhere within the first 256 bytes of the object. */
460 /* (This should normally be declared volatile to prevent the compiler */
461 /* from invalidating this assertion.) This routine is only useful */
462 /* if a large array is being allocated. It reduces the chance of */
463 /* accidentally retaining such an array as a result of scanning an */
464 /* integer that happens to be an address inside the array. (Actually, */
465 /* it reduces the chance of the allocator not finding space for such */
466 /* an array, since it will try hard to avoid introducing such a false */
467 /* reference.) On a SunOS 4.X or MS Windows system this is recommended */
468 /* for arrays likely to be larger than 100K or so. For other systems, */
469 /* or if the collector is not configured to recognize all interior */
470 /* pointers, the threshold is normally much higher. */
471 GC_API GC_PTR GC_malloc_ignore_off_page GC_PROTO((size_t lb));
472 GC_API GC_PTR GC_malloc_atomic_ignore_off_page GC_PROTO((size_t lb));
474 #if defined(__sgi) && !defined(__GNUC__) && _COMPILER_VERSION >= 720
475 # define GC_ADD_CALLER
476 # define GC_RETURN_ADDR (GC_word)__return_address
479 #if defined(__linux__) || defined(__GLIBC__)
480 # include <features.h>
481 # if (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 1 || __GLIBC__ > 2) \
482 && !defined(__ia64__)
483 # ifndef GC_HAVE_BUILTIN_BACKTRACE
484 /* # define GC_HAVE_BUILTIN_BACKTRACE */
487 # if defined(__i386__) || defined(__x86_64__)
488 # define GC_CAN_SAVE_CALL_STACKS
492 #if defined(GC_HAVE_BUILTIN_BACKTRACE) && !defined(GC_CAN_SAVE_CALL_STACKS)
493 # define GC_CAN_SAVE_CALL_STACKS
496 #if defined(__sparc__)
497 # define GC_CAN_SAVE_CALL_STACKS
500 /* If we're on an a platform on which we can't save call stacks, but */
501 /* gcc is normally used, we go ahead and define GC_ADD_CALLER. */
502 /* We make this decision independent of whether gcc is actually being */
503 /* used, in order to keep the interface consistent, and allow mixing */
505 /* This may also be desirable if it is possible but expensive to */
506 /* retrieve the call chain. */
507 #if (defined(__linux__) || defined(__NetBSD__) || defined(__OpenBSD__) \
508 || defined(__FreeBSD__) || defined(__DragonFly__)) & !defined(GC_CAN_SAVE_CALL_STACKS)
509 # define GC_ADD_CALLER
510 # if __GNUC__ >= 3 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 95)
511 /* gcc knows how to retrieve return address, but we don't know */
512 /* how to generate call stacks. */
513 # define GC_RETURN_ADDR (GC_word)__builtin_return_address(0)
515 /* Just pass 0 for gcc compatibility. */
516 # define GC_RETURN_ADDR 0
521 # define GC_EXTRAS GC_RETURN_ADDR, __FILE__, __LINE__
522 # define GC_EXTRA_PARAMS GC_word ra, GC_CONST char * s, int i
524 # define GC_EXTRAS __FILE__, __LINE__
525 # define GC_EXTRA_PARAMS GC_CONST char * s, int i
528 /* Debugging (annotated) allocation. GC_gcollect will check */
529 /* objects allocated in this way for overwrites, etc. */
530 GC_API GC_PTR GC_debug_malloc
531 GC_PROTO((size_t size_in_bytes, GC_EXTRA_PARAMS));
532 GC_API GC_PTR GC_debug_malloc_atomic
533 GC_PROTO((size_t size_in_bytes, GC_EXTRA_PARAMS));
534 GC_API char *GC_debug_strdup
535 GC_PROTO((const char *str, GC_EXTRA_PARAMS));
536 GC_API GC_PTR GC_debug_malloc_uncollectable
537 GC_PROTO((size_t size_in_bytes, GC_EXTRA_PARAMS));
538 GC_API GC_PTR GC_debug_malloc_stubborn
539 GC_PROTO((size_t size_in_bytes, GC_EXTRA_PARAMS));
540 GC_API GC_PTR GC_debug_malloc_ignore_off_page
541 GC_PROTO((size_t size_in_bytes, GC_EXTRA_PARAMS));
542 GC_API GC_PTR GC_debug_malloc_atomic_ignore_off_page
543 GC_PROTO((size_t size_in_bytes, GC_EXTRA_PARAMS));
544 GC_API void GC_debug_free GC_PROTO((GC_PTR object_addr));
545 GC_API GC_PTR GC_debug_realloc
546 GC_PROTO((GC_PTR old_object, size_t new_size_in_bytes,
548 GC_API void GC_debug_change_stubborn GC_PROTO((GC_PTR));
549 GC_API void GC_debug_end_stubborn_change GC_PROTO((GC_PTR));
551 /* Routines that allocate objects with debug information (like the */
552 /* above), but just fill in dummy file and line number information. */
553 /* Thus they can serve as drop-in malloc/realloc replacements. This */
554 /* can be useful for two reasons: */
555 /* 1) It allows the collector to be built with DBG_HDRS_ALL defined */
556 /* even if some allocation calls come from 3rd party libraries */
557 /* that can't be recompiled. */
558 /* 2) On some platforms, the file and line information is redundant, */
559 /* since it can be reconstructed from a stack trace. On such */
560 /* platforms it may be more convenient not to recompile, e.g. for */
561 /* leak detection. This can be accomplished by instructing the */
562 /* linker to replace malloc/realloc with these. */
563 GC_API GC_PTR GC_debug_malloc_replacement GC_PROTO((size_t size_in_bytes));
564 GC_API GC_PTR GC_debug_realloc_replacement
565 GC_PROTO((GC_PTR object_addr, size_t size_in_bytes));
568 # define GC_MALLOC(sz) GC_debug_malloc(sz, GC_EXTRAS)
569 # define GC_MALLOC_ATOMIC(sz) GC_debug_malloc_atomic(sz, GC_EXTRAS)
570 # define GC_STRDUP(s) GC_debug_strdup((s), GC_EXTRAS)
571 # define GC_MALLOC_UNCOLLECTABLE(sz) \
572 GC_debug_malloc_uncollectable(sz, GC_EXTRAS)
573 # define GC_MALLOC_IGNORE_OFF_PAGE(sz) \
574 GC_debug_malloc_ignore_off_page(sz, GC_EXTRAS)
575 # define GC_MALLOC_ATOMIC_IGNORE_OFF_PAGE(sz) \
576 GC_debug_malloc_atomic_ignore_off_page(sz, GC_EXTRAS)
577 # define GC_REALLOC(old, sz) GC_debug_realloc(old, sz, GC_EXTRAS)
578 # define GC_FREE(p) GC_debug_free(p)
579 # define GC_REGISTER_FINALIZER(p, f, d, of, od) \
580 GC_debug_register_finalizer(p, f, d, of, od)
581 # define GC_REGISTER_FINALIZER_IGNORE_SELF(p, f, d, of, od) \
582 GC_debug_register_finalizer_ignore_self(p, f, d, of, od)
583 # define GC_REGISTER_FINALIZER_NO_ORDER(p, f, d, of, od) \
584 GC_debug_register_finalizer_no_order(p, f, d, of, od)
585 # define GC_MALLOC_STUBBORN(sz) GC_debug_malloc_stubborn(sz, GC_EXTRAS);
586 # define GC_CHANGE_STUBBORN(p) GC_debug_change_stubborn(p)
587 # define GC_END_STUBBORN_CHANGE(p) GC_debug_end_stubborn_change(p)
588 # define GC_GENERAL_REGISTER_DISAPPEARING_LINK(link, obj) \
589 GC_general_register_disappearing_link(link, GC_base(obj))
590 # define GC_REGISTER_DISPLACEMENT(n) GC_debug_register_displacement(n)
592 # define GC_MALLOC(sz) GC_malloc(sz)
593 # define GC_MALLOC_ATOMIC(sz) GC_malloc_atomic(sz)
594 # define GC_STRDUP(s) GC_strdup(s)
595 # define GC_MALLOC_UNCOLLECTABLE(sz) GC_malloc_uncollectable(sz)
596 # define GC_MALLOC_IGNORE_OFF_PAGE(sz) \
597 GC_malloc_ignore_off_page(sz)
598 # define GC_MALLOC_ATOMIC_IGNORE_OFF_PAGE(sz) \
599 GC_malloc_atomic_ignore_off_page(sz)
600 # define GC_REALLOC(old, sz) GC_realloc(old, sz)
601 # define GC_FREE(p) GC_free(p)
602 # define GC_REGISTER_FINALIZER(p, f, d, of, od) \
603 GC_register_finalizer(p, f, d, of, od)
604 # define GC_REGISTER_FINALIZER_IGNORE_SELF(p, f, d, of, od) \
605 GC_register_finalizer_ignore_self(p, f, d, of, od)
606 # define GC_REGISTER_FINALIZER_NO_ORDER(p, f, d, of, od) \
607 GC_register_finalizer_no_order(p, f, d, of, od)
608 # define GC_MALLOC_STUBBORN(sz) GC_malloc_stubborn(sz)
609 # define GC_CHANGE_STUBBORN(p) GC_change_stubborn(p)
610 # define GC_END_STUBBORN_CHANGE(p) GC_end_stubborn_change(p)
611 # define GC_GENERAL_REGISTER_DISAPPEARING_LINK(link, obj) \
612 GC_general_register_disappearing_link(link, obj)
613 # define GC_REGISTER_DISPLACEMENT(n) GC_register_displacement(n)
615 /* The following are included because they are often convenient, and */
616 /* reduce the chance for a misspecifed size argument. But calls may */
617 /* expand to something syntactically incorrect if t is a complicated */
618 /* type expression. */
619 # define GC_NEW(t) (t *)GC_MALLOC(sizeof (t))
620 # define GC_NEW_ATOMIC(t) (t *)GC_MALLOC_ATOMIC(sizeof (t))
621 # define GC_NEW_STUBBORN(t) (t *)GC_MALLOC_STUBBORN(sizeof (t))
622 # define GC_NEW_UNCOLLECTABLE(t) (t *)GC_MALLOC_UNCOLLECTABLE(sizeof (t))
624 /* Finalization. Some of these primitives are grossly unsafe. */
625 /* The idea is to make them both cheap, and sufficient to build */
626 /* a safer layer, closer to Modula-3, Java, or PCedar finalization. */
627 /* The interface represents my conclusions from a long discussion */
628 /* with Alan Demers, Dan Greene, Carl Hauser, Barry Hayes, */
629 /* Christian Jacobi, and Russ Atkinson. It's not perfect, and */
630 /* probably nobody else agrees with it. Hans-J. Boehm 3/13/92 */
631 typedef void (*GC_finalization_proc)
632 GC_PROTO((GC_PTR obj, GC_PTR client_data));
634 GC_API void GC_register_finalizer
635 GC_PROTO((GC_PTR obj, GC_finalization_proc fn, GC_PTR cd,
636 GC_finalization_proc *ofn, GC_PTR *ocd));
637 GC_API void GC_debug_register_finalizer
638 GC_PROTO((GC_PTR obj, GC_finalization_proc fn, GC_PTR cd,
639 GC_finalization_proc *ofn, GC_PTR *ocd));
640 /* When obj is no longer accessible, invoke */
641 /* (*fn)(obj, cd). If a and b are inaccessible, and */
642 /* a points to b (after disappearing links have been */
643 /* made to disappear), then only a will be */
644 /* finalized. (If this does not create any new */
645 /* pointers to b, then b will be finalized after the */
646 /* next collection.) Any finalizable object that */
647 /* is reachable from itself by following one or more */
648 /* pointers will not be finalized (or collected). */
649 /* Thus cycles involving finalizable objects should */
650 /* be avoided, or broken by disappearing links. */
651 /* All but the last finalizer registered for an object */
653 /* Finalization may be removed by passing 0 as fn. */
654 /* Finalizers are implicitly unregistered just before */
655 /* they are invoked. */
656 /* The old finalizer and client data are stored in */
658 /* Fn is never invoked on an accessible object, */
659 /* provided hidden pointers are converted to real */
660 /* pointers only if the allocation lock is held, and */
661 /* such conversions are not performed by finalization */
663 /* If GC_register_finalizer is aborted as a result of */
664 /* a signal, the object may be left with no */
665 /* finalization, even if neither the old nor new */
666 /* finalizer were NULL. */
667 /* Obj should be the nonNULL starting address of an */
668 /* object allocated by GC_malloc or friends. */
669 /* Note that any garbage collectable object referenced */
670 /* by cd will be considered accessible until the */
671 /* finalizer is invoked. */
673 /* Another versions of the above follow. It ignores */
674 /* self-cycles, i.e. pointers from a finalizable object to */
675 /* itself. There is a stylistic argument that this is wrong, */
676 /* but it's unavoidable for C++, since the compiler may */
677 /* silently introduce these. It's also benign in that specific */
678 /* case. And it helps if finalizable objects are split to */
680 /* Note that cd will still be viewed as accessible, even if it */
681 /* refers to the object itself. */
682 GC_API void GC_register_finalizer_ignore_self
683 GC_PROTO((GC_PTR obj, GC_finalization_proc fn, GC_PTR cd,
684 GC_finalization_proc *ofn, GC_PTR *ocd));
685 GC_API void GC_debug_register_finalizer_ignore_self
686 GC_PROTO((GC_PTR obj, GC_finalization_proc fn, GC_PTR cd,
687 GC_finalization_proc *ofn, GC_PTR *ocd));
689 /* Another version of the above. It ignores all cycles. */
690 /* It should probably only be used by Java implementations. */
691 /* Note that cd will still be viewed as accessible, even if it */
692 /* refers to the object itself. */
693 GC_API void GC_register_finalizer_no_order
694 GC_PROTO((GC_PTR obj, GC_finalization_proc fn, GC_PTR cd,
695 GC_finalization_proc *ofn, GC_PTR *ocd));
696 GC_API void GC_debug_register_finalizer_no_order
697 GC_PROTO((GC_PTR obj, GC_finalization_proc fn, GC_PTR cd,
698 GC_finalization_proc *ofn, GC_PTR *ocd));
701 /* The following routine may be used to break cycles between */
702 /* finalizable objects, thus causing cyclic finalizable */
703 /* objects to be finalized in the correct order. Standard */
704 /* use involves calling GC_register_disappearing_link(&p), */
705 /* where p is a pointer that is not followed by finalization */
706 /* code, and should not be considered in determining */
707 /* finalization order. */
708 GC_API int GC_register_disappearing_link GC_PROTO((GC_PTR * /* link */));
709 /* Link should point to a field of a heap allocated */
710 /* object obj. *link will be cleared when obj is */
711 /* found to be inaccessible. This happens BEFORE any */
712 /* finalization code is invoked, and BEFORE any */
713 /* decisions about finalization order are made. */
714 /* This is useful in telling the finalizer that */
715 /* some pointers are not essential for proper */
716 /* finalization. This may avoid finalization cycles. */
717 /* Note that obj may be resurrected by another */
718 /* finalizer, and thus the clearing of *link may */
719 /* be visible to non-finalization code. */
720 /* There's an argument that an arbitrary action should */
721 /* be allowed here, instead of just clearing a pointer. */
722 /* But this causes problems if that action alters, or */
723 /* examines connectivity. */
724 /* Returns 1 if link was already registered, 0 */
726 /* Only exists for backward compatibility. See below: */
728 GC_API int GC_general_register_disappearing_link
729 GC_PROTO((GC_PTR * /* link */, GC_PTR obj));
730 /* A slight generalization of the above. *link is */
731 /* cleared when obj first becomes inaccessible. This */
732 /* can be used to implement weak pointers easily and */
733 /* safely. Typically link will point to a location */
734 /* holding a disguised pointer to obj. (A pointer */
735 /* inside an "atomic" object is effectively */
736 /* disguised.) In this way soft */
737 /* pointers are broken before any object */
738 /* reachable from them are finalized. Each link */
739 /* May be registered only once, i.e. with one obj */
740 /* value. This was added after a long email discussion */
741 /* with John Ellis. */
742 /* Obj must be a pointer to the first word of an object */
743 /* we allocated. It is unsafe to explicitly deallocate */
744 /* the object containing link. Explicitly deallocating */
745 /* obj may or may not cause link to eventually be */
747 GC_API int GC_unregister_disappearing_link GC_PROTO((GC_PTR * /* link */));
748 /* Returns 0 if link was not actually registered. */
749 /* Undoes a registration by either of the above two */
752 GC_API void GC_finalize_all();
754 /* Returns !=0 if GC_invoke_finalizers has something to do. */
755 GC_API int GC_should_invoke_finalizers GC_PROTO((void));
757 GC_API int GC_invoke_finalizers GC_PROTO((void));
758 /* Run finalizers for all objects that are ready to */
759 /* be finalized. Return the number of finalizers */
760 /* that were run. Normally this is also called */
761 /* implicitly during some allocations. If */
762 /* GC_finalize_on_demand is nonzero, it must be called */
765 /* GC_set_warn_proc can be used to redirect or filter warning messages. */
766 /* p may not be a NULL pointer. */
767 typedef void (*GC_warn_proc) GC_PROTO((char *msg, GC_word arg));
768 GC_API GC_warn_proc GC_set_warn_proc GC_PROTO((GC_warn_proc p));
769 /* Returns old warning procedure. */
771 GC_API GC_word GC_set_free_space_divisor GC_PROTO((GC_word value));
772 /* Set free_space_divisor. See above for definition. */
773 /* Returns old value. */
775 /* The following is intended to be used by a higher level */
776 /* (e.g. Java-like) finalization facility. It is expected */
777 /* that finalization code will arrange for hidden pointers to */
778 /* disappear. Otherwise objects can be accessed after they */
779 /* have been collected. */
780 /* Note that putting pointers in atomic objects or in */
781 /* nonpointer slots of "typed" objects is equivalent to */
782 /* disguising them in this way, and may have other advantages. */
783 # if defined(I_HIDE_POINTERS) || defined(GC_I_HIDE_POINTERS)
784 typedef GC_word GC_hidden_pointer;
785 # define HIDE_POINTER(p) (~(GC_hidden_pointer)(p))
786 # define REVEAL_POINTER(p) ((GC_PTR)(HIDE_POINTER(p)))
787 /* Converting a hidden pointer to a real pointer requires verifying */
788 /* that the object still exists. This involves acquiring the */
789 /* allocator lock to avoid a race with the collector. */
790 # endif /* I_HIDE_POINTERS */
792 typedef GC_PTR (*GC_fn_type) GC_PROTO((GC_PTR client_data));
793 GC_API GC_PTR GC_call_with_alloc_lock
794 GC_PROTO((GC_fn_type fn, GC_PTR client_data));
796 /* The following routines are primarily intended for use with a */
797 /* preprocessor which inserts calls to check C pointer arithmetic. */
798 /* They indicate failure by invoking the corresponding _print_proc. */
800 /* Check that p and q point to the same object. */
801 /* Fail conspicuously if they don't. */
802 /* Returns the first argument. */
803 /* Succeeds if neither p nor q points to the heap. */
804 /* May succeed if both p and q point to between heap objects. */
805 GC_API GC_PTR GC_same_obj GC_PROTO((GC_PTR p, GC_PTR q));
807 /* Checked pointer pre- and post- increment operations. Note that */
808 /* the second argument is in units of bytes, not multiples of the */
809 /* object size. This should either be invoked from a macro, or the */
810 /* call should be automatically generated. */
811 GC_API GC_PTR GC_pre_incr GC_PROTO((GC_PTR *p, size_t how_much));
812 GC_API GC_PTR GC_post_incr GC_PROTO((GC_PTR *p, size_t how_much));
814 /* Check that p is visible */
815 /* to the collector as a possibly pointer containing location. */
816 /* If it isn't fail conspicuously. */
817 /* Returns the argument in all cases. May erroneously succeed */
818 /* in hard cases. (This is intended for debugging use with */
819 /* untyped allocations. The idea is that it should be possible, though */
820 /* slow, to add such a call to all indirect pointer stores.) */
821 /* Currently useless for multithreaded worlds. */
822 GC_API GC_PTR GC_is_visible GC_PROTO((GC_PTR p));
824 /* Check that if p is a pointer to a heap page, then it points to */
825 /* a valid displacement within a heap object. */
826 /* Fail conspicuously if this property does not hold. */
827 /* Uninteresting with GC_all_interior_pointers. */
828 /* Always returns its argument. */
829 GC_API GC_PTR GC_is_valid_displacement GC_PROTO((GC_PTR p));
831 /* Safer, but slow, pointer addition. Probably useful mainly with */
832 /* a preprocessor. Useful only for heap pointers. */
834 # define GC_PTR_ADD3(x, n, type_of_result) \
835 ((type_of_result)GC_same_obj((x)+(n), (x)))
836 # define GC_PRE_INCR3(x, n, type_of_result) \
837 ((type_of_result)GC_pre_incr(&(x), (n)*sizeof(*x))
838 # define GC_POST_INCR2(x, type_of_result) \
839 ((type_of_result)GC_post_incr(&(x), sizeof(*x))
841 # define GC_PTR_ADD(x, n) \
842 GC_PTR_ADD3(x, n, typeof(x))
843 # define GC_PRE_INCR(x, n) \
844 GC_PRE_INCR3(x, n, typeof(x))
845 # define GC_POST_INCR(x, n) \
846 GC_POST_INCR3(x, typeof(x))
848 /* We can't do this right without typeof, which ANSI */
849 /* decided was not sufficiently useful. Repeatedly */
850 /* mentioning the arguments seems too dangerous to be */
851 /* useful. So does not casting the result. */
852 # define GC_PTR_ADD(x, n) ((x)+(n))
854 #else /* !GC_DEBUG */
855 # define GC_PTR_ADD3(x, n, type_of_result) ((x)+(n))
856 # define GC_PTR_ADD(x, n) ((x)+(n))
857 # define GC_PRE_INCR3(x, n, type_of_result) ((x) += (n))
858 # define GC_PRE_INCR(x, n) ((x) += (n))
859 # define GC_POST_INCR2(x, n, type_of_result) ((x)++)
860 # define GC_POST_INCR(x, n) ((x)++)
863 /* Safer assignment of a pointer to a nonstack location. */
865 # if defined(__STDC__) || defined(_AIX)
866 # define GC_PTR_STORE(p, q) \
867 (*(void **)GC_is_visible(p) = GC_is_valid_displacement(q))
869 # define GC_PTR_STORE(p, q) \
870 (*(char **)GC_is_visible(p) = GC_is_valid_displacement(q))
872 #else /* !GC_DEBUG */
873 # define GC_PTR_STORE(p, q) *((p) = (q))
876 /* Functions called to report pointer checking errors */
877 GC_API void (*GC_same_obj_print_proc) GC_PROTO((GC_PTR p, GC_PTR q));
879 GC_API void (*GC_is_valid_displacement_print_proc)
880 GC_PROTO((GC_PTR p));
882 GC_API void (*GC_is_visible_print_proc)
883 GC_PROTO((GC_PTR p));
886 /* For pthread support, we generally need to intercept a number of */
887 /* thread library calls. We do that here by macro defining them. */
889 #if !defined(GC_USE_LD_WRAP) && \
890 (defined(GC_PTHREADS) || defined(GC_SOLARIS_THREADS))
891 # include "gc_pthread_redirects.h"
894 # if defined(PCR) || defined(GC_SOLARIS_THREADS) || \
895 defined(GC_PTHREADS) || defined(GC_WIN32_THREADS)
896 /* Any flavor of threads except SRC_M3. */
897 /* This returns a list of objects, linked through their first */
898 /* word. Its use can greatly reduce lock contention problems, since */
899 /* the allocation lock can be acquired and released many fewer times. */
900 /* lb must be large enough to hold the pointer field. */
901 /* It is used internally by gc_local_alloc.h, which provides a simpler */
902 /* programming interface on Linux. */
903 GC_PTR GC_malloc_many(size_t lb);
904 #define GC_NEXT(p) (*(GC_PTR *)(p)) /* Retrieve the next element */
905 /* in returned list. */
906 extern void GC_thr_init GC_PROTO((void));/* Needed for Solaris/X86 */
908 #endif /* THREADS && !SRC_M3 */
910 #if defined(GC_WIN32_THREADS) && !defined(__CYGWIN32__) && !defined(__CYGWIN__)
911 # include <windows.h>
914 * All threads must be created using GC_CreateThread, so that they will be
915 * recorded in the thread table. For backwards compatibility, this is not
916 * technically true if the GC is built as a dynamic library, since it can
917 * and does then use DllMain to keep track of thread creations. But new code
918 * should be built to call GC_CreateThread.
920 GC_API HANDLE WINAPI GC_CreateThread(
921 LPSECURITY_ATTRIBUTES lpThreadAttributes,
922 DWORD dwStackSize, LPTHREAD_START_ROUTINE lpStartAddress,
923 LPVOID lpParameter, DWORD dwCreationFlags, LPDWORD lpThreadId );
925 # if defined(_WIN32_WCE)
927 * win32_threads.c implements the real WinMain, which will start a new thread
928 * to call GC_WinMain after initializing the garbage collector.
930 int WINAPI GC_WinMain(
932 HINSTANCE hPrevInstance,
937 # define WinMain GC_WinMain
938 # define CreateThread GC_CreateThread
940 # endif /* defined(_WIN32_WCE) */
942 #endif /* defined(GC_WIN32_THREADS) && !cygwin */
945 * Fully portable code should call GC_INIT() from the main program
946 * before making any other GC_ calls. On most platforms this is a
947 * no-op and the collector self-initializes. But a number of platforms
948 * make that too hard.
950 #if (defined(sparc) || defined(__sparc)) && defined(sun)
952 * If you are planning on putting
953 * the collector in a SunOS 5 dynamic library, you need to call GC_INIT()
954 * from the statically loaded program section.
955 * This circumvents a Solaris 2.X (X<=4) linker bug.
957 extern int _end[], _etext[];
959 extern "C" void GC_noop1(GC_word);
962 # endif /* !__cplusplus */
963 # define GC_INIT() { GC_noop1((GC_word)_end); \
964 GC_noop1((GC_word)_etext); }
966 # if defined(__CYGWIN32__) || defined (_AIX)
968 * Similarly gnu-win32 DLLs need explicit initialization from
969 * the main program, as does AIX.
972 extern int _data_start__[];
973 extern int _data_end__[];
974 extern int _bss_start__[];
975 extern int _bss_end__[];
976 # define GC_MAX(x,y) ((x) > (y) ? (x) : (y))
977 # define GC_MIN(x,y) ((x) < (y) ? (x) : (y))
978 # define GC_DATASTART ((GC_PTR) GC_MIN(_data_start__, _bss_start__))
979 # define GC_DATAEND ((GC_PTR) GC_MAX(_data_end__, _bss_end__))
981 # define GC_INIT() { GC_add_roots(GC_DATASTART, GC_DATAEND); }
987 extern int _data[], _end[];
988 # define GC_DATASTART ((GC_PTR)((ulong)_data))
989 # define GC_DATAEND ((GC_PTR)((ulong)_end))
990 # define GC_INIT() { GC_add_roots(GC_DATASTART, GC_DATAEND); }
993 # if defined(__APPLE__) && defined(__MACH__) || defined(GC_WIN32_THREADS)
994 # define GC_INIT() { GC_init(); }
997 # endif /* !__MACH && !GC_WIN32_THREADS */
998 # endif /* !AIX && !cygwin */
1001 #if !defined(_WIN32_WCE) \
1002 && ((defined(_MSDOS) || defined(_MSC_VER)) && (_M_IX86 >= 300) \
1003 || defined(_WIN32) && !defined(__CYGWIN32__) && !defined(__CYGWIN__))
1004 /* win32S may not free all resources on process exit. */
1005 /* This explicitly deallocates the heap. */
1006 GC_API void GC_win32_free_heap ();
1009 #if ( defined(_AMIGA) && !defined(GC_AMIGA_MAKINGLIB) )
1010 /* Allocation really goes through GC_amiga_allocwrapper_do */
1011 # include "gc_amiga_redirects.h"
1014 #if defined(GC_REDIRECT_TO_LOCAL) && !defined(GC_LOCAL_ALLOC_H)
1015 # include "gc_local_alloc.h"
1019 } /* end of extern "C" */
projects / cacao.git / blob