/*
* sgen-nursery-allocator.c: Nursery allocation code.
*
- *
* Copyright 2009-2010 Novell, Inc.
* 2011 Rodrigo Kumpera
*
* Copyright 2011 Xamarin Inc (http://www.xamarin.com)
+ * Copyright (C) 2012 Xamarin Inc
*
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Library General Public
+ * License 2.0 as published by the Free Software Foundation;
*
- * Permission is hereby granted, free of charge, to any person obtaining
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
- * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
- * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
- * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Library General Public License for more details.
+ *
+ * You should have received a copy of the GNU Library General Public
+ * License 2.0 along with this library; if not, write to the Free
+ * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/*
#define _XOPEN_SOURCE
#endif
-/*
-TODO:
-cleanup the code that readies the nursery for pinning/collection
- this means removing all remaining memseting and use phony objects
- all around. Have a separate fragments head so we can process all
- of them together.
-*/
#include "metadata/sgen-gc.h"
#include "metadata/metadata-internals.h"
#include "metadata/class-internals.h"
#include "utils/mono-proclib.h"
#include "utils/mono-threads.h"
-
-typedef struct _Fragment Fragment;
-
-struct _Fragment {
- Fragment *next;
- char *fragment_start;
- char *fragment_next; /* the current soft limit for allocation */
- char *fragment_end;
- Fragment *next_in_order; /* We use a different entry for all active fragments so we can avoid SMR. */
-};
-
-typedef struct {
- Fragment *alloc_head; /* List head to be used when allocating memory. Walk with fragment_next. */
- Fragment *region_head; /* List head of the region used by this allocator. Walk with next_in_order. */
-} FragmentAllocator;
-
/* Enable it so nursery allocation diagnostic data is collected */
//#define NALLOC_DEBUG 1
-/* fragments that are free and ready to be used for allocation */
-static FragmentAllocator nursery_allocator;
+/* The mutator allocs from here. */
+SgenFragmentAllocator mutator_allocator;
/* freeelist of fragment structures */
-static Fragment *fragment_freelist = NULL;
+static SgenFragment *fragment_freelist = NULL;
/* Allocator cursors */
static char *nursery_last_pinned_end = NULL;
#endif
#endif
-
-static void sgen_clear_range (char *start, char *end);
+char *sgen_space_bitmap MONO_INTERNAL;
+int sgen_space_bitmap_size MONO_INTERNAL;
#ifdef HEAVY_STATISTICS
}
/*MUST be called with world stopped*/
-static Fragment*
-alloc_fragment (void)
+SgenFragment*
+sgen_fragment_allocator_alloc (void)
{
- Fragment *frag = fragment_freelist;
+ SgenFragment *frag = fragment_freelist;
if (frag) {
fragment_freelist = frag->next_in_order;
frag->next = frag->next_in_order = NULL;
return frag;
}
-static void
-add_fragment (FragmentAllocator *allocator, char *start, char *end)
+void
+sgen_fragment_allocator_add (SgenFragmentAllocator *allocator, char *start, char *end)
{
- Fragment *fragment;
+ SgenFragment *fragment;
- fragment = alloc_fragment ();
+ fragment = sgen_fragment_allocator_alloc ();
fragment->fragment_start = start;
fragment->fragment_next = start;
fragment->fragment_end = end;
fragment->next_in_order = fragment->next = unmask (allocator->region_head);
allocator->region_head = allocator->alloc_head = fragment;
+ g_assert (fragment->fragment_end > fragment->fragment_start);
}
-static void
-release_fragment_list (FragmentAllocator *allocator)
+void
+sgen_fragment_allocator_release (SgenFragmentAllocator *allocator)
{
- Fragment *last = allocator->region_head;
+ SgenFragment *last = allocator->region_head;
if (!last)
return;
allocator->alloc_head = allocator->region_head = NULL;
}
-static Fragment**
-find_previous_pointer_fragment (FragmentAllocator *allocator, Fragment *frag)
+static SgenFragment**
+find_previous_pointer_fragment (SgenFragmentAllocator *allocator, SgenFragment *frag)
{
- Fragment **prev;
- Fragment *cur, *next;
+ SgenFragment **prev;
+ SgenFragment *cur, *next;
#ifdef NALLOC_DEBUG
int count = 0;
#endif
}
static gboolean
-claim_remaining_size (Fragment *frag, char *alloc_end)
+claim_remaining_size (SgenFragment *frag, char *alloc_end)
{
/* All space used, nothing to claim. */
if (frag->fragment_end <= alloc_end)
}
static void*
-par_alloc_from_fragment (FragmentAllocator *allocator, Fragment *frag, size_t size)
+par_alloc_from_fragment (SgenFragmentAllocator *allocator, SgenFragment *frag, size_t size)
{
char *p = frag->fragment_next;
char *end = p + size;
return NULL;
if (frag->fragment_end - end < SGEN_MAX_NURSERY_WASTE) {
- Fragment *next, **prev_ptr;
+ SgenFragment *next, **prev_ptr;
/*
* Before we clean the remaining nursery, we must claim the remaining space
}
static void*
-serial_alloc_from_fragment (Fragment **previous, Fragment *frag, size_t size)
+serial_alloc_from_fragment (SgenFragment **previous, SgenFragment *frag, size_t size)
{
char *p = frag->fragment_next;
char *end = p + size;
return p;
}
-static void*
-par_alloc (FragmentAllocator *allocator, size_t size)
+void*
+sgen_fragment_allocator_par_alloc (SgenFragmentAllocator *allocator, size_t size)
{
- Fragment *frag;
+ SgenFragment *frag;
#ifdef NALLOC_DEBUG
InterlockedIncrement (&alloc_count);
return NULL;
}
-static void*
-serial_alloc (FragmentAllocator *allocator, size_t size)
+void*
+sgen_fragment_allocator_serial_alloc (SgenFragmentAllocator *allocator, size_t size)
{
- Fragment *frag;
- Fragment **previous;
+ SgenFragment *frag;
+ SgenFragment **previous;
#ifdef NALLOC_DEBUG
InterlockedIncrement (&alloc_count);
#endif
return NULL;
}
-static void*
-par_range_alloc (FragmentAllocator *allocator, size_t desired_size, size_t minimum_size, int *out_alloc_size)
+void*
+sgen_fragment_allocator_serial_range_alloc (SgenFragmentAllocator *allocator, size_t desired_size, size_t minimum_size, size_t *out_alloc_size)
{
- Fragment *frag, *min_frag;
+ SgenFragment *frag, **previous, *min_frag = NULL, **prev_min_frag = NULL;
+ size_t current_minimum = minimum_size;
+
+#ifdef NALLOC_DEBUG
+ InterlockedIncrement (&alloc_count);
+#endif
+
+ previous = &allocator->alloc_head;
+
+ for (frag = *previous; frag; frag = *previous) {
+ size_t frag_size = frag->fragment_end - frag->fragment_next;
+
+ HEAVY_STAT (InterlockedIncrement (&stat_alloc_range_iterations));
+
+ if (desired_size <= frag_size) {
+ void *p;
+ *out_alloc_size = desired_size;
+
+ p = serial_alloc_from_fragment (previous, frag, desired_size);
+#ifdef NALLOC_DEBUG
+ add_alloc_record (p, desired_size, RANGE_ALLOC);
+#endif
+ return p;
+ }
+ if (current_minimum <= frag_size) {
+ min_frag = frag;
+ prev_min_frag = previous;
+ current_minimum = frag_size;
+ }
+ previous = &frag->next;
+ }
+
+ if (min_frag) {
+ void *p;
+ size_t frag_size = min_frag->fragment_end - min_frag->fragment_next;
+ *out_alloc_size = frag_size;
+
+ p = serial_alloc_from_fragment (prev_min_frag, min_frag, frag_size);
+
+#ifdef NALLOC_DEBUG
+ add_alloc_record (p, frag_size, RANGE_ALLOC);
+#endif
+ return p;
+ }
+
+ return NULL;
+}
+
+void*
+sgen_fragment_allocator_par_range_alloc (SgenFragmentAllocator *allocator, size_t desired_size, size_t minimum_size, size_t *out_alloc_size)
+{
+ SgenFragment *frag, *min_frag;
+ size_t current_minimum;
+
restart:
min_frag = NULL;
+ current_minimum = minimum_size;
#ifdef NALLOC_DEBUG
InterlockedIncrement (&alloc_count);
#endif
return p;
}
- if (minimum_size <= frag_size)
+ if (current_minimum <= frag_size) {
min_frag = frag;
+ current_minimum = frag_size;
+ }
}
/* The second fragment_next read should be ordered in respect to the first code block */
return NULL;
}
-static void
-clear_allocator_fragments (FragmentAllocator *allocator)
+void
+sgen_clear_allocator_fragments (SgenFragmentAllocator *allocator)
{
- Fragment *frag;
+ SgenFragment *frag;
for (frag = unmask (allocator->alloc_head); frag; frag = unmask (frag->next)) {
- DEBUG (4, fprintf (gc_debug_file, "Clear nursery frag %p-%p\n", frag->fragment_next, frag->fragment_end));
+ SGEN_LOG (4, "Clear nursery frag %p-%p", frag->fragment_next, frag->fragment_end);
sgen_clear_range (frag->fragment_next, frag->fragment_end);
#ifdef NALLOC_DEBUG
add_alloc_record (frag->fragment_next, frag->fragment_end - frag->fragment_next, CLEAR_NURSERY_FRAGS);
sgen_clear_nursery_fragments (void)
{
if (sgen_get_nursery_clear_policy () == CLEAR_AT_TLAB_CREATION) {
- clear_allocator_fragments (&nursery_allocator);
+ sgen_clear_allocator_fragments (&mutator_allocator);
+ sgen_minor_collector.clear_fragments ();
}
}
-static void
+/*
+ * Mark a given range of memory as invalid.
+ *
+ * This can be done either by zeroing memory or by placing
+ * a phony byte[] array. This keeps the heap forward walkable.
+ *
+ * This function ignores calls with a zero range, even if
+ * both start and end are NULL.
+ */
+void
sgen_clear_range (char *start, char *end)
{
MonoArray *o;
size_t size = end - start;
+ if ((start && !end) || (start > end))
+ g_error ("Invalid range [%p %p]", start, end);
+
if (size < sizeof (MonoArray)) {
memset (start, 0, size);
return;
void
sgen_nursery_allocator_prepare_for_pinning (void)
{
- clear_allocator_fragments (&nursery_allocator);
+ sgen_clear_allocator_fragments (&mutator_allocator);
+ sgen_minor_collector.clear_fragments ();
}
static mword fragment_total = 0;
* allocation.
*/
static void
-add_nursery_frag (FragmentAllocator *allocator, size_t frag_size, char* frag_start, char* frag_end)
+add_nursery_frag (SgenFragmentAllocator *allocator, size_t frag_size, char* frag_start, char* frag_end)
{
- DEBUG (4, fprintf (gc_debug_file, "Found empty fragment: %p-%p, size: %zd\n", frag_start, frag_end, frag_size));
+ SGEN_LOG (4, "Found empty fragment: %p-%p, size: %zd", frag_start, frag_end, frag_size);
binary_protocol_empty (frag_start, frag_size);
+ MONO_GC_NURSERY_SWEPT ((mword)frag_start, frag_end - frag_start);
/* Not worth dealing with smaller fragments: need to tune */
if (frag_size >= SGEN_MAX_NURSERY_WASTE) {
/* memsetting just the first chunk start is bound to provide better cache locality */
printf ("\tfragment [%p %p] size %zd\n", frag_start, frag_end, frag_size);
*/
#endif
- add_fragment (allocator, frag_start, frag_end);
+ sgen_fragment_allocator_add (allocator, frag_start, frag_end);
fragment_total += frag_size;
} else {
/* Clear unused fragments, pinning depends on this */
}
}
+static void
+fragment_list_reverse (SgenFragmentAllocator *allocator)
+{
+ SgenFragment *prev = NULL, *list = allocator->region_head;
+ while (list) {
+ SgenFragment *next = list->next;
+ list->next = prev;
+ list->next_in_order = prev;
+ prev = list;
+ list = next;
+ }
+
+ allocator->region_head = allocator->alloc_head = prev;
+}
+
mword
-sgen_build_nursery_fragments (GCMemSection *nursery_section, void **start, int num_entries)
+sgen_build_nursery_fragments (GCMemSection *nursery_section, void **start, int num_entries, SgenGrayQueue *unpin_queue)
{
char *frag_start, *frag_end;
size_t frag_size;
- int i;
+ int i = 0;
+ SgenFragment *frags_ranges;
#ifdef NALLOC_DEBUG
reset_alloc_records ();
#endif
-
- release_fragment_list (&nursery_allocator);
+ /*The mutator fragments are done. We no longer need them. */
+ sgen_fragment_allocator_release (&mutator_allocator);
frag_start = sgen_nursery_start;
fragment_total = 0;
+
+ /* The current nursery might give us a fragment list to exclude [start, next[*/
+ frags_ranges = sgen_minor_collector.build_fragments_get_exclude_head ();
+
/* clear scan starts */
memset (nursery_section->scan_starts, 0, nursery_section->num_scan_start * sizeof (gpointer));
- for (i = 0; i < num_entries; ++i) {
- frag_end = start [i];
- /* remove the pin bit from pinned objects */
- SGEN_UNPIN_OBJECT (frag_end);
- sgen_set_nursery_scan_start (frag_end);
+
+ while (i < num_entries || frags_ranges) {
+ char *addr0, *addr1;
+ size_t size;
+ SgenFragment *last_frag = NULL;
+
+ addr0 = addr1 = sgen_nursery_end;
+ if (i < num_entries)
+ addr0 = start [i];
+ if (frags_ranges)
+ addr1 = frags_ranges->fragment_start;
+
+ if (addr0 < addr1) {
+ if (unpin_queue)
+ GRAY_OBJECT_ENQUEUE (unpin_queue, addr0);
+ else
+ SGEN_UNPIN_OBJECT (addr0);
+ sgen_set_nursery_scan_start (addr0);
+ frag_end = addr0;
+ size = SGEN_ALIGN_UP (sgen_safe_object_get_size ((MonoObject*)addr0));
+ ++i;
+ } else {
+ frag_end = addr1;
+ size = frags_ranges->fragment_next - addr1;
+ last_frag = frags_ranges;
+ frags_ranges = frags_ranges->next_in_order;
+ }
+
frag_size = frag_end - frag_start;
- if (frag_size)
- add_nursery_frag (&nursery_allocator, frag_size, frag_start, frag_end);
- frag_size = SGEN_ALIGN_UP (sgen_safe_object_get_size ((MonoObject*)start [i]));
+
+ if (size == 0)
+ continue;
+
+ g_assert (frag_size >= 0);
+ g_assert (size > 0);
+ if (frag_size && size)
+ add_nursery_frag (&mutator_allocator, frag_size, frag_start, frag_end);
+
+ frag_size = size;
#ifdef NALLOC_DEBUG
add_alloc_record (start [i], frag_size, PINNING);
#endif
- frag_start = (char*)start [i] + frag_size;
+ frag_start = frag_end + frag_size;
}
+
nursery_last_pinned_end = frag_start;
frag_end = sgen_nursery_end;
frag_size = frag_end - frag_start;
if (frag_size)
- add_nursery_frag (&nursery_allocator, frag_size, frag_start, frag_end);
- if (!unmask (nursery_allocator.alloc_head)) {
- DEBUG (1, fprintf (gc_debug_file, "Nursery fully pinned (%d)\n", num_entries));
+ add_nursery_frag (&mutator_allocator, frag_size, frag_start, frag_end);
+
+ /* Now it's safe to release the fragments exclude list. */
+ sgen_minor_collector.build_fragments_release_exclude_head ();
+
+ /* First we reorder the fragment list to be in ascending address order. This makes H/W prefetchers happier. */
+ fragment_list_reverse (&mutator_allocator);
+
+ /*The collector might want to do something with the final nursery fragment list.*/
+ sgen_minor_collector.build_fragments_finish (&mutator_allocator);
+
+ if (!unmask (mutator_allocator.alloc_head)) {
+ SGEN_LOG (1, "Nursery fully pinned (%d)", num_entries);
for (i = 0; i < num_entries; ++i) {
- DEBUG (3, fprintf (gc_debug_file, "Bastard pinning obj %p (%s), size: %d\n", start [i], sgen_safe_name (start [i]), sgen_safe_object_get_size (start [i])));
+ SGEN_LOG (3, "Bastard pinning obj %p (%s), size: %d", start [i], sgen_safe_name (start [i]), sgen_safe_object_get_size (start [i]));
}
}
return fragment_total;
char *
sgen_nursery_alloc_get_upper_alloc_bound (void)
{
- char *p = NULL;
- Fragment *frag;
-
- for (frag = unmask (nursery_allocator.alloc_head); frag; frag = unmask (frag->next))
- p = MAX (p, frag->fragment_next);
-
- return MAX (p, nursery_last_pinned_end);
+ /*FIXME we need to calculate the collector upper bound as well, but this must be done in the previous GC. */
+ return sgen_nursery_end;
}
/*** Nursery memory allocation ***/
gboolean
sgen_can_alloc_size (size_t size)
{
- Fragment *frag;
+ SgenFragment *frag;
size = SGEN_ALIGN_UP (size);
- for (frag = unmask (nursery_allocator.alloc_head); frag; frag = unmask (frag->next)) {
+ for (frag = unmask (mutator_allocator.alloc_head); frag; frag = unmask (frag->next)) {
if ((frag->fragment_end - frag->fragment_next) >= size)
return TRUE;
}
void*
sgen_nursery_alloc (size_t size)
{
- DEBUG (4, fprintf (gc_debug_file, "Searching nursery for size: %zd\n", size));
+ SGEN_LOG (4, "Searching nursery for size: %zd", size);
size = SGEN_ALIGN_UP (size);
HEAVY_STAT (InterlockedIncrement (&stat_nursery_alloc_requests));
- return par_alloc (&nursery_allocator, size);
+ return sgen_fragment_allocator_par_alloc (&mutator_allocator, size);
}
void*
-sgen_nursery_alloc_range (size_t desired_size, size_t minimum_size, int *out_alloc_size)
+sgen_nursery_alloc_range (size_t desired_size, size_t minimum_size, size_t *out_alloc_size)
{
- DEBUG (4, fprintf (gc_debug_file, "Searching for byte range desired size: %zd minimum size %zd\n", desired_size, minimum_size));
+ SGEN_LOG (4, "Searching for byte range desired size: %zd minimum size %zd", desired_size, minimum_size);
HEAVY_STAT (InterlockedIncrement (&stat_nursery_alloc_range_requests));
- return par_range_alloc (&nursery_allocator, desired_size, minimum_size, out_alloc_size);
+ return sgen_fragment_allocator_par_range_alloc (&mutator_allocator, desired_size, minimum_size, out_alloc_size);
}
/*** Initialization ***/
void
sgen_init_nursery_allocator (void)
{
- sgen_register_fixed_internal_mem_type (INTERNAL_MEM_FRAGMENT, sizeof (Fragment));
+ sgen_register_fixed_internal_mem_type (INTERNAL_MEM_FRAGMENT, sizeof (SgenFragment));
#ifdef NALLOC_DEBUG
- alloc_records = sgen_alloc_os_memory (sizeof (AllocRecord) * ALLOC_RECORD_COUNT, TRUE);
+ alloc_records = sgen_alloc_os_memory (sizeof (AllocRecord) * ALLOC_RECORD_COUNT, SGEN_ALLOC_INTERNAL | SGEN_ALLOC_ACTIVATE, "debugging memory");
#endif
}
+void
+sgen_nursery_alloc_prepare_for_minor (void)
+{
+ sgen_minor_collector.prepare_to_space (sgen_space_bitmap, sgen_space_bitmap_size);
+}
+
+void
+sgen_nursery_alloc_prepare_for_major (void)
+{
+ sgen_minor_collector.prepare_to_space (sgen_space_bitmap, sgen_space_bitmap_size);
+}
+
void
sgen_nursery_allocator_set_nursery_bounds (char *start, char *end)
{
- /* Setup the single first large fragment */
- add_fragment (&nursery_allocator, start, end);
sgen_nursery_start = start;
sgen_nursery_end = end;
+
+ sgen_space_bitmap_size = (end - start) / (SGEN_TO_SPACE_GRANULE_IN_BYTES * 8);
+ sgen_space_bitmap = g_malloc0 (sgen_space_bitmap_size);
+
+ /* Setup the single first large fragment */
+ sgen_minor_collector.init_nursery (&mutator_allocator, start, end);
}
#endif
projects / mono.git / blobdiff