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. */
65 typedef unsigned __int64 GC_word;
66 typedef __int64 GC_signed_word;
69 /* Public read-only variables */
71 GC_API GC_word GC_gc_no;/* Counter incremented per collection. */
72 /* Includes empty GCs at startup. */
74 GC_API int GC_parallel; /* GC is parallelized for performance on */
75 /* multiprocessors. Currently set only */
76 /* implicitly if collector is built with */
77 /* -DPARALLEL_MARK and if either: */
78 /* Env variable GC_NPROC is set to > 1, or */
79 /* GC_NPROC is not set and this is an MP. */
80 /* If GC_parallel is set, incremental */
81 /* collection is only partially functional, */
82 /* and may not be desirable. */
85 /* Public R/W variables */
87 GC_API GC_PTR (*GC_oom_fn) GC_PROTO((size_t bytes_requested));
88 /* When there is insufficient memory to satisfy */
89 /* an allocation request, we return */
90 /* (*GC_oom_fn)(). By default this just */
92 /* If it returns, it must return 0 or a valid */
93 /* pointer to a previously allocated heap */
96 // Keep somewhat in sync with mono/metadata/profiler.h:enum MonoGCEvent
101 GC_EVENT_RECLAIM_START,
102 GC_EVENT_RECLAIM_END,
104 GC_EVENT_PRE_STOP_WORLD,
105 GC_EVENT_POST_STOP_WORLD,
106 GC_EVENT_PRE_START_WORLD,
107 GC_EVENT_POST_START_WORLD
110 GC_API void GC_set_on_collection_event GC_PROTO((void (*) (GC_EventType)));
111 /* Set callback invoked at specific points */
112 /* during every collection. */
114 GC_API void (*GC_on_heap_resize) GC_PROTO((size_t new_size));
115 /* Invoked when the heap grows or shrinks */
117 GC_API int GC_find_leak;
118 /* Do not actually garbage collect, but simply */
119 /* report inaccessible memory that was not */
120 /* deallocated with GC_free. Initial value */
121 /* is determined by FIND_LEAK macro. */
123 GC_API int GC_all_interior_pointers;
124 /* Arrange for pointers to object interiors to */
125 /* be recognized as valid. May not be changed */
126 /* after GC initialization. */
127 /* Initial value is determined by */
128 /* -DALL_INTERIOR_POINTERS. */
129 /* Unless DONT_ADD_BYTE_AT_END is defined, this */
130 /* also affects whether sizes are increased by */
131 /* at least a byte to allow "off the end" */
132 /* pointer recognition. */
133 /* MUST BE 0 or 1. */
135 GC_API int GC_quiet; /* Disable statistics output. Only matters if */
136 /* collector has been compiled with statistics */
137 /* enabled. This involves a performance cost, */
138 /* and is thus not the default. */
140 GC_API int GC_finalize_on_demand;
141 /* If nonzero, finalizers will only be run in */
142 /* response to an explicit GC_invoke_finalizers */
143 /* call. The default is determined by whether */
144 /* the FINALIZE_ON_DEMAND macro is defined */
145 /* when the collector is built. */
147 GC_API int GC_java_finalization;
148 /* Mark objects reachable from finalizable */
149 /* objects in a separate postpass. This makes */
150 /* it a bit safer to use non-topologically- */
151 /* ordered finalization. Default value is */
152 /* determined by JAVA_FINALIZATION macro. */
154 GC_API void (* GC_finalizer_notifier)(void);
155 /* Invoked by the collector when there are */
156 /* objects to be finalized. Invoked at most */
157 /* once per GC cycle. Never invoked unless */
158 /* GC_finalize_on_demand is set. */
159 /* Typically this will notify a finalization */
160 /* thread, which will call GC_invoke_finalizers */
163 GC_API int GC_dont_gc; /* != 0 ==> Dont collect. In versions 6.2a1+, */
164 /* this overrides explicit GC_gcollect() calls. */
165 /* Used as a counter, so that nested enabling */
166 /* and disabling work correctly. Should */
167 /* normally be updated with GC_enable() and */
168 /* GC_disable() calls. */
169 /* Direct assignment to GC_dont_gc is */
172 GC_API int GC_dont_expand;
173 /* Dont expand heap unless explicitly requested */
176 GC_API int GC_use_entire_heap;
177 /* Causes the nonincremental collector to use the */
178 /* entire heap before collecting. This was the only */
179 /* option for GC versions < 5.0. This sometimes */
180 /* results in more large block fragmentation, since */
181 /* very larg blocks will tend to get broken up */
182 /* during each GC cycle. It is likely to result in a */
183 /* larger working set, but lower collection */
184 /* frequencies, and hence fewer instructions executed */
185 /* in the collector. */
187 GC_API int GC_full_freq; /* Number of partial collections between */
188 /* full collections. Matters only if */
189 /* GC_incremental is set. */
190 /* Full collections are also triggered if */
191 /* the collector detects a substantial */
192 /* increase in the number of in-use heap */
193 /* blocks. Values in the tens are now */
194 /* perfectly reasonable, unlike for */
195 /* earlier GC versions. */
197 GC_API GC_word GC_non_gc_bytes;
198 /* Bytes not considered candidates for collection. */
199 /* Used only to control scheduling of collections. */
200 /* Updated by GC_malloc_uncollectable and GC_free. */
203 GC_API int GC_no_dls;
204 /* Don't register dynamic library data segments. */
205 /* Wizards only. Should be used only if the */
206 /* application explicitly registers all roots. */
207 /* In Microsoft Windows environments, this will */
208 /* usually also prevent registration of the */
209 /* main data segment as part of the root set. */
211 GC_API GC_word GC_free_space_divisor;
212 /* We try to make sure that we allocate at */
213 /* least N/GC_free_space_divisor bytes between */
214 /* collections, where N is the heap size plus */
215 /* a rough estimate of the root set size. */
216 /* Initially, GC_free_space_divisor = 3. */
217 /* Increasing its value will use less space */
218 /* but more collection time. Decreasing it */
219 /* will appreciably decrease collection time */
220 /* at the expense of space. */
221 /* GC_free_space_divisor = 1 will effectively */
222 /* disable collections. */
224 GC_API GC_word GC_max_retries;
225 /* The maximum number of GCs attempted before */
226 /* reporting out of memory after heap */
227 /* expansion fails. Initially 0. */
230 GC_API char *GC_stackbottom; /* Cool end of user stack. */
231 /* May be set in the client prior to */
232 /* calling any GC_ routines. This */
233 /* avoids some overhead, and */
234 /* potentially some signals that can */
235 /* confuse debuggers. Otherwise the */
236 /* collector attempts to set it */
238 /* For multithreaded code, this is the */
239 /* cold end of the stack for the */
240 /* primordial thread. */
242 GC_API int GC_dont_precollect; /* Don't collect as part of */
243 /* initialization. Should be set only */
244 /* if the client wants a chance to */
245 /* manually initialize the root set */
246 /* before the first collection. */
247 /* Interferes with blacklisting. */
250 GC_API unsigned long GC_time_limit;
251 /* If incremental collection is enabled, */
252 /* We try to terminate collections */
253 /* after this many milliseconds. Not a */
254 /* hard time bound. Setting this to */
255 /* GC_TIME_UNLIMITED will essentially */
256 /* disable incremental collection while */
257 /* leaving generational collection */
259 # define GC_TIME_UNLIMITED 999999
260 /* Setting GC_time_limit to this value */
261 /* will disable the "pause time exceeded"*/
264 /* Public procedures */
266 /* Initialize the collector. This is only required when using thread-local
267 * allocation, since unlike the regular allocation routines, GC_local_malloc
268 * is not self-initializing. If you use GC_local_malloc you should arrange
269 * to call this somehow (e.g. from a constructor) before doing any allocation.
270 * For win32 threads, it needs to be called explicitly.
272 GC_API void GC_init GC_PROTO((void));
275 * general purpose allocation routines, with roughly malloc calling conv.
276 * The atomic versions promise that no relevant pointers are contained
277 * in the object. The nonatomic versions guarantee that the new object
278 * is cleared. GC_malloc_stubborn promises that no changes to the object
279 * will occur after GC_end_stubborn_change has been called on the
280 * result of GC_malloc_stubborn. GC_malloc_uncollectable allocates an object
281 * that is scanned for pointers to collectable objects, but is not itself
282 * collectable. The object is scanned even if it does not appear to
283 * be reachable. GC_malloc_uncollectable and GC_free called on the resulting
284 * object implicitly update GC_non_gc_bytes appropriately.
286 * Note that the GC_malloc_stubborn support is stubbed out by default
287 * starting in 6.0. GC_malloc_stubborn is an alias for GC_malloc unless
288 * the collector is built with STUBBORN_ALLOC defined.
290 GC_API GC_PTR GC_malloc GC_PROTO((size_t size_in_bytes));
291 GC_API GC_PTR GC_malloc_atomic GC_PROTO((size_t size_in_bytes));
292 GC_API GC_PTR GC_malloc_uncollectable GC_PROTO((size_t size_in_bytes));
293 GC_API GC_PTR GC_malloc_stubborn GC_PROTO((size_t size_in_bytes));
295 /* The following is only defined if the library has been suitably */
297 GC_API GC_PTR GC_malloc_atomic_uncollectable GC_PROTO((size_t size_in_bytes));
299 /* Explicitly deallocate an object. Dangerous if used incorrectly. */
300 /* Requires a pointer to the base of an object. */
301 /* If the argument is stubborn, it should not be changeable when freed. */
302 /* An object should not be enable for finalization when it is */
303 /* explicitly deallocated. */
304 /* GC_free(0) is a no-op, as required by ANSI C for free. */
305 GC_API void GC_free GC_PROTO((GC_PTR object_addr));
308 * Stubborn objects may be changed only if the collector is explicitly informed.
309 * The collector is implicitly informed of coming change when such
310 * an object is first allocated. The following routines inform the
311 * collector that an object will no longer be changed, or that it will
312 * once again be changed. Only nonNIL pointer stores into the object
313 * are considered to be changes. The argument to GC_end_stubborn_change
314 * must be exacly the value returned by GC_malloc_stubborn or passed to
315 * GC_change_stubborn. (In the second case it may be an interior pointer
316 * within 512 bytes of the beginning of the objects.)
317 * There is a performance penalty for allowing more than
318 * one stubborn object to be changed at once, but it is acceptable to
319 * do so. The same applies to dropping stubborn objects that are still
322 GC_API void GC_change_stubborn GC_PROTO((GC_PTR));
323 GC_API void GC_end_stubborn_change GC_PROTO((GC_PTR));
325 /* Return a pointer to the base (lowest address) of an object given */
326 /* a pointer to a location within the object. */
327 /* I.e. map an interior pointer to the corresponding bas pointer. */
328 /* Note that with debugging allocation, this returns a pointer to the */
329 /* actual base of the object, i.e. the debug information, not to */
330 /* the base of the user object. */
331 /* Return 0 if displaced_pointer doesn't point to within a valid */
333 /* Note that a deallocated object in the garbage collected heap */
334 /* may be considered valid, even if it has been deallocated with */
336 GC_API GC_PTR GC_base GC_PROTO((GC_PTR displaced_pointer));
338 /* Given a pointer to the base of an object, return its size in bytes. */
339 /* The returned size may be slightly larger than what was originally */
341 GC_API size_t GC_size GC_PROTO((GC_PTR object_addr));
343 /* For compatibility with C library. This is occasionally faster than */
344 /* a malloc followed by a bcopy. But if you rely on that, either here */
345 /* or with the standard C library, your code is broken. In my */
346 /* opinion, it shouldn't have been invented, but now we're stuck. -HB */
347 /* The resulting object has the same kind as the original. */
348 /* If the argument is stubborn, the result will have changes enabled. */
349 /* It is an error to have changes enabled for the original object. */
350 /* Follows ANSI comventions for NULL old_object. */
351 GC_API GC_PTR GC_realloc
352 GC_PROTO((GC_PTR old_object, size_t new_size_in_bytes));
354 /* Explicitly increase the heap size. */
355 /* Returns 0 on failure, 1 on success. */
356 GC_API int GC_expand_hp GC_PROTO((size_t number_of_bytes));
358 /* Limit the heap size to n bytes. Useful when you're debugging, */
359 /* especially on systems that don't handle running out of memory well. */
360 /* n == 0 ==> unbounded. This is the default. */
361 GC_API void GC_set_max_heap_size GC_PROTO((GC_word n));
363 /* Inform the collector that a certain section of statically allocated */
364 /* memory contains no pointers to garbage collected memory. Thus it */
365 /* need not be scanned. This is sometimes important if the application */
366 /* maps large read/write files into the address space, which could be */
367 /* mistaken for dynamic library data segments on some systems. */
368 GC_API void GC_exclude_static_roots GC_PROTO((GC_PTR start, GC_PTR finish));
370 /* Clear the set of root segments. Wizards only. */
371 GC_API void GC_clear_roots GC_PROTO((void));
373 /* Add a root segment. Wizards only. */
374 GC_API void GC_add_roots GC_PROTO((char * low_address,
375 char * high_address_plus_1));
377 /* Remove a root segment. Wizards only. */
378 GC_API void GC_remove_roots GC_PROTO((char * low_address,
379 char * high_address_plus_1));
381 /* Add a displacement to the set of those considered valid by the */
382 /* collector. GC_register_displacement(n) means that if p was returned */
383 /* by GC_malloc, then (char *)p + n will be considered to be a valid */
384 /* pointer to p. N must be small and less than the size of p. */
385 /* (All pointers to the interior of objects from the stack are */
386 /* considered valid in any case. This applies to heap objects and */
388 /* Preferably, this should be called before any other GC procedures. */
389 /* Calling it later adds to the probability of excess memory */
391 /* This is a no-op if the collector has recognition of */
392 /* arbitrary interior pointers enabled, which is now the default. */
393 GC_API void GC_register_displacement GC_PROTO((GC_word n));
395 /* The following version should be used if any debugging allocation is */
397 GC_API void GC_debug_register_displacement GC_PROTO((GC_word n));
399 /* Explicitly trigger a full, world-stop collection. */
400 GC_API void GC_gcollect GC_PROTO((void));
402 /* Trigger a full world-stopped collection. Abort the collection if */
403 /* and when stop_func returns a nonzero value. Stop_func will be */
404 /* called frequently, and should be reasonably fast. This works even */
405 /* if virtual dirty bits, and hence incremental collection is not */
406 /* available for this architecture. Collections can be aborted faster */
407 /* than normal pause times for incremental collection. However, */
408 /* aborted collections do no useful work; the next collection needs */
409 /* to start from the beginning. */
410 /* Return 0 if the collection was aborted, 1 if it succeeded. */
411 typedef int (* GC_stop_func) GC_PROTO((void));
412 GC_API int GC_try_to_collect GC_PROTO((GC_stop_func stop_func));
414 /* Return the number of bytes in the heap. Excludes collector private */
415 /* data structures. Includes empty blocks and fragmentation loss. */
416 /* Includes some pages that were allocated but never written. */
417 GC_API size_t GC_get_heap_size GC_PROTO((void));
419 /* Return a lower bound on the number of free bytes in the heap. */
420 GC_API size_t GC_get_free_bytes GC_PROTO((void));
422 /* Return the number of bytes allocated since the last collection. */
423 GC_API size_t GC_get_bytes_since_gc GC_PROTO((void));
425 /* Return the total number of bytes allocated in this process. */
426 /* Never decreases, except due to wrapping. */
427 GC_API size_t GC_get_total_bytes GC_PROTO((void));
429 /* Return the signal used by the gc to suspend threads on posix platforms. */
430 /* Return -1 otherwise. */
431 int GC_get_suspend_signal GC_PROTO((void));
433 /* Return the signal used by the gc to resume threads on posix platforms. */
434 /* Return -1 otherwise. */
435 int GC_get_thr_restart_signal GC_PROTO((void));
437 /* Explicitly enable GC_register_my_thread() invocation. */
438 GC_API void GC_allow_register_threads GC_PROTO((void));
440 /* Disable garbage collection. Even GC_gcollect calls will be */
442 GC_API void GC_disable GC_PROTO((void));
444 /* Reenable garbage collection. GC_disable() and GC_enable() calls */
445 /* nest. Garbage collection is enabled if the number of calls to both */
446 /* both functions is equal. */
447 GC_API void GC_enable GC_PROTO((void));
449 /* Enable incremental/generational collection. */
450 /* Not advisable unless dirty bits are */
451 /* available or most heap objects are */
452 /* pointerfree(atomic) or immutable. */
453 /* Don't use in leak finding mode. */
454 /* Ignored if GC_dont_gc is true. */
455 /* Only the generational piece of this is */
456 /* functional if GC_parallel is TRUE */
457 /* or if GC_time_limit is GC_TIME_UNLIMITED. */
458 /* Causes GC_local_gcj_malloc() to revert to */
459 /* locked allocation. Must be called */
460 /* before any GC_local_gcj_malloc() calls. */
461 GC_API void GC_enable_incremental GC_PROTO((void));
463 /* Does incremental mode write-protect pages? Returns zero or */
464 /* more of the following, or'ed together: */
465 #define GC_PROTECTS_POINTER_HEAP 1 /* May protect non-atomic objs. */
466 #define GC_PROTECTS_PTRFREE_HEAP 2
467 #define GC_PROTECTS_STATIC_DATA 4 /* Curently never. */
468 #define GC_PROTECTS_STACK 8 /* Probably impractical. */
470 #define GC_PROTECTS_NONE 0
471 GC_API int GC_incremental_protection_needs GC_PROTO((void));
473 /* Perform some garbage collection work, if appropriate. */
474 /* Return 0 if there is no more work to be done. */
475 /* Typically performs an amount of work corresponding roughly */
476 /* to marking from one page. May do more work if further */
477 /* progress requires it, e.g. if incremental collection is */
478 /* disabled. It is reasonable to call this in a wait loop */
479 /* until it returns 0. */
480 GC_API int GC_collect_a_little GC_PROTO((void));
482 /* Allocate an object of size lb bytes. The client guarantees that */
483 /* as long as the object is live, it will be referenced by a pointer */
484 /* that points to somewhere within the first 256 bytes of the object. */
485 /* (This should normally be declared volatile to prevent the compiler */
486 /* from invalidating this assertion.) This routine is only useful */
487 /* if a large array is being allocated. It reduces the chance of */
488 /* accidentally retaining such an array as a result of scanning an */
489 /* integer that happens to be an address inside the array. (Actually, */
490 /* it reduces the chance of the allocator not finding space for such */
491 /* an array, since it will try hard to avoid introducing such a false */
492 /* reference.) On a SunOS 4.X or MS Windows system this is recommended */
493 /* for arrays likely to be larger than 100K or so. For other systems, */
494 /* or if the collector is not configured to recognize all interior */
495 /* pointers, the threshold is normally much higher. */
496 GC_API GC_PTR GC_malloc_ignore_off_page GC_PROTO((size_t lb));
497 GC_API GC_PTR GC_malloc_atomic_ignore_off_page GC_PROTO((size_t lb));
499 #if defined(__sgi) && !defined(__GNUC__) && _COMPILER_VERSION >= 720
500 # define GC_ADD_CALLER
501 # define GC_RETURN_ADDR (GC_word)__return_address
504 #if defined(__linux__) || defined(__GLIBC__)
505 # include <features.h>
506 # if (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 1 || __GLIBC__ > 2) \
507 && !defined(__ia64__)
508 # ifndef GC_HAVE_BUILTIN_BACKTRACE
509 # define GC_HAVE_BUILTIN_BACKTRACE
512 # if defined(__i386__) || defined(__x86_64__)
513 # define GC_CAN_SAVE_CALL_STACKS
517 #if defined(GC_HAVE_BUILTIN_BACKTRACE) && !defined(GC_CAN_SAVE_CALL_STACKS)
518 # define GC_CAN_SAVE_CALL_STACKS
521 #if defined(__sparc__)
522 # define GC_CAN_SAVE_CALL_STACKS
525 /* If we're on an a platform on which we can't save call stacks, but */
526 /* gcc is normally used, we go ahead and define GC_ADD_CALLER. */
527 /* We make this decision independent of whether gcc is actually being */
528 /* used, in order to keep the interface consistent, and allow mixing */
530 /* This may also be desirable if it is possible but expensive to */
531 /* retrieve the call chain. */
532 #if (defined(__linux__) || defined(__NetBSD__) || defined(__OpenBSD__) \
533 || defined(__FreeBSD__)) & !defined(GC_CAN_SAVE_CALL_STACKS)
534 # define GC_ADD_CALLER
535 # if __GNUC__ >= 3 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 95)
536 /* gcc knows how to retrieve return address, but we don't know */
537 /* how to generate call stacks. */
538 # define GC_RETURN_ADDR (GC_word)__builtin_return_address(0)
540 /* Just pass 0 for gcc compatibility. */
541 # define GC_RETURN_ADDR 0
546 # define GC_EXTRAS GC_RETURN_ADDR, __FILE__, __LINE__
547 # define GC_EXTRA_PARAMS GC_word ra, GC_CONST char * s, int i
549 # define GC_EXTRAS __FILE__, __LINE__
550 # define GC_EXTRA_PARAMS GC_CONST char * s, int i
553 /* Debugging (annotated) allocation. GC_gcollect will check */
554 /* objects allocated in this way for overwrites, etc. */
555 GC_API GC_PTR GC_debug_malloc
556 GC_PROTO((size_t size_in_bytes, GC_EXTRA_PARAMS));
557 GC_API GC_PTR GC_debug_malloc_atomic
558 GC_PROTO((size_t size_in_bytes, GC_EXTRA_PARAMS));
559 GC_API GC_PTR GC_debug_malloc_uncollectable
560 GC_PROTO((size_t size_in_bytes, GC_EXTRA_PARAMS));
561 GC_API GC_PTR GC_debug_malloc_stubborn
562 GC_PROTO((size_t size_in_bytes, GC_EXTRA_PARAMS));
563 GC_API GC_PTR GC_debug_malloc_ignore_off_page
564 GC_PROTO((size_t size_in_bytes, GC_EXTRA_PARAMS));
565 GC_API GC_PTR GC_debug_malloc_atomic_ignore_off_page
566 GC_PROTO((size_t size_in_bytes, GC_EXTRA_PARAMS));
567 GC_API void GC_debug_free GC_PROTO((GC_PTR object_addr));
568 GC_API GC_PTR GC_debug_realloc
569 GC_PROTO((GC_PTR old_object, size_t new_size_in_bytes,
571 GC_API void GC_debug_change_stubborn GC_PROTO((GC_PTR));
572 GC_API void GC_debug_end_stubborn_change GC_PROTO((GC_PTR));
574 /* Routines that allocate objects with debug information (like the */
575 /* above), but just fill in dummy file and line number information. */
576 /* Thus they can serve as drop-in malloc/realloc replacements. This */
577 /* can be useful for two reasons: */
578 /* 1) It allows the collector to be built with DBG_HDRS_ALL defined */
579 /* even if some allocation calls come from 3rd party libraries */
580 /* that can't be recompiled. */
581 /* 2) On some platforms, the file and line information is redundant, */
582 /* since it can be reconstructed from a stack trace. On such */
583 /* platforms it may be more convenient not to recompile, e.g. for */
584 /* leak detection. This can be accomplished by instructing the */
585 /* linker to replace malloc/realloc with these. */
586 GC_API GC_PTR GC_debug_malloc_replacement GC_PROTO((size_t size_in_bytes));
587 GC_API GC_PTR GC_debug_realloc_replacement
588 GC_PROTO((GC_PTR object_addr, size_t size_in_bytes));
591 # define GC_MALLOC(sz) GC_debug_malloc(sz, GC_EXTRAS)
592 # define GC_MALLOC_ATOMIC(sz) GC_debug_malloc_atomic(sz, GC_EXTRAS)
593 # define GC_MALLOC_UNCOLLECTABLE(sz) \
594 GC_debug_malloc_uncollectable(sz, GC_EXTRAS)
595 # define GC_MALLOC_IGNORE_OFF_PAGE(sz) \
596 GC_debug_malloc_ignore_off_page(sz, GC_EXTRAS)
597 # define GC_MALLOC_ATOMIC_IGNORE_OFF_PAGE(sz) \
598 GC_debug_malloc_atomic_ignore_off_page(sz, GC_EXTRAS)
599 # define GC_REALLOC(old, sz) GC_debug_realloc(old, sz, GC_EXTRAS)
600 # define GC_FREE(p) GC_debug_free(p)
601 # define GC_REGISTER_FINALIZER(p, f, d, of, od) \
602 GC_debug_register_finalizer(p, f, d, of, od)
603 # define GC_REGISTER_FINALIZER_IGNORE_SELF(p, f, d, of, od) \
604 GC_debug_register_finalizer_ignore_self(p, f, d, of, od)
605 # define GC_REGISTER_FINALIZER_NO_ORDER(p, f, d, of, od) \
606 GC_debug_register_finalizer_no_order(p, f, d, of, od)
607 # define GC_MALLOC_STUBBORN(sz) GC_debug_malloc_stubborn(sz, GC_EXTRAS);
608 # define GC_CHANGE_STUBBORN(p) GC_debug_change_stubborn(p)
609 # define GC_END_STUBBORN_CHANGE(p) GC_debug_end_stubborn_change(p)
610 # define GC_GENERAL_REGISTER_DISAPPEARING_LINK(link, obj) \
611 GC_general_register_disappearing_link(link, GC_base(obj))
612 # define GC_REGISTER_LONG_LINK(link, obj) \
613 GC_register_long_link(link, GC_base(obj))
614 # define GC_REGISTER_DISPLACEMENT(n) GC_debug_register_displacement(n)
616 # define GC_MALLOC(sz) GC_malloc(sz)
617 # define GC_MALLOC_ATOMIC(sz) GC_malloc_atomic(sz)
618 # define GC_MALLOC_UNCOLLECTABLE(sz) GC_malloc_uncollectable(sz)
619 # define GC_MALLOC_IGNORE_OFF_PAGE(sz) \
620 GC_malloc_ignore_off_page(sz)
621 # define GC_MALLOC_ATOMIC_IGNORE_OFF_PAGE(sz) \
622 GC_malloc_atomic_ignore_off_page(sz)
623 # define GC_REALLOC(old, sz) GC_realloc(old, sz)
624 # define GC_FREE(p) GC_free(p)
625 # define GC_REGISTER_FINALIZER(p, f, d, of, od) \
626 GC_register_finalizer(p, f, d, of, od)
627 # define GC_REGISTER_FINALIZER_IGNORE_SELF(p, f, d, of, od) \
628 GC_register_finalizer_ignore_self(p, f, d, of, od)
629 # define GC_REGISTER_FINALIZER_NO_ORDER(p, f, d, of, od) \
630 GC_register_finalizer_no_order(p, f, d, of, od)
631 # define GC_MALLOC_STUBBORN(sz) GC_malloc_stubborn(sz)
632 # define GC_CHANGE_STUBBORN(p) GC_change_stubborn(p)
633 # define GC_END_STUBBORN_CHANGE(p) GC_end_stubborn_change(p)
634 # define GC_GENERAL_REGISTER_DISAPPEARING_LINK(link, obj) \
635 GC_general_register_disappearing_link(link, obj)
636 # define GC_REGISTER_LONG_LINK(link, obj) \
637 GC_register_long_link(link, obj)
638 # define GC_REGISTER_DISPLACEMENT(n) GC_register_displacement(n)
640 /* The following are included because they are often convenient, and */
641 /* reduce the chance for a misspecifed size argument. But calls may */
642 /* expand to something syntactically incorrect if t is a complicated */
643 /* type expression. */
644 # define GC_NEW(t) (t *)GC_MALLOC(sizeof (t))
645 # define GC_NEW_ATOMIC(t) (t *)GC_MALLOC_ATOMIC(sizeof (t))
646 # define GC_NEW_STUBBORN(t) (t *)GC_MALLOC_STUBBORN(sizeof (t))
647 # define GC_NEW_UNCOLLECTABLE(t) (t *)GC_MALLOC_UNCOLLECTABLE(sizeof (t))
649 /* Finalization. Some of these primitives are grossly unsafe. */
650 /* The idea is to make them both cheap, and sufficient to build */
651 /* a safer layer, closer to Modula-3, Java, or PCedar finalization. */
652 /* The interface represents my conclusions from a long discussion */
653 /* with Alan Demers, Dan Greene, Carl Hauser, Barry Hayes, */
654 /* Christian Jacobi, and Russ Atkinson. It's not perfect, and */
655 /* probably nobody else agrees with it. Hans-J. Boehm 3/13/92 */
656 typedef void (*GC_finalization_proc)
657 GC_PROTO((GC_PTR obj, GC_PTR client_data));
659 GC_API void GC_register_finalizer
660 GC_PROTO((GC_PTR obj, GC_finalization_proc fn, GC_PTR cd,
661 GC_finalization_proc *ofn, GC_PTR *ocd));
662 GC_API void GC_debug_register_finalizer
663 GC_PROTO((GC_PTR obj, GC_finalization_proc fn, GC_PTR cd,
664 GC_finalization_proc *ofn, GC_PTR *ocd));
665 /* When obj is no longer accessible, invoke */
666 /* (*fn)(obj, cd). If a and b are inaccessible, and */
667 /* a points to b (after disappearing links have been */
668 /* made to disappear), then only a will be */
669 /* finalized. (If this does not create any new */
670 /* pointers to b, then b will be finalized after the */
671 /* next collection.) Any finalizable object that */
672 /* is reachable from itself by following one or more */
673 /* pointers will not be finalized (or collected). */
674 /* Thus cycles involving finalizable objects should */
675 /* be avoided, or broken by disappearing links. */
676 /* All but the last finalizer registered for an object */
678 /* Finalization may be removed by passing 0 as fn. */
679 /* Finalizers are implicitly unregistered just before */
680 /* they are invoked. */
681 /* The old finalizer and client data are stored in */
683 /* Fn is never invoked on an accessible object, */
684 /* provided hidden pointers are converted to real */
685 /* pointers only if the allocation lock is held, and */
686 /* such conversions are not performed by finalization */
688 /* If GC_register_finalizer is aborted as a result of */
689 /* a signal, the object may be left with no */
690 /* finalization, even if neither the old nor new */
691 /* finalizer were NULL. */
692 /* Obj should be the nonNULL starting address of an */
693 /* object allocated by GC_malloc or friends. */
694 /* Note that any garbage collectable object referenced */
695 /* by cd will be considered accessible until the */
696 /* finalizer is invoked. */
698 /* Another versions of the above follow. It ignores */
699 /* self-cycles, i.e. pointers from a finalizable object to */
700 /* itself. There is a stylistic argument that this is wrong, */
701 /* but it's unavoidable for C++, since the compiler may */
702 /* silently introduce these. It's also benign in that specific */
703 /* case. And it helps if finalizable objects are split to */
705 /* Note that cd will still be viewed as accessible, even if it */
706 /* refers to the object itself. */
707 GC_API void GC_register_finalizer_ignore_self
708 GC_PROTO((GC_PTR obj, GC_finalization_proc fn, GC_PTR cd,
709 GC_finalization_proc *ofn, GC_PTR *ocd));
710 GC_API void GC_debug_register_finalizer_ignore_self
711 GC_PROTO((GC_PTR obj, GC_finalization_proc fn, GC_PTR cd,
712 GC_finalization_proc *ofn, GC_PTR *ocd));
714 /* Another version of the above. It ignores all cycles. */
715 /* It should probably only be used by Java implementations. */
716 /* Note that cd will still be viewed as accessible, even if it */
717 /* refers to the object itself. */
718 GC_API void GC_register_finalizer_no_order
719 GC_PROTO((GC_PTR obj, GC_finalization_proc fn, GC_PTR cd,
720 GC_finalization_proc *ofn, GC_PTR *ocd));
721 GC_API void GC_debug_register_finalizer_no_order
722 GC_PROTO((GC_PTR obj, GC_finalization_proc fn, GC_PTR cd,
723 GC_finalization_proc *ofn, GC_PTR *ocd));
726 /* The following routine may be used to break cycles between */
727 /* finalizable objects, thus causing cyclic finalizable */
728 /* objects to be finalized in the correct order. Standard */
729 /* use involves calling GC_register_disappearing_link(&p), */
730 /* where p is a pointer that is not followed by finalization */
731 /* code, and should not be considered in determining */
732 /* finalization order. */
733 GC_API int GC_register_disappearing_link GC_PROTO((GC_PTR * /* link */));
734 /* Link should point to a field of a heap allocated */
735 /* object obj. *link will be cleared when obj is */
736 /* found to be inaccessible. This happens BEFORE any */
737 /* finalization code is invoked, and BEFORE any */
738 /* decisions about finalization order are made. */
739 /* This is useful in telling the finalizer that */
740 /* some pointers are not essential for proper */
741 /* finalization. This may avoid finalization cycles. */
742 /* Note that obj may be resurrected by another */
743 /* finalizer, and thus the clearing of *link may */
744 /* be visible to non-finalization code. */
745 /* There's an argument that an arbitrary action should */
746 /* be allowed here, instead of just clearing a pointer. */
747 /* But this causes problems if that action alters, or */
748 /* examines connectivity. */
749 /* Returns 1 if link was already registered, 0 */
751 /* Only exists for backward compatibility. See below: */
753 GC_API int GC_general_register_disappearing_link
754 GC_PROTO((GC_PTR * /* link */, GC_PTR obj));
755 /* A slight generalization of the above. *link is */
756 /* cleared when obj first becomes inaccessible. This */
757 /* can be used to implement weak pointers easily and */
758 /* safely. Typically link will point to a location */
759 /* holding a disguised pointer to obj. (A pointer */
760 /* inside an "atomic" object is effectively */
761 /* disguised.) In this way soft */
762 /* pointers are broken before any object */
763 /* reachable from them are finalized. Each link */
764 /* May be registered only once, i.e. with one obj */
765 /* value. This was added after a long email discussion */
766 /* with John Ellis. */
767 /* Obj must be a pointer to the first word of an object */
768 /* we allocated. It is unsafe to explicitly deallocate */
769 /* the object containing link. Explicitly deallocating */
770 /* obj may or may not cause link to eventually be */
772 GC_API int GC_unregister_disappearing_link GC_PROTO((GC_PTR * /* link */));
773 /* Returns 0 if link was not actually registered. */
774 /* Undoes a registration by either of the above two */
777 GC_API int GC_register_long_link GC_PROTO((GC_PTR * /* link */, GC_PTR obj));
778 GC_API int GC_unregister_long_link GC_PROTO((GC_PTR * /* link */));
782 GC_TOGGLE_REF_STRONG,
784 } GC_ToggleRefStatus;
786 /* toggleref support */
787 GC_API void GC_set_toggleref_func GC_PROTO(
788 (GC_ToggleRefStatus (*proccess_toggleref) (GC_PTR obj)));
789 GC_API int GC_toggleref_add (GC_PTR object, int strong_ref);
790 /* Returns GC_SUCCESS if registration succeeded (or no callback */
791 /* registered yet), GC_NO_MEMORY if failed for lack of memory. */
793 /* finalizer callback support */
794 GC_API void GC_set_await_finalize_proc GC_PROTO((void (*object_finalized) (GC_PTR obj)));
797 /* Returns !=0 if GC_invoke_finalizers has something to do. */
798 GC_API int GC_should_invoke_finalizers GC_PROTO((void));
800 GC_API int GC_invoke_finalizers GC_PROTO((void));
801 /* Run finalizers for all objects that are ready to */
802 /* be finalized. Return the number of finalizers */
803 /* that were run. Normally this is also called */
804 /* implicitly during some allocations. If */
805 /* GC-finalize_on_demand is nonzero, it must be called */
808 /* GC_set_warn_proc can be used to redirect or filter warning messages. */
809 /* p may not be a NULL pointer. */
810 typedef void (*GC_warn_proc) GC_PROTO((char *msg, GC_word arg));
811 GC_API GC_warn_proc GC_set_warn_proc GC_PROTO((GC_warn_proc p));
812 /* Returns old warning procedure. */
814 GC_API GC_word GC_set_free_space_divisor GC_PROTO((GC_word value));
815 /* Set free_space_divisor. See above for definition. */
816 /* Returns old value. */
818 /* The following is intended to be used by a higher level */
819 /* (e.g. Java-like) finalization facility. It is expected */
820 /* that finalization code will arrange for hidden pointers to */
821 /* disappear. Otherwise objects can be accessed after they */
822 /* have been collected. */
823 /* Note that putting pointers in atomic objects or in */
824 /* nonpointer slots of "typed" objects is equivalent to */
825 /* disguising them in this way, and may have other advantages. */
826 # if defined(I_HIDE_POINTERS) || defined(GC_I_HIDE_POINTERS)
827 typedef GC_word GC_hidden_pointer;
828 # define HIDE_POINTER(p) (~(GC_hidden_pointer)(p))
829 # define REVEAL_POINTER(p) ((GC_PTR)(HIDE_POINTER(p)))
830 /* Converting a hidden pointer to a real pointer requires verifying */
831 /* that the object still exists. This involves acquiring the */
832 /* allocator lock to avoid a race with the collector. */
833 # endif /* I_HIDE_POINTERS */
835 typedef GC_PTR (*GC_fn_type) GC_PROTO((GC_PTR client_data));
836 GC_API GC_PTR GC_call_with_alloc_lock
837 GC_PROTO((GC_fn_type fn, GC_PTR client_data));
839 /* The following routines are primarily intended for use with a */
840 /* preprocessor which inserts calls to check C pointer arithmetic. */
841 /* They indicate failure by invoking the corresponding _print_proc. */
843 /* Check that p and q point to the same object. */
844 /* Fail conspicuously if they don't. */
845 /* Returns the first argument. */
846 /* Succeeds if neither p nor q points to the heap. */
847 /* May succeed if both p and q point to between heap objects. */
848 GC_API GC_PTR GC_same_obj GC_PROTO((GC_PTR p, GC_PTR q));
850 /* Checked pointer pre- and post- increment operations. Note that */
851 /* the second argument is in units of bytes, not multiples of the */
852 /* object size. This should either be invoked from a macro, or the */
853 /* call should be automatically generated. */
854 GC_API GC_PTR GC_pre_incr GC_PROTO((GC_PTR *p, size_t how_much));
855 GC_API GC_PTR GC_post_incr GC_PROTO((GC_PTR *p, size_t how_much));
857 /* Check that p is visible */
858 /* to the collector as a possibly pointer containing location. */
859 /* If it isn't fail conspicuously. */
860 /* Returns the argument in all cases. May erroneously succeed */
861 /* in hard cases. (This is intended for debugging use with */
862 /* untyped allocations. The idea is that it should be possible, though */
863 /* slow, to add such a call to all indirect pointer stores.) */
864 /* Currently useless for multithreaded worlds. */
865 GC_API GC_PTR GC_is_visible GC_PROTO((GC_PTR p));
867 /* Check that if p is a pointer to a heap page, then it points to */
868 /* a valid displacement within a heap object. */
869 /* Fail conspicuously if this property does not hold. */
870 /* Uninteresting with GC_all_interior_pointers. */
871 /* Always returns its argument. */
872 GC_API GC_PTR GC_is_valid_displacement GC_PROTO((GC_PTR p));
875 #define GC_DUPLICATE 1 /* Was already registered. */
876 #define GC_NO_MEMORY 2 /* Failure due to lack of memory. */
877 #define GC_UNIMPLEMENTED 3 /* Not yet implemented on the platform. */
879 /* Structure representing the base of a thread stack. */
880 struct GC_stack_base {
881 void * mem_base; /* Base of memory stack. */
884 /* Register the current thread, with the indicated stack base. */
885 /* Returns GC_SUCCESS on success, GC_DUPLICATE if already registered. */
886 /* On some platforms it returns GC_UNIMPLEMENTED. */
887 GC_API int GC_register_my_thread GC_PROTO((struct GC_stack_base *));
889 /* Returns 1 if the calling thread is registered with the GC, 0 otherwise */
890 GC_API int GC_thread_is_registered GC_PROTO((void));
892 /* Notify the collector about the stack and the altstack of the current thread */
893 /* STACK/STACK_SIZE is used to determine the stack dimensions when a thread is
894 * suspended while it is on an altstack.
896 GC_API void GC_register_altstack GC_PROTO((void *stack, int stack_size, void *altstack, int altstack_size));
898 /* Safer, but slow, pointer addition. Probably useful mainly with */
899 /* a preprocessor. Useful only for heap pointers. */
901 # define GC_PTR_ADD3(x, n, type_of_result) \
902 ((type_of_result)GC_same_obj((x)+(n), (x)))
903 # define GC_PRE_INCR3(x, n, type_of_result) \
904 ((type_of_result)GC_pre_incr(&(x), (n)*sizeof(*x))
905 # define GC_POST_INCR2(x, type_of_result) \
906 ((type_of_result)GC_post_incr(&(x), sizeof(*x))
908 # define GC_PTR_ADD(x, n) \
909 GC_PTR_ADD3(x, n, typeof(x))
910 # define GC_PRE_INCR(x, n) \
911 GC_PRE_INCR3(x, n, typeof(x))
912 # define GC_POST_INCR(x, n) \
913 GC_POST_INCR3(x, typeof(x))
915 /* We can't do this right without typeof, which ANSI */
916 /* decided was not sufficiently useful. Repeatedly */
917 /* mentioning the arguments seems too dangerous to be */
918 /* useful. So does not casting the result. */
919 # define GC_PTR_ADD(x, n) ((x)+(n))
921 #else /* !GC_DEBUG */
922 # define GC_PTR_ADD3(x, n, type_of_result) ((x)+(n))
923 # define GC_PTR_ADD(x, n) ((x)+(n))
924 # define GC_PRE_INCR3(x, n, type_of_result) ((x) += (n))
925 # define GC_PRE_INCR(x, n) ((x) += (n))
926 # define GC_POST_INCR2(x, n, type_of_result) ((x)++)
927 # define GC_POST_INCR(x, n) ((x)++)
930 /* Safer assignment of a pointer to a nonstack location. */
932 # if defined(__STDC__) || defined(_AIX)
933 # define GC_PTR_STORE(p, q) \
934 (*(void **)GC_is_visible(p) = GC_is_valid_displacement(q))
936 # define GC_PTR_STORE(p, q) \
937 (*(char **)GC_is_visible(p) = GC_is_valid_displacement(q))
939 #else /* !GC_DEBUG */
940 # define GC_PTR_STORE(p, q) *((p) = (q))
943 /* Functions called to report pointer checking errors */
944 GC_API void (*GC_same_obj_print_proc) GC_PROTO((GC_PTR p, GC_PTR q));
946 GC_API void (*GC_is_valid_displacement_print_proc)
947 GC_PROTO((GC_PTR p));
949 GC_API void (*GC_is_visible_print_proc)
950 GC_PROTO((GC_PTR p));
952 /* For pthread support, we generally need to intercept a number of */
953 /* thread library calls. We do that here by macro defining them. */
955 #if !defined(GC_USE_LD_WRAP) && \
956 (defined(GC_PTHREADS) || defined(GC_SOLARIS_THREADS) || defined(GC_DARWIN_THREADS) || defined(GC_MACOSX_THREADS))
957 # include "gc_pthread_redirects.h"
960 # if defined(PCR) || defined(GC_SOLARIS_THREADS) || \
961 defined(GC_PTHREADS) || defined(GC_WIN32_THREADS)
962 /* Any flavor of threads except SRC_M3. */
963 /* This returns a list of objects, linked through their first */
964 /* word. Its use can greatly reduce lock contention problems, since */
965 /* the allocation lock can be acquired and released many fewer times. */
966 /* lb must be large enough to hold the pointer field. */
967 /* It is used internally by gc_local_alloc.h, which provides a simpler */
968 /* programming interface on Linux. */
969 GC_PTR GC_malloc_many(size_t lb);
970 #define GC_NEXT(p) (*(GC_PTR *)(p)) /* Retrieve the next element */
971 /* in returned list. */
972 extern void GC_thr_init(void); /* Needed for Solaris/X86 */
974 #endif /* THREADS && !SRC_M3 */
976 #if defined(GC_WIN32_THREADS) && !defined(__CYGWIN32__) && !defined(__CYGWIN__)
977 # include <windows.h>
979 # ifdef GC_INSIDE_DLL
980 BOOL WINAPI GC_DllMain(HINSTANCE inst, ULONG reason, LPVOID reserved);
984 * All threads must be created using GC_CreateThread, so that they will be
985 * recorded in the thread table. For backwards compatibility, this is not
986 * technically true if the GC is built as a dynamic library, since it can
987 * and does then use DllMain to keep track of thread creations. But new code
988 * should be built to call GC_CreateThread.
990 GC_API HANDLE WINAPI GC_CreateThread(
991 LPSECURITY_ATTRIBUTES lpThreadAttributes,
992 DWORD dwStackSize, LPTHREAD_START_ROUTINE lpStartAddress,
993 LPVOID lpParameter, DWORD dwCreationFlags, LPDWORD lpThreadId );
995 # if defined(_WIN32_WCE)
997 * win32_threads.c implements the real WinMain, which will start a new thread
998 * to call GC_WinMain after initializing the garbage collector.
1000 int WINAPI GC_WinMain(
1001 HINSTANCE hInstance,
1002 HINSTANCE hPrevInstance,
1007 # define WinMain GC_WinMain
1008 # define CreateThread GC_CreateThread
1010 # endif /* defined(_WIN32_WCE) */
1012 #endif /* defined(GC_WIN32_THREADS) && !cygwin */
1015 * Fully portable code should call GC_INIT() from the main program
1016 * before making any other GC_ calls. On most platforms this is a
1017 * no-op and the collector self-initializes. But a number of platforms
1018 * make that too hard.
1020 #if (defined(sparc) || defined(__sparc)) && defined(sun)
1022 * If you are planning on putting
1023 * the collector in a SunOS 5 dynamic library, you need to call GC_INIT()
1024 * from the statically loaded program section.
1025 * This circumvents a Solaris 2.X (X<=4) linker bug.
1027 # define GC_INIT() { extern end, etext; \
1028 GC_noop(&end, &etext); }
1030 # if defined(__CYGWIN32__) || defined (_AIX)
1032 * Similarly gnu-win32 DLLs need explicit initialization from
1033 * the main program, as does AIX.
1035 # ifdef __CYGWIN32__
1036 extern int _data_start__[];
1037 extern int _data_end__[];
1038 extern int _bss_start__[];
1039 extern int _bss_end__[];
1040 # define GC_MAX(x,y) ((x) > (y) ? (x) : (y))
1041 # define GC_MIN(x,y) ((x) < (y) ? (x) : (y))
1042 # define GC_DATASTART ((GC_PTR) GC_MIN(_data_start__, _bss_start__))
1043 # define GC_DATAEND ((GC_PTR) GC_MAX(_data_end__, _bss_end__))
1045 # define GC_INIT() { GC_add_roots(GC_DATASTART, GC_DATAEND); }
1051 extern int _data[], _end[];
1052 # define GC_DATASTART ((GC_PTR)((ulong)_data))
1053 # define GC_DATAEND ((GC_PTR)((ulong)_end))
1054 # define GC_INIT() { GC_add_roots(GC_DATASTART, GC_DATAEND); }
1057 # if defined(__APPLE__) && defined(__MACH__) || defined(GC_WIN32_THREADS)
1058 # define GC_INIT() { GC_init(); }
1061 # endif /* !__MACH && !GC_WIN32_THREADS */
1062 # endif /* !AIX && !cygwin */
1065 #if !defined(_WIN32_WCE) \
1066 && ((defined(_MSDOS) || defined(_MSC_VER)) && (_M_IX86 >= 300) \
1067 || defined(_WIN32) && !defined(__CYGWIN32__) && !defined(__CYGWIN__))
1068 /* win32S may not free all resources on process exit. */
1069 /* This explicitly deallocates the heap. */
1070 GC_API void GC_win32_free_heap ();
1073 #if ( defined(_AMIGA) && !defined(GC_AMIGA_MAKINGLIB) )
1074 /* Allocation really goes through GC_amiga_allocwrapper_do */
1075 # include "gc_amiga_redirects.h"
1078 #if defined(GC_REDIRECT_TO_LOCAL) && !defined(GC_LOCAL_ALLOC_H)
1079 # include "gc_local_alloc.h"
1083 } /* end of extern "C" */