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, August 9, 1995 6:09 pm PDT */
15 # include "private/gc_priv.h"
18 * We maintain several hash tables of hblks that have had false hits.
19 * Each contains one bit per hash bucket; If any page in the bucket
20 * has had a false hit, we assume that all of them have.
21 * See the definition of page_hash_table in gc_private.h.
22 * False hits from the stack(s) are much more dangerous than false hits
23 * from elsewhere, since the former can pin a large object that spans the
24 * block, eventhough it does not start on the dangerous block.
28 * Externally callable routines are:
30 * GC_add_to_black_list_normal
31 * GC_add_to_black_list_stack
32 * GC_promote_black_lists
35 * All require that the allocator lock is held.
38 /* Pointers to individual tables. We replace one table by another by */
39 /* switching these pointers. */
40 word * GC_old_normal_bl;
41 /* Nonstack false references seen at last full */
43 word * GC_incomplete_normal_bl;
44 /* Nonstack false references seen since last */
45 /* full collection. */
46 word * GC_old_stack_bl;
47 word * GC_incomplete_stack_bl;
49 word GC_total_stack_black_listed;
51 word GC_black_list_spacing = MINHINCR*HBLKSIZE; /* Initial rough guess */
53 void GC_clear_bl(word *);
55 void GC_default_print_heap_obj_proc(ptr_t p)
57 ptr_t base = GC_base(p);
59 GC_err_printf("start: %p, appr. length: %ld", base,
60 (unsigned long)GC_size(base));
63 void (*GC_print_heap_obj) (ptr_t p) = GC_default_print_heap_obj_proc;
65 void GC_print_source_ptr(ptr_t p)
67 ptr_t base = GC_base(p);
70 GC_err_printf("in register");
72 GC_err_printf("in root set");
75 GC_err_printf("in object at ");
76 (*GC_print_heap_obj)(base);
82 if (!GC_all_interior_pointers) {
83 GC_old_normal_bl = (word *)
84 GC_scratch_alloc((word)(sizeof (page_hash_table)));
85 GC_incomplete_normal_bl = (word *)GC_scratch_alloc
86 ((word)(sizeof(page_hash_table)));
87 if (GC_old_normal_bl == 0 || GC_incomplete_normal_bl == 0) {
88 GC_err_printf("Insufficient memory for black list\n");
91 GC_clear_bl(GC_old_normal_bl);
92 GC_clear_bl(GC_incomplete_normal_bl);
94 GC_old_stack_bl = (word *)GC_scratch_alloc((word)(sizeof(page_hash_table)));
95 GC_incomplete_stack_bl = (word *)GC_scratch_alloc
96 ((word)(sizeof(page_hash_table)));
97 if (GC_old_stack_bl == 0 || GC_incomplete_stack_bl == 0) {
98 GC_err_printf("Insufficient memory for black list\n");
101 GC_clear_bl(GC_old_stack_bl);
102 GC_clear_bl(GC_incomplete_stack_bl);
105 void GC_clear_bl(word *doomed)
107 BZERO(doomed, sizeof(page_hash_table));
110 void GC_copy_bl(word *old, word *new)
112 BCOPY(old, new, sizeof(page_hash_table));
115 static word total_stack_black_listed(void);
117 /* Signal the completion of a collection. Turn the incomplete black */
118 /* lists into new black lists, etc. */
119 void GC_promote_black_lists(void)
121 word * very_old_normal_bl = GC_old_normal_bl;
122 word * very_old_stack_bl = GC_old_stack_bl;
124 GC_old_normal_bl = GC_incomplete_normal_bl;
125 GC_old_stack_bl = GC_incomplete_stack_bl;
126 if (!GC_all_interior_pointers) {
127 GC_clear_bl(very_old_normal_bl);
129 GC_clear_bl(very_old_stack_bl);
130 GC_incomplete_normal_bl = very_old_normal_bl;
131 GC_incomplete_stack_bl = very_old_stack_bl;
132 GC_total_stack_black_listed = total_stack_black_listed();
133 if (GC_print_stats == VERBOSE)
134 GC_log_printf("%ld bytes in heap blacklisted for interior pointers\n",
135 (unsigned long)GC_total_stack_black_listed);
136 if (GC_total_stack_black_listed != 0) {
137 GC_black_list_spacing =
138 HBLKSIZE*(GC_heapsize/GC_total_stack_black_listed);
140 if (GC_black_list_spacing < 3 * HBLKSIZE) {
141 GC_black_list_spacing = 3 * HBLKSIZE;
143 if (GC_black_list_spacing > MAXHINCR * HBLKSIZE) {
144 GC_black_list_spacing = MAXHINCR * HBLKSIZE;
145 /* Makes it easier to allocate really huge blocks, which otherwise */
146 /* may have problems with nonuniform blacklist distributions. */
147 /* This way we should always succeed immediately after growing the */
152 void GC_unpromote_black_lists(void)
154 if (!GC_all_interior_pointers) {
155 GC_copy_bl(GC_old_normal_bl, GC_incomplete_normal_bl);
157 GC_copy_bl(GC_old_stack_bl, GC_incomplete_stack_bl);
160 /* P is not a valid pointer reference, but it falls inside */
161 /* the plausible heap bounds. */
162 /* Add it to the normal incomplete black list if appropriate. */
163 #ifdef PRINT_BLACK_LIST
164 void GC_add_to_black_list_normal(word p, ptr_t source)
166 void GC_add_to_black_list_normal(word p)
169 if (!(GC_modws_valid_offsets[p & (sizeof(word)-1)])) return;
171 word index = PHT_HASH((word)p);
173 if (HDR(p) == 0 || get_pht_entry_from_index(GC_old_normal_bl, index)) {
174 # ifdef PRINT_BLACK_LIST
175 if (!get_pht_entry_from_index(GC_incomplete_normal_bl, index)) {
177 "Black listing (normal) %p referenced from %p ",
179 GC_print_source_ptr(source);
183 set_pht_entry_from_index(GC_incomplete_normal_bl, index);
184 } /* else this is probably just an interior pointer to an allocated */
185 /* object, and isn't worth black listing. */
189 /* And the same for false pointers from the stack. */
190 #ifdef PRINT_BLACK_LIST
191 void GC_add_to_black_list_stack(word p, ptr_t source)
194 void GC_add_to_black_list_stack(word p)
197 word index = PHT_HASH((word)p);
199 if (HDR(p) == 0 || get_pht_entry_from_index(GC_old_stack_bl, index)) {
200 # ifdef PRINT_BLACK_LIST
201 if (!get_pht_entry_from_index(GC_incomplete_stack_bl, index)) {
203 "Black listing (stack) %p referenced from %p ",
205 GC_print_source_ptr(source);
209 set_pht_entry_from_index(GC_incomplete_stack_bl, index);
214 * Is the block starting at h of size len bytes black listed? If so,
215 * return the address of the next plausible r such that (r, len) might not
216 * be black listed. (R may not actually be in the heap. We guarantee only
217 * that every smaller value of r after h is also black listed.)
218 * If (h,len) is not black listed, return 0.
219 * Knows about the structure of the black list hash tables.
221 struct hblk * GC_is_black_listed(struct hblk *h, word len)
223 word index = PHT_HASH((word)h);
225 word nblocks = divHBLKSZ(len);
227 if (!GC_all_interior_pointers) {
228 if (get_pht_entry_from_index(GC_old_normal_bl, index)
229 || get_pht_entry_from_index(GC_incomplete_normal_bl, index)) {
235 if (GC_old_stack_bl[divWORDSZ(index)] == 0
236 && GC_incomplete_stack_bl[divWORDSZ(index)] == 0) {
238 i += WORDSZ - modWORDSZ(index);
240 if (get_pht_entry_from_index(GC_old_stack_bl, index)
241 || get_pht_entry_from_index(GC_incomplete_stack_bl, index)) {
246 if (i >= nblocks) break;
247 index = PHT_HASH((word)(h+i));
253 /* Return the number of blacklisted blocks in a given range. */
254 /* Used only for statistical purposes. */
255 /* Looks only at the GC_incomplete_stack_bl. */
256 word GC_number_stack_black_listed(struct hblk *start, struct hblk *endp1)
258 register struct hblk * h;
261 for (h = start; h < endp1; h++) {
262 word index = PHT_HASH((word)h);
264 if (get_pht_entry_from_index(GC_old_stack_bl, index)) result++;
270 /* Return the total number of (stack) black-listed bytes. */
271 static word total_stack_black_listed(void)
276 for (i = 0; i < GC_n_heap_sects; i++) {
277 struct hblk * start = (struct hblk *) GC_heap_sects[i].hs_start;
278 size_t len = (word) GC_heap_sects[i].hs_bytes;
279 struct hblk * endp1 = start + len/HBLKSIZE;
281 total += GC_number_stack_black_listed(start, endp1);
283 return(total * HBLKSIZE);