2 * Copyright (c) 1991-1994 by Xerox Corporation. All rights reserved.
3 * Copyright (c) 1999-2000 by Hewlett-Packard Company. 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.
16 #include "private/gc_pmark.h"
17 #include "gc_inline.h" /* for GC_malloc_kind */
20 * Some simple primitives for allocation with explicit type information.
21 * Simple objects are allocated such that they contain a GC_descr at the
22 * end (in the last allocated word). This descriptor may be a procedure
23 * which then examines an extended descriptor passed as its environment.
25 * Arrays are treated as simple objects if they have sufficiently simple
26 * structure. Otherwise they are allocated from an array kind that supplies
27 * a special mark procedure. These arrays contain a pointer to a
28 * complex_descriptor as their last word.
29 * This is done because the environment field is too small, and the collector
30 * must trace the complex_descriptor.
32 * Note that descriptors inside objects may appear cleared, if we encounter a
33 * false reference to an object on a free list. In the GC_descr case, this
34 * is OK, since a 0 descriptor corresponds to examining no fields.
35 * In the complex_descriptor case, we explicitly check for that case.
37 * MAJOR PARTS OF THIS CODE HAVE NOT BEEN TESTED AT ALL and are not testable,
38 * since they are not accessible through the current interface.
43 #define TYPD_EXTRA_BYTES (sizeof(word) - EXTRA_BYTES)
45 STATIC int GC_explicit_kind = 0;
46 /* Object kind for objects with indirect */
47 /* (possibly extended) descriptors. */
49 STATIC int GC_array_kind = 0;
50 /* Object kind for objects with complex */
51 /* descriptors and GC_array_mark_proc. */
53 /* Extended descriptors. GC_typed_mark_proc understands these. */
54 /* These are used for simple objects that are larger than what */
55 /* can be described by a BITMAP_BITS sized bitmap. */
57 word ed_bitmap; /* lsb corresponds to first word. */
58 GC_bool ed_continued; /* next entry is continuation. */
61 /* Array descriptors. GC_array_mark_proc understands these. */
62 /* We may eventually need to add provisions for headers and */
63 /* trailers. Hence we provide for tree structured descriptors, */
64 /* though we don't really use them currently. */
66 struct LeafDescriptor { /* Describes simple array */
69 size_t ld_size; /* bytes per element */
70 /* multiple of ALIGNMENT. */
71 size_t ld_nelements; /* Number of elements. */
72 GC_descr ld_descriptor; /* A simple length, bitmap, */
73 /* or procedure descriptor. */
76 struct ComplexArrayDescriptor {
80 union ComplexDescriptor * ad_element_descr;
83 struct SequenceDescriptor {
85 # define SEQUENCE_TAG 3
86 union ComplexDescriptor * sd_first;
87 union ComplexDescriptor * sd_second;
90 typedef union ComplexDescriptor {
91 struct LeafDescriptor ld;
92 struct ComplexArrayDescriptor ad;
93 struct SequenceDescriptor sd;
97 STATIC ext_descr * GC_ext_descriptors = NULL;
98 /* Points to array of extended */
101 STATIC size_t GC_ed_size = 0; /* Current size of above arrays. */
102 #define ED_INITIAL_SIZE 100
104 STATIC size_t GC_avail_descr = 0; /* Next available slot. */
106 STATIC int GC_typed_mark_proc_index = 0; /* Indices of my mark */
107 STATIC int GC_array_mark_proc_index = 0; /* procedures. */
109 #ifdef AO_HAVE_load_acquire
110 STATIC volatile AO_t GC_explicit_typing_initialized = FALSE;
112 STATIC GC_bool GC_explicit_typing_initialized = FALSE;
115 STATIC void GC_push_typed_structures_proc(void)
117 GC_PUSH_ALL_SYM(GC_ext_descriptors);
120 /* Add a multiword bitmap to GC_ext_descriptors arrays. Return */
121 /* starting index. */
122 /* Returns -1 on failure. */
123 /* Caller does not hold allocation lock. */
124 STATIC signed_word GC_add_ext_descriptor(const word * bm, word nbits)
126 size_t nwords = divWORDSZ(nbits + WORDSZ-1);
134 while (GC_avail_descr + nwords >= GC_ed_size) {
137 word ed_size = GC_ed_size;
140 GC_ASSERT((word)(&GC_ext_descriptors) % sizeof(word) == 0);
141 GC_push_typed_structures = GC_push_typed_structures_proc;
143 new_size = ED_INITIAL_SIZE;
146 new_size = 2 * ed_size;
147 if (new_size > MAX_ENV) return(-1);
149 newExtD = (ext_descr *)GC_malloc_atomic(new_size * sizeof(ext_descr));
153 if (ed_size == GC_ed_size) {
154 if (GC_avail_descr != 0) {
155 BCOPY(GC_ext_descriptors, newExtD,
156 GC_avail_descr * sizeof(ext_descr));
158 GC_ed_size = new_size;
159 GC_ext_descriptors = newExtD;
160 } /* else another thread already resized it in the meantime */
162 result = GC_avail_descr;
163 for (i = 0; i < nwords-1; i++) {
164 GC_ext_descriptors[result + i].ed_bitmap = bm[i];
165 GC_ext_descriptors[result + i].ed_continued = TRUE;
168 /* Clear irrelevant bits. */
169 extra_bits = nwords * WORDSZ - nbits;
170 last_part <<= extra_bits;
171 last_part >>= extra_bits;
172 GC_ext_descriptors[result + i].ed_bitmap = last_part;
173 GC_ext_descriptors[result + i].ed_continued = FALSE;
174 GC_avail_descr += nwords;
179 /* Table of bitmap descriptors for n word long all pointer objects. */
180 STATIC GC_descr GC_bm_table[WORDSZ/2];
182 /* Return a descriptor for the concatenation of 2 nwords long objects, */
183 /* each of which is described by descriptor. */
184 /* The result is known to be short enough to fit into a bitmap */
186 /* Descriptor is a GC_DS_LENGTH or GC_DS_BITMAP descriptor. */
187 STATIC GC_descr GC_double_descr(GC_descr descriptor, word nwords)
189 if ((descriptor & GC_DS_TAGS) == GC_DS_LENGTH) {
190 descriptor = GC_bm_table[BYTES_TO_WORDS((word)descriptor)];
192 descriptor |= (descriptor & ~GC_DS_TAGS) >> nwords;
196 STATIC complex_descriptor *
197 GC_make_sequence_descriptor(complex_descriptor *first,
198 complex_descriptor *second);
200 /* Build a descriptor for an array with nelements elements, */
201 /* each of which can be described by a simple descriptor. */
202 /* We try to optimize some common cases. */
203 /* If the result is COMPLEX, then a complex_descr* is returned */
205 /* If the result is LEAF, then we built a LeafDescriptor in */
206 /* the structure pointed to by leaf. */
207 /* The tag in the leaf structure is not set. */
208 /* If the result is SIMPLE, then a GC_descr */
209 /* is returned in *simple_d. */
210 /* If the result is NO_MEM, then */
211 /* we failed to allocate the descriptor. */
212 /* The implementation knows that GC_DS_LENGTH is 0. */
213 /* *leaf, *complex_d, and *simple_d may be used as temporaries */
214 /* during the construction. */
219 STATIC int GC_make_array_descriptor(size_t nelements, size_t size,
220 GC_descr descriptor, GC_descr *simple_d,
221 complex_descriptor **complex_d,
222 struct LeafDescriptor * leaf)
224 # define OPT_THRESHOLD 50
225 /* For larger arrays, we try to combine descriptors of adjacent */
226 /* descriptors to speed up marking, and to reduce the amount */
227 /* of space needed on the mark stack. */
228 if ((descriptor & GC_DS_TAGS) == GC_DS_LENGTH) {
229 if (descriptor == (GC_descr)size) {
230 *simple_d = nelements * descriptor;
232 } else if ((word)descriptor == 0) {
233 *simple_d = (GC_descr)0;
237 if (nelements <= OPT_THRESHOLD) {
238 if (nelements <= 1) {
239 if (nelements == 1) {
240 *simple_d = descriptor;
243 *simple_d = (GC_descr)0;
247 } else if (size <= BITMAP_BITS/2
248 && (descriptor & GC_DS_TAGS) != GC_DS_PROC
249 && (size & (sizeof(word)-1)) == 0) {
251 GC_make_array_descriptor(nelements/2, 2*size,
252 GC_double_descr(descriptor,
253 BYTES_TO_WORDS(size)),
254 simple_d, complex_d, leaf);
255 if ((nelements & 1) == 0) {
258 struct LeafDescriptor * one_element =
259 (struct LeafDescriptor *)
260 GC_malloc_atomic(sizeof(struct LeafDescriptor));
262 if (result == NO_MEM || one_element == 0) return(NO_MEM);
263 one_element -> ld_tag = LEAF_TAG;
264 one_element -> ld_size = size;
265 one_element -> ld_nelements = 1;
266 one_element -> ld_descriptor = descriptor;
270 struct LeafDescriptor * beginning =
271 (struct LeafDescriptor *)
272 GC_malloc_atomic(sizeof(struct LeafDescriptor));
273 if (beginning == 0) return(NO_MEM);
274 beginning -> ld_tag = LEAF_TAG;
275 beginning -> ld_size = size;
276 beginning -> ld_nelements = 1;
277 beginning -> ld_descriptor = *simple_d;
278 *complex_d = GC_make_sequence_descriptor(
279 (complex_descriptor *)beginning,
280 (complex_descriptor *)one_element);
285 struct LeafDescriptor * beginning =
286 (struct LeafDescriptor *)
287 GC_malloc_atomic(sizeof(struct LeafDescriptor));
288 if (beginning == 0) return(NO_MEM);
289 beginning -> ld_tag = LEAF_TAG;
290 beginning -> ld_size = leaf -> ld_size;
291 beginning -> ld_nelements = leaf -> ld_nelements;
292 beginning -> ld_descriptor = leaf -> ld_descriptor;
293 *complex_d = GC_make_sequence_descriptor(
294 (complex_descriptor *)beginning,
295 (complex_descriptor *)one_element);
299 *complex_d = GC_make_sequence_descriptor(
301 (complex_descriptor *)one_element);
308 leaf -> ld_size = size;
309 leaf -> ld_nelements = nelements;
310 leaf -> ld_descriptor = descriptor;
314 STATIC complex_descriptor *
315 GC_make_sequence_descriptor(complex_descriptor *first,
316 complex_descriptor *second)
318 struct SequenceDescriptor * result =
319 (struct SequenceDescriptor *)
320 GC_malloc(sizeof(struct SequenceDescriptor));
321 /* Can't result in overly conservative marking, since tags are */
322 /* very small integers. Probably faster than maintaining type */
325 result -> sd_tag = SEQUENCE_TAG;
326 result -> sd_first = first;
327 result -> sd_second = second;
329 REACHABLE_AFTER_DIRTY(first);
330 REACHABLE_AFTER_DIRTY(second);
332 return((complex_descriptor *)result);
335 STATIC ptr_t * GC_eobjfreelist = NULL;
337 STATIC mse * GC_typed_mark_proc(word * addr, mse * mark_stack_ptr,
338 mse * mark_stack_limit, word env);
340 STATIC mse * GC_array_mark_proc(word * addr, mse * mark_stack_ptr,
341 mse * mark_stack_limit, word env);
343 STATIC void GC_init_explicit_typing(void)
347 GC_STATIC_ASSERT(sizeof(struct LeafDescriptor) % sizeof(word) == 0);
348 /* Set up object kind with simple indirect descriptor. */
349 GC_eobjfreelist = (ptr_t *)GC_new_free_list_inner();
350 GC_explicit_kind = GC_new_kind_inner(
351 (void **)GC_eobjfreelist,
352 (WORDS_TO_BYTES((word)-1) | GC_DS_PER_OBJECT),
354 /* Descriptors are in the last word of the object. */
355 GC_typed_mark_proc_index = GC_new_proc_inner(GC_typed_mark_proc);
356 /* Set up object kind with array descriptor. */
357 GC_array_mark_proc_index = GC_new_proc_inner(GC_array_mark_proc);
358 GC_array_kind = GC_new_kind_inner(GC_new_free_list_inner(),
359 GC_MAKE_PROC(GC_array_mark_proc_index, 0),
361 GC_bm_table[0] = GC_DS_BITMAP;
362 for (i = 1; i < WORDSZ/2; i++) {
363 GC_bm_table[i] = (((word)-1) << (WORDSZ - i)) | GC_DS_BITMAP;
367 STATIC mse * GC_typed_mark_proc(word * addr, mse * mark_stack_ptr,
368 mse * mark_stack_limit, word env)
370 word bm = GC_ext_descriptors[env].ed_bitmap;
371 word * current_p = addr;
373 ptr_t greatest_ha = (ptr_t)GC_greatest_plausible_heap_addr;
374 ptr_t least_ha = (ptr_t)GC_least_plausible_heap_addr;
378 for (; bm != 0; bm >>= 1, current_p++) {
380 current = *current_p;
381 FIXUP_POINTER(current);
382 if (current >= (word)least_ha && current <= (word)greatest_ha) {
383 PUSH_CONTENTS((ptr_t)current, mark_stack_ptr,
384 mark_stack_limit, (ptr_t)current_p);
388 if (GC_ext_descriptors[env].ed_continued) {
389 /* Push an entry with the rest of the descriptor back onto the */
390 /* stack. Thus we never do too much work at once. Note that */
391 /* we also can't overflow the mark stack unless we actually */
392 /* mark something. */
394 if ((word)mark_stack_ptr >= (word)mark_stack_limit) {
395 mark_stack_ptr = GC_signal_mark_stack_overflow(mark_stack_ptr);
397 mark_stack_ptr -> mse_start = (ptr_t)(addr + WORDSZ);
398 mark_stack_ptr -> mse_descr.w =
399 GC_MAKE_PROC(GC_typed_mark_proc_index, env + 1);
401 return(mark_stack_ptr);
404 /* Return the size of the object described by d. It would be faster to */
405 /* store this directly, or to compute it as part of */
406 /* GC_push_complex_descriptor, but hopefully it doesn't matter. */
407 STATIC word GC_descr_obj_size(complex_descriptor *d)
411 return(d -> ld.ld_nelements * d -> ld.ld_size);
413 return(d -> ad.ad_nelements
414 * GC_descr_obj_size(d -> ad.ad_element_descr));
416 return(GC_descr_obj_size(d -> sd.sd_first)
417 + GC_descr_obj_size(d -> sd.sd_second));
419 ABORT_RET("Bad complex descriptor");
424 /* Push descriptors for the object at addr with complex descriptor d */
425 /* onto the mark stack. Return 0 if the mark stack overflowed. */
426 STATIC mse * GC_push_complex_descriptor(word *addr, complex_descriptor *d,
429 ptr_t current = (ptr_t)addr;
437 GC_descr descr = d -> ld.ld_descriptor;
439 nelements = d -> ld.ld_nelements;
440 if (msl - msp <= (ptrdiff_t)nelements) return(0);
441 sz = d -> ld.ld_size;
442 for (i = 0; i < nelements; i++) {
444 msp -> mse_start = current;
445 msp -> mse_descr.w = descr;
452 complex_descriptor *descr = d -> ad.ad_element_descr;
454 nelements = d -> ad.ad_nelements;
455 sz = GC_descr_obj_size(descr);
456 for (i = 0; i < nelements; i++) {
457 msp = GC_push_complex_descriptor((word *)current, descr,
459 if (msp == 0) return(0);
466 sz = GC_descr_obj_size(d -> sd.sd_first);
467 msp = GC_push_complex_descriptor((word *)current, d -> sd.sd_first,
469 if (msp == 0) return(0);
471 msp = GC_push_complex_descriptor((word *)current, d -> sd.sd_second,
476 ABORT_RET("Bad complex descriptor");
481 STATIC mse * GC_array_mark_proc(word * addr, mse * mark_stack_ptr,
482 mse * mark_stack_limit,
483 word env GC_ATTR_UNUSED)
485 hdr * hhdr = HDR(addr);
486 word sz = hhdr -> hb_sz;
487 word nwords = BYTES_TO_WORDS(sz);
488 complex_descriptor * descr = (complex_descriptor *)(addr[nwords-1]);
489 mse * orig_mark_stack_ptr = mark_stack_ptr;
490 mse * new_mark_stack_ptr;
493 /* Found a reference to a free list entry. Ignore it. */
494 return(orig_mark_stack_ptr);
496 /* In use counts were already updated when array descriptor was */
497 /* pushed. Here we only replace it by subobject descriptors, so */
498 /* no update is necessary. */
499 new_mark_stack_ptr = GC_push_complex_descriptor(addr, descr,
502 if (new_mark_stack_ptr == 0) {
503 /* Explicitly instruct Clang Static Analyzer that ptr is non-null. */
504 if (NULL == mark_stack_ptr) ABORT("Bad mark_stack_ptr");
506 /* Doesn't fit. Conservatively push the whole array as a unit */
507 /* and request a mark stack expansion. */
508 /* This cannot cause a mark stack overflow, since it replaces */
509 /* the original array entry. */
510 # ifdef PARALLEL_MARK
511 /* We might be using a local_mark_stack in parallel mode. */
512 if (GC_mark_stack + GC_mark_stack_size == mark_stack_limit)
515 GC_mark_stack_too_small = TRUE;
517 new_mark_stack_ptr = orig_mark_stack_ptr + 1;
518 new_mark_stack_ptr -> mse_start = (ptr_t)addr;
519 new_mark_stack_ptr -> mse_descr.w = sz | GC_DS_LENGTH;
521 /* Push descriptor itself */
522 new_mark_stack_ptr++;
523 new_mark_stack_ptr -> mse_start = (ptr_t)(addr + nwords - 1);
524 new_mark_stack_ptr -> mse_descr.w = sizeof(word) | GC_DS_LENGTH;
526 return new_mark_stack_ptr;
529 GC_API GC_descr GC_CALL GC_make_descriptor(const GC_word * bm, size_t len)
531 signed_word last_set_bit = len - 1;
535 # if defined(AO_HAVE_load_acquire) && defined(AO_HAVE_store_release)
536 if (!EXPECT(AO_load_acquire(&GC_explicit_typing_initialized), TRUE)) {
538 if (!GC_explicit_typing_initialized) {
539 GC_init_explicit_typing();
540 AO_store_release(&GC_explicit_typing_initialized, TRUE);
546 if (!EXPECT(GC_explicit_typing_initialized, TRUE)) {
547 GC_init_explicit_typing();
548 GC_explicit_typing_initialized = TRUE;
553 while (last_set_bit >= 0 && !GC_get_bit(bm, last_set_bit))
555 if (last_set_bit < 0) return(0 /* no pointers */);
557 # if ALIGNMENT == CPP_WORDSZ/8
561 for (i = 0; i < last_set_bit; i++) {
562 if (!GC_get_bit(bm, i)) {
566 if (i == last_set_bit) {
567 /* An initial section contains all pointers. Use length descriptor. */
568 return (WORDS_TO_BYTES(last_set_bit+1) | GC_DS_LENGTH);
572 if ((word)last_set_bit < BITMAP_BITS) {
575 /* Hopefully the common case. */
576 /* Build bitmap descriptor (with bits reversed) */
578 for (i = last_set_bit - 1; i >= 0; i--) {
580 if (GC_get_bit(bm, i)) result |= SIGNB;
582 result |= GC_DS_BITMAP;
584 signed_word index = GC_add_ext_descriptor(bm, (word)last_set_bit + 1);
585 if (index == -1) return(WORDS_TO_BYTES(last_set_bit+1) | GC_DS_LENGTH);
586 /* Out of memory: use conservative */
588 result = GC_MAKE_PROC(GC_typed_mark_proc_index, (word)index);
593 GC_API GC_ATTR_MALLOC void * GC_CALL GC_malloc_explicitly_typed(size_t lb,
599 GC_ASSERT(GC_explicit_typing_initialized);
600 lb = SIZET_SAT_ADD(lb, TYPD_EXTRA_BYTES);
601 op = (word *)GC_malloc_kind(lb, GC_explicit_kind);
602 if (EXPECT(NULL == op, FALSE))
604 /* It is not safe to use GC_size_map[lb] to compute lg here as the */
605 /* the former might be updated asynchronously. */
606 lg = BYTES_TO_GRANULES(GC_size(op));
607 op[GRANULES_TO_WORDS(lg) - 1] = d;
608 GC_dirty(op + GRANULES_TO_WORDS(lg) - 1);
609 REACHABLE_AFTER_DIRTY(d);
613 /* We make the GC_clear_stack() call a tail one, hoping to get more of */
615 #define GENERAL_MALLOC_IOP(lb, k) \
616 GC_clear_stack(GC_generic_malloc_ignore_off_page(lb, k))
618 GC_API GC_ATTR_MALLOC void * GC_CALL
619 GC_malloc_explicitly_typed_ignore_off_page(size_t lb, GC_descr d)
625 GC_ASSERT(GC_explicit_typing_initialized);
626 lb = SIZET_SAT_ADD(lb, TYPD_EXTRA_BYTES);
628 GC_DBG_COLLECT_AT_MALLOC(lb);
630 lg = GC_size_map[lb];
631 op = GC_eobjfreelist[lg];
632 if (EXPECT(0 == op, FALSE)) {
634 op = (ptr_t)GENERAL_MALLOC_IOP(lb, GC_explicit_kind);
635 if (0 == op) return 0;
636 /* See the comment in GC_malloc_explicitly_typed. */
637 lg = BYTES_TO_GRANULES(GC_size(op));
639 GC_eobjfreelist[lg] = (ptr_t)obj_link(op);
641 GC_bytes_allocd += GRANULES_TO_BYTES((word)lg);
645 op = (ptr_t)GENERAL_MALLOC_IOP(lb, GC_explicit_kind);
646 if (NULL == op) return NULL;
647 lg = BYTES_TO_GRANULES(GC_size(op));
649 ((word *)op)[GRANULES_TO_WORDS(lg) - 1] = d;
650 GC_dirty(op + GRANULES_TO_WORDS(lg) - 1);
651 REACHABLE_AFTER_DIRTY(d);
655 GC_API GC_ATTR_MALLOC void * GC_CALL GC_calloc_explicitly_typed(size_t n,
656 size_t lb, GC_descr d)
660 GC_descr simple_descr;
661 complex_descriptor *complex_descr;
663 struct LeafDescriptor leaf;
665 GC_ASSERT(GC_explicit_typing_initialized);
666 descr_type = GC_make_array_descriptor((word)n, (word)lb, d, &simple_descr,
667 &complex_descr, &leaf);
668 if ((lb | n) > GC_SQRT_SIZE_MAX /* fast initial check */
669 && lb > 0 && n > GC_SIZE_MAX / lb)
670 return (*GC_get_oom_fn())(GC_SIZE_MAX); /* n*lb overflow */
673 case NO_MEM: return(0);
675 return GC_malloc_explicitly_typed(lb, simple_descr);
677 lb = SIZET_SAT_ADD(lb,
678 sizeof(struct LeafDescriptor) + TYPD_EXTRA_BYTES);
681 lb = SIZET_SAT_ADD(lb, TYPD_EXTRA_BYTES);
684 op = (word *)GC_malloc_kind(lb, GC_array_kind);
685 if (EXPECT(NULL == op, FALSE))
687 lg = BYTES_TO_GRANULES(GC_size(op));
688 if (descr_type == LEAF) {
689 /* Set up the descriptor inside the object itself. */
690 volatile struct LeafDescriptor * lp =
691 (struct LeafDescriptor *)
692 (op + GRANULES_TO_WORDS(lg)
693 - (BYTES_TO_WORDS(sizeof(struct LeafDescriptor)) + 1));
695 lp -> ld_tag = LEAF_TAG;
696 lp -> ld_size = leaf.ld_size;
697 lp -> ld_nelements = leaf.ld_nelements;
698 lp -> ld_descriptor = leaf.ld_descriptor;
699 ((volatile word *)op)[GRANULES_TO_WORDS(lg) - 1] = (word)lp;
701 # ifndef GC_NO_FINALIZATION
702 size_t lw = GRANULES_TO_WORDS(lg);
704 op[lw - 1] = (word)complex_descr;
705 GC_dirty(op + lw - 1);
706 REACHABLE_AFTER_DIRTY(complex_descr);
708 /* Make sure the descriptor is cleared once there is any danger */
709 /* it may have been collected. */
710 if (EXPECT(GC_general_register_disappearing_link(
711 (void **)(op + lw - 1), op)
712 == GC_NO_MEMORY, FALSE))
715 /* Couldn't register it due to lack of memory. Punt. */
716 return (*GC_get_oom_fn())(lb);