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.
16 #include "private/gc_priv.h"
20 * 1. allocation of heap block headers
21 * 2. A map from addresses to heap block addresses to heap block headers
23 * Access speed is crucial. We implement an index structure based on a 2
27 STATIC bottom_index * GC_all_bottom_indices = 0;
28 /* Pointer to first (lowest addr) */
31 STATIC bottom_index * GC_all_bottom_indices_end = 0;
32 /* Pointer to last (highest addr) */
35 /* Non-macro version of header location routine */
36 GC_INNER 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 /* Never returns a pointer to a free hblk. */
55 #ifdef PRINT_BLACK_LIST
56 GC_header_cache_miss(ptr_t p, hdr_cache_entry *hce, ptr_t source)
58 GC_header_cache_miss(ptr_t p, hdr_cache_entry *hce)
64 if (IS_FORWARDING_ADDR_OR_NIL(hhdr)) {
65 if (GC_all_interior_pointers) {
69 current = (ptr_t)HBLKPTR(current);
71 current = current - HBLKSIZE*(word)hhdr;
73 } while(IS_FORWARDING_ADDR_OR_NIL(hhdr));
74 /* current points to near the start of the large object */
75 if (hhdr -> hb_flags & IGNORE_OFF_PAGE)
77 if (HBLK_IS_FREE(hhdr)
78 || p - current >= (ptrdiff_t)(hhdr->hb_sz)) {
79 GC_ADD_TO_BLACK_LIST_NORMAL(p, source);
80 /* Pointer past the end of the block */
84 GC_ADD_TO_BLACK_LIST_NORMAL(p, source);
85 /* And return zero: */
87 GC_ASSERT(hhdr == 0 || !HBLK_IS_FREE(hhdr));
89 /* Pointers past the first page are probably too rare */
90 /* to add them to the cache. We don't. */
91 /* And correctness relies on the fact that we don't. */
94 GC_ADD_TO_BLACK_LIST_NORMAL(p, source);
99 if (HBLK_IS_FREE(hhdr)) {
100 GC_ADD_TO_BLACK_LIST_NORMAL(p, source);
103 hce -> block_addr = (word)(p) >> LOG_HBLKSIZE;
104 hce -> hce_hdr = hhdr;
110 /* Routines to dynamically allocate collector data structures that will */
111 /* never be freed. */
113 static ptr_t scratch_free_ptr = 0;
115 /* GC_scratch_last_end_ptr is end point of last obtained scratch area. */
116 /* GC_scratch_end_ptr is end point of current scratch area. */
118 GC_INNER ptr_t GC_scratch_alloc(size_t bytes)
120 register ptr_t result = scratch_free_ptr;
122 bytes += GRANULE_BYTES-1;
123 bytes &= ~(GRANULE_BYTES-1);
124 scratch_free_ptr += bytes;
125 if (scratch_free_ptr <= GC_scratch_end_ptr) {
129 word bytes_to_get = MINHINCR * HBLKSIZE;
131 if (bytes_to_get <= bytes) {
132 /* Undo the damage, and get memory directly */
133 bytes_to_get = bytes;
135 bytes_to_get += GC_page_size - 1;
136 bytes_to_get &= ~(GC_page_size - 1);
138 result = (ptr_t)GET_MEM(bytes_to_get);
139 GC_add_to_our_memory(result, bytes_to_get);
140 scratch_free_ptr -= bytes;
141 GC_scratch_last_end_ptr = result + bytes;
144 result = (ptr_t)GET_MEM(bytes_to_get);
145 GC_add_to_our_memory(result, bytes_to_get);
148 GC_log_printf("Out of memory - trying to allocate less\n");
149 scratch_free_ptr -= bytes;
150 bytes_to_get = bytes;
152 bytes_to_get += GC_page_size - 1;
153 bytes_to_get &= ~(GC_page_size - 1);
155 result = (ptr_t)GET_MEM(bytes_to_get);
156 GC_add_to_our_memory(result, bytes_to_get);
159 scratch_free_ptr = result;
160 GC_scratch_end_ptr = scratch_free_ptr + bytes_to_get;
161 GC_scratch_last_end_ptr = GC_scratch_end_ptr;
162 return(GC_scratch_alloc(bytes));
166 static hdr * hdr_free_list = 0;
168 /* Return an uninitialized header */
169 static hdr * alloc_hdr(void)
171 register hdr * result;
173 if (hdr_free_list == 0) {
174 result = (hdr *) GC_scratch_alloc((word)(sizeof(hdr)));
176 result = hdr_free_list;
177 hdr_free_list = (hdr *) (result -> hb_next);
182 GC_INLINE void free_hdr(hdr * hhdr)
184 hhdr -> hb_next = (struct hblk *) hdr_free_list;
185 hdr_free_list = hhdr;
188 #ifdef COUNT_HDR_CACHE_HITS
189 /* Used for debugging/profiling (the symbols are externally visible). */
190 word GC_hdr_cache_hits = 0;
191 word GC_hdr_cache_misses = 0;
194 GC_INNER void GC_init_headers(void)
198 GC_all_nils = (bottom_index *)GC_scratch_alloc((word)sizeof(bottom_index));
199 if (GC_all_nils == NULL) {
200 GC_err_printf("Insufficient memory for GC_all_nils\n");
203 BZERO(GC_all_nils, sizeof(bottom_index));
204 for (i = 0; i < TOP_SZ; i++) {
205 GC_top_index[i] = GC_all_nils;
209 /* Make sure that there is a bottom level index block for address addr */
210 /* Return FALSE on failure. */
211 static GC_bool get_index(word addr)
213 word hi = (word)(addr) >> (LOG_BOTTOM_SZ + LOG_HBLKSIZE);
216 bottom_index ** prev;
220 word i = TL_HASH(hi);
223 old = p = GC_top_index[i];
224 while(p != GC_all_nils) {
225 if (p -> key == hi) return(TRUE);
228 r = (bottom_index*)GC_scratch_alloc((word)(sizeof (bottom_index)));
229 if (r == 0) return(FALSE);
230 BZERO(r, sizeof (bottom_index));
231 r -> hash_link = old;
234 if (GC_top_index[hi] != GC_all_nils) return(TRUE);
235 r = (bottom_index*)GC_scratch_alloc((word)(sizeof (bottom_index)));
236 if (r == 0) return(FALSE);
237 GC_top_index[hi] = r;
238 BZERO(r, sizeof (bottom_index));
241 /* Add it to the list of bottom indices */
242 prev = &GC_all_bottom_indices; /* pointer to p */
243 pi = 0; /* bottom_index preceding p */
244 while ((p = *prev) != 0 && p -> key < hi) {
246 prev = &(p -> asc_link);
250 GC_all_bottom_indices_end = r;
259 /* Install a header for block h. */
260 /* The header is uninitialized. */
261 /* Returns the header or 0 on failure. */
262 GC_INNER struct hblkhdr * GC_install_header(struct hblk *h)
266 if (!get_index((word) h)) return(0);
267 result = alloc_hdr();
271 result -> hb_last_reclaimed = (unsigned short)GC_gc_no;
277 /* Set up forwarding counts for block h of size sz */
278 GC_INNER GC_bool GC_install_counts(struct hblk *h, size_t sz/* bytes */)
283 for (hbp = h; (char *)hbp < (char *)h + sz; hbp += BOTTOM_SZ) {
284 if (!get_index((word) hbp)) return(FALSE);
286 if (!get_index((word)h + sz - 1)) return(FALSE);
287 for (hbp = h + 1; (char *)hbp < (char *)h + sz; hbp += 1) {
288 i = HBLK_PTR_DIFF(hbp, h);
289 SET_HDR(hbp, (hdr *)(i > MAX_JUMP? MAX_JUMP : i));
294 /* Remove the header for block h */
295 GC_INNER void GC_remove_header(struct hblk *h)
303 /* Remove forwarding counts for h */
304 GC_INNER void GC_remove_counts(struct hblk *h, size_t sz/* bytes */)
306 register struct hblk * hbp;
307 for (hbp = h+1; (char *)hbp < (char *)h + sz; hbp += 1) {
312 /* Apply fn to all allocated blocks */
314 void GC_apply_to_all_blocks(void (*fn)(struct hblk *h, word client_data),
318 bottom_index * index_p;
320 for (index_p = GC_all_bottom_indices; index_p != 0;
321 index_p = index_p -> asc_link) {
322 for (j = BOTTOM_SZ-1; j >= 0;) {
323 if (!IS_FORWARDING_ADDR_OR_NIL(index_p->index[j])) {
324 if (!HBLK_IS_FREE(index_p->index[j])) {
325 (*fn)(((struct hblk *)
326 (((index_p->key << LOG_BOTTOM_SZ) + (word)j)
331 } else if (index_p->index[j] == 0) {
334 j -= (signed_word)(index_p->index[j]);
340 /* Get the next valid block whose address is at least h */
341 /* Return 0 if there is none. */
342 GC_INNER struct hblk * GC_next_used_block(struct hblk *h)
344 register bottom_index * bi;
345 register word j = ((word)h >> LOG_HBLKSIZE) & (BOTTOM_SZ-1);
348 if (bi == GC_all_nils) {
349 register word hi = (word)h >> (LOG_BOTTOM_SZ + LOG_HBLKSIZE);
350 bi = GC_all_bottom_indices;
351 while (bi != 0 && bi -> key < hi) bi = bi -> asc_link;
355 while (j < BOTTOM_SZ) {
356 hdr * hhdr = bi -> index[j];
357 if (IS_FORWARDING_ADDR_OR_NIL(hhdr)) {
360 if (!HBLK_IS_FREE(hhdr)) {
361 return((struct hblk *)
362 (((bi -> key << LOG_BOTTOM_SZ) + j)
365 j += divHBLKSZ(hhdr -> hb_sz);
375 /* Get the last (highest address) block whose address is */
376 /* at most h. Return 0 if there is none. */
377 /* Unlike the above, this may return a free block. */
378 GC_INNER struct hblk * GC_prev_block(struct hblk *h)
380 register bottom_index * bi;
381 register signed_word j = ((word)h >> LOG_HBLKSIZE) & (BOTTOM_SZ-1);
384 if (bi == GC_all_nils) {
385 register word hi = (word)h >> (LOG_BOTTOM_SZ + LOG_HBLKSIZE);
386 bi = GC_all_bottom_indices_end;
387 while (bi != 0 && bi -> key > hi) bi = bi -> desc_link;
392 hdr * hhdr = bi -> index[j];
395 } else if (IS_FORWARDING_ADDR_OR_NIL(hhdr)) {
396 j -= (signed_word)hhdr;
398 return((struct hblk *)
399 (((bi -> key << LOG_BOTTOM_SZ) + j)
404 bi = bi -> desc_link;