2 * Copyright 1988, 1989 Hans-J. Boehm, Alan J. Demers
3 * Copyright (c) 1991-1994 by Xerox Corporation. All rights reserved.
4 * Copyright (c) 1996 by Silicon Graphics. All rights reserved.
6 * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
7 * OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
9 * Permission is hereby granted to use or copy this program
10 * for any purpose, provided the above notices are retained on all copies.
11 * Permission to modify the code and to distribute modified code is granted,
12 * provided the above notices are retained, and a notice that the code was
13 * modified is included with the above copyright notice.
18 * 1. allocation of heap block headers
19 * 2. A map from addresses to heap block addresses to heap block headers
21 * Access speed is crucial. We implement an index structure based on a 2
25 # include "private/gc_priv.h"
27 bottom_index * GC_all_bottom_indices = 0;
28 /* Pointer to first (lowest addr) */
31 bottom_index * GC_all_bottom_indices_end = 0;
32 /* Pointer to last (highest addr) */
35 /* Non-macro version of header location routine */
36 hdr * GC_find_header(ptr_t h)
47 /* Handle a header cache miss. Returns a pointer to the */
48 /* header corresponding to p, if p can possibly be a valid */
49 /* object pointer, and 0 otherwise. */
50 /* GUARANTEED to return 0 for a pointer past the first page */
51 /* of an object unless both GC_all_interior_pointers is set */
52 /* and p is in fact a valid object pointer. */
53 #ifdef PRINT_BLACK_LIST
54 hdr * GC_header_cache_miss(ptr_t p, hdr_cache_entry *hce, ptr_t source)
56 hdr * GC_header_cache_miss(ptr_t p, hdr_cache_entry *hce)
62 if (IS_FORWARDING_ADDR_OR_NIL(hhdr)) {
63 if (GC_all_interior_pointers) {
67 current = (ptr_t)HBLKPTR(current);
69 current = current - HBLKSIZE*(word)hhdr;
71 } while(IS_FORWARDING_ADDR_OR_NIL(hhdr));
72 /* current points to near the start of the large object */
73 if (hhdr -> hb_flags & IGNORE_OFF_PAGE
74 || HBLK_IS_FREE(hhdr))
76 if (p - current >= (ptrdiff_t)(hhdr->hb_sz)) {
77 GC_ADD_TO_BLACK_LIST_NORMAL(p, source);
78 /* Pointer past the end of the block */
82 GC_ADD_TO_BLACK_LIST_NORMAL(p, source);
85 /* Pointers past the first page are probably too rare */
86 /* to add them to the cache. We don't. */
87 /* And correctness relies on the fact that we don't. */
90 GC_ADD_TO_BLACK_LIST_NORMAL(p, source);
95 if (HBLK_IS_FREE(hhdr)) {
96 GC_ADD_TO_BLACK_LIST_NORMAL(p, source);
99 hce -> block_addr = (word)(p) >> LOG_HBLKSIZE;
100 hce -> hce_hdr = hhdr;
106 /* Routines to dynamically allocate collector data structures that will */
107 /* never be freed. */
109 static ptr_t scratch_free_ptr = 0;
111 /* GC_scratch_last_end_ptr is end point of last obtained scratch area. */
112 /* GC_scratch_end_ptr is end point of current scratch area. */
114 ptr_t GC_scratch_alloc(size_t bytes)
116 register ptr_t result = scratch_free_ptr;
118 bytes += GRANULE_BYTES-1;
119 bytes &= ~(GRANULE_BYTES-1);
120 scratch_free_ptr += bytes;
121 if (scratch_free_ptr <= GC_scratch_end_ptr) {
125 word bytes_to_get = MINHINCR * HBLKSIZE;
127 if (bytes_to_get <= bytes) {
128 /* Undo the damage, and get memory directly */
129 bytes_to_get = bytes;
131 bytes_to_get += GC_page_size - 1;
132 bytes_to_get &= ~(GC_page_size - 1);
134 result = (ptr_t)GET_MEM(bytes_to_get);
135 GC_add_to_our_memory(result, bytes_to_get);
136 scratch_free_ptr -= bytes;
137 GC_scratch_last_end_ptr = result + bytes;
140 result = (ptr_t)GET_MEM(bytes_to_get);
141 GC_add_to_our_memory(result, bytes_to_get);
144 GC_printf("Out of memory - trying to allocate less\n");
145 scratch_free_ptr -= bytes;
146 bytes_to_get = bytes;
148 bytes_to_get += GC_page_size - 1;
149 bytes_to_get &= ~(GC_page_size - 1);
151 result = (ptr_t)GET_MEM(bytes_to_get);
152 GC_add_to_our_memory(result, bytes_to_get);
155 scratch_free_ptr = result;
156 GC_scratch_end_ptr = scratch_free_ptr + bytes_to_get;
157 GC_scratch_last_end_ptr = GC_scratch_end_ptr;
158 return(GC_scratch_alloc(bytes));
162 static hdr * hdr_free_list = 0;
164 /* Return an uninitialized header */
165 static hdr * alloc_hdr(void)
167 register hdr * result;
169 if (hdr_free_list == 0) {
170 result = (hdr *) GC_scratch_alloc((word)(sizeof(hdr)));
172 result = hdr_free_list;
173 hdr_free_list = (hdr *) (result -> hb_next);
178 static void free_hdr(hdr * hhdr)
180 hhdr -> hb_next = (struct hblk *) hdr_free_list;
181 hdr_free_list = hhdr;
185 word GC_hdr_cache_hits = 0;
186 word GC_hdr_cache_misses = 0;
189 void GC_init_headers(void)
193 GC_all_nils = (bottom_index *)GC_scratch_alloc((word)sizeof(bottom_index));
194 BZERO(GC_all_nils, sizeof(bottom_index));
195 for (i = 0; i < TOP_SZ; i++) {
196 GC_top_index[i] = GC_all_nils;
200 /* Make sure that there is a bottom level index block for address addr */
201 /* Return FALSE on failure. */
202 static GC_bool get_index(word addr)
204 word hi = (word)(addr) >> (LOG_BOTTOM_SZ + LOG_HBLKSIZE);
207 bottom_index ** prev;
211 word i = TL_HASH(hi);
214 old = p = GC_top_index[i];
215 while(p != GC_all_nils) {
216 if (p -> key == hi) return(TRUE);
219 r = (bottom_index*)GC_scratch_alloc((word)(sizeof (bottom_index)));
220 if (r == 0) return(FALSE);
221 BZERO(r, sizeof (bottom_index));
222 r -> hash_link = old;
225 if (GC_top_index[hi] != GC_all_nils) return(TRUE);
226 r = (bottom_index*)GC_scratch_alloc((word)(sizeof (bottom_index)));
227 if (r == 0) return(FALSE);
228 GC_top_index[hi] = r;
229 BZERO(r, sizeof (bottom_index));
232 /* Add it to the list of bottom indices */
233 prev = &GC_all_bottom_indices; /* pointer to p */
234 pi = 0; /* bottom_index preceding p */
235 while ((p = *prev) != 0 && p -> key < hi) {
237 prev = &(p -> asc_link);
241 GC_all_bottom_indices_end = r;
250 /* Install a header for block h. */
251 /* The header is uninitialized. */
252 /* Returns the header or 0 on failure. */
253 struct hblkhdr * GC_install_header(struct hblk *h)
257 if (!get_index((word) h)) return(0);
258 result = alloc_hdr();
261 result -> hb_last_reclaimed = (unsigned short)GC_gc_no;
266 /* Set up forwarding counts for block h of size sz */
267 GC_bool GC_install_counts(struct hblk *h, size_t sz/* bytes */)
272 for (hbp = h; (char *)hbp < (char *)h + sz; hbp += BOTTOM_SZ) {
273 if (!get_index((word) hbp)) return(FALSE);
275 if (!get_index((word)h + sz - 1)) return(FALSE);
276 for (hbp = h + 1; (char *)hbp < (char *)h + sz; hbp += 1) {
277 i = HBLK_PTR_DIFF(hbp, h);
278 SET_HDR(hbp, (hdr *)(i > MAX_JUMP? MAX_JUMP : i));
283 /* Remove the header for block h */
284 void GC_remove_header(struct hblk *h)
293 /* Remove forwarding counts for h */
294 void GC_remove_counts(struct hblk *h, size_t sz/* bytes */)
296 register struct hblk * hbp;
298 for (hbp = h+1; (char *)hbp < (char *)h + sz; hbp += 1) {
303 /* Apply fn to all allocated blocks */
305 void GC_apply_to_all_blocks(void (*fn)(struct hblk *h, word client_data),
309 bottom_index * index_p;
311 for (index_p = GC_all_bottom_indices; index_p != 0;
312 index_p = index_p -> asc_link) {
313 for (j = BOTTOM_SZ-1; j >= 0;) {
314 if (!IS_FORWARDING_ADDR_OR_NIL(index_p->index[j])) {
315 if (!HBLK_IS_FREE(index_p->index[j])) {
316 (*fn)(((struct hblk *)
317 (((index_p->key << LOG_BOTTOM_SZ) + (word)j)
322 } else if (index_p->index[j] == 0) {
325 j -= (signed_word)(index_p->index[j]);
331 /* Get the next valid block whose address is at least h */
332 /* Return 0 if there is none. */
333 struct hblk * GC_next_used_block(struct hblk *h)
335 register bottom_index * bi;
336 register word j = ((word)h >> LOG_HBLKSIZE) & (BOTTOM_SZ-1);
339 if (bi == GC_all_nils) {
340 register word hi = (word)h >> (LOG_BOTTOM_SZ + LOG_HBLKSIZE);
341 bi = GC_all_bottom_indices;
342 while (bi != 0 && bi -> key < hi) bi = bi -> asc_link;
346 while (j < BOTTOM_SZ) {
347 hdr * hhdr = bi -> index[j];
348 if (IS_FORWARDING_ADDR_OR_NIL(hhdr)) {
351 if (!HBLK_IS_FREE(hhdr)) {
352 return((struct hblk *)
353 (((bi -> key << LOG_BOTTOM_SZ) + j)
356 j += divHBLKSZ(hhdr -> hb_sz);
366 /* Get the last (highest address) block whose address is */
367 /* at most h. Return 0 if there is none. */
368 /* Unlike the above, this may return a free block. */
369 struct hblk * GC_prev_block(struct hblk *h)
371 register bottom_index * bi;
372 register signed_word j = ((word)h >> LOG_HBLKSIZE) & (BOTTOM_SZ-1);
375 if (bi == GC_all_nils) {
376 register word hi = (word)h >> (LOG_BOTTOM_SZ + LOG_HBLKSIZE);
377 bi = GC_all_bottom_indices_end;
378 while (bi != 0 && bi -> key > hi) bi = bi -> desc_link;
383 hdr * hhdr = bi -> index[j];
386 } else if (IS_FORWARDING_ADDR_OR_NIL(hhdr)) {
387 j -= (signed_word)hhdr;
389 return((struct hblk *)
390 (((bi -> key << LOG_BOTTOM_SZ) + j)
395 bi = bi -> desc_link;