2 * Copyright 1988, 1989 Hans-J. Boehm, Alan J. Demers
3 * Copyright (c) 1991-1994 by Xerox Corporation. All rights reserved.
5 * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
6 * OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
8 * Permission is hereby granted to use or copy this program
9 * for any purpose, provided the above notices are retained on all copies.
10 * Permission to modify the code and to distribute modified code is granted,
11 * provided the above notices are retained, and a notice that the code was
12 * modified is included with the above copyright notice.
14 /* Boehm, February 7, 1996 4:32 pm PST */
19 extern ptr_t GC_clear_stack(); /* in misc.c, behaves like identity */
20 void GC_extend_size_map(); /* in misc.c. */
22 /* Allocate reclaim list for kind: */
23 /* Return TRUE on success */
24 GC_bool GC_alloc_reclaim_list(kind)
25 register struct obj_kind * kind;
27 struct hblk ** result = (struct hblk **)
28 GC_scratch_alloc((MAXOBJSZ+1) * sizeof(struct hblk *));
29 if (result == 0) return(FALSE);
30 BZERO(result, (MAXOBJSZ+1)*sizeof(struct hblk *));
31 kind -> ok_reclaim_list = result;
35 /* allocate lb bytes for an object of kind. */
36 /* Should not be used to directly to allocate */
37 /* objects such as STUBBORN objects that */
38 /* require special handling on allocation. */
39 /* First a version that assumes we already */
41 ptr_t GC_generic_malloc_inner(lb, k)
50 register struct obj_kind * kind = GC_obj_kinds + k;
54 lw = ALIGNED_WORDS(lb);
57 opp = &(kind -> ok_freelist[lw]);
58 if( (op = *opp) == 0 ) {
60 if (GC_size_map[lb] == 0) {
61 if (!GC_is_initialized) GC_init_inner();
62 if (GC_size_map[lb] == 0) GC_extend_size_map(lb);
63 return(GC_generic_malloc_inner(lb, k));
66 if (!GC_is_initialized) {
68 return(GC_generic_malloc_inner(lb, k));
71 if (kind -> ok_reclaim_list == 0) {
72 if (!GC_alloc_reclaim_list(kind)) goto out;
74 op = GC_allocobj(lw, k);
75 if (op == 0) goto out;
77 /* Here everything is in a consistent state. */
78 /* We assume the following assignment is */
79 /* atomic. If we get aborted */
80 /* after the assignment, we lose an object, */
81 /* but that's benign. */
82 /* Volatile declarations may need to be added */
83 /* to prevent the compiler from breaking things.*/
87 register struct hblk * h;
88 register word n_blocks = divHBLKSZ(ADD_SLOP(lb)
89 + HDR_BYTES + HBLKSIZE-1);
91 if (!GC_is_initialized) GC_init_inner();
92 /* Do our share of marking work */
93 if(GC_incremental && !GC_dont_gc)
94 GC_collect_a_little_inner((int)n_blocks);
95 lw = ROUNDED_UP_WORDS(lb);
96 h = GC_allochblk(lw, k, 0);
100 h = GC_allochblk(lw, k, 0);
103 while (0 == h && GC_collect_or_expand(n_blocks, FALSE)) {
104 h = GC_allochblk(lw, k, 0);
109 op = (ptr_t) (h -> hb_body);
110 GC_words_wasted += BYTES_TO_WORDS(n_blocks * HBLKSIZE) - lw;
113 GC_words_allocd += lw;
119 ptr_t GC_generic_malloc(lb, k)
126 GC_INVOKE_FINALIZERS();
129 result = GC_generic_malloc_inner(lb, k);
133 return((*GC_oom_fn)(lb));
140 #define GENERAL_MALLOC(lb,k) \
141 (GC_PTR)GC_clear_stack(GC_generic_malloc((word)lb, k))
142 /* We make the GC_clear_stack_call a tail call, hoping to get more of */
145 /* Allocate lb bytes of atomic (pointerfree) data */
147 GC_PTR GC_malloc_atomic(size_t lb)
149 GC_PTR GC_malloc_atomic(lb)
154 register ptr_t * opp;
158 if( SMALL_OBJ(lb) ) {
160 lw = GC_size_map[lb];
162 lw = ALIGNED_WORDS(lb);
164 opp = &(GC_aobjfreelist[lw]);
166 if( !FASTLOCK_SUCCEEDED() || (op = *opp) == 0 ) {
168 return(GENERAL_MALLOC((word)lb, PTRFREE));
170 /* See above comment on signals. */
172 GC_words_allocd += lw;
176 return(GENERAL_MALLOC((word)lb, PTRFREE));
180 /* Allocate lb bytes of composite (pointerful) data */
182 GC_PTR GC_malloc(size_t lb)
193 if( SMALL_OBJ(lb) ) {
195 lw = GC_size_map[lb];
197 lw = ALIGNED_WORDS(lb);
199 opp = &(GC_objfreelist[lw]);
201 if( !FASTLOCK_SUCCEEDED() || (op = *opp) == 0 ) {
203 return(GENERAL_MALLOC((word)lb, NORMAL));
205 /* See above comment on signals. */
208 GC_words_allocd += lw;
212 return(GENERAL_MALLOC((word)lb, NORMAL));
216 # ifdef REDIRECT_MALLOC
218 GC_PTR malloc(size_t lb)
224 /* It might help to manually inline the GC_malloc call here. */
225 /* But any decent compiler should reduce the extra procedure call */
226 /* to at most a jump instruction in this case. */
227 # if defined(I386) && defined(SOLARIS_THREADS)
229 * Thread initialisation can call malloc before
230 * we're ready for it.
231 * It's not clear that this is enough to help matters.
232 * The thread implementation may well call malloc at other
235 if (!GC_is_initialized) return sbrk(lb);
236 # endif /* I386 && SOLARIS_THREADS */
237 return(REDIRECT_MALLOC(lb));
241 GC_PTR calloc(size_t n, size_t lb)
247 return(REDIRECT_MALLOC(n*lb));
249 # endif /* REDIRECT_MALLOC */
251 GC_PTR GC_generic_or_special_malloc(lb,knd)
256 # ifdef STUBBORN_ALLOC
258 return(GC_malloc_stubborn((size_t)lb));
261 return(GC_malloc_atomic((size_t)lb));
263 return(GC_malloc((size_t)lb));
265 return(GC_malloc_uncollectable((size_t)lb));
266 # ifdef ATOMIC_UNCOLLECTABLE
268 return(GC_malloc_atomic_uncollectable((size_t)lb));
269 # endif /* ATOMIC_UNCOLLECTABLE */
271 return(GC_generic_malloc(lb,knd));
276 /* Change the size of the block pointed to by p to contain at least */
277 /* lb bytes. The object may be (and quite likely will be) moved. */
278 /* The kind (e.g. atomic) is the same as that of the old. */
279 /* Shrinking of large blocks is not implemented well. */
281 GC_PTR GC_realloc(GC_PTR p, size_t lb)
283 GC_PTR GC_realloc(p,lb)
288 register struct hblk * h;
290 register word sz; /* Current size in bytes */
291 register word orig_sz; /* Original sz in bytes */
294 if (p == 0) return(GC_malloc(lb)); /* Required by ANSI */
298 obj_kind = hhdr -> hb_obj_kind;
299 sz = WORDS_TO_BYTES(sz);
302 if (sz > WORDS_TO_BYTES(MAXOBJSZ)) {
303 /* Round it up to the next whole heap block */
306 sz = (sz+HDR_BYTES+HBLKSIZE-1)
309 hhdr -> hb_sz = BYTES_TO_WORDS(sz);
310 descr = GC_obj_kinds[obj_kind].ok_descriptor;
311 if (GC_obj_kinds[obj_kind].ok_relocate_descr) descr += sz;
312 hhdr -> hb_descr = descr;
313 if (IS_UNCOLLECTABLE(obj_kind)) GC_non_gc_bytes += (sz - orig_sz);
314 /* Extra area is already cleared by allochblk. */
316 if (ADD_SLOP(lb) <= sz) {
317 if (lb >= (sz >> 1)) {
318 # ifdef STUBBORN_ALLOC
319 if (obj_kind == STUBBORN) GC_change_stubborn(p);
322 /* Clear unneeded part of object to avoid bogus pointer */
324 /* Safe for stubborn objects. */
325 BZERO(((ptr_t)p) + lb, orig_sz - lb);
331 GC_generic_or_special_malloc((word)lb, obj_kind);
333 if (result == 0) return(0);
334 /* Could also return original object. But this */
335 /* gives the client warning of imminent disaster. */
336 BCOPY(p, result, lb);
345 GC_generic_or_special_malloc((word)lb, obj_kind);
347 if (result == 0) return(0);
348 BCOPY(p, result, sz);
356 # ifdef REDIRECT_MALLOC
358 GC_PTR realloc(GC_PTR p, size_t lb)
365 return(GC_realloc(p, lb));
367 # endif /* REDIRECT_MALLOC */
369 /* Explicitly deallocate an object p. */
371 void GC_free(GC_PTR p)
377 register struct hblk *h;
379 register signed_word sz;
380 register ptr_t * flh;
382 register struct obj_kind * ok;
386 /* Required by ANSI. It's not my fault ... */
389 # if defined(REDIRECT_MALLOC) && \
390 (defined(SOLARIS_THREADS) || defined(LINUX_THREADS))
391 /* We have to redirect malloc calls during initialization. */
392 /* Don't try to deallocate that memory. */
393 if (0 == hhdr) return;
395 knd = hhdr -> hb_obj_kind;
397 ok = &GC_obj_kinds[knd];
398 if (sz <= MAXOBJSZ) {
404 /* A signal here can make GC_mem_freed and GC_non_gc_bytes */
405 /* inconsistent. We claim this is benign. */
406 if (IS_UNCOLLECTABLE(knd)) GC_non_gc_bytes -= WORDS_TO_BYTES(sz);
407 /* Its unnecessary to clear the mark bit. If the */
408 /* object is reallocated, it doesn't matter. O.w. the */
409 /* collector will do it, since it's on a free list. */
411 BZERO((word *)p + 1, WORDS_TO_BYTES(sz-1));
413 flh = &(ok -> ok_freelist[sz]);
424 if (IS_UNCOLLECTABLE(knd)) GC_non_gc_bytes -= WORDS_TO_BYTES(sz);
431 # ifdef REDIRECT_MALLOC
443 # endif /* REDIRECT_MALLOC */