2 * sgen-marksweep.c: Simple generational GC.
5 * Mark Probst <mark.probst@gmail.com>
7 * Copyright 2009-2010 Novell, Inc.
9 * Permission is hereby granted, free of charge, to any person obtaining
10 * a copy of this software and associated documentation files (the
11 * "Software"), to deal in the Software without restriction, including
12 * without limitation the rights to use, copy, modify, merge, publish,
13 * distribute, sublicense, and/or sell copies of the Software, and to
14 * permit persons to whom the Software is furnished to do so, subject to
15 * the following conditions:
17 * The above copyright notice and this permission notice shall be
18 * included in all copies or substantial portions of the Software.
20 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
21 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
22 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
23 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
24 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
25 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
26 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
36 #include "utils/mono-counters.h"
37 #include "utils/mono-semaphore.h"
38 #include "utils/mono-time.h"
39 #include "metadata/object-internals.h"
40 #include "metadata/profiler-private.h"
42 #include "metadata/sgen-gc.h"
43 #include "metadata/sgen-protocol.h"
44 #include "metadata/sgen-cardtable.h"
45 #include "metadata/gc-internal.h"
47 #define MS_BLOCK_SIZE (16*1024)
48 #define MS_BLOCK_SIZE_SHIFT 14
49 #define MAJOR_SECTION_SIZE MS_BLOCK_SIZE
50 #define CARDS_PER_BLOCK (MS_BLOCK_SIZE / CARD_SIZE_IN_BYTES)
53 #define MS_DEFAULT_HEAP_NUM_BLOCKS (32 * 1024) /* 512 MB */
57 * Don't allocate single blocks, but alloc a contingent of this many
58 * blocks in one swoop.
60 #define MS_BLOCK_ALLOC_NUM 32
63 * Number of bytes before the first object in a block. At the start
64 * of a block is the MSBlockHeader, then opional padding, then come
65 * the objects, so this must be >= sizeof (MSBlockHeader).
68 #define MS_BLOCK_SKIP 0
70 #define MS_BLOCK_SKIP 16
73 #define MS_BLOCK_FREE (MS_BLOCK_SIZE - MS_BLOCK_SKIP)
75 #define MS_NUM_MARK_WORDS ((MS_BLOCK_SIZE / SGEN_ALLOC_ALIGN + sizeof (mword) * 8 - 1) / (sizeof (mword) * 8))
77 #if SGEN_MAX_SMALL_OBJ_SIZE > MS_BLOCK_FREE / 2
78 #error MAX_SMALL_OBJ_SIZE must be at most MS_BLOCK_FREE / 2
81 typedef struct _MSBlockInfo MSBlockInfo;
85 int pin_queue_num_entries;
86 unsigned int pinned : 1;
87 unsigned int has_references : 1;
88 unsigned int has_pinned : 1; /* means cannot evacuate */
89 unsigned int is_to_space : 1;
91 unsigned int used : 1;
92 unsigned int zeroed : 1;
97 MSBlockInfo *next_free;
98 void **pin_queue_start;
99 mword mark_words [MS_NUM_MARK_WORDS];
103 static int ms_heap_num_blocks = MS_DEFAULT_HEAP_NUM_BLOCKS;
105 static char *ms_heap_start;
106 static char *ms_heap_end;
108 #define MS_PTR_IN_SMALL_MAJOR_HEAP(p) ((char*)(p) >= ms_heap_start && (char*)(p) < ms_heap_end)
110 /* array of all all block infos in the system */
111 static MSBlockInfo *block_infos;
114 #define MS_BLOCK_OBJ(b,i) ((b)->block + MS_BLOCK_SKIP + (b)->obj_size * (i))
115 #define MS_BLOCK_DATA_FOR_OBJ(o) ((char*)((mword)(o) & ~(mword)(MS_BLOCK_SIZE - 1)))
118 #define MS_BLOCK_FOR_OBJ(o) (&block_infos [(mword)((char*)(o) - ms_heap_start) >> MS_BLOCK_SIZE_SHIFT])
124 #define MS_BLOCK_FOR_OBJ(o) (((MSBlockHeader*)MS_BLOCK_DATA_FOR_OBJ ((o)))->info)
127 #define MS_BLOCK_OBJ_INDEX(o,b) (((char*)(o) - ((b)->block + MS_BLOCK_SKIP)) / (b)->obj_size)
129 #define MS_CALC_MARK_BIT(w,b,o) do { \
130 int i = ((char*)(o) - MS_BLOCK_DATA_FOR_OBJ ((o))) >> SGEN_ALLOC_ALIGN_BITS; \
131 if (sizeof (mword) == 4) { \
140 #define MS_MARK_BIT(bl,w,b) ((bl)->mark_words [(w)] & (1L << (b)))
141 #define MS_SET_MARK_BIT(bl,w,b) ((bl)->mark_words [(w)] |= (1L << (b)))
142 #define MS_PAR_SET_MARK_BIT(was_marked,bl,w,b) do { \
143 mword __old = (bl)->mark_words [(w)]; \
144 mword __bitmask = 1L << (b); \
145 if (__old & __bitmask) { \
149 if (SGEN_CAS_PTR ((gpointer*)&(bl)->mark_words [(w)], \
150 (gpointer)(__old | __bitmask), \
151 (gpointer)__old) == \
153 was_marked = FALSE; \
158 #define MS_OBJ_ALLOCED(o,b) (*(void**)(o) && (*(char**)(o) < (b)->block || *(char**)(o) >= (b)->block + MS_BLOCK_SIZE))
160 #define MS_BLOCK_OBJ_SIZE_FACTOR (sqrt (2.0))
163 * This way we can lookup block object size indexes for sizes up to
164 * 256 bytes with a single load.
166 #define MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES 32
168 static int *block_obj_sizes;
169 static int num_block_obj_sizes;
170 static int fast_block_obj_size_indexes [MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES];
172 #define MS_BLOCK_FLAG_PINNED 1
173 #define MS_BLOCK_FLAG_REFS 2
175 #define MS_BLOCK_TYPE_MAX 4
177 #ifdef SGEN_PARALLEL_MARK
178 static LOCK_DECLARE (ms_block_list_mutex);
179 #define LOCK_MS_BLOCK_LIST mono_mutex_lock (&ms_block_list_mutex)
180 #define UNLOCK_MS_BLOCK_LIST mono_mutex_unlock (&ms_block_list_mutex)
183 static gboolean *evacuate_block_obj_sizes;
184 static float evacuation_threshold = 0.666;
186 static gboolean concurrent_sweep = FALSE;
187 static gboolean have_swept;
189 /* all allocated blocks in the system */
190 static MSBlockInfo *all_blocks;
193 /* non-allocated block free-list */
194 static MSBlockInfo *empty_blocks = NULL;
196 /* non-allocated block free-list */
197 static void *empty_blocks = NULL;
198 static int num_empty_blocks = 0;
201 #define FOREACH_BLOCK(bl) for ((bl) = all_blocks; (bl); (bl) = (bl)->next) {
202 #define END_FOREACH_BLOCK }
204 static int num_major_sections = 0;
205 /* one free block list for each block object size */
206 static MSBlockInfo **free_block_lists [MS_BLOCK_TYPE_MAX];
208 #ifdef SGEN_PARALLEL_MARK
209 #ifdef HAVE_KW_THREAD
210 static __thread MSBlockInfo ***workers_free_block_lists;
212 static MonoNativeTlsKey workers_free_block_lists_key;
216 static long long stat_major_blocks_alloced = 0;
217 static long long stat_major_blocks_freed = 0;
218 static long long stat_major_objects_evacuated = 0;
219 static long long stat_time_wait_for_sweep = 0;
220 #ifdef SGEN_PARALLEL_MARK
221 static long long stat_slots_allocated_in_vain = 0;
224 static gboolean ms_sweep_in_progress = FALSE;
225 static MonoNativeThreadId ms_sweep_thread;
226 static MonoSemType ms_sweep_cmd_semaphore;
227 static MonoSemType ms_sweep_done_semaphore;
230 ms_signal_sweep_command (void)
232 if (!concurrent_sweep)
235 g_assert (!ms_sweep_in_progress);
236 ms_sweep_in_progress = TRUE;
237 MONO_SEM_POST (&ms_sweep_cmd_semaphore);
241 ms_signal_sweep_done (void)
243 if (!concurrent_sweep)
246 MONO_SEM_POST (&ms_sweep_done_semaphore);
250 ms_wait_for_sweep_done (void)
252 SGEN_TV_DECLARE (atv);
253 SGEN_TV_DECLARE (btv);
256 if (!concurrent_sweep)
259 if (!ms_sweep_in_progress)
262 SGEN_TV_GETTIME (atv);
263 while ((result = MONO_SEM_WAIT (&ms_sweep_done_semaphore)) != 0) {
265 g_error ("MONO_SEM_WAIT");
267 SGEN_TV_GETTIME (btv);
268 stat_time_wait_for_sweep += SGEN_TV_ELAPSED (atv, btv);
270 g_assert (ms_sweep_in_progress);
271 ms_sweep_in_progress = FALSE;
275 ms_find_block_obj_size_index (int size)
278 DEBUG (9, g_assert (size <= SGEN_MAX_SMALL_OBJ_SIZE));
279 for (i = 0; i < num_block_obj_sizes; ++i)
280 if (block_obj_sizes [i] >= size)
282 g_assert_not_reached ();
285 #define FREE_BLOCKS_FROM(lists,p,r) (lists [((p) ? MS_BLOCK_FLAG_PINNED : 0) | ((r) ? MS_BLOCK_FLAG_REFS : 0)])
286 #define FREE_BLOCKS(p,r) (FREE_BLOCKS_FROM (free_block_lists, (p), (r)))
287 #ifdef SGEN_PARALLEL_MARK
288 #ifdef HAVE_KW_THREAD
289 #define FREE_BLOCKS_LOCAL(p,r) (FREE_BLOCKS_FROM (workers_free_block_lists, (p), (r)))
291 #define FREE_BLOCKS_LOCAL(p,r) (FREE_BLOCKS_FROM (((MSBlockInfo***)(mono_native_tls_get_value (workers_free_block_lists_key))), (p), (r)))
294 //#define FREE_BLOCKS_LOCAL(p,r) (FREE_BLOCKS_FROM (free_block_lists, (p), (r)))
297 #define MS_BLOCK_OBJ_SIZE_INDEX(s) \
298 (((s)+7)>>3 < MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES ? \
299 fast_block_obj_size_indexes [((s)+7)>>3] : \
300 ms_find_block_obj_size_index ((s)))
304 major_alloc_heap (mword nursery_size, mword nursery_align, int the_nursery_bits)
307 mword major_heap_size = ms_heap_num_blocks * MS_BLOCK_SIZE;
308 mword alloc_size = nursery_size + major_heap_size;
311 g_assert (ms_heap_num_blocks > 0);
312 g_assert (nursery_size % MS_BLOCK_SIZE == 0);
314 g_assert (nursery_align % MS_BLOCK_SIZE == 0);
316 nursery_start = mono_sgen_alloc_os_memory_aligned (alloc_size, nursery_align ? nursery_align : MS_BLOCK_SIZE, TRUE);
317 ms_heap_start = nursery_start + nursery_size;
318 ms_heap_end = ms_heap_start + major_heap_size;
320 block_infos = mono_sgen_alloc_internal_dynamic (sizeof (MSBlockInfo) * ms_heap_num_blocks, INTERNAL_MEM_MS_BLOCK_INFO);
322 for (i = 0; i < ms_heap_num_blocks; ++i) {
323 block_infos [i].block = ms_heap_start + i * MS_BLOCK_SIZE;
324 if (i < ms_heap_num_blocks - 1)
325 block_infos [i].next_free = &block_infos [i + 1];
327 block_infos [i].next_free = NULL;
328 block_infos [i].zeroed = TRUE;
331 empty_blocks = &block_infos [0];
333 return nursery_start;
337 major_alloc_heap (mword nursery_size, mword nursery_align, int the_nursery_bits)
341 start = mono_sgen_alloc_os_memory_aligned (nursery_size, nursery_align, TRUE);
343 start = mono_sgen_alloc_os_memory (nursery_size, TRUE);
350 update_heap_boundaries_for_block (MSBlockInfo *block)
352 mono_sgen_update_heap_boundaries ((mword)block->block, (mword)block->block + MS_BLOCK_SIZE);
357 ms_get_empty_block (void)
361 g_assert (empty_blocks);
364 block = empty_blocks;
365 } while (SGEN_CAS_PTR ((gpointer*)&empty_blocks, block->next_free, block) != block);
370 memset (block->block, 0, MS_BLOCK_SIZE);
376 ms_free_block (MSBlockInfo *block)
378 block->next_free = empty_blocks;
379 empty_blocks = block;
381 block->zeroed = FALSE;
382 mono_sgen_release_space (MS_BLOCK_SIZE, SPACE_MAJOR);
386 ms_get_empty_block (void)
390 void *block, *empty, *next;
394 p = mono_sgen_alloc_os_memory_aligned (MS_BLOCK_SIZE * MS_BLOCK_ALLOC_NUM, MS_BLOCK_SIZE, TRUE);
396 for (i = 0; i < MS_BLOCK_ALLOC_NUM; ++i) {
399 * We do the free list update one after the
400 * other so that other threads can use the new
401 * blocks as quickly as possible.
404 empty = empty_blocks;
405 *(void**)block = empty;
406 } while (SGEN_CAS_PTR ((gpointer*)&empty_blocks, block, empty) != empty);
410 SGEN_ATOMIC_ADD (num_empty_blocks, MS_BLOCK_ALLOC_NUM);
412 stat_major_blocks_alloced += MS_BLOCK_ALLOC_NUM;
416 empty = empty_blocks;
420 next = *(void**)block;
421 } while (SGEN_CAS_PTR (&empty_blocks, next, empty) != empty);
423 SGEN_ATOMIC_ADD (num_empty_blocks, -1);
425 *(void**)block = NULL;
427 g_assert (!((mword)block & (MS_BLOCK_SIZE - 1)));
433 ms_free_block (void *block)
437 mono_sgen_release_space (MS_BLOCK_SIZE, SPACE_MAJOR);
438 memset (block, 0, MS_BLOCK_SIZE);
441 empty = empty_blocks;
442 *(void**)block = empty;
443 } while (SGEN_CAS_PTR (&empty_blocks, block, empty) != empty);
445 SGEN_ATOMIC_ADD (num_empty_blocks, 1);
449 //#define MARKSWEEP_CONSISTENCY_CHECK
451 #ifdef MARKSWEEP_CONSISTENCY_CHECK
453 check_block_free_list (MSBlockInfo *block, int size, gboolean pinned)
457 for (; block; block = block->next_free) {
458 g_assert (block->obj_size == size);
459 g_assert ((pinned && block->pinned) || (!pinned && !block->pinned));
461 /* blocks in the free lists must have at least
463 g_assert (block->free_list);
466 /* the block must not be in the empty_blocks list */
467 for (b = empty_blocks; b; b = b->next_free)
468 g_assert (b != block);
470 /* the block must be in the all_blocks list */
471 for (b = all_blocks; b; b = b->next) {
475 g_assert (b == block);
480 check_empty_blocks (void)
485 for (p = empty_blocks; p; p = *(void**)p)
487 g_assert (i == num_empty_blocks);
492 consistency_check (void)
497 /* check all blocks */
498 FOREACH_BLOCK (block) {
499 int count = MS_BLOCK_FREE / block->obj_size;
504 /* check block header */
505 g_assert (((MSBlockHeader*)block->block)->info == block);
508 /* count number of free slots */
509 for (i = 0; i < count; ++i) {
510 void **obj = (void**) MS_BLOCK_OBJ (block, i);
511 if (!MS_OBJ_ALLOCED (obj, block))
515 /* check free list */
516 for (free = block->free_list; free; free = (void**)*free) {
517 g_assert (MS_BLOCK_FOR_OBJ (free) == block);
520 g_assert (num_free == 0);
522 /* check all mark words are zero */
523 for (i = 0; i < MS_NUM_MARK_WORDS; ++i)
524 g_assert (block->mark_words [i] == 0);
527 /* check free blocks */
528 for (i = 0; i < num_block_obj_sizes; ++i) {
530 for (j = 0; j < MS_BLOCK_TYPE_MAX; ++j)
531 check_block_free_list (free_block_lists [j][i], block_obj_sizes [i], j & MS_BLOCK_FLAG_PINNED);
534 check_empty_blocks ();
539 ms_alloc_block (int size_index, gboolean pinned, gboolean has_references)
541 int size = block_obj_sizes [size_index];
542 int count = MS_BLOCK_FREE / size;
544 #ifdef SGEN_PARALLEL_MARK
548 MSBlockHeader *header;
550 MSBlockInfo **free_blocks = FREE_BLOCKS (pinned, has_references);
554 if (!mono_sgen_try_alloc_space (MS_BLOCK_SIZE, SPACE_MAJOR))
558 info = ms_get_empty_block ();
560 info = mono_sgen_alloc_internal (INTERNAL_MEM_MS_BLOCK_INFO);
563 DEBUG (9, g_assert (count >= 2));
565 info->obj_size = size;
566 info->obj_size_index = size_index;
567 info->pinned = pinned;
568 info->has_references = has_references;
569 info->has_pinned = pinned;
570 info->is_to_space = (mono_sgen_get_current_collection_generation () == GENERATION_OLD);
572 info->block = ms_get_empty_block ();
574 header = (MSBlockHeader*) info->block;
578 update_heap_boundaries_for_block (info);
580 /* build free list */
581 obj_start = info->block + MS_BLOCK_SKIP;
582 info->free_list = (void**)obj_start;
583 /* we're skipping the last one - it must be nulled */
584 for (i = 0; i < count - 1; ++i) {
585 char *next_obj_start = obj_start + size;
586 *(void**)obj_start = next_obj_start;
587 obj_start = next_obj_start;
590 *(void**)obj_start = NULL;
592 #ifdef SGEN_PARALLEL_MARK
594 next = info->next_free = free_blocks [size_index];
595 } while (SGEN_CAS_PTR ((void**)&free_blocks [size_index], info, next) != next);
598 next = info->next = all_blocks;
599 } while (SGEN_CAS_PTR ((void**)&all_blocks, info, next) != next);
601 info->next_free = free_blocks [size_index];
602 free_blocks [size_index] = info;
604 info->next = all_blocks;
608 ++num_major_sections;
613 obj_is_from_pinned_alloc (char *ptr)
617 FOREACH_BLOCK (block) {
618 if (ptr >= block->block && ptr <= block->block + MS_BLOCK_SIZE)
619 return block->pinned;
625 unlink_slot_from_free_list_uncontested (MSBlockInfo **free_blocks, int size_index)
630 block = free_blocks [size_index];
631 DEBUG (9, g_assert (block));
633 obj = block->free_list;
634 DEBUG (9, g_assert (obj));
636 block->free_list = *(void**)obj;
637 if (!block->free_list) {
638 free_blocks [size_index] = block->next_free;
639 block->next_free = NULL;
645 #ifdef SGEN_PARALLEL_MARK
647 try_remove_block_from_free_list (MSBlockInfo *block, MSBlockInfo **free_blocks, int size_index)
650 * No more free slots in the block, so try to free the block.
651 * Don't try again if we don't succeed - another thread will
652 * already have done it.
654 MSBlockInfo *next_block = block->next_free;
655 if (SGEN_CAS_PTR ((void**)&free_blocks [size_index], next_block, block) == block) {
657 void *old = SGEN_CAS_PTR ((void**)&block->next_free, NULL, next_block);
658 g_assert (old == next_block);
660 block->next_free = NULL;
667 alloc_obj_par (int size, gboolean pinned, gboolean has_references)
669 int size_index = MS_BLOCK_OBJ_SIZE_INDEX (size);
670 MSBlockInfo **free_blocks_local = FREE_BLOCKS_LOCAL (pinned, has_references);
674 DEBUG (9, g_assert (!ms_sweep_in_progress));
675 DEBUG (9, g_assert (current_collection_generation == GENERATION_OLD));
677 if (free_blocks_local [size_index]) {
679 obj = unlink_slot_from_free_list_uncontested (free_blocks_local, size_index);
681 MSBlockInfo **free_blocks = FREE_BLOCKS (pinned, has_references);
684 block = free_blocks [size_index];
686 if (!try_remove_block_from_free_list (block, free_blocks, size_index))
689 g_assert (block->next_free == NULL);
690 g_assert (block->free_list);
691 block->next_free = free_blocks_local [size_index];
692 free_blocks_local [size_index] = block;
699 success = ms_alloc_block (size_index, pinned, has_references);
700 UNLOCK_MS_BLOCK_LIST;
702 if (G_UNLIKELY (!success))
710 * FIXME: This should not be necessary because it'll be
711 * overwritten by the vtable immediately.
719 major_par_alloc_object (int size, gboolean has_references)
721 return alloc_obj_par (size, FALSE, has_references);
726 alloc_obj (int size, gboolean pinned, gboolean has_references)
728 int size_index = MS_BLOCK_OBJ_SIZE_INDEX (size);
729 MSBlockInfo **free_blocks = FREE_BLOCKS (pinned, has_references);
732 #ifdef SGEN_PARALLEL_MARK
733 DEBUG (9, g_assert (current_collection_generation != GENERATION_OLD));
736 DEBUG (9, g_assert (!ms_sweep_in_progress));
738 if (!free_blocks [size_index]) {
739 if (G_UNLIKELY (!ms_alloc_block (size_index, pinned, has_references)))
743 obj = unlink_slot_from_free_list_uncontested (free_blocks, size_index);
746 * FIXME: This should not be necessary because it'll be
747 * overwritten by the vtable immediately.
755 major_alloc_object (int size, gboolean has_references)
757 return alloc_obj (size, FALSE, has_references);
761 * We're not freeing the block if it's empty. We leave that work for
762 * the next major collection.
764 * This is just called from the domain clearing code, which runs in a
765 * single thread and has the GC lock, so we don't need an extra lock.
768 free_object (char *obj, size_t size, gboolean pinned)
770 MSBlockInfo *block = MS_BLOCK_FOR_OBJ (obj);
772 DEBUG (9, g_assert ((pinned && block->pinned) || (!pinned && !block->pinned)));
773 DEBUG (9, g_assert (MS_OBJ_ALLOCED (obj, block)));
774 MS_CALC_MARK_BIT (word, bit, obj);
775 DEBUG (9, g_assert (!MS_MARK_BIT (block, word, bit)));
776 if (!block->free_list) {
777 MSBlockInfo **free_blocks = FREE_BLOCKS (pinned, block->has_references);
778 int size_index = MS_BLOCK_OBJ_SIZE_INDEX (size);
779 DEBUG (9, g_assert (!block->next_free));
780 block->next_free = free_blocks [size_index];
781 free_blocks [size_index] = block;
783 memset (obj, 0, size);
784 *(void**)obj = block->free_list;
785 block->free_list = (void**)obj;
789 major_free_non_pinned_object (char *obj, size_t size)
791 free_object (obj, size, FALSE);
794 /* size is a multiple of SGEN_ALLOC_ALIGN */
796 major_alloc_small_pinned_obj (size_t size, gboolean has_references)
800 ms_wait_for_sweep_done ();
802 res = alloc_obj (size, TRUE, has_references);
803 /*If we failed to alloc memory, we better try releasing memory
804 *as pinned alloc is requested by the runtime.
807 sgen_collect_major_no_lock ("pinned alloc failure");
808 res = alloc_obj (size, TRUE, has_references);
814 free_pinned_object (char *obj, size_t size)
816 free_object (obj, size, TRUE);
820 * size is already rounded up and we hold the GC lock.
823 major_alloc_degraded (MonoVTable *vtable, size_t size)
826 int old_num_sections;
828 ms_wait_for_sweep_done ();
830 old_num_sections = num_major_sections;
832 obj = alloc_obj (size, FALSE, SGEN_VTABLE_HAS_REFERENCES (vtable));
833 if (G_LIKELY (obj)) {
834 *(MonoVTable**)obj = vtable;
835 HEAVY_STAT (++stat_objects_alloced_degraded);
836 HEAVY_STAT (stat_bytes_alloced_degraded += size);
837 g_assert (num_major_sections >= old_num_sections);
838 mono_sgen_register_major_sections_alloced (num_major_sections - old_num_sections);
843 #define MAJOR_OBJ_IS_IN_TO_SPACE(obj) FALSE
846 * obj is some object. If it's not in the major heap (i.e. if it's in
847 * the nursery or LOS), return FALSE. Otherwise return whether it's
848 * been marked or copied.
851 major_is_object_live (char *obj)
859 if (mono_sgen_ptr_in_nursery (obj))
864 if (!MS_PTR_IN_SMALL_MAJOR_HEAP (obj))
867 objsize = SGEN_ALIGN_UP (mono_sgen_safe_object_get_size ((MonoObject*)obj));
870 if (objsize > SGEN_MAX_SMALL_OBJ_SIZE)
874 /* now we know it's in a major block */
875 block = MS_BLOCK_FOR_OBJ (obj);
876 DEBUG (9, g_assert (!block->pinned));
877 MS_CALC_MARK_BIT (word, bit, obj);
878 return MS_MARK_BIT (block, word, bit) ? TRUE : FALSE;
882 major_ptr_is_in_non_pinned_space (char *ptr)
886 FOREACH_BLOCK (block) {
887 if (ptr >= block->block && ptr <= block->block + MS_BLOCK_SIZE)
888 return !block->pinned;
894 major_iterate_objects (gboolean non_pinned, gboolean pinned, IterateObjectCallbackFunc callback, void *data)
898 ms_wait_for_sweep_done ();
900 FOREACH_BLOCK (block) {
901 int count = MS_BLOCK_FREE / block->obj_size;
904 if (block->pinned && !pinned)
906 if (!block->pinned && !non_pinned)
909 for (i = 0; i < count; ++i) {
910 void **obj = (void**) MS_BLOCK_OBJ (block, i);
911 if (MS_OBJ_ALLOCED (obj, block))
912 callback ((char*)obj, block->obj_size, data);
918 major_check_scan_starts (void)
923 major_dump_heap (FILE *heap_dump_file)
926 int *slots_available = alloca (sizeof (int) * num_block_obj_sizes);
927 int *slots_used = alloca (sizeof (int) * num_block_obj_sizes);
930 for (i = 0; i < num_block_obj_sizes; ++i)
931 slots_available [i] = slots_used [i] = 0;
933 FOREACH_BLOCK (block) {
934 int index = ms_find_block_obj_size_index (block->obj_size);
935 int count = MS_BLOCK_FREE / block->obj_size;
937 slots_available [index] += count;
938 for (i = 0; i < count; ++i) {
939 if (MS_OBJ_ALLOCED (MS_BLOCK_OBJ (block, i), block))
940 ++slots_used [index];
944 fprintf (heap_dump_file, "<occupancies>\n");
945 for (i = 0; i < num_block_obj_sizes; ++i) {
946 fprintf (heap_dump_file, "<occupancy size=\"%d\" available=\"%d\" used=\"%d\" />\n",
947 block_obj_sizes [i], slots_available [i], slots_used [i]);
949 fprintf (heap_dump_file, "</occupancies>\n");
951 FOREACH_BLOCK (block) {
952 int count = MS_BLOCK_FREE / block->obj_size;
956 fprintf (heap_dump_file, "<section type=\"%s\" size=\"%zu\">\n", "old", (size_t)MS_BLOCK_FREE);
958 for (i = 0; i <= count; ++i) {
959 if ((i < count) && MS_OBJ_ALLOCED (MS_BLOCK_OBJ (block, i), block)) {
964 mono_sgen_dump_occupied (MS_BLOCK_OBJ (block, start), MS_BLOCK_OBJ (block, i), block->block);
970 fprintf (heap_dump_file, "</section>\n");
974 #define LOAD_VTABLE SGEN_LOAD_VTABLE
976 #define MS_MARK_OBJECT_AND_ENQUEUE_CHECKED(obj,block,queue) do { \
978 MS_CALC_MARK_BIT (__word, __bit, (obj)); \
979 if (!MS_MARK_BIT ((block), __word, __bit) && MS_OBJ_ALLOCED ((obj), (block))) { \
980 MS_SET_MARK_BIT ((block), __word, __bit); \
981 if ((block)->has_references) \
982 GRAY_OBJECT_ENQUEUE ((queue), (obj)); \
983 binary_protocol_mark ((obj), (gpointer)LOAD_VTABLE ((obj)), mono_sgen_safe_object_get_size ((MonoObject*)(obj))); \
986 #define MS_MARK_OBJECT_AND_ENQUEUE(obj,block,queue) do { \
988 MS_CALC_MARK_BIT (__word, __bit, (obj)); \
989 DEBUG (9, g_assert (MS_OBJ_ALLOCED ((obj), (block)))); \
990 if (!MS_MARK_BIT ((block), __word, __bit)) { \
991 MS_SET_MARK_BIT ((block), __word, __bit); \
992 if ((block)->has_references) \
993 GRAY_OBJECT_ENQUEUE ((queue), (obj)); \
994 binary_protocol_mark ((obj), (gpointer)LOAD_VTABLE ((obj)), mono_sgen_safe_object_get_size ((MonoObject*)(obj))); \
997 #define MS_PAR_MARK_OBJECT_AND_ENQUEUE(obj,block,queue) do { \
999 gboolean __was_marked; \
1000 DEBUG (9, g_assert (MS_OBJ_ALLOCED ((obj), (block)))); \
1001 MS_CALC_MARK_BIT (__word, __bit, (obj)); \
1002 MS_PAR_SET_MARK_BIT (__was_marked, (block), __word, __bit); \
1003 if (!__was_marked) { \
1004 if ((block)->has_references) \
1005 GRAY_OBJECT_ENQUEUE ((queue), (obj)); \
1006 binary_protocol_mark ((obj), (gpointer)LOAD_VTABLE ((obj)), mono_sgen_safe_object_get_size ((MonoObject*)(obj))); \
1011 pin_major_object (void *obj, SgenGrayQueue *queue)
1013 MSBlockInfo *block = MS_BLOCK_FOR_OBJ (obj);
1014 block->has_pinned = TRUE;
1015 MS_MARK_OBJECT_AND_ENQUEUE (obj, block, queue);
1018 #ifdef SGEN_PARALLEL_MARK
1020 pin_or_update_par (void **ptr, void *obj, MonoVTable *vt, SgenGrayQueue *queue)
1024 gboolean major_pinned = FALSE;
1026 if (mono_sgen_ptr_in_nursery (obj)) {
1027 if (SGEN_CAS_PTR (obj, (void*)((mword)vt | SGEN_PINNED_BIT), vt) == vt) {
1028 mono_sgen_pin_object (obj, queue);
1032 pin_major_object (obj, queue);
1033 major_pinned = TRUE;
1036 vtable_word = *(mword*)obj;
1037 /*someone else forwarded it, update the pointer and bail out*/
1038 if (vtable_word & SGEN_FORWARDED_BIT) {
1039 *ptr = (void*)(vtable_word & ~SGEN_VTABLE_BITS_MASK);
1043 /*someone pinned it, nothing to do.*/
1044 if (vtable_word & SGEN_PINNED_BIT || major_pinned)
1050 #include "sgen-major-copy-object.h"
1052 #ifdef SGEN_PARALLEL_MARK
1054 major_copy_or_mark_object (void **ptr, SgenGrayQueue *queue)
1061 HEAVY_STAT (++stat_copy_object_called_major);
1063 DEBUG (9, g_assert (obj));
1064 DEBUG (9, g_assert (current_collection_generation == GENERATION_OLD));
1066 if (mono_sgen_ptr_in_nursery (obj)) {
1068 gboolean has_references;
1070 mword vtable_word = *(mword*)obj;
1071 vt = (MonoVTable*)(vtable_word & ~SGEN_VTABLE_BITS_MASK);
1073 if (vtable_word & SGEN_FORWARDED_BIT) {
1078 if (vtable_word & SGEN_PINNED_BIT)
1081 HEAVY_STAT (++stat_objects_copied_major);
1084 objsize = SGEN_ALIGN_UP (mono_sgen_par_object_get_size (vt, (MonoObject*)obj));
1085 has_references = SGEN_VTABLE_HAS_REFERENCES (vt);
1087 destination = alloc_obj_par (objsize, FALSE, has_references);
1088 if (G_UNLIKELY (!destination)) {
1089 if (!mono_sgen_ptr_in_nursery (obj)) {
1091 block = MS_BLOCK_FOR_OBJ (obj);
1092 size_index = block->obj_size_index;
1093 evacuate_block_obj_sizes [size_index] = FALSE;
1096 pin_or_update_par (ptr, obj, vt, queue);
1097 mono_sgen_set_pinned_from_failed_allocation (objsize);
1102 * We do this before the CAS because we want to make
1103 * sure that if another thread sees the destination
1104 * pointer the VTable is already in place. Not doing
1105 * this can crash binary protocols.
1107 *(MonoVTable**)destination = vt;
1109 if (SGEN_CAS_PTR (obj, (void*)((mword)destination | SGEN_FORWARDED_BIT), vt) == vt) {
1110 gboolean was_marked;
1112 par_copy_object_no_checks (destination, vt, obj, objsize, has_references ? queue : NULL);
1117 * FIXME: If we make major_alloc_object() give
1118 * us the block info, too, we won't have to
1121 block = MS_BLOCK_FOR_OBJ (obj);
1122 MS_CALC_MARK_BIT (word, bit, obj);
1123 DEBUG (9, g_assert (!MS_MARK_BIT (block, word, bit)));
1124 MS_PAR_SET_MARK_BIT (was_marked, block, word, bit);
1127 * FIXME: We have allocated destination, but
1128 * we cannot use it. Give it back to the
1131 *(void**)destination = NULL;
1133 vtable_word = *(mword*)obj;
1134 g_assert (vtable_word & SGEN_FORWARDED_BIT);
1136 obj = (void*)(vtable_word & ~SGEN_VTABLE_BITS_MASK);
1140 ++stat_slots_allocated_in_vain;
1144 if (MS_PTR_IN_SMALL_MAJOR_HEAP (obj))
1146 mword vtable_word = *(mword*)obj;
1147 vt = (MonoVTable*)(vtable_word & ~SGEN_VTABLE_BITS_MASK);
1149 /* see comment in the non-parallel version below */
1150 if (vtable_word & SGEN_FORWARDED_BIT) {
1154 objsize = SGEN_ALIGN_UP (mono_sgen_par_object_get_size (vt, (MonoObject*)obj));
1156 if (objsize <= SGEN_MAX_SMALL_OBJ_SIZE)
1161 block = MS_BLOCK_FOR_OBJ (obj);
1162 size_index = block->obj_size_index;
1164 if (!block->has_pinned && evacuate_block_obj_sizes [size_index]) {
1165 if (block->is_to_space)
1170 mword vtable_word = *(mword*)obj;
1171 vt = (MonoVTable*)(vtable_word & ~SGEN_VTABLE_BITS_MASK);
1173 if (vtable_word & SGEN_FORWARDED_BIT) {
1180 HEAVY_STAT (++stat_major_objects_evacuated);
1181 goto do_copy_object;
1184 MS_PAR_MARK_OBJECT_AND_ENQUEUE (obj, block, queue);
1187 mword vtable_word = *(mword*)obj;
1188 vt = (MonoVTable*)(vtable_word & ~SGEN_VTABLE_BITS_MASK);
1191 if (vtable_word & SGEN_PINNED_BIT)
1193 binary_protocol_pin (obj, vt, mono_sgen_safe_object_get_size ((MonoObject*)obj));
1194 if (SGEN_CAS_PTR (obj, (void*)(vtable_word | SGEN_PINNED_BIT), (void*)vtable_word) == (void*)vtable_word) {
1195 if (SGEN_VTABLE_HAS_REFERENCES (vt))
1196 GRAY_OBJECT_ENQUEUE (queue, obj);
1198 g_assert (SGEN_OBJECT_IS_PINNED (obj));
1205 major_copy_or_mark_object (void **ptr, SgenGrayQueue *queue)
1210 HEAVY_STAT (++stat_copy_object_called_major);
1212 DEBUG (9, g_assert (obj));
1213 DEBUG (9, g_assert (current_collection_generation == GENERATION_OLD));
1215 if (mono_sgen_ptr_in_nursery (obj)) {
1217 char *forwarded, *old_obj;
1219 if ((forwarded = SGEN_OBJECT_IS_FORWARDED (obj))) {
1223 if (SGEN_OBJECT_IS_PINNED (obj))
1226 HEAVY_STAT (++stat_objects_copied_major);
1230 obj = copy_object_no_checks (obj, queue);
1231 if (G_UNLIKELY (old_obj == obj)) {
1232 /*If we fail to evacuate an object we just stop doing it for a given block size as all other will surely fail too.*/
1233 if (!mono_sgen_ptr_in_nursery (obj)) {
1235 block = MS_BLOCK_FOR_OBJ (obj);
1236 size_index = block->obj_size_index;
1237 evacuate_block_obj_sizes [size_index] = FALSE;
1238 MS_MARK_OBJECT_AND_ENQUEUE (obj, block, queue);
1245 * FIXME: See comment for copy_object_no_checks(). If
1246 * we have that, we can let the allocation function
1247 * give us the block info, too, and we won't have to
1250 block = MS_BLOCK_FOR_OBJ (obj);
1251 MS_CALC_MARK_BIT (word, bit, obj);
1252 DEBUG (9, g_assert (!MS_MARK_BIT (block, word, bit)));
1253 MS_SET_MARK_BIT (block, word, bit);
1257 if (MS_PTR_IN_SMALL_MAJOR_HEAP (obj))
1262 * If we have don't have a fixed heap we cannot know
1263 * whether an object is in the LOS or in the small
1264 * object major heap without checking its size. To do
1265 * that, however, we need to know that we actually
1266 * have a valid object, not a forwarding pointer, so
1267 * we have to do this check first.
1269 if ((forwarded = SGEN_OBJECT_IS_FORWARDED (obj))) {
1274 objsize = SGEN_ALIGN_UP (mono_sgen_safe_object_get_size ((MonoObject*)obj));
1276 if (objsize <= SGEN_MAX_SMALL_OBJ_SIZE)
1282 block = MS_BLOCK_FOR_OBJ (obj);
1283 size_index = block->obj_size_index;
1284 evacuate = evacuate_block_obj_sizes [size_index];
1288 * We could also check for !block->has_pinned
1289 * here, but it would only make an uncommon case
1290 * faster, namely objects that are in blocks
1291 * whose slot sizes are evacuated but which have
1294 if (evacuate && (forwarded = SGEN_OBJECT_IS_FORWARDED (obj))) {
1300 if (evacuate && !block->has_pinned) {
1301 g_assert (!SGEN_OBJECT_IS_PINNED (obj));
1302 if (block->is_to_space)
1304 HEAVY_STAT (++stat_major_objects_evacuated);
1305 goto do_copy_object;
1307 MS_MARK_OBJECT_AND_ENQUEUE (obj, block, queue);
1310 if (SGEN_OBJECT_IS_PINNED (obj))
1312 binary_protocol_pin (obj, (gpointer)SGEN_LOAD_VTABLE (obj), mono_sgen_safe_object_get_size ((MonoObject*)obj));
1313 SGEN_PIN_OBJECT (obj);
1314 /* FIXME: only enqueue if object has references */
1315 GRAY_OBJECT_ENQUEUE (queue, obj);
1321 #include "sgen-major-scan-object.h"
1324 mark_pinned_objects_in_block (MSBlockInfo *block, SgenGrayQueue *queue)
1327 int last_index = -1;
1329 if (!block->pin_queue_num_entries)
1332 block->has_pinned = TRUE;
1334 for (i = 0; i < block->pin_queue_num_entries; ++i) {
1335 int index = MS_BLOCK_OBJ_INDEX (block->pin_queue_start [i], block);
1336 DEBUG (9, g_assert (index >= 0 && index < MS_BLOCK_FREE / block->obj_size));
1337 if (index == last_index)
1339 MS_MARK_OBJECT_AND_ENQUEUE_CHECKED (MS_BLOCK_OBJ (block, index), block, queue);
1350 /* statistics for evacuation */
1351 int *slots_available = alloca (sizeof (int) * num_block_obj_sizes);
1352 int *slots_used = alloca (sizeof (int) * num_block_obj_sizes);
1353 int *num_blocks = alloca (sizeof (int) * num_block_obj_sizes);
1355 for (i = 0; i < num_block_obj_sizes; ++i)
1356 slots_available [i] = slots_used [i] = num_blocks [i] = 0;
1358 /* clear all the free lists */
1359 for (i = 0; i < MS_BLOCK_TYPE_MAX; ++i) {
1360 MSBlockInfo **free_blocks = free_block_lists [i];
1362 for (j = 0; j < num_block_obj_sizes; ++j)
1363 free_blocks [j] = NULL;
1366 /* traverse all blocks, free and zero unmarked objects */
1369 MSBlockInfo *block = *iter;
1371 gboolean have_live = FALSE;
1372 gboolean has_pinned;
1376 obj_size_index = block->obj_size_index;
1378 has_pinned = block->has_pinned;
1379 block->has_pinned = block->pinned;
1381 block->is_to_space = FALSE;
1383 count = MS_BLOCK_FREE / block->obj_size;
1384 block->free_list = NULL;
1386 for (obj_index = 0; obj_index < count; ++obj_index) {
1388 void *obj = MS_BLOCK_OBJ (block, obj_index);
1390 MS_CALC_MARK_BIT (word, bit, obj);
1391 if (MS_MARK_BIT (block, word, bit)) {
1392 DEBUG (9, g_assert (MS_OBJ_ALLOCED (obj, block)));
1395 ++slots_used [obj_size_index];
1397 /* an unmarked object */
1398 if (MS_OBJ_ALLOCED (obj, block)) {
1399 binary_protocol_empty (obj, block->obj_size);
1400 memset (obj, 0, block->obj_size);
1402 *(void**)obj = block->free_list;
1403 block->free_list = obj;
1407 /* reset mark bits */
1408 memset (block->mark_words, 0, sizeof (mword) * MS_NUM_MARK_WORDS);
1411 * FIXME: reverse free list so that it's in address
1417 ++num_blocks [obj_size_index];
1418 slots_available [obj_size_index] += count;
1421 iter = &block->next;
1424 * If there are free slots in the block, add
1425 * the block to the corresponding free list.
1427 if (block->free_list) {
1428 MSBlockInfo **free_blocks = FREE_BLOCKS (block->pinned, block->has_references);
1429 int index = MS_BLOCK_OBJ_SIZE_INDEX (block->obj_size);
1430 block->next_free = free_blocks [index];
1431 free_blocks [index] = block;
1434 update_heap_boundaries_for_block (block);
1437 * Blocks without live objects are removed from the
1438 * block list and freed.
1440 *iter = block->next;
1443 ms_free_block (block);
1445 ms_free_block (block->block);
1447 mono_sgen_free_internal (block, INTERNAL_MEM_MS_BLOCK_INFO);
1450 --num_major_sections;
1454 for (i = 0; i < num_block_obj_sizes; ++i) {
1455 float usage = (float)slots_used [i] / (float)slots_available [i];
1456 if (num_blocks [i] > 5 && usage < evacuation_threshold) {
1457 evacuate_block_obj_sizes [i] = TRUE;
1459 g_print ("slot size %d - %d of %d used\n",
1460 block_obj_sizes [i], slots_used [i], slots_available [i]);
1463 evacuate_block_obj_sizes [i] = FALSE;
1470 static mono_native_thread_return_t
1471 ms_sweep_thread_func (void *dummy)
1473 g_assert (concurrent_sweep);
1478 while ((result = MONO_SEM_WAIT (&ms_sweep_cmd_semaphore)) != 0) {
1480 g_error ("MONO_SEM_WAIT");
1485 ms_signal_sweep_done ();
1494 if (concurrent_sweep) {
1495 g_assert (ms_sweep_thread);
1496 ms_signal_sweep_command ();
1502 static int count_pinned_ref;
1503 static int count_pinned_nonref;
1504 static int count_nonpinned_ref;
1505 static int count_nonpinned_nonref;
1508 count_nonpinned_callback (char *obj, size_t size, void *data)
1510 MonoVTable *vtable = (MonoVTable*)LOAD_VTABLE (obj);
1512 if (vtable->klass->has_references)
1513 ++count_nonpinned_ref;
1515 ++count_nonpinned_nonref;
1519 count_pinned_callback (char *obj, size_t size, void *data)
1521 MonoVTable *vtable = (MonoVTable*)LOAD_VTABLE (obj);
1523 if (vtable->klass->has_references)
1526 ++count_pinned_nonref;
1529 static void __attribute__ ((unused))
1530 count_ref_nonref_objs (void)
1534 count_pinned_ref = 0;
1535 count_pinned_nonref = 0;
1536 count_nonpinned_ref = 0;
1537 count_nonpinned_nonref = 0;
1539 major_iterate_objects (TRUE, FALSE, count_nonpinned_callback, NULL);
1540 major_iterate_objects (FALSE, TRUE, count_pinned_callback, NULL);
1542 total = count_pinned_nonref + count_nonpinned_nonref + count_pinned_ref + count_nonpinned_ref;
1544 g_print ("ref: %d pinned %d non-pinned non-ref: %d pinned %d non-pinned -- %.1f\n",
1545 count_pinned_ref, count_nonpinned_ref,
1546 count_pinned_nonref, count_nonpinned_nonref,
1547 (count_pinned_nonref + count_nonpinned_nonref) * 100.0 / total);
1551 ms_calculate_block_obj_sizes (double factor, int *arr)
1553 double target_size = sizeof (MonoObject);
1558 int target_count = ceil (MS_BLOCK_FREE / target_size);
1559 int size = MIN ((MS_BLOCK_FREE / target_count) & ~(SGEN_ALLOC_ALIGN - 1), SGEN_MAX_SMALL_OBJ_SIZE);
1561 if (size != last_size) {
1563 arr [num_sizes] = size;
1568 target_size *= factor;
1569 } while (last_size < SGEN_MAX_SMALL_OBJ_SIZE);
1574 /* only valid during minor collections */
1575 static int old_num_major_sections;
1578 major_start_nursery_collection (void)
1580 ms_wait_for_sweep_done ();
1582 #ifdef MARKSWEEP_CONSISTENCY_CHECK
1583 consistency_check ();
1586 old_num_major_sections = num_major_sections;
1590 major_finish_nursery_collection (void)
1592 #ifdef MARKSWEEP_CONSISTENCY_CHECK
1593 consistency_check ();
1595 mono_sgen_register_major_sections_alloced (num_major_sections - old_num_major_sections);
1599 major_start_major_collection (void)
1603 ms_wait_for_sweep_done ();
1605 /* clear the free lists */
1606 for (i = 0; i < num_block_obj_sizes; ++i) {
1607 if (!evacuate_block_obj_sizes [i])
1610 free_block_lists [0][i] = NULL;
1611 free_block_lists [MS_BLOCK_FLAG_REFS][i] = NULL;
1616 major_finish_major_collection (void)
1621 major_have_computer_minor_collection_allowance (void)
1624 int section_reserve = mono_sgen_get_minor_collection_allowance () / MS_BLOCK_SIZE;
1626 g_assert (have_swept);
1627 ms_wait_for_sweep_done ();
1628 g_assert (!ms_sweep_in_progress);
1631 * FIXME: We don't free blocks on 32 bit platforms because it
1632 * can lead to address space fragmentation, since we're
1633 * allocating blocks in larger contingents.
1635 if (sizeof (mword) < 8)
1638 while (num_empty_blocks > section_reserve) {
1639 void *next = *(void**)empty_blocks;
1640 mono_sgen_free_os_memory (empty_blocks, MS_BLOCK_SIZE);
1641 empty_blocks = next;
1643 * Needs not be atomic because this is running
1648 ++stat_major_blocks_freed;
1654 major_find_pin_queue_start_ends (SgenGrayQueue *queue)
1658 FOREACH_BLOCK (block) {
1659 block->pin_queue_start = mono_sgen_find_optimized_pin_queue_area (block->block + MS_BLOCK_SKIP, block->block + MS_BLOCK_SIZE,
1660 &block->pin_queue_num_entries);
1661 } END_FOREACH_BLOCK;
1665 major_pin_objects (SgenGrayQueue *queue)
1669 FOREACH_BLOCK (block) {
1670 mark_pinned_objects_in_block (block, queue);
1671 } END_FOREACH_BLOCK;
1675 major_init_to_space (void)
1680 major_report_pinned_memory_usage (void)
1682 g_assert_not_reached ();
1686 major_get_used_size (void)
1691 FOREACH_BLOCK (block) {
1692 int count = MS_BLOCK_FREE / block->obj_size;
1694 size += count * block->obj_size;
1695 for (iter = block->free_list; iter; iter = (void**)*iter)
1696 size -= block->obj_size;
1697 } END_FOREACH_BLOCK;
1703 get_num_major_sections (void)
1705 return num_major_sections;
1709 major_handle_gc_param (const char *opt)
1712 if (g_str_has_prefix (opt, "major-heap-size=")) {
1713 const char *arg = strchr (opt, '=') + 1;
1715 if (!mono_gc_parse_environment_string_extract_number (arg, &size))
1717 ms_heap_num_blocks = (size + MS_BLOCK_SIZE - 1) / MS_BLOCK_SIZE;
1718 g_assert (ms_heap_num_blocks > 0);
1722 if (g_str_has_prefix (opt, "evacuation-threshold=")) {
1723 const char *arg = strchr (opt, '=') + 1;
1724 int percentage = atoi (arg);
1725 if (percentage < 0 || percentage > 100) {
1726 fprintf (stderr, "evacuation-threshold must be an integer in the range 0-100.\n");
1729 evacuation_threshold = (float)percentage / 100.0;
1731 } else if (!strcmp (opt, "concurrent-sweep")) {
1732 concurrent_sweep = TRUE;
1734 } else if (!strcmp (opt, "no-concurrent-sweep")) {
1735 concurrent_sweep = FALSE;
1743 major_print_gc_param_usage (void)
1748 " major-heap-size=N (where N is an integer, possibly with a k, m or a g suffix)\n"
1750 " evacuation-threshold=P (where P is a percentage, an integer in 0-100)\n"
1751 " (no-)concurrent-sweep\n"
1755 #ifdef SGEN_HAVE_CARDTABLE
1757 major_iterate_live_block_ranges (sgen_cardtable_block_callback callback)
1761 FOREACH_BLOCK (block) {
1762 if (block->has_references)
1763 callback ((mword)block->block, MS_BLOCK_SIZE);
1764 } END_FOREACH_BLOCK;
1767 #ifdef HEAVY_STATISTICS
1768 extern long long marked_cards;
1769 extern long long scanned_cards;
1770 extern long long scanned_objects;
1771 extern long long remarked_cards;
1774 #define CARD_WORDS_PER_BLOCK (CARDS_PER_BLOCK / SIZEOF_VOID_P)
1776 * MS blocks are 16K aligned.
1777 * Cardtables are 4K aligned, at least.
1778 * This means that the cardtable of a given block is 32 bytes aligned.
1781 initial_skip_card (guint8 *card_data)
1783 mword *cards = (mword*)card_data;
1786 for (i = 0; i < CARD_WORDS_PER_BLOCK; ++i) {
1792 if (i == CARD_WORDS_PER_BLOCK)
1793 return card_data + CARDS_PER_BLOCK;
1795 #if defined(__i386__) && defined(__GNUC__)
1796 return card_data + i * 4 + (__builtin_ffs (card) - 1) / 8;
1797 #elif defined(__x86_64__) && defined(__GNUC__)
1798 return card_data + i * 8 + (__builtin_ffsll (card) - 1) / 8;
1799 #elif defined(__s390x__) && defined(__GNUC__)
1800 return card_data + i * 8 + (__builtin_ffsll (GUINT64_TO_LE(card)) - 1) / 8;
1802 for (i = i * SIZEOF_VOID_P; i < CARDS_PER_BLOCK; ++i) {
1804 return &card_data [i];
1811 static G_GNUC_UNUSED guint8*
1812 skip_card (guint8 *card_data, guint8 *card_data_end)
1814 while (card_data < card_data_end && !*card_data)
1819 #define MS_BLOCK_OBJ_INDEX_FAST(o,b,os) (((char*)(o) - ((b) + MS_BLOCK_SKIP)) / (os))
1820 #define MS_BLOCK_OBJ_FAST(b,os,i) ((b) + MS_BLOCK_SKIP + (os) * (i))
1821 #define MS_OBJ_ALLOCED_FAST(o,b) (*(void**)(o) && (*(char**)(o) < (b) || *(char**)(o) >= (b) + MS_BLOCK_SIZE))
1824 major_scan_card_table (SgenGrayQueue *queue)
1828 FOREACH_BLOCK (block) {
1832 if (!block->has_references)
1835 block_obj_size = block->obj_size;
1836 block_start = block->block;
1838 if (block_obj_size >= CARD_SIZE_IN_BYTES) {
1840 #ifndef SGEN_HAVE_OVERLAPPING_CARDS
1841 guint8 cards_data [CARDS_PER_BLOCK];
1843 char *obj, *end, *base;
1845 /*We can avoid the extra copy since the remark cardtable was cleaned before */
1846 #ifdef SGEN_HAVE_OVERLAPPING_CARDS
1847 cards = sgen_card_table_get_card_scan_address ((mword)block_start);
1850 if (!sgen_card_table_get_card_data (cards_data, (mword)block_start, CARDS_PER_BLOCK))
1854 obj = (char*)MS_BLOCK_OBJ_FAST (block_start, block_obj_size, 0);
1855 end = block_start + MS_BLOCK_SIZE;
1856 base = sgen_card_table_align_pointer (obj);
1859 if (MS_OBJ_ALLOCED_FAST (obj, block_start)) {
1860 int card_offset = (obj - base) >> CARD_BITS;
1861 sgen_cardtable_scan_object (obj, block_obj_size, cards + card_offset, queue);
1863 obj += block_obj_size;
1866 ScanObjectFunc scan_func = mono_sgen_get_minor_scan_object ();
1867 guint8 *card_data, *card_base;
1868 guint8 *card_data_end;
1871 * This is safe in face of card aliasing for the following reason:
1873 * Major blocks are 16k aligned, or 32 cards aligned.
1874 * Cards aliasing happens in powers of two, so as long as major blocks are aligned to their
1875 * sizes, they won't overflow the cardtable overlap modulus.
1877 card_data = card_base = sgen_card_table_get_card_scan_address ((mword)block_start);
1878 card_data_end = card_data + CARDS_PER_BLOCK;
1880 for (card_data = initial_skip_card (card_data); card_data < card_data_end; ++card_data) { //card_data = skip_card (card_data + 1, card_data_end)) {
1882 int idx = card_data - card_base;
1883 char *start = (char*)(block_start + idx * CARD_SIZE_IN_BYTES);
1884 char *end = start + CARD_SIZE_IN_BYTES;
1887 HEAVY_STAT (++scanned_cards);
1892 HEAVY_STAT (++marked_cards);
1894 sgen_card_table_prepare_card_for_scanning (card_data);
1899 index = MS_BLOCK_OBJ_INDEX_FAST (start, block_start, block_obj_size);
1901 obj = (char*)MS_BLOCK_OBJ_FAST (block_start, block_obj_size, index);
1903 if (MS_OBJ_ALLOCED_FAST (obj, block_start)) {
1904 HEAVY_STAT (++scanned_objects);
1905 scan_func (obj, queue);
1907 obj += block_obj_size;
1909 HEAVY_STAT (if (*card_data) ++remarked_cards);
1912 } END_FOREACH_BLOCK;
1917 major_is_worker_thread (MonoNativeThreadId thread)
1919 if (concurrent_sweep)
1920 return thread == ms_sweep_thread;
1926 alloc_free_block_lists (MSBlockInfo ***lists)
1929 for (i = 0; i < MS_BLOCK_TYPE_MAX; ++i)
1930 lists [i] = mono_sgen_alloc_internal_dynamic (sizeof (MSBlockInfo*) * num_block_obj_sizes, INTERNAL_MEM_MS_TABLES);
1933 #ifdef SGEN_PARALLEL_MARK
1935 major_alloc_worker_data (void)
1937 /* FIXME: free this when the workers come down */
1938 MSBlockInfo ***lists = malloc (sizeof (MSBlockInfo**) * MS_BLOCK_TYPE_MAX);
1939 alloc_free_block_lists (lists);
1944 major_init_worker_thread (void *data)
1946 MSBlockInfo ***lists = data;
1949 g_assert (lists && lists != free_block_lists);
1950 for (i = 0; i < MS_BLOCK_TYPE_MAX; ++i) {
1952 for (j = 0; j < num_block_obj_sizes; ++j)
1953 g_assert (!lists [i][j]);
1956 #ifdef HAVE_KW_THREAD
1957 workers_free_block_lists = data;
1959 mono_native_tls_set_value (workers_free_block_lists_key, data);
1964 major_reset_worker_data (void *data)
1966 MSBlockInfo ***lists = data;
1968 for (i = 0; i < MS_BLOCK_TYPE_MAX; ++i) {
1970 for (j = 0; j < num_block_obj_sizes; ++j)
1971 lists [i][j] = NULL;
1976 #undef pthread_create
1979 post_param_init (void)
1981 if (concurrent_sweep) {
1982 if (mono_native_thread_create (&ms_sweep_thread, ms_sweep_thread_func, NULL)) {
1983 fprintf (stderr, "Error: Could not create sweep thread.\n");
1990 #ifdef SGEN_PARALLEL_MARK
1992 mono_sgen_marksweep_fixed_par_init
1994 mono_sgen_marksweep_par_init
1998 mono_sgen_marksweep_fixed_init
2000 mono_sgen_marksweep_init
2003 (SgenMajorCollector *collector)
2008 mono_sgen_register_fixed_internal_mem_type (INTERNAL_MEM_MS_BLOCK_INFO, sizeof (MSBlockInfo));
2011 num_block_obj_sizes = ms_calculate_block_obj_sizes (MS_BLOCK_OBJ_SIZE_FACTOR, NULL);
2012 block_obj_sizes = mono_sgen_alloc_internal_dynamic (sizeof (int) * num_block_obj_sizes, INTERNAL_MEM_MS_TABLES);
2013 ms_calculate_block_obj_sizes (MS_BLOCK_OBJ_SIZE_FACTOR, block_obj_sizes);
2015 evacuate_block_obj_sizes = mono_sgen_alloc_internal_dynamic (sizeof (gboolean) * num_block_obj_sizes, INTERNAL_MEM_MS_TABLES);
2016 for (i = 0; i < num_block_obj_sizes; ++i)
2017 evacuate_block_obj_sizes [i] = FALSE;
2022 g_print ("block object sizes:\n");
2023 for (i = 0; i < num_block_obj_sizes; ++i)
2024 g_print ("%d\n", block_obj_sizes [i]);
2028 alloc_free_block_lists (free_block_lists);
2030 for (i = 0; i < MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES; ++i)
2031 fast_block_obj_size_indexes [i] = ms_find_block_obj_size_index (i * 8);
2032 for (i = 0; i < MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES * 8; ++i)
2033 g_assert (MS_BLOCK_OBJ_SIZE_INDEX (i) == ms_find_block_obj_size_index (i));
2035 #ifdef SGEN_PARALLEL_MARK
2036 LOCK_INIT (ms_block_list_mutex);
2039 mono_counters_register ("# major blocks allocated", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_blocks_alloced);
2040 mono_counters_register ("# major blocks freed", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_blocks_freed);
2041 mono_counters_register ("# major objects evacuated", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_objects_evacuated);
2042 mono_counters_register ("Wait for sweep time", MONO_COUNTER_GC | MONO_COUNTER_TIME_INTERVAL, &stat_time_wait_for_sweep);
2043 #ifdef SGEN_PARALLEL_MARK
2044 mono_counters_register ("Slots allocated in vain", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_slots_allocated_in_vain);
2046 #ifndef HAVE_KW_THREAD
2047 mono_native_tls_alloc (&workers_free_block_lists_key, NULL);
2052 * FIXME: These are superfluous if concurrent sweep is
2053 * disabled. We might want to create them lazily.
2055 MONO_SEM_INIT (&ms_sweep_cmd_semaphore, 0);
2056 MONO_SEM_INIT (&ms_sweep_done_semaphore, 0);
2058 collector->section_size = MAJOR_SECTION_SIZE;
2059 #ifdef SGEN_PARALLEL_MARK
2060 collector->is_parallel = TRUE;
2061 collector->alloc_worker_data = major_alloc_worker_data;
2062 collector->init_worker_thread = major_init_worker_thread;
2063 collector->reset_worker_data = major_reset_worker_data;
2065 collector->is_parallel = FALSE;
2067 collector->supports_cardtable = TRUE;
2069 collector->have_swept = &have_swept;
2071 collector->alloc_heap = major_alloc_heap;
2072 collector->is_object_live = major_is_object_live;
2073 collector->alloc_small_pinned_obj = major_alloc_small_pinned_obj;
2074 collector->alloc_degraded = major_alloc_degraded;
2075 collector->copy_or_mark_object = major_copy_or_mark_object;
2076 collector->alloc_object = major_alloc_object;
2077 #ifdef SGEN_PARALLEL_MARK
2078 collector->par_alloc_object = major_par_alloc_object;
2080 collector->free_pinned_object = free_pinned_object;
2081 collector->iterate_objects = major_iterate_objects;
2082 collector->free_non_pinned_object = major_free_non_pinned_object;
2083 collector->find_pin_queue_start_ends = major_find_pin_queue_start_ends;
2084 collector->pin_objects = major_pin_objects;
2085 #ifdef SGEN_HAVE_CARDTABLE
2086 collector->scan_card_table = major_scan_card_table;
2087 collector->iterate_live_block_ranges = (void*)(void*) major_iterate_live_block_ranges;
2089 collector->init_to_space = major_init_to_space;
2090 collector->sweep = major_sweep;
2091 collector->check_scan_starts = major_check_scan_starts;
2092 collector->dump_heap = major_dump_heap;
2093 collector->get_used_size = major_get_used_size;
2094 collector->start_nursery_collection = major_start_nursery_collection;
2095 collector->finish_nursery_collection = major_finish_nursery_collection;
2096 collector->start_major_collection = major_start_major_collection;
2097 collector->finish_major_collection = major_finish_major_collection;
2098 collector->have_computed_minor_collection_allowance = major_have_computer_minor_collection_allowance;
2099 collector->ptr_is_in_non_pinned_space = major_ptr_is_in_non_pinned_space;
2100 collector->obj_is_from_pinned_alloc = obj_is_from_pinned_alloc;
2101 collector->report_pinned_memory_usage = major_report_pinned_memory_usage;
2102 collector->get_num_major_sections = get_num_major_sections;
2103 collector->handle_gc_param = major_handle_gc_param;
2104 collector->print_gc_param_usage = major_print_gc_param_usage;
2105 collector->is_worker_thread = major_is_worker_thread;
2106 collector->post_param_init = post_param_init;
2108 FILL_COLLECTOR_COPY_OBJECT (collector);
2109 FILL_COLLECTOR_SCAN_OBJECT (collector);
2111 #ifdef SGEN_HAVE_CARDTABLE
2112 /*cardtable requires major pages to be 8 cards aligned*/
2113 g_assert ((MS_BLOCK_SIZE % (8 * CARD_SIZE_IN_BYTES)) == 0);