2 * sgen-nursery-allocator.c: Nursery allocation code.
4 * Copyright 2009-2010 Novell, Inc.
7 * Copyright 2011 Xamarin Inc (http://www.xamarin.com)
8 * Copyright (C) 2012 Xamarin Inc
10 * This library is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU Library General Public
12 * License 2.0 as published by the Free Software Foundation;
14 * This library is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Library General Public License for more details.
19 * You should have received a copy of the GNU Library General Public
20 * License 2.0 along with this library; if not, write to the Free
21 * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25 * The young generation is divided into fragments. This is because
26 * we can hand one fragments to a thread for lock-less fast alloc and
27 * because the young generation ends up fragmented anyway by pinned objects.
28 * Once a collection is done, a list of fragments is created. When doing
29 * thread local alloc we use smallish nurseries so we allow new threads to
30 * allocate memory from gen0 without triggering a collection. Threads that
31 * are found to allocate lots of memory are given bigger fragments. This
32 * should make the finalizer thread use little nursery memory after a while.
33 * We should start assigning threads very small fragments: if there are many
34 * threads the nursery will be full of reserved space that the threads may not
35 * use at all, slowing down allocation speed.
36 * Thread local allocation is done from areas of memory Hotspot calls Thread Local
37 * Allocation Buffers (TLABs).
48 #ifdef HAVE_SEMAPHORE_H
49 #include <semaphore.h>
63 #include "metadata/sgen-gc.h"
64 #include "metadata/metadata-internals.h"
65 #include "metadata/class-internals.h"
66 #include "metadata/gc-internal.h"
67 #include "metadata/object-internals.h"
68 #include "metadata/threads.h"
69 #include "metadata/sgen-cardtable.h"
70 #include "metadata/sgen-protocol.h"
71 #include "metadata/sgen-archdep.h"
72 #include "metadata/sgen-bridge.h"
73 #include "metadata/mono-gc.h"
74 #include "metadata/method-builder.h"
75 #include "metadata/profiler-private.h"
76 #include "metadata/monitor.h"
77 #include "metadata/threadpool-internals.h"
78 #include "metadata/mempool-internals.h"
79 #include "metadata/marshal.h"
80 #include "utils/mono-mmap.h"
81 #include "utils/mono-time.h"
82 #include "utils/mono-semaphore.h"
83 #include "utils/mono-counters.h"
84 #include "utils/mono-proclib.h"
85 #include "utils/mono-threads.h"
87 /* Enable it so nursery allocation diagnostic data is collected */
88 //#define NALLOC_DEBUG 1
90 /* The mutator allocs from here. */
91 SgenFragmentAllocator mutator_allocator;
93 /* freeelist of fragment structures */
94 static SgenFragment *fragment_freelist = NULL;
96 /* Allocator cursors */
97 static char *nursery_last_pinned_end = NULL;
99 char *sgen_nursery_start;
100 char *sgen_nursery_end;
103 int sgen_nursery_size = (1 << 22);
104 #ifdef SGEN_ALIGN_NURSERY
105 int sgen_nursery_bits = 22;
109 char *sgen_space_bitmap MONO_INTERNAL;
110 int sgen_space_bitmap_size MONO_INTERNAL;
112 #ifdef HEAVY_STATISTICS
114 static gint32 stat_wasted_bytes_trailer = 0;
115 static gint32 stat_wasted_bytes_small_areas = 0;
116 static gint32 stat_wasted_bytes_discarded_fragments = 0;
117 static gint32 stat_nursery_alloc_requests = 0;
118 static gint32 stat_alloc_iterations = 0;
119 static gint32 stat_alloc_retries = 0;
121 static gint32 stat_nursery_alloc_range_requests = 0;
122 static gint32 stat_alloc_range_iterations = 0;
123 static gint32 stat_alloc_range_retries = 0;
127 /************************************Nursery allocation debugging *********************************************/
144 MonoNativeThreadId tid;
147 #define ALLOC_RECORD_COUNT 128000
150 static AllocRecord *alloc_records;
151 static volatile int next_record;
152 static volatile int alloc_count;
156 get_reason_name (AllocRecord *rec)
158 switch (rec->reason) {
159 case FIXED_ALLOC: return "fixed-alloc";
160 case RANGE_ALLOC: return "range-alloc";
161 case PINNING: return "pinning";
162 case BLOCK_ZEROING: return "block-zeroing";
163 case CLEAR_NURSERY_FRAGS: return "clear-nursery-frag";
164 default: return "invalid";
169 reset_alloc_records (void)
176 add_alloc_record (char *addr, size_t size, int reason)
178 int idx = InterlockedIncrement (&next_record) - 1;
179 alloc_records [idx].address = addr;
180 alloc_records [idx].size = size;
181 alloc_records [idx].reason = reason;
182 alloc_records [idx].seq = idx;
183 alloc_records [idx].tid = mono_native_thread_id_get ();
187 comp_alloc_record (const void *_a, const void *_b)
189 const AllocRecord *a = _a;
190 const AllocRecord *b = _b;
191 if (a->address == b->address)
192 return a->seq - b->seq;
193 return a->address - b->address;
196 #define rec_end(REC) ((REC)->address + (REC)->size)
199 dump_alloc_records (void)
202 qsort (alloc_records, next_record, sizeof (AllocRecord), comp_alloc_record);
204 printf ("------------------------------------DUMP RECORDS----------------------------\n");
205 for (i = 0; i < next_record; ++i) {
206 AllocRecord *rec = alloc_records + i;
207 printf ("obj [%p, %p] size %zd reason %s seq %d tid %zx\n", rec->address, rec_end (rec), rec->size, get_reason_name (rec), rec->seq, (size_t)rec->tid);
212 verify_alloc_records (void)
218 AllocRecord *prev = NULL;
220 qsort (alloc_records, next_record, sizeof (AllocRecord), comp_alloc_record);
221 printf ("------------------------------------DUMP RECORDS- %d %d---------------------------\n", next_record, alloc_count);
222 for (i = 0; i < next_record; ++i) {
223 AllocRecord *rec = alloc_records + i;
227 if (rec_end (prev) > rec->address)
228 printf ("WE GOT OVERLAPPING objects %p and %p\n", prev->address, rec->address);
229 if ((rec->address - rec_end (prev)) >= 8)
231 hole_size = rec->address - rec_end (prev);
232 max_hole = MAX (max_hole, hole_size);
234 printf ("obj [%p, %p] size %zd hole to prev %d reason %s seq %d tid %zx\n", rec->address, rec_end (rec), rec->size, hole_size, get_reason_name (rec), rec->seq, (size_t)rec->tid);
237 printf ("SUMMARY total alloc'd %d holes %d max_hole %d\n", total, holes, max_hole);
242 /*********************************************************************************/
245 static inline gpointer
246 mask (gpointer n, uintptr_t bit)
248 return (gpointer)(((uintptr_t)n) | bit);
251 static inline gpointer
254 return (gpointer)((uintptr_t)p & ~(uintptr_t)0x3);
257 static inline uintptr_t
258 get_mark (gpointer n)
260 return (uintptr_t)n & 0x1;
263 /*MUST be called with world stopped*/
265 sgen_fragment_allocator_alloc (void)
267 SgenFragment *frag = fragment_freelist;
269 fragment_freelist = frag->next_in_order;
270 frag->next = frag->next_in_order = NULL;
273 frag = sgen_alloc_internal (INTERNAL_MEM_FRAGMENT);
274 frag->next = frag->next_in_order = NULL;
279 sgen_fragment_allocator_add (SgenFragmentAllocator *allocator, char *start, char *end)
281 SgenFragment *fragment;
283 fragment = sgen_fragment_allocator_alloc ();
284 fragment->fragment_start = start;
285 fragment->fragment_next = start;
286 fragment->fragment_end = end;
287 fragment->next_in_order = fragment->next = unmask (allocator->region_head);
289 allocator->region_head = allocator->alloc_head = fragment;
290 g_assert (fragment->fragment_end > fragment->fragment_start);
294 sgen_fragment_allocator_release (SgenFragmentAllocator *allocator)
296 SgenFragment *last = allocator->region_head;
300 /* Find the last fragment in insert order */
301 for (; last->next_in_order; last = last->next_in_order) ;
303 last->next_in_order = fragment_freelist;
304 fragment_freelist = allocator->region_head;
305 allocator->alloc_head = allocator->region_head = NULL;
308 static SgenFragment**
309 find_previous_pointer_fragment (SgenFragmentAllocator *allocator, SgenFragment *frag)
312 SgenFragment *cur, *next;
318 prev = &allocator->alloc_head;
321 printf ("retry count for fppf is %d\n", count);
324 cur = unmask (*prev);
332 * We need to make sure that we dereference prev below
333 * after reading cur->next above, so we need a read
336 mono_memory_read_barrier ();
341 if (!get_mark (next)) {
346 next = unmask (next);
347 if (InterlockedCompareExchangePointer ((volatile gpointer*)prev, next, cur) != cur)
349 /*we must make sure that the next from cur->next happens after*/
350 mono_memory_write_barrier ();
353 cur = mono_lls_pointer_unmask (next);
359 claim_remaining_size (SgenFragment *frag, char *alloc_end)
361 /* All space used, nothing to claim. */
362 if (frag->fragment_end <= alloc_end)
365 /* Try to alloc all the remaining space. */
366 return InterlockedCompareExchangePointer ((volatile gpointer*)&frag->fragment_next, frag->fragment_end, alloc_end) == alloc_end;
370 par_alloc_from_fragment (SgenFragmentAllocator *allocator, SgenFragment *frag, size_t size)
372 char *p = frag->fragment_next;
373 char *end = p + size;
375 if (end > frag->fragment_end)
378 /* p = frag->fragment_next must happen before */
379 mono_memory_barrier ();
381 if (InterlockedCompareExchangePointer ((volatile gpointer*)&frag->fragment_next, end, p) != p)
384 if (frag->fragment_end - end < SGEN_MAX_NURSERY_WASTE) {
385 SgenFragment *next, **prev_ptr;
388 * Before we clean the remaining nursery, we must claim the remaining space
389 * as it could end up been used by the range allocator since it can end up
390 * allocating from this dying fragment as it doesn't respect SGEN_MAX_NURSERY_WASTE
391 * when doing second chance allocation.
393 if (sgen_get_nursery_clear_policy () == CLEAR_AT_TLAB_CREATION && claim_remaining_size (frag, end)) {
394 sgen_clear_range (end, frag->fragment_end);
395 HEAVY_STAT (InterlockedExchangeAdd (&stat_wasted_bytes_trailer, frag->fragment_end - end));
397 add_alloc_record (end, frag->fragment_end - end, BLOCK_ZEROING);
401 prev_ptr = find_previous_pointer_fragment (allocator, frag);
403 /*Use Michaels linked list remove*/
405 /*prev_ptr will be null if the fragment was removed concurrently */
410 if (!get_mark (next)) {
411 /*frag->next read must happen before the first CAS*/
412 mono_memory_write_barrier ();
414 /*Fail if the next done is removed concurrently and its CAS wins */
415 if (InterlockedCompareExchangePointer ((volatile gpointer*)&frag->next, mask (next, 1), next) != next) {
420 /* The second CAS must happen after the first CAS or frag->next. */
421 mono_memory_write_barrier ();
423 /* Fail if the previous node was deleted and its CAS wins */
424 if (InterlockedCompareExchangePointer ((volatile gpointer*)prev_ptr, next, frag) != frag) {
425 prev_ptr = find_previous_pointer_fragment (allocator, frag);
436 serial_alloc_from_fragment (SgenFragment **previous, SgenFragment *frag, size_t size)
438 char *p = frag->fragment_next;
439 char *end = p + size;
441 if (end > frag->fragment_end)
444 frag->fragment_next = end;
446 if (frag->fragment_end - end < SGEN_MAX_NURSERY_WASTE) {
447 *previous = frag->next;
449 /* Clear the remaining space, pinning depends on this. FIXME move this to use phony arrays */
450 memset (end, 0, frag->fragment_end - end);
452 *previous = frag->next;
459 sgen_fragment_allocator_par_alloc (SgenFragmentAllocator *allocator, size_t size)
464 InterlockedIncrement (&alloc_count);
468 for (frag = unmask (allocator->alloc_head); unmask (frag); frag = unmask (frag->next)) {
469 HEAVY_STAT (InterlockedIncrement (&stat_alloc_iterations));
471 if (size <= (frag->fragment_end - frag->fragment_next)) {
472 void *p = par_alloc_from_fragment (allocator, frag, size);
474 HEAVY_STAT (InterlockedIncrement (&stat_alloc_retries));
478 add_alloc_record (p, size, FIXED_ALLOC);
487 sgen_fragment_allocator_serial_alloc (SgenFragmentAllocator *allocator, size_t size)
490 SgenFragment **previous;
492 InterlockedIncrement (&alloc_count);
495 previous = &allocator->alloc_head;
497 for (frag = *previous; frag; frag = *previous) {
498 char *p = serial_alloc_from_fragment (previous, frag, size);
500 HEAVY_STAT (InterlockedIncrement (&stat_alloc_iterations));
504 add_alloc_record (p, size, FIXED_ALLOC);
508 previous = &frag->next;
514 sgen_fragment_allocator_serial_range_alloc (SgenFragmentAllocator *allocator, size_t desired_size, size_t minimum_size, size_t *out_alloc_size)
516 SgenFragment *frag, **previous, *min_frag = NULL, **prev_min_frag = NULL;
517 size_t current_minimum = minimum_size;
520 InterlockedIncrement (&alloc_count);
523 previous = &allocator->alloc_head;
525 for (frag = *previous; frag; frag = *previous) {
526 size_t frag_size = frag->fragment_end - frag->fragment_next;
528 HEAVY_STAT (InterlockedIncrement (&stat_alloc_range_iterations));
530 if (desired_size <= frag_size) {
532 *out_alloc_size = desired_size;
534 p = serial_alloc_from_fragment (previous, frag, desired_size);
536 add_alloc_record (p, desired_size, RANGE_ALLOC);
540 if (current_minimum <= frag_size) {
542 prev_min_frag = previous;
543 current_minimum = frag_size;
545 previous = &frag->next;
550 size_t frag_size = min_frag->fragment_end - min_frag->fragment_next;
551 *out_alloc_size = frag_size;
553 p = serial_alloc_from_fragment (prev_min_frag, min_frag, frag_size);
556 add_alloc_record (p, frag_size, RANGE_ALLOC);
565 sgen_fragment_allocator_par_range_alloc (SgenFragmentAllocator *allocator, size_t desired_size, size_t minimum_size, size_t *out_alloc_size)
567 SgenFragment *frag, *min_frag;
568 size_t current_minimum;
572 current_minimum = minimum_size;
575 InterlockedIncrement (&alloc_count);
578 for (frag = unmask (allocator->alloc_head); frag; frag = unmask (frag->next)) {
579 int frag_size = frag->fragment_end - frag->fragment_next;
581 HEAVY_STAT (InterlockedIncrement (&stat_alloc_range_iterations));
583 if (desired_size <= frag_size) {
585 *out_alloc_size = desired_size;
587 p = par_alloc_from_fragment (allocator, frag, desired_size);
589 HEAVY_STAT (InterlockedIncrement (&stat_alloc_range_retries));
593 add_alloc_record (p, desired_size, RANGE_ALLOC);
597 if (current_minimum <= frag_size) {
599 current_minimum = frag_size;
603 /* The second fragment_next read should be ordered in respect to the first code block */
604 mono_memory_barrier ();
610 frag_size = min_frag->fragment_end - min_frag->fragment_next;
611 if (frag_size < minimum_size)
614 *out_alloc_size = frag_size;
616 mono_memory_barrier ();
617 p = par_alloc_from_fragment (allocator, min_frag, frag_size);
619 /*XXX restarting here is quite dubious given this is already second chance allocation. */
621 HEAVY_STAT (InterlockedIncrement (&stat_alloc_retries));
625 add_alloc_record (p, frag_size, RANGE_ALLOC);
634 sgen_clear_allocator_fragments (SgenFragmentAllocator *allocator)
638 for (frag = unmask (allocator->alloc_head); frag; frag = unmask (frag->next)) {
639 SGEN_LOG (4, "Clear nursery frag %p-%p", frag->fragment_next, frag->fragment_end);
640 sgen_clear_range (frag->fragment_next, frag->fragment_end);
642 add_alloc_record (frag->fragment_next, frag->fragment_end - frag->fragment_next, CLEAR_NURSERY_FRAGS);
647 /* Clear all remaining nursery fragments */
649 sgen_clear_nursery_fragments (void)
651 if (sgen_get_nursery_clear_policy () == CLEAR_AT_TLAB_CREATION) {
652 sgen_clear_allocator_fragments (&mutator_allocator);
653 sgen_minor_collector.clear_fragments ();
658 * Mark a given range of memory as invalid.
660 * This can be done either by zeroing memory or by placing
661 * a phony byte[] array. This keeps the heap forward walkable.
663 * This function ignores calls with a zero range, even if
664 * both start and end are NULL.
667 sgen_clear_range (char *start, char *end)
670 size_t size = end - start;
672 if ((start && !end) || (start > end))
673 g_error ("Invalid range [%p %p]", start, end);
675 if (size < sizeof (MonoArray)) {
676 memset (start, 0, size);
680 o = (MonoArray*)start;
681 o->obj.vtable = sgen_get_array_fill_vtable ();
682 /* Mark this as not a real object */
683 o->obj.synchronisation = GINT_TO_POINTER (-1);
685 o->max_length = size - sizeof (MonoArray);
686 sgen_set_nursery_scan_start (start);
687 g_assert (start + sgen_safe_object_get_size ((MonoObject*)o) == end);
691 sgen_nursery_allocator_prepare_for_pinning (void)
693 sgen_clear_allocator_fragments (&mutator_allocator);
694 sgen_minor_collector.clear_fragments ();
697 static mword fragment_total = 0;
699 * We found a fragment of free memory in the nursery: memzero it and if
700 * it is big enough, add it to the list of fragments that can be used for
704 add_nursery_frag (SgenFragmentAllocator *allocator, size_t frag_size, char* frag_start, char* frag_end)
706 SGEN_LOG (4, "Found empty fragment: %p-%p, size: %zd", frag_start, frag_end, frag_size);
707 binary_protocol_empty (frag_start, frag_size);
708 MONO_GC_NURSERY_SWEPT ((mword)frag_start, frag_end - frag_start);
709 /* Not worth dealing with smaller fragments: need to tune */
710 if (frag_size >= SGEN_MAX_NURSERY_WASTE) {
711 /* memsetting just the first chunk start is bound to provide better cache locality */
712 if (sgen_get_nursery_clear_policy () == CLEAR_AT_GC)
713 memset (frag_start, 0, frag_size);
716 /* XXX convert this into a flight record entry
717 printf ("\tfragment [%p %p] size %zd\n", frag_start, frag_end, frag_size);
720 sgen_fragment_allocator_add (allocator, frag_start, frag_end);
721 fragment_total += frag_size;
723 /* Clear unused fragments, pinning depends on this */
724 sgen_clear_range (frag_start, frag_end);
725 HEAVY_STAT (InterlockedExchangeAdd (&stat_wasted_bytes_small_areas, frag_size));
730 fragment_list_reverse (SgenFragmentAllocator *allocator)
732 SgenFragment *prev = NULL, *list = allocator->region_head;
734 SgenFragment *next = list->next;
736 list->next_in_order = prev;
741 allocator->region_head = allocator->alloc_head = prev;
745 sgen_build_nursery_fragments (GCMemSection *nursery_section, void **start, int num_entries, SgenGrayQueue *unpin_queue)
747 char *frag_start, *frag_end;
750 SgenFragment *frags_ranges;
753 reset_alloc_records ();
755 /*The mutator fragments are done. We no longer need them. */
756 sgen_fragment_allocator_release (&mutator_allocator);
758 frag_start = sgen_nursery_start;
761 /* The current nursery might give us a fragment list to exclude [start, next[*/
762 frags_ranges = sgen_minor_collector.build_fragments_get_exclude_head ();
764 /* clear scan starts */
765 memset (nursery_section->scan_starts, 0, nursery_section->num_scan_start * sizeof (gpointer));
767 while (i < num_entries || frags_ranges) {
770 SgenFragment *last_frag = NULL;
772 addr0 = addr1 = sgen_nursery_end;
776 addr1 = frags_ranges->fragment_start;
780 GRAY_OBJECT_ENQUEUE (unpin_queue, addr0);
782 SGEN_UNPIN_OBJECT (addr0);
783 sgen_set_nursery_scan_start (addr0);
785 size = SGEN_ALIGN_UP (sgen_safe_object_get_size ((MonoObject*)addr0));
789 size = frags_ranges->fragment_next - addr1;
790 last_frag = frags_ranges;
791 frags_ranges = frags_ranges->next_in_order;
794 frag_size = frag_end - frag_start;
799 g_assert (frag_size >= 0);
801 if (frag_size && size)
802 add_nursery_frag (&mutator_allocator, frag_size, frag_start, frag_end);
806 add_alloc_record (start [i], frag_size, PINNING);
808 frag_start = frag_end + frag_size;
811 nursery_last_pinned_end = frag_start;
812 frag_end = sgen_nursery_end;
813 frag_size = frag_end - frag_start;
815 add_nursery_frag (&mutator_allocator, frag_size, frag_start, frag_end);
817 /* Now it's safe to release the fragments exclude list. */
818 sgen_minor_collector.build_fragments_release_exclude_head ();
820 /* First we reorder the fragment list to be in ascending address order. This makes H/W prefetchers happier. */
821 fragment_list_reverse (&mutator_allocator);
823 /*The collector might want to do something with the final nursery fragment list.*/
824 sgen_minor_collector.build_fragments_finish (&mutator_allocator);
826 if (!unmask (mutator_allocator.alloc_head)) {
827 SGEN_LOG (1, "Nursery fully pinned (%d)", num_entries);
828 for (i = 0; i < num_entries; ++i) {
829 SGEN_LOG (3, "Bastard pinning obj %p (%s), size: %d", start [i], sgen_safe_name (start [i]), sgen_safe_object_get_size (start [i]));
832 return fragment_total;
836 sgen_nursery_alloc_get_upper_alloc_bound (void)
838 /*FIXME we need to calculate the collector upper bound as well, but this must be done in the previous GC. */
839 return sgen_nursery_end;
842 /*** Nursery memory allocation ***/
844 sgen_nursery_retire_region (void *address, ptrdiff_t size)
846 HEAVY_STAT (InterlockedExchangeAdd (&stat_wasted_bytes_discarded_fragments, size));
850 sgen_can_alloc_size (size_t size)
853 size = SGEN_ALIGN_UP (size);
855 for (frag = unmask (mutator_allocator.alloc_head); frag; frag = unmask (frag->next)) {
856 if ((frag->fragment_end - frag->fragment_next) >= size)
863 sgen_nursery_alloc (size_t size)
865 SGEN_LOG (4, "Searching nursery for size: %zd", size);
866 size = SGEN_ALIGN_UP (size);
868 HEAVY_STAT (InterlockedIncrement (&stat_nursery_alloc_requests));
870 return sgen_fragment_allocator_par_alloc (&mutator_allocator, size);
874 sgen_nursery_alloc_range (size_t desired_size, size_t minimum_size, size_t *out_alloc_size)
876 SGEN_LOG (4, "Searching for byte range desired size: %zd minimum size %zd", desired_size, minimum_size);
878 HEAVY_STAT (InterlockedIncrement (&stat_nursery_alloc_range_requests));
880 return sgen_fragment_allocator_par_range_alloc (&mutator_allocator, desired_size, minimum_size, out_alloc_size);
883 /*** Initialization ***/
885 #ifdef HEAVY_STATISTICS
888 sgen_nursery_allocator_init_heavy_stats (void)
890 mono_counters_register ("bytes wasted trailer fragments", MONO_COUNTER_GC | MONO_COUNTER_INT, &stat_wasted_bytes_trailer);
891 mono_counters_register ("bytes wasted small areas", MONO_COUNTER_GC | MONO_COUNTER_INT, &stat_wasted_bytes_small_areas);
892 mono_counters_register ("bytes wasted discarded fragments", MONO_COUNTER_GC | MONO_COUNTER_INT, &stat_wasted_bytes_discarded_fragments);
894 mono_counters_register ("# nursery alloc requests", MONO_COUNTER_GC | MONO_COUNTER_INT, &stat_nursery_alloc_requests);
895 mono_counters_register ("# nursery alloc iterations", MONO_COUNTER_GC | MONO_COUNTER_INT, &stat_alloc_iterations);
896 mono_counters_register ("# nursery alloc retries", MONO_COUNTER_GC | MONO_COUNTER_INT, &stat_alloc_retries);
898 mono_counters_register ("# nursery alloc range requests", MONO_COUNTER_GC | MONO_COUNTER_INT, &stat_nursery_alloc_range_requests);
899 mono_counters_register ("# nursery alloc range iterations", MONO_COUNTER_GC | MONO_COUNTER_INT, &stat_alloc_range_iterations);
900 mono_counters_register ("# nursery alloc range restries", MONO_COUNTER_GC | MONO_COUNTER_INT, &stat_alloc_range_retries);
906 sgen_init_nursery_allocator (void)
908 sgen_register_fixed_internal_mem_type (INTERNAL_MEM_FRAGMENT, sizeof (SgenFragment));
910 alloc_records = sgen_alloc_os_memory (sizeof (AllocRecord) * ALLOC_RECORD_COUNT, SGEN_ALLOC_INTERNAL | SGEN_ALLOC_ACTIVATE, "debugging memory");
915 sgen_nursery_alloc_prepare_for_minor (void)
917 sgen_minor_collector.prepare_to_space (sgen_space_bitmap, sgen_space_bitmap_size);
921 sgen_nursery_alloc_prepare_for_major (void)
923 sgen_minor_collector.prepare_to_space (sgen_space_bitmap, sgen_space_bitmap_size);
927 sgen_nursery_allocator_set_nursery_bounds (char *start, char *end)
929 sgen_nursery_start = start;
930 sgen_nursery_end = end;
932 sgen_space_bitmap_size = (end - start) / (SGEN_TO_SPACE_GRANULE_IN_BYTES * 8);
933 sgen_space_bitmap = g_malloc0 (sgen_space_bitmap_size);
935 /* Setup the single first large fragment */
936 sgen_minor_collector.init_nursery (&mutator_allocator, start, end);