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.
33 #include "utils/mono-counters.h"
34 #include "metadata/object-internals.h"
35 #include "metadata/profiler-private.h"
37 #include "metadata/sgen-gc.h"
38 #include "metadata/sgen-protocol.h"
39 #include "metadata/sgen-cardtable.h"
44 #define MS_BLOCK_SIZE (16*1024)
45 #define MS_BLOCK_SIZE_SHIFT 14
46 #define MAJOR_SECTION_SIZE MS_BLOCK_SIZE
47 #define CARDS_PER_BLOCK (MS_BLOCK_SIZE / CARD_SIZE_IN_BYTES)
50 #define MS_DEFAULT_HEAP_NUM_BLOCKS (32 * 1024) /* 512 MB */
54 * Don't allocate single blocks, but alloc a contingent of this many
55 * blocks in one swoop.
57 #define MS_BLOCK_ALLOC_NUM 32
60 * Number of bytes before the first object in a block. At the start
61 * of a block is the MSBlockHeader, then opional padding, then come
62 * the objects, so this must be >= sizeof (MSBlockHeader).
65 #define MS_BLOCK_SKIP 0
67 #define MS_BLOCK_SKIP 16
70 #define MS_BLOCK_FREE (MS_BLOCK_SIZE - MS_BLOCK_SKIP)
72 #define MS_NUM_MARK_WORDS ((MS_BLOCK_SIZE / SGEN_ALLOC_ALIGN + sizeof (mword) * 8 - 1) / (sizeof (mword) * 8))
74 #if SGEN_MAX_SMALL_OBJ_SIZE > MS_BLOCK_FREE / 2
75 #error MAX_SMALL_OBJ_SIZE must be at most MS_BLOCK_FREE / 2
78 typedef struct _MSBlockInfo MSBlockInfo;
82 gboolean has_references;
90 MSBlockInfo *next_free;
91 void **pin_queue_start;
92 int pin_queue_num_entries;
93 mword mark_words [MS_NUM_MARK_WORDS];
97 static int ms_heap_num_blocks = MS_DEFAULT_HEAP_NUM_BLOCKS;
99 #define ms_heap_start nursery_end
100 static char *ms_heap_end;
102 #define MS_PTR_IN_SMALL_MAJOR_HEAP(p) ((char*)(p) >= ms_heap_start && (char*)(p) < ms_heap_end)
104 /* array of all all block infos in the system */
105 static MSBlockInfo *block_infos;
108 #define MS_BLOCK_OBJ(b,i) ((b)->block + MS_BLOCK_SKIP + (b)->obj_size * (i))
109 #define MS_BLOCK_DATA_FOR_OBJ(o) ((char*)((mword)(o) & ~(mword)(MS_BLOCK_SIZE - 1)))
112 #define MS_BLOCK_FOR_OBJ(o) (&block_infos [(mword)((char*)(o) - ms_heap_start) >> MS_BLOCK_SIZE_SHIFT])
118 #define MS_BLOCK_FOR_OBJ(o) (((MSBlockHeader*)MS_BLOCK_DATA_FOR_OBJ ((o)))->info)
121 #define MS_BLOCK_OBJ_INDEX(o,b) (((char*)(o) - ((b)->block + MS_BLOCK_SKIP)) / (b)->obj_size)
123 #define MS_CALC_MARK_BIT(w,b,o) do { \
124 int i = ((char*)(o) - MS_BLOCK_DATA_FOR_OBJ ((o))) >> SGEN_ALLOC_ALIGN_BITS; \
125 if (sizeof (mword) == 4) { \
134 #define MS_MARK_BIT(bl,w,b) ((bl)->mark_words [(w)] & (1L << (b)))
135 #define MS_SET_MARK_BIT(bl,w,b) ((bl)->mark_words [(w)] |= (1L << (b)))
136 #define MS_PAR_SET_MARK_BIT(was_marked,bl,w,b) do { \
137 mword __old = (bl)->mark_words [(w)]; \
138 mword __bitmask = 1L << (b); \
139 if (__old & __bitmask) { \
143 if (SGEN_CAS_PTR ((gpointer*)&(bl)->mark_words [(w)], \
144 (gpointer)(__old | __bitmask), \
145 (gpointer)__old) == \
147 was_marked = FALSE; \
152 #define MS_OBJ_ALLOCED(o,b) (*(void**)(o) && (*(char**)(o) < (b)->block || *(char**)(o) >= (b)->block + MS_BLOCK_SIZE))
154 #define MS_BLOCK_OBJ_SIZE_FACTOR (sqrt (2.0))
157 * This way we can lookup block object size indexes for sizes up to
158 * 256 bytes with a single load.
160 #define MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES 32
162 static int *block_obj_sizes;
163 static int num_block_obj_sizes;
164 static int fast_block_obj_size_indexes [MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES];
166 #define MS_BLOCK_FLAG_PINNED 1
167 #define MS_BLOCK_FLAG_REFS 2
169 #define MS_BLOCK_TYPE_MAX 4
171 #ifdef SGEN_PARALLEL_MARK
172 static LOCK_DECLARE (ms_block_list_mutex);
173 #define LOCK_MS_BLOCK_LIST pthread_mutex_lock (&ms_block_list_mutex)
174 #define UNLOCK_MS_BLOCK_LIST pthread_mutex_unlock (&ms_block_list_mutex)
176 #define LOCK_MS_BLOCK_LIST
177 #define UNLOCK_MS_BLOCK_LIST
180 /* we get this at init */
181 static int nursery_bits;
182 static char *nursery_start;
183 static char *nursery_end;
185 #define ptr_in_nursery(p) (SGEN_PTR_IN_NURSERY ((p), nursery_bits, nursery_start, nursery_end))
188 /* non-allocated block free-list */
189 static MSBlockInfo *empty_blocks = NULL;
191 /* non-allocated block free-list */
192 static void *empty_blocks = NULL;
193 /* all allocated blocks in the system */
194 static MSBlockInfo *all_blocks;
195 static int num_empty_blocks = 0;
199 #define FOREACH_BLOCK(bl) { \
201 for (__block_i = 0; __block_i < ms_heap_num_blocks; ++__block_i) { \
202 (bl) = &block_infos [__block_i]; \
203 if (!(bl)->used) continue;
204 #define END_FOREACH_BLOCK }}
206 #define FOREACH_BLOCK(bl) for ((bl) = all_blocks; (bl); (bl) = (bl)->next) {
207 #define END_FOREACH_BLOCK }
210 static int num_major_sections = 0;
211 /* one free block list for each block object size */
212 static MSBlockInfo **free_block_lists [MS_BLOCK_TYPE_MAX];
214 static long long stat_major_blocks_alloced = 0;
215 static long long stat_major_blocks_freed = 0;
218 ms_find_block_obj_size_index (int size)
221 DEBUG (9, g_assert (size <= SGEN_MAX_SMALL_OBJ_SIZE));
222 for (i = 0; i < num_block_obj_sizes; ++i)
223 if (block_obj_sizes [i] >= size)
225 g_assert_not_reached ();
228 #define FREE_BLOCKS(p,r) (free_block_lists [((p) ? MS_BLOCK_FLAG_PINNED : 0) | ((r) ? MS_BLOCK_FLAG_REFS : 0)])
230 #define MS_BLOCK_OBJ_SIZE_INDEX(s) \
231 (((s)+7)>>3 < MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES ? \
232 fast_block_obj_size_indexes [((s)+7)>>3] : \
233 ms_find_block_obj_size_index ((s)))
237 major_alloc_heap (mword nursery_size, mword nursery_align, int the_nursery_bits)
240 mword major_heap_size = ms_heap_num_blocks * MS_BLOCK_SIZE;
241 mword alloc_size = nursery_size + major_heap_size;
244 g_assert (ms_heap_num_blocks > 0);
245 g_assert (nursery_size % MS_BLOCK_SIZE == 0);
247 g_assert (nursery_align % MS_BLOCK_SIZE == 0);
249 nursery_start = mono_sgen_alloc_os_memory_aligned (alloc_size, nursery_align ? nursery_align : MS_BLOCK_SIZE, TRUE);
250 nursery_end = heap_start = nursery_start + nursery_size;
251 nursery_bits = the_nursery_bits;
253 ms_heap_end = heap_start + major_heap_size;
255 block_infos = mono_sgen_alloc_internal_dynamic (sizeof (MSBlockInfo) * ms_heap_num_blocks, INTERNAL_MEM_MS_BLOCK_INFO);
257 for (i = 0; i < ms_heap_num_blocks; ++i) {
258 block_infos [i].block = heap_start + i * MS_BLOCK_SIZE;
259 if (i < ms_heap_num_blocks - 1)
260 block_infos [i].next_free = &block_infos [i + 1];
262 block_infos [i].next_free = NULL;
265 empty_blocks = &block_infos [0];
267 return nursery_start;
271 major_alloc_heap (mword nursery_size, mword nursery_align, int the_nursery_bits)
274 nursery_start = mono_sgen_alloc_os_memory_aligned (nursery_size, nursery_align, TRUE);
276 nursery_start = mono_sgen_alloc_os_memory (nursery_size, TRUE);
278 nursery_end = nursery_start + nursery_size;
279 nursery_bits = the_nursery_bits;
281 return nursery_start;
287 ms_get_empty_block (void)
291 g_assert (empty_blocks);
293 block = empty_blocks;
294 empty_blocks = empty_blocks->next_free;
298 mono_sgen_update_heap_boundaries ((mword)block->block, (mword)block->block + MS_BLOCK_SIZE);
304 ms_free_block (MSBlockInfo *block)
306 block->next_free = empty_blocks;
307 empty_blocks = block;
312 ms_get_empty_block (void)
316 void *block, *empty, *next;
320 p = mono_sgen_alloc_os_memory_aligned (MS_BLOCK_SIZE * MS_BLOCK_ALLOC_NUM, MS_BLOCK_SIZE, TRUE);
322 for (i = 0; i < MS_BLOCK_ALLOC_NUM; ++i) {
325 * We do the free list update one after the
326 * other so that other threads can use the new
327 * blocks as quickly as possible.
330 empty = empty_blocks;
331 *(void**)block = empty;
332 } while (SGEN_CAS_PTR (&empty_blocks, block, empty) != empty);
336 SGEN_ATOMIC_ADD (num_empty_blocks, MS_BLOCK_ALLOC_NUM);
338 stat_major_blocks_alloced += MS_BLOCK_ALLOC_NUM;
342 empty = empty_blocks;
346 next = *(void**)block;
347 } while (SGEN_CAS_PTR (&empty_blocks, next, empty) != empty);
349 SGEN_ATOMIC_ADD (num_empty_blocks, -1);
351 *(void**)block = NULL;
353 g_assert (!((mword)block & (MS_BLOCK_SIZE - 1)));
355 mono_sgen_update_heap_boundaries ((mword)block, (mword)block + MS_BLOCK_SIZE);
361 ms_free_block (void *block)
365 memset (block, 0, MS_BLOCK_SIZE);
368 empty = empty_blocks;
369 *(void**)block = empty;
370 } while (SGEN_CAS_PTR (&empty_blocks, block, empty) != empty);
372 SGEN_ATOMIC_ADD (num_empty_blocks, 1);
376 //#define MARKSWEEP_CONSISTENCY_CHECK
378 #ifdef MARKSWEEP_CONSISTENCY_CHECK
380 check_block_free_list (MSBlockInfo *block, int size, gboolean pinned)
384 for (; block; block = block->next_free) {
385 g_assert (block->obj_size == size);
386 g_assert ((pinned && block->pinned) || (!pinned && !block->pinned));
388 /* blocks in the free lists must have at least
390 g_assert (block->free_list);
393 /* the block must not be in the empty_blocks list */
394 for (b = empty_blocks; b; b = b->next_free)
395 g_assert (b != block);
397 /* the block must be in the all_blocks list */
398 for (b = all_blocks; b; b = b->next) {
402 g_assert (b == block);
408 check_empty_blocks (void)
413 for (p = empty_blocks; p; p = *(void**)p)
415 g_assert (i == num_empty_blocks);
420 consistency_check (void)
425 /* check all blocks */
426 FOREACH_BLOCK (block) {
427 int count = MS_BLOCK_FREE / block->obj_size;
432 /* check block header */
433 g_assert (((MSBlockHeader*)block->block)->info == block);
436 /* count number of free slots */
437 for (i = 0; i < count; ++i) {
438 void **obj = (void**) MS_BLOCK_OBJ (block, i);
439 if (!MS_OBJ_ALLOCED (obj, block))
443 /* check free list */
444 for (free = block->free_list; free; free = (void**)*free) {
445 g_assert (MS_BLOCK_FOR_OBJ (free) == block);
448 g_assert (num_free == 0);
450 /* check all mark words are zero */
451 for (i = 0; i < MS_NUM_MARK_WORDS; ++i)
452 g_assert (block->mark_words [i] == 0);
455 /* check free blocks */
456 for (i = 0; i < num_block_obj_sizes; ++i) {
458 for (j = 0; j < MS_BLOCK_TYPE_MAX; ++j)
459 check_block_free_list (free_block_lists [j][i], block_obj_sizes [i], j & MS_BLOCK_FLAG_PINNED);
462 check_empty_blocks ();
467 ms_alloc_block (int size_index, gboolean pinned, gboolean has_references)
469 int size = block_obj_sizes [size_index];
470 int count = MS_BLOCK_FREE / size;
472 MSBlockInfo *info = ms_get_empty_block ();
474 MSBlockInfo *info = mono_sgen_alloc_internal (INTERNAL_MEM_MS_BLOCK_INFO);
475 MSBlockHeader *header;
477 MSBlockInfo **free_blocks = FREE_BLOCKS (pinned, has_references);
481 DEBUG (9, g_assert (count >= 2));
483 info->obj_size = size;
484 info->pinned = pinned;
485 info->has_references = has_references;
487 info->block = ms_get_empty_block ();
489 header = (MSBlockHeader*) info->block;
493 /* build free list */
494 obj_start = info->block + MS_BLOCK_SKIP;
495 info->free_list = (void**)obj_start;
496 /* we're skipping the last one - it must be nulled */
497 for (i = 0; i < count - 1; ++i) {
498 char *next_obj_start = obj_start + size;
499 *(void**)obj_start = next_obj_start;
500 obj_start = next_obj_start;
503 *(void**)obj_start = NULL;
505 info->next_free = free_blocks [size_index];
506 free_blocks [size_index] = info;
509 info->next = all_blocks;
513 ++num_major_sections;
517 obj_is_from_pinned_alloc (char *obj)
519 MSBlockInfo *block = MS_BLOCK_FOR_OBJ (obj);
520 return block->pinned;
524 alloc_obj (int size, gboolean pinned, gboolean has_references)
526 int size_index = MS_BLOCK_OBJ_SIZE_INDEX (size);
527 MSBlockInfo **free_blocks = FREE_BLOCKS (pinned, has_references);
531 /* FIXME: try to do this without locking */
535 if (!free_blocks [size_index])
536 ms_alloc_block (size_index, pinned, has_references);
538 block = free_blocks [size_index];
539 DEBUG (9, g_assert (block));
541 obj = block->free_list;
542 DEBUG (9, g_assert (obj));
544 block->free_list = *(void**)obj;
545 if (!block->free_list) {
546 free_blocks [size_index] = block->next_free;
547 block->next_free = NULL;
550 UNLOCK_MS_BLOCK_LIST;
553 * FIXME: This should not be necessary because it'll be
554 * overwritten by the vtable immediately.
562 major_alloc_object (int size, gboolean has_references)
564 return alloc_obj (size, FALSE, has_references);
568 * We're not freeing the block if it's empty. We leave that work for
569 * the next major collection.
571 * This is just called from the domain clearing code, which runs in a
572 * single thread and has the GC lock, so we don't need an extra lock.
575 free_object (char *obj, size_t size, gboolean pinned)
577 MSBlockInfo *block = MS_BLOCK_FOR_OBJ (obj);
579 DEBUG (9, g_assert ((pinned && block->pinned) || (!pinned && !block->pinned)));
580 DEBUG (9, g_assert (MS_OBJ_ALLOCED (obj, block)));
581 MS_CALC_MARK_BIT (word, bit, obj);
582 DEBUG (9, g_assert (!MS_MARK_BIT (block, word, bit)));
583 if (!block->free_list) {
584 MSBlockInfo **free_blocks = FREE_BLOCKS (pinned, block->has_references);
585 int size_index = MS_BLOCK_OBJ_SIZE_INDEX (size);
586 DEBUG (9, g_assert (!block->next_free));
587 block->next_free = free_blocks [size_index];
588 free_blocks [size_index] = block;
590 memset (obj, 0, size);
591 *(void**)obj = block->free_list;
592 block->free_list = (void**)obj;
596 major_free_non_pinned_object (char *obj, size_t size)
598 free_object (obj, size, FALSE);
601 /* size is a multiple of SGEN_ALLOC_ALIGN */
603 major_alloc_small_pinned_obj (size_t size, gboolean has_references)
605 return alloc_obj (size, TRUE, has_references);
609 free_pinned_object (char *obj, size_t size)
611 free_object (obj, size, TRUE);
615 * size is already rounded up and we hold the GC lock.
618 major_alloc_degraded (MonoVTable *vtable, size_t size)
621 int old_num_sections = num_major_sections;
622 obj = alloc_obj (size, FALSE, vtable->klass->has_references);
623 *(MonoVTable**)obj = vtable;
624 HEAVY_STAT (++stat_objects_alloced_degraded);
625 HEAVY_STAT (stat_bytes_alloced_degraded += size);
626 g_assert (num_major_sections >= old_num_sections);
627 mono_sgen_register_major_sections_alloced (num_major_sections - old_num_sections);
631 #define MAJOR_OBJ_IS_IN_TO_SPACE(obj) FALSE
634 * obj is some object. If it's not in the major heap (i.e. if it's in
635 * the nursery or LOS), return FALSE. Otherwise return whether it's
636 * been marked or copied.
639 major_is_object_live (char *obj)
647 if (ptr_in_nursery (obj))
652 if (!MS_PTR_IN_SMALL_MAJOR_HEAP (obj))
655 objsize = SGEN_ALIGN_UP (mono_sgen_safe_object_get_size ((MonoObject*)obj));
658 if (objsize > SGEN_MAX_SMALL_OBJ_SIZE)
662 /* now we know it's in a major block */
663 block = MS_BLOCK_FOR_OBJ (obj);
664 DEBUG (9, g_assert (!block->pinned));
665 MS_CALC_MARK_BIT (word, bit, obj);
666 return MS_MARK_BIT (block, word, bit) ? TRUE : FALSE;
670 major_ptr_is_in_non_pinned_space (char *ptr)
672 g_assert_not_reached ();
676 major_iterate_objects (gboolean non_pinned, gboolean pinned, IterateObjectCallbackFunc callback, void *data)
680 FOREACH_BLOCK (block) {
681 int count = MS_BLOCK_FREE / block->obj_size;
684 if (block->pinned && !pinned)
686 if (!block->pinned && !non_pinned)
689 for (i = 0; i < count; ++i) {
690 void **obj = (void**) MS_BLOCK_OBJ (block, i);
691 if (MS_OBJ_ALLOCED (obj, block))
692 callback ((char*)obj, block->obj_size, data);
698 major_check_scan_starts (void)
703 major_dump_heap (FILE *heap_dump_file)
707 FOREACH_BLOCK (block) {
708 int count = MS_BLOCK_FREE / block->obj_size;
712 fprintf (heap_dump_file, "<section type=\"%s\" size=\"%zu\">\n", "old", (size_t)MS_BLOCK_FREE);
714 for (i = 0; i <= count; ++i) {
715 if ((i < count) && MS_OBJ_ALLOCED (MS_BLOCK_OBJ (block, i), block)) {
720 mono_sgen_dump_occupied (MS_BLOCK_OBJ (block, start), MS_BLOCK_OBJ (block, i), block->block);
726 fprintf (heap_dump_file, "</section>\n");
730 #define LOAD_VTABLE SGEN_LOAD_VTABLE
732 #define MS_MARK_OBJECT_AND_ENQUEUE_CHECKED(obj,block,queue) do { \
734 MS_CALC_MARK_BIT (__word, __bit, (obj)); \
735 if (!MS_MARK_BIT ((block), __word, __bit) && MS_OBJ_ALLOCED ((obj), (block))) { \
736 MS_SET_MARK_BIT ((block), __word, __bit); \
737 if ((block)->has_references) \
738 GRAY_OBJECT_ENQUEUE ((queue), (obj)); \
739 binary_protocol_mark ((obj), (gpointer)LOAD_VTABLE ((obj)), mono_sgen_safe_object_get_size ((MonoObject*)(obj))); \
742 #define MS_MARK_OBJECT_AND_ENQUEUE(obj,block,queue) do { \
744 MS_CALC_MARK_BIT (__word, __bit, (obj)); \
745 DEBUG (9, g_assert (MS_OBJ_ALLOCED ((obj), (block)))); \
746 if (!MS_MARK_BIT ((block), __word, __bit)) { \
747 MS_SET_MARK_BIT ((block), __word, __bit); \
748 if ((block)->has_references) \
749 GRAY_OBJECT_ENQUEUE ((queue), (obj)); \
750 binary_protocol_mark ((obj), (gpointer)LOAD_VTABLE ((obj)), mono_sgen_safe_object_get_size ((MonoObject*)(obj))); \
753 #define MS_PAR_MARK_OBJECT_AND_ENQUEUE(obj,block,queue) do { \
755 gboolean __was_marked; \
756 DEBUG (9, g_assert (MS_OBJ_ALLOCED ((obj), (block)))); \
757 MS_CALC_MARK_BIT (__word, __bit, (obj)); \
758 MS_PAR_SET_MARK_BIT (__was_marked, (block), __word, __bit); \
759 if (!__was_marked) { \
760 if ((block)->has_references) \
761 GRAY_OBJECT_ENQUEUE ((queue), (obj)); \
762 binary_protocol_mark ((obj), (gpointer)LOAD_VTABLE ((obj)), mono_sgen_safe_object_get_size ((MonoObject*)(obj))); \
766 #include "sgen-major-copy-object.h"
768 #ifdef SGEN_PARALLEL_MARK
770 major_copy_or_mark_object (void **ptr, SgenGrayQueue *queue)
773 mword vtable_word = *(mword*)obj;
774 MonoVTable *vt = (MonoVTable*)(vtable_word & ~SGEN_VTABLE_BITS_MASK);
778 HEAVY_STAT (++stat_copy_object_called_major);
780 DEBUG (9, g_assert (obj));
781 DEBUG (9, g_assert (current_collection_generation == GENERATION_OLD));
783 if (ptr_in_nursery (obj)) {
785 gboolean has_references;
788 if (vtable_word & SGEN_FORWARDED_BIT) {
793 if (vtable_word & SGEN_PINNED_BIT)
796 HEAVY_STAT (++stat_objects_copied_major);
798 objsize = SGEN_ALIGN_UP (mono_sgen_par_object_get_size (vt, (MonoObject*)obj));
799 has_references = SGEN_VTABLE_HAS_REFERENCES (vt);
801 destination = major_alloc_object (objsize, has_references);
803 if (SGEN_CAS_PTR (obj, (void*)((mword)destination | SGEN_FORWARDED_BIT), vt) == vt) {
806 par_copy_object_no_checks (destination, vt, obj, objsize, has_references ? queue : NULL);
811 * FIXME: If we make major_alloc_object() give
812 * us the block info, too, we won't have to
815 block = MS_BLOCK_FOR_OBJ (obj);
816 MS_CALC_MARK_BIT (word, bit, obj);
817 DEBUG (9, g_assert (!MS_MARK_BIT (block, word, bit)));
818 MS_PAR_SET_MARK_BIT (was_marked, block, word, bit);
821 * FIXME: We have allocated destination, but
822 * we cannot use it. Give it back to the
825 *(void**)destination = NULL;
827 vtable_word = *(mword*)obj;
828 g_assert (vtable_word & SGEN_FORWARDED_BIT);
830 obj = (void*)(vtable_word & ~SGEN_VTABLE_BITS_MASK);
836 if (MS_PTR_IN_SMALL_MAJOR_HEAP (obj))
838 objsize = SGEN_ALIGN_UP (mono_sgen_par_object_get_size (vt, (MonoObject*)obj));
840 if (objsize <= SGEN_MAX_SMALL_OBJ_SIZE)
843 block = MS_BLOCK_FOR_OBJ (obj);
844 MS_PAR_MARK_OBJECT_AND_ENQUEUE (obj, block, queue);
846 if (vtable_word & SGEN_PINNED_BIT)
848 binary_protocol_pin (obj, vt, mono_sgen_safe_object_get_size ((MonoObject*)obj));
849 if (SGEN_CAS_PTR (obj, (void*)(vtable_word | SGEN_PINNED_BIT), (void*)vtable_word) == (void*)vtable_word) {
850 if (SGEN_VTABLE_HAS_REFERENCES (vt))
851 GRAY_OBJECT_ENQUEUE (queue, obj);
853 g_assert (SGEN_OBJECT_IS_PINNED (obj));
860 major_copy_or_mark_object (void **ptr, SgenGrayQueue *queue)
866 HEAVY_STAT (++stat_copy_object_called_major);
868 DEBUG (9, g_assert (obj));
869 DEBUG (9, g_assert (current_collection_generation == GENERATION_OLD));
871 if (ptr_in_nursery (obj)) {
875 if ((forwarded = SGEN_OBJECT_IS_FORWARDED (obj))) {
879 if (SGEN_OBJECT_IS_PINNED (obj))
882 HEAVY_STAT (++stat_objects_copied_major);
884 obj = copy_object_no_checks (obj, queue);
888 * FIXME: See comment for copy_object_no_checks(). If
889 * we have that, we can let the allocation function
890 * give us the block info, too, and we won't have to
893 block = MS_BLOCK_FOR_OBJ (obj);
894 MS_CALC_MARK_BIT (word, bit, obj);
895 DEBUG (9, g_assert (!MS_MARK_BIT (block, word, bit)));
896 MS_SET_MARK_BIT (block, word, bit);
899 if (MS_PTR_IN_SMALL_MAJOR_HEAP (obj))
901 objsize = SGEN_ALIGN_UP (mono_sgen_safe_object_get_size ((MonoObject*)obj));
903 if (objsize <= SGEN_MAX_SMALL_OBJ_SIZE)
906 block = MS_BLOCK_FOR_OBJ (obj);
907 MS_MARK_OBJECT_AND_ENQUEUE (obj, block, queue);
909 if (SGEN_OBJECT_IS_PINNED (obj))
911 binary_protocol_pin (obj, (gpointer)SGEN_LOAD_VTABLE (obj), mono_sgen_safe_object_get_size ((MonoObject*)obj));
912 SGEN_PIN_OBJECT (obj);
913 /* FIXME: only enqueue if object has references */
914 GRAY_OBJECT_ENQUEUE (queue, obj);
920 #include "sgen-major-scan-object.h"
923 mark_pinned_objects_in_block (MSBlockInfo *block, SgenGrayQueue *queue)
927 int count = MS_BLOCK_FREE / block->obj_size;
929 for (i = 0; i < block->pin_queue_num_entries; ++i) {
930 int index = MS_BLOCK_OBJ_INDEX (block->pin_queue_start [i], block);
931 DEBUG (9, g_assert (index >= 0 && index < count));
932 if (index == last_index)
934 MS_MARK_OBJECT_AND_ENQUEUE_CHECKED (MS_BLOCK_OBJ (block, index), block, queue);
949 /* clear all the free lists */
950 for (i = 0; i < MS_BLOCK_TYPE_MAX; ++i) {
951 MSBlockInfo **free_blocks = free_block_lists [i];
953 for (j = 0; j < num_block_obj_sizes; ++j)
954 free_blocks [j] = NULL;
957 /* traverse all blocks, free and zero unmarked objects */
959 for (j = 0; j < ms_heap_num_blocks; ++j) {
960 MSBlockInfo *block = &block_infos [j];
964 MSBlockInfo *block = *iter;
967 gboolean have_live = FALSE;
975 count = MS_BLOCK_FREE / block->obj_size;
976 block->free_list = NULL;
978 for (obj_index = 0; obj_index < count; ++obj_index) {
980 void *obj = MS_BLOCK_OBJ (block, obj_index);
982 MS_CALC_MARK_BIT (word, bit, obj);
983 if (MS_MARK_BIT (block, word, bit)) {
984 DEBUG (9, g_assert (MS_OBJ_ALLOCED (obj, block)));
987 /* an unmarked object */
988 if (MS_OBJ_ALLOCED (obj, block)) {
989 binary_protocol_empty (obj, block->obj_size);
990 memset (obj, 0, block->obj_size);
992 *(void**)obj = block->free_list;
993 block->free_list = obj;
997 /* reset mark bits */
998 memset (block->mark_words, 0, sizeof (mword) * MS_NUM_MARK_WORDS);
1001 * FIXME: reverse free list so that it's in address
1007 iter = &block->next;
1011 * If there are free slots in the block, add
1012 * the block to the corresponding free list.
1014 if (block->free_list) {
1015 MSBlockInfo **free_blocks = FREE_BLOCKS (block->pinned, block->has_references);
1016 int index = MS_BLOCK_OBJ_SIZE_INDEX (block->obj_size);
1017 block->next_free = free_blocks [index];
1018 free_blocks [index] = block;
1022 * Blocks without live objects are removed from the
1023 * block list and freed.
1026 ms_free_block (block);
1028 *iter = block->next;
1030 ms_free_block (block->block);
1031 mono_sgen_free_internal (block, INTERNAL_MEM_MS_BLOCK_INFO);
1034 --num_major_sections;
1039 static int count_pinned_ref;
1040 static int count_pinned_nonref;
1041 static int count_nonpinned_ref;
1042 static int count_nonpinned_nonref;
1045 count_nonpinned_callback (char *obj, size_t size, void *data)
1047 MonoVTable *vtable = (MonoVTable*)LOAD_VTABLE (obj);
1049 if (vtable->klass->has_references)
1050 ++count_nonpinned_ref;
1052 ++count_nonpinned_nonref;
1056 count_pinned_callback (char *obj, size_t size, void *data)
1058 MonoVTable *vtable = (MonoVTable*)LOAD_VTABLE (obj);
1060 if (vtable->klass->has_references)
1063 ++count_pinned_nonref;
1066 static void __attribute__ ((unused))
1067 count_ref_nonref_objs (void)
1071 count_pinned_ref = 0;
1072 count_pinned_nonref = 0;
1073 count_nonpinned_ref = 0;
1074 count_nonpinned_nonref = 0;
1076 major_iterate_objects (TRUE, FALSE, count_nonpinned_callback, NULL);
1077 major_iterate_objects (FALSE, TRUE, count_pinned_callback, NULL);
1079 total = count_pinned_nonref + count_nonpinned_nonref + count_pinned_ref + count_nonpinned_ref;
1081 g_print ("ref: %d pinned %d non-pinned non-ref: %d pinned %d non-pinned -- %.1f\n",
1082 count_pinned_ref, count_nonpinned_ref,
1083 count_pinned_nonref, count_nonpinned_nonref,
1084 (count_pinned_nonref + count_nonpinned_nonref) * 100.0 / total);
1088 ms_calculate_block_obj_sizes (double factor, int *arr)
1090 double target_size = sizeof (MonoObject);
1095 int target_count = ceil (MS_BLOCK_FREE / target_size);
1096 int size = MIN ((MS_BLOCK_FREE / target_count) & ~(SGEN_ALLOC_ALIGN - 1), SGEN_MAX_SMALL_OBJ_SIZE);
1098 if (size != last_size) {
1100 arr [num_sizes] = size;
1105 target_size *= factor;
1106 } while (last_size < SGEN_MAX_SMALL_OBJ_SIZE);
1111 /* only valid during minor collections */
1112 static int old_num_major_sections;
1115 major_start_nursery_collection (void)
1117 #ifdef MARKSWEEP_CONSISTENCY_CHECK
1118 consistency_check ();
1121 old_num_major_sections = num_major_sections;
1125 major_finish_nursery_collection (void)
1127 #ifdef MARKSWEEP_CONSISTENCY_CHECK
1128 consistency_check ();
1130 mono_sgen_register_major_sections_alloced (num_major_sections - old_num_major_sections);
1134 major_finish_major_collection (void)
1137 int section_reserve = mono_sgen_get_minor_collection_allowance () / MS_BLOCK_SIZE;
1140 * FIXME: We don't free blocks on 32 bit platforms because it
1141 * can lead to address space fragmentation, since we're
1142 * allocating blocks in larger contingents.
1144 if (sizeof (mword) < 8)
1147 while (num_empty_blocks > section_reserve) {
1148 void *next = *(void**)empty_blocks;
1149 mono_sgen_free_os_memory (empty_blocks, MS_BLOCK_SIZE);
1150 empty_blocks = next;
1152 * Needs not be atomic because this is running
1157 ++stat_major_blocks_freed;
1163 major_find_pin_queue_start_ends (SgenGrayQueue *queue)
1167 FOREACH_BLOCK (block) {
1168 block->pin_queue_start = mono_sgen_find_optimized_pin_queue_area (block->block + MS_BLOCK_SKIP, block->block + MS_BLOCK_SIZE,
1169 &block->pin_queue_num_entries);
1170 } END_FOREACH_BLOCK;
1174 major_pin_objects (SgenGrayQueue *queue)
1178 FOREACH_BLOCK (block) {
1179 mark_pinned_objects_in_block (block, queue);
1180 } END_FOREACH_BLOCK;
1184 major_init_to_space (void)
1189 major_report_pinned_memory_usage (void)
1191 g_assert_not_reached ();
1195 major_get_used_size (void)
1200 FOREACH_BLOCK (block) {
1201 int count = MS_BLOCK_FREE / block->obj_size;
1203 size += count * block->obj_size;
1204 for (iter = block->free_list; iter; iter = (void**)*iter)
1205 size -= block->obj_size;
1206 } END_FOREACH_BLOCK;
1212 get_num_major_sections (void)
1214 return num_major_sections;
1219 major_handle_gc_param (const char *opt)
1221 if (g_str_has_prefix (opt, "major-heap-size=")) {
1222 const char *arg = strchr (opt, '=') + 1;
1224 if (!mono_sgen_parse_environment_string_extract_number (arg, &size))
1226 ms_heap_num_blocks = (size + MS_BLOCK_SIZE - 1) / MS_BLOCK_SIZE;
1227 g_assert (ms_heap_num_blocks > 0);
1235 major_print_gc_param_usage (void)
1237 fprintf (stderr, " major-heap-size=N (where N is an integer, possibly with a k, m or a g suffix)\n");
1241 #ifdef SGEN_HAVE_CARDTABLE
1243 major_iterate_live_block_ranges (sgen_cardtable_block_callback callback)
1247 FOREACH_BLOCK (block) {
1248 if (block->has_references)
1249 callback ((mword)block->block, MS_BLOCK_SIZE);
1250 } END_FOREACH_BLOCK;
1253 #define MS_BLOCK_OBJ_INDEX_FAST(o,b,os) (((char*)(o) - ((b) + MS_BLOCK_SKIP)) / (os))
1254 #define MS_BLOCK_OBJ_FAST(b,os,i) ((b) + MS_BLOCK_SKIP + (os) * (i))
1255 #define MS_OBJ_ALLOCED_FAST(o,b) (*(void**)(o) && (*(char**)(o) < (b) || *(char**)(o) >= (b) + MS_BLOCK_SIZE))
1258 major_scan_card_table (SgenGrayQueue *queue)
1262 FOREACH_BLOCK (block) {
1265 char *start, *block_start;
1267 if (!block->has_references)
1270 block_obj_size = block->obj_size;
1271 start = block_start = block->block;
1273 if (block_obj_size >= CARD_SIZE_IN_BYTES) {
1274 guint8 cards [CARDS_PER_BLOCK];
1275 char *obj = (char*)MS_BLOCK_OBJ_FAST (block_start, block_obj_size, 0);
1276 char *end = start + MS_BLOCK_SIZE;
1277 char *base = sgen_card_table_align_pointer (obj);
1279 sgen_card_table_get_card_data (cards, (mword)start, CARDS_PER_BLOCK);
1282 if (MS_OBJ_ALLOCED_FAST (obj, block_start)) {
1283 int card_offset = (obj - base) >> CARD_BITS;
1284 sgen_cardtable_scan_object (obj, block_obj_size, cards + card_offset, queue);
1286 obj += block_obj_size;
1289 for (i = 0; i < CARDS_PER_BLOCK; ++i, start += CARD_SIZE_IN_BYTES) {
1293 if (!sgen_card_table_card_begin_scanning ((mword)start))
1296 end = start + CARD_SIZE_IN_BYTES;
1300 index = MS_BLOCK_OBJ_INDEX_FAST (start, block_start, block_obj_size);
1302 obj = (char*)MS_BLOCK_OBJ_FAST (block_start, block_obj_size, index);
1304 if (MS_OBJ_ALLOCED_FAST (obj, block_start))
1305 minor_scan_object (obj, queue);
1306 obj += block_obj_size;
1310 } END_FOREACH_BLOCK;
1315 #ifdef SGEN_PARALLEL_MARK
1317 mono_sgen_marksweep_fixed_par_init
1319 mono_sgen_marksweep_par_init
1323 mono_sgen_marksweep_fixed_init
1325 mono_sgen_marksweep_init
1328 (SgenMajorCollector *collector)
1333 mono_sgen_register_fixed_internal_mem_type (INTERNAL_MEM_MS_BLOCK_INFO, sizeof (MSBlockInfo));
1336 num_block_obj_sizes = ms_calculate_block_obj_sizes (MS_BLOCK_OBJ_SIZE_FACTOR, NULL);
1337 block_obj_sizes = mono_sgen_alloc_internal_dynamic (sizeof (int) * num_block_obj_sizes, INTERNAL_MEM_MS_TABLES);
1338 ms_calculate_block_obj_sizes (MS_BLOCK_OBJ_SIZE_FACTOR, block_obj_sizes);
1343 g_print ("block object sizes:\n");
1344 for (i = 0; i < num_block_obj_sizes; ++i)
1345 g_print ("%d\n", block_obj_sizes [i]);
1349 for (i = 0; i < MS_BLOCK_TYPE_MAX; ++i)
1350 free_block_lists [i] = mono_sgen_alloc_internal_dynamic (sizeof (MSBlockInfo*) * num_block_obj_sizes, INTERNAL_MEM_MS_TABLES);
1352 for (i = 0; i < MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES; ++i)
1353 fast_block_obj_size_indexes [i] = ms_find_block_obj_size_index (i * 8);
1354 for (i = 0; i < MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES * 8; ++i)
1355 g_assert (MS_BLOCK_OBJ_SIZE_INDEX (i) == ms_find_block_obj_size_index (i));
1357 LOCK_INIT (ms_block_list_mutex);
1359 mono_counters_register ("# major blocks allocated", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_blocks_alloced);
1360 mono_counters_register ("# major blocks freed", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_blocks_freed);
1362 collector->section_size = MAJOR_SECTION_SIZE;
1363 #ifdef SGEN_PARALLEL_MARK
1364 collector->is_parallel = TRUE;
1366 collector->is_parallel = FALSE;
1368 collector->supports_cardtable = !collector->is_parallel;
1370 collector->alloc_heap = major_alloc_heap;
1371 collector->is_object_live = major_is_object_live;
1372 collector->alloc_small_pinned_obj = major_alloc_small_pinned_obj;
1373 collector->alloc_degraded = major_alloc_degraded;
1374 collector->copy_or_mark_object = major_copy_or_mark_object;
1375 collector->alloc_object = major_alloc_object;
1376 collector->free_pinned_object = free_pinned_object;
1377 collector->iterate_objects = major_iterate_objects;
1378 collector->free_non_pinned_object = major_free_non_pinned_object;
1379 collector->find_pin_queue_start_ends = major_find_pin_queue_start_ends;
1380 collector->pin_objects = major_pin_objects;
1381 #ifdef SGEN_HAVE_CARDTABLE
1382 collector->scan_card_table = major_scan_card_table;
1383 collector->iterate_live_block_ranges = (void*)(void*) major_iterate_live_block_ranges;
1385 collector->init_to_space = major_init_to_space;
1386 collector->sweep = major_sweep;
1387 collector->check_scan_starts = major_check_scan_starts;
1388 collector->dump_heap = major_dump_heap;
1389 collector->get_used_size = major_get_used_size;
1390 collector->start_nursery_collection = major_start_nursery_collection;
1391 collector->finish_nursery_collection = major_finish_nursery_collection;
1392 collector->finish_major_collection = major_finish_major_collection;
1393 collector->ptr_is_in_non_pinned_space = major_ptr_is_in_non_pinned_space;
1394 collector->obj_is_from_pinned_alloc = obj_is_from_pinned_alloc;
1395 collector->report_pinned_memory_usage = major_report_pinned_memory_usage;
1396 collector->get_num_major_sections = get_num_major_sections;
1398 collector->handle_gc_param = major_handle_gc_param;
1399 collector->print_gc_param_usage = major_print_gc_param_usage;
1401 collector->handle_gc_param = NULL;
1402 collector->print_gc_param_usage = NULL;
1405 FILL_COLLECTOR_COPY_OBJECT (collector);
1406 FILL_COLLECTOR_SCAN_OBJECT (collector);