mono/metadata/sgen-marksweep.c

   1 /*
   2  * sgen-marksweep.c: The Mark & Sweep major collector.
   3  *
   4  * Author:
   5  *      Mark Probst <mark.probst@gmail.com>
   6  *
   7  * Copyright 2009-2010 Novell, Inc.
   8  * Copyright (C) 2012 Xamarin Inc
   9  *
  10  * This library is free software; you can redistribute it and/or
  11  * modify it under the terms of the GNU Library General Public
  12  * License 2.0 as published by the Free Software Foundation;
  13  *
  14  * This library is distributed in the hope that it will be useful,
  15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  17  * Library General Public License for more details.
  18  *
  19  * You should have received a copy of the GNU Library General Public
  20  * License 2.0 along with this library; if not, write to the Free
  21  * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  22  */
  23
  24 #include "config.h"
  25
  26 #ifdef HAVE_SGEN_GC
  27
  28 #include <math.h>
  29 #include <errno.h>
  30
  31 #include "utils/mono-counters.h"
  32 #include "utils/mono-semaphore.h"
  33 #include "utils/mono-time.h"
  34 #include "metadata/object-internals.h"
  35 #include "metadata/profiler-private.h"
  36
  37 #include "metadata/sgen-gc.h"
  38 #include "metadata/sgen-protocol.h"
  39 #include "metadata/sgen-cardtable.h"
  40 #include "metadata/sgen-memory-governor.h"
  41 #include "metadata/sgen-layout-stats.h"
  42 #include "metadata/gc-internal.h"
  43 #include "metadata/sgen-pointer-queue.h"
  44 #include "metadata/sgen-pinning.h"
  45 #include "metadata/sgen-workers.h"
  46
  47 #define SGEN_HAVE_CONCURRENT_MARK
  48
  49 #define MS_BLOCK_SIZE   (16*1024)
  50 #define MS_BLOCK_SIZE_SHIFT     14
  51 #define MAJOR_SECTION_SIZE      MS_BLOCK_SIZE
  52 #define CARDS_PER_BLOCK (MS_BLOCK_SIZE / CARD_SIZE_IN_BYTES)
  53
  54 /*
  55  * Don't allocate single blocks, but alloc a contingent of this many
  56  * blocks in one swoop.  This must be a power of two.
  57  */
  58 #define MS_BLOCK_ALLOC_NUM      32
  59
  60 /*
  61  * Number of bytes before the first object in a block.  At the start
  62  * of a block is the MSBlockHeader, then opional padding, then come
  63  * the objects, so this must be >= sizeof (MSBlockHeader).
  64  */
  65 #define BLOCK_INFO_IN_HEADER
  66 #define MS_BLOCK_SKIP   ((sizeof (MSBlockHeader) + 15) & ~15)
  67
  68 #define MS_BLOCK_FREE   (MS_BLOCK_SIZE - MS_BLOCK_SKIP)
  69
  70 #define MS_NUM_MARK_WORDS       ((MS_BLOCK_SIZE / SGEN_ALLOC_ALIGN + sizeof (mword) * 8 - 1) / (sizeof (mword) * 8))
  71
  72 typedef struct _MSBlockInfo MSBlockInfo;
  73 struct _MSBlockInfo {
  74         int obj_size;
  75         int obj_size_index;
  76         unsigned int pinned : 1;
  77         unsigned int has_references : 1;
  78         unsigned int has_pinned : 1;    /* means cannot evacuate */
  79         unsigned int is_to_space : 1;
  80         unsigned int swept : 1;
  81 #ifndef BLOCK_INFO_IN_HEADER
  82         char *block;
  83 #endif
  84         void **free_list;
  85         MSBlockInfo *next_free;
  86         size_t pin_queue_first_entry;
  87         size_t pin_queue_last_entry;
  88 #ifdef SGEN_HAVE_CONCURRENT_MARK
  89         guint8 *cardtable_mod_union;
  90 #endif
  91         mword mark_words [MS_NUM_MARK_WORDS];
  92 };
  93
  94 #ifdef BLOCK_INFO_IN_HEADER
  95 #define MS_BLOCK_FOR_BLOCK_INFO(b)      ((char*)(b))
  96 #else
  97 #define MS_BLOCK_FOR_BLOCK_INFO(b)      ((b)->block)
  98 #endif
  99
 100 #define MS_BLOCK_OBJ(b,i)               (MS_BLOCK_FOR_BLOCK_INFO(b) + MS_BLOCK_SKIP + (b)->obj_size * (i))
 101 #define MS_BLOCK_OBJ_FOR_SIZE(b,i,obj_size)             (MS_BLOCK_FOR_BLOCK_INFO(b) + MS_BLOCK_SKIP + (obj_size) * (i))
 102 #define MS_BLOCK_DATA_FOR_OBJ(o)        ((char*)((mword)(o) & ~(mword)(MS_BLOCK_SIZE - 1)))
 103
 104 typedef struct {
 105 #ifdef BLOCK_INFO_IN_HEADER
 106         MSBlockInfo info;
 107 #else
 108         MSBlockInfo *info;
 109 #endif
 110 } MSBlockHeader;
 111
 112 #ifdef BLOCK_INFO_IN_HEADER
 113 #define MS_BLOCK_FOR_OBJ(o)             (&((MSBlockHeader*)MS_BLOCK_DATA_FOR_OBJ ((o)))->info)
 114 #else
 115 #define MS_BLOCK_FOR_OBJ(o)             (((MSBlockHeader*)MS_BLOCK_DATA_FOR_OBJ ((o)))->info)
 116 #endif
 117
 118 /* object index will always be small */
 119 #define MS_BLOCK_OBJ_INDEX(o,b) ((int)(((char*)(o) - (MS_BLOCK_FOR_BLOCK_INFO(b) + MS_BLOCK_SKIP)) / (b)->obj_size))
 120
 121 //casting to int is fine since blocks are 32k
 122 #define MS_CALC_MARK_BIT(w,b,o)         do {                            \
 123                 int i = ((int)((char*)(o) - MS_BLOCK_DATA_FOR_OBJ ((o)))) >> SGEN_ALLOC_ALIGN_BITS; \
 124                 if (sizeof (mword) == 4) {                              \
 125                         (w) = i >> 5;                                   \
 126                         (b) = i & 31;                                   \
 127                 } else {                                                \
 128                         (w) = i >> 6;                                   \
 129                         (b) = i & 63;                                   \
 130                 }                                                       \
 131         } while (0)
 132
 133 #define MS_MARK_BIT(bl,w,b)     ((bl)->mark_words [(w)] & (ONE_P << (b)))
 134 #define MS_SET_MARK_BIT(bl,w,b) ((bl)->mark_words [(w)] |= (ONE_P << (b)))
 135
 136 #define MS_OBJ_ALLOCED(o,b)     (*(void**)(o) && (*(char**)(o) < MS_BLOCK_FOR_BLOCK_INFO (b) || *(char**)(o) >= MS_BLOCK_FOR_BLOCK_INFO (b) + MS_BLOCK_SIZE))
 137
 138 #define MS_BLOCK_OBJ_SIZE_FACTOR        (sqrt (2.0))
 139
 140 /*
 141  * This way we can lookup block object size indexes for sizes up to
 142  * 256 bytes with a single load.
 143  */
 144 #define MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES      32
 145
 146 static int *block_obj_sizes;
 147 static int num_block_obj_sizes;
 148 static int fast_block_obj_size_indexes [MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES];
 149
 150 #define MS_BLOCK_FLAG_PINNED    1
 151 #define MS_BLOCK_FLAG_REFS      2
 152
 153 #define MS_BLOCK_TYPE_MAX       4
 154
 155 static gboolean *evacuate_block_obj_sizes;
 156 static float evacuation_threshold = 0.0f;
 157 #ifdef SGEN_HAVE_CONCURRENT_MARK
 158 static float concurrent_evacuation_threshold = 0.0f;
 159 static gboolean want_evacuation = FALSE;
 160 #endif
 161
 162 static gboolean lazy_sweep = TRUE;
 163 static gboolean have_swept;
 164
 165 #ifdef SGEN_HAVE_CONCURRENT_MARK
 166 static gboolean concurrent_mark;
 167 #endif
 168
 169 #define BLOCK_IS_TAGGED_HAS_REFERENCES(bl)      SGEN_POINTER_IS_TAGGED_1 ((bl))
 170 #define BLOCK_TAG_HAS_REFERENCES(bl)            SGEN_POINTER_TAG_1 ((bl))
 171 #define BLOCK_UNTAG_HAS_REFERENCES(bl)          SGEN_POINTER_UNTAG_1 ((bl))
 172
 173 #define BLOCK_TAG(bl)   ((bl)->has_references ? BLOCK_TAG_HAS_REFERENCES ((bl)) : (bl))
 174
 175 /* all allocated blocks in the system */
 176 static SgenPointerQueue allocated_blocks;
 177
 178 /* non-allocated block free-list */
 179 static void *empty_blocks = NULL;
 180 static size_t num_empty_blocks = 0;
 181
 182 #define FOREACH_BLOCK(bl)       { size_t __index; for (__index = 0; __index < allocated_blocks.next_slot; ++__index) { (bl) = BLOCK_UNTAG_HAS_REFERENCES (allocated_blocks.data [__index]);
 183 #define FOREACH_BLOCK_HAS_REFERENCES(bl,hr)     { size_t __index; for (__index = 0; __index < allocated_blocks.next_slot; ++__index) { (bl) = allocated_blocks.data [__index]; (hr) = BLOCK_IS_TAGGED_HAS_REFERENCES ((bl)); (bl) = BLOCK_UNTAG_HAS_REFERENCES ((bl));
 184 #define END_FOREACH_BLOCK       } }
 185 #define DELETE_BLOCK_IN_FOREACH()       (allocated_blocks.data [__index] = NULL)
 186
 187 static size_t num_major_sections = 0;
 188 /* one free block list for each block object size */
 189 static MSBlockInfo **free_block_lists [MS_BLOCK_TYPE_MAX];
 190
 191 static long long stat_major_blocks_alloced = 0;
 192 static long long stat_major_blocks_freed = 0;
 193 static long long stat_major_blocks_lazy_swept = 0;
 194 static long long stat_major_objects_evacuated = 0;
 195
 196 #if SIZEOF_VOID_P != 8
 197 static long long stat_major_blocks_freed_ideal = 0;
 198 static long long stat_major_blocks_freed_less_ideal = 0;
 199 static long long stat_major_blocks_freed_individual = 0;
 200 static long long stat_major_blocks_alloced_less_ideal = 0;
 201 #endif
 202
 203 #ifdef SGEN_COUNT_NUMBER_OF_MAJOR_OBJECTS_MARKED
 204 static long long num_major_objects_marked = 0;
 205 #define INC_NUM_MAJOR_OBJECTS_MARKED()  (++num_major_objects_marked)
 206 #else
 207 #define INC_NUM_MAJOR_OBJECTS_MARKED()
 208 #endif
 209
 210 #ifdef SGEN_HEAVY_BINARY_PROTOCOL
 211 static mono_mutex_t scanned_objects_list_lock;
 212 static SgenPointerQueue scanned_objects_list;
 213
 214 static void
 215 add_scanned_object (void *ptr)
 216 {
 217         if (!binary_protocol_is_enabled ())
 218                 return;
 219
 220         mono_mutex_lock (&scanned_objects_list_lock);
 221         sgen_pointer_queue_add (&scanned_objects_list, ptr);
 222         mono_mutex_unlock (&scanned_objects_list_lock);
 223 }
 224 #endif
 225
 226 static void
 227 sweep_block (MSBlockInfo *block, gboolean during_major_collection);
 228
 229 static int
 230 ms_find_block_obj_size_index (size_t size)
 231 {
 232         int i;
 233         SGEN_ASSERT (9, size <= SGEN_MAX_SMALL_OBJ_SIZE, "size %d is bigger than max small object size %d", size, SGEN_MAX_SMALL_OBJ_SIZE);
 234         for (i = 0; i < num_block_obj_sizes; ++i)
 235                 if (block_obj_sizes [i] >= size)
 236                         return i;
 237         g_error ("no object of size %d\n", size);
 238 }
 239
 240 #define FREE_BLOCKS_FROM(lists,p,r)     (lists [((p) ? MS_BLOCK_FLAG_PINNED : 0) | ((r) ? MS_BLOCK_FLAG_REFS : 0)])
 241 #define FREE_BLOCKS(p,r)                (FREE_BLOCKS_FROM (free_block_lists, (p), (r)))
 242
 243 #define MS_BLOCK_OBJ_SIZE_INDEX(s)                              \
 244         (((s)+7)>>3 < MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES ?      \
 245          fast_block_obj_size_indexes [((s)+7)>>3] :             \
 246          ms_find_block_obj_size_index ((s)))
 247
 248 static void*
 249 major_alloc_heap (mword nursery_size, mword nursery_align, int the_nursery_bits)
 250 {
 251         char *start;
 252         if (nursery_align)
 253                 start = sgen_alloc_os_memory_aligned (nursery_size, nursery_align, SGEN_ALLOC_HEAP | SGEN_ALLOC_ACTIVATE, "nursery");
 254         else
 255                 start = sgen_alloc_os_memory (nursery_size, SGEN_ALLOC_HEAP | SGEN_ALLOC_ACTIVATE, "nursery");
 256
 257         return start;
 258 }
 259
 260 static void
 261 update_heap_boundaries_for_block (MSBlockInfo *block)
 262 {
 263         sgen_update_heap_boundaries ((mword)MS_BLOCK_FOR_BLOCK_INFO (block), (mword)MS_BLOCK_FOR_BLOCK_INFO (block) + MS_BLOCK_SIZE);
 264 }
 265
 266 static void*
 267 ms_get_empty_block (void)
 268 {
 269         char *p;
 270         int i;
 271         void *block, *empty, *next;
 272
 273  retry:
 274         if (!empty_blocks) {
 275                 /*
 276                  * We try allocating MS_BLOCK_ALLOC_NUM blocks first.  If that's
 277                  * unsuccessful, we halve the number of blocks and try again, until we're at
 278                  * 1.  If that doesn't work, either, we assert.
 279                  */
 280                 int alloc_num = MS_BLOCK_ALLOC_NUM;
 281                 for (;;) {
 282                         p = sgen_alloc_os_memory_aligned (MS_BLOCK_SIZE * alloc_num, MS_BLOCK_SIZE, SGEN_ALLOC_HEAP | SGEN_ALLOC_ACTIVATE,
 283                                         alloc_num == 1 ? "major heap section" : NULL);
 284                         if (p)
 285                                 break;
 286                         alloc_num >>= 1;
 287                 }
 288
 289                 for (i = 0; i < alloc_num; ++i) {
 290                         block = p;
 291                         /*
 292                          * We do the free list update one after the
 293                          * other so that other threads can use the new
 294                          * blocks as quickly as possible.
 295                          */
 296                         do {
 297                                 empty = empty_blocks;
 298                                 *(void**)block = empty;
 299                         } while (SGEN_CAS_PTR ((gpointer*)&empty_blocks, block, empty) != empty);
 300                         p += MS_BLOCK_SIZE;
 301                 }
 302
 303                 SGEN_ATOMIC_ADD_P (num_empty_blocks, alloc_num);
 304
 305                 stat_major_blocks_alloced += alloc_num;
 306 #if SIZEOF_VOID_P != 8
 307                 if (alloc_num != MS_BLOCK_ALLOC_NUM)
 308                         stat_major_blocks_alloced_less_ideal += alloc_num;
 309 #endif
 310         }
 311
 312         do {
 313                 empty = empty_blocks;
 314                 if (!empty)
 315                         goto retry;
 316                 block = empty;
 317                 next = *(void**)block;
 318         } while (SGEN_CAS_PTR (&empty_blocks, next, empty) != empty);
 319
 320         SGEN_ATOMIC_ADD_P (num_empty_blocks, -1);
 321
 322         *(void**)block = NULL;
 323
 324         g_assert (!((mword)block & (MS_BLOCK_SIZE - 1)));
 325
 326         return block;
 327 }
 328
 329 static void
 330 ms_free_block (void *block)
 331 {
 332         void *empty;
 333
 334         sgen_memgov_release_space (MS_BLOCK_SIZE, SPACE_MAJOR);
 335         memset (block, 0, MS_BLOCK_SIZE);
 336
 337         do {
 338                 empty = empty_blocks;
 339                 *(void**)block = empty;
 340         } while (SGEN_CAS_PTR (&empty_blocks, block, empty) != empty);
 341
 342         SGEN_ATOMIC_ADD_P (num_empty_blocks, 1);
 343 }
 344
 345 //#define MARKSWEEP_CONSISTENCY_CHECK
 346
 347 #ifdef MARKSWEEP_CONSISTENCY_CHECK
 348 static void
 349 check_block_free_list (MSBlockInfo *block, int size, gboolean pinned)
 350 {
 351         MSBlockInfo *b;
 352
 353         for (; block; block = block->next_free) {
 354                 g_assert (block->obj_size == size);
 355                 g_assert ((pinned && block->pinned) || (!pinned && !block->pinned));
 356
 357                 /* blocks in the free lists must have at least
 358                    one free slot */
 359                 if (block->swept)
 360                         g_assert (block->free_list);
 361
 362                 /* the block must be in the allocated_blocks array */
 363                 g_assert (sgen_pointer_queue_find (&allocated_blocks, BLOCK_TAG (block)) != (size_t)-1);
 364         }
 365 }
 366
 367 static void
 368 check_empty_blocks (void)
 369 {
 370         void *p;
 371         size_t i = 0;
 372         for (p = empty_blocks; p; p = *(void**)p)
 373                 ++i;
 374         g_assert (i == num_empty_blocks);
 375 }
 376
 377 static void
 378 consistency_check (void)
 379 {
 380         MSBlockInfo *block;
 381         int i;
 382
 383         /* check all blocks */
 384         FOREACH_BLOCK (block) {
 385                 int count = MS_BLOCK_FREE / block->obj_size;
 386                 int num_free = 0;
 387                 void **free;
 388
 389                 /* check block header */
 390                 g_assert (((MSBlockHeader*)block->block)->info == block);
 391
 392                 /* count number of free slots */
 393                 for (i = 0; i < count; ++i) {
 394                         void **obj = (void**) MS_BLOCK_OBJ (block, i);
 395                         if (!MS_OBJ_ALLOCED (obj, block))
 396                                 ++num_free;
 397                 }
 398
 399                 /* check free list */
 400                 for (free = block->free_list; free; free = (void**)*free) {
 401                         g_assert (MS_BLOCK_FOR_OBJ (free) == block);
 402                         --num_free;
 403                 }
 404                 g_assert (num_free == 0);
 405
 406                 /* check all mark words are zero */
 407                 if (block->swept) {
 408                         for (i = 0; i < MS_NUM_MARK_WORDS; ++i)
 409                                 g_assert (block->mark_words [i] == 0);
 410                 }
 411         } END_FOREACH_BLOCK;
 412
 413         /* check free blocks */
 414         for (i = 0; i < num_block_obj_sizes; ++i) {
 415                 int j;
 416                 for (j = 0; j < MS_BLOCK_TYPE_MAX; ++j)
 417                         check_block_free_list (free_block_lists [j][i], block_obj_sizes [i], j & MS_BLOCK_FLAG_PINNED);
 418         }
 419
 420         check_empty_blocks ();
 421 }
 422 #endif
 423
 424 static gboolean
 425 ms_alloc_block (int size_index, gboolean pinned, gboolean has_references)
 426 {
 427         int size = block_obj_sizes [size_index];
 428         int count = MS_BLOCK_FREE / size;
 429         MSBlockInfo *info;
 430         MSBlockInfo **free_blocks = FREE_BLOCKS (pinned, has_references);
 431         char *obj_start;
 432         int i;
 433
 434         if (!sgen_memgov_try_alloc_space (MS_BLOCK_SIZE, SPACE_MAJOR))
 435                 return FALSE;
 436
 437 #ifdef BLOCK_INFO_IN_HEADER
 438         info = (MSBlockInfo*)ms_get_empty_block ();
 439 #else
 440         {
 441                 MSBlockHeader *header;
 442                 info = sgen_alloc_internal (INTERNAL_MEM_MS_BLOCK_INFO);
 443                 info->block = ms_get_empty_block ();
 444                 header = (MSBlockHeader*)info->block;
 445                 header->info = info;
 446         }
 447 #endif
 448
 449         SGEN_ASSERT (9, count >= 2, "block with %d objects, it must hold at least 2", count);
 450
 451         info->obj_size = size;
 452         info->obj_size_index = size_index;
 453         info->pinned = pinned;
 454         info->has_references = has_references;
 455         info->has_pinned = pinned;
 456         /*
 457          * Blocks that are to-space are not evacuated from.  During an major collection
 458          * blocks are allocated for two reasons: evacuating objects from the nursery and
 459          * evacuating them from major blocks marked for evacuation.  In both cases we don't
 460          * want further evacuation.
 461          */
 462         info->is_to_space = (sgen_get_current_collection_generation () == GENERATION_OLD);
 463         info->swept = 1;
 464 #ifdef SGEN_HAVE_CONCURRENT_MARK
 465         info->cardtable_mod_union = NULL;
 466 #endif
 467
 468         update_heap_boundaries_for_block (info);
 469
 470         /* build free list */
 471         obj_start = MS_BLOCK_FOR_BLOCK_INFO (info) + MS_BLOCK_SKIP;
 472         info->free_list = (void**)obj_start;
 473         /* we're skipping the last one - it must be nulled */
 474         for (i = 0; i < count - 1; ++i) {
 475                 char *next_obj_start = obj_start + size;
 476                 *(void**)obj_start = next_obj_start;
 477                 obj_start = next_obj_start;
 478         }
 479         /* the last one */
 480         *(void**)obj_start = NULL;
 481
 482         info->next_free = free_blocks [size_index];
 483         free_blocks [size_index] = info;
 484
 485         sgen_pointer_queue_add (&allocated_blocks, BLOCK_TAG (info));
 486
 487         ++num_major_sections;
 488         return TRUE;
 489 }
 490
 491 static gboolean
 492 obj_is_from_pinned_alloc (char *ptr)
 493 {
 494         MSBlockInfo *block;
 495
 496         FOREACH_BLOCK (block) {
 497                 if (ptr >= MS_BLOCK_FOR_BLOCK_INFO (block) && ptr <= MS_BLOCK_FOR_BLOCK_INFO (block) + MS_BLOCK_SIZE)
 498                         return block->pinned;
 499         } END_FOREACH_BLOCK;
 500         return FALSE;
 501 }
 502
 503 static void*
 504 unlink_slot_from_free_list_uncontested (MSBlockInfo **free_blocks, int size_index)
 505 {
 506         MSBlockInfo *block;
 507         void *obj;
 508
 509         block = free_blocks [size_index];
 510         SGEN_ASSERT (9, block, "no free block to unlink from free_blocks %p size_index %d", free_blocks, size_index);
 511
 512         if (G_UNLIKELY (!block->swept)) {
 513                 stat_major_blocks_lazy_swept ++;
 514                 sweep_block (block, FALSE);
 515         }
 516
 517         obj = block->free_list;
 518         SGEN_ASSERT (9, obj, "block %p in free list had no available object to alloc from", block);
 519
 520         block->free_list = *(void**)obj;
 521         if (!block->free_list) {
 522                 free_blocks [size_index] = block->next_free;
 523                 block->next_free = NULL;
 524         }
 525
 526         return obj;
 527 }
 528
 529 static void*
 530 alloc_obj (MonoVTable *vtable, size_t size, gboolean pinned, gboolean has_references)
 531 {
 532         int size_index = MS_BLOCK_OBJ_SIZE_INDEX (size);
 533         MSBlockInfo **free_blocks = FREE_BLOCKS (pinned, has_references);
 534         void *obj;
 535
 536         if (!free_blocks [size_index]) {
 537                 if (G_UNLIKELY (!ms_alloc_block (size_index, pinned, has_references)))
 538                         return NULL;
 539         }
 540
 541         obj = unlink_slot_from_free_list_uncontested (free_blocks, size_index);
 542
 543         *(MonoVTable**)obj = vtable;
 544
 545         return obj;
 546 }
 547
 548 static void*
 549 major_alloc_object (MonoVTable *vtable, size_t size, gboolean has_references)
 550 {
 551         return alloc_obj (vtable, size, FALSE, has_references);
 552 }
 553
 554 /*
 555  * We're not freeing the block if it's empty.  We leave that work for
 556  * the next major collection.
 557  *
 558  * This is just called from the domain clearing code, which runs in a
 559  * single thread and has the GC lock, so we don't need an extra lock.
 560  */
 561 static void
 562 free_object (char *obj, size_t size, gboolean pinned)
 563 {
 564         MSBlockInfo *block = MS_BLOCK_FOR_OBJ (obj);
 565         int word, bit;
 566
 567         if (!block->swept)
 568                 sweep_block (block, FALSE);
 569         SGEN_ASSERT (9, (pinned && block->pinned) || (!pinned && !block->pinned), "free-object pinning mixup object %p pinned %d block %p pinned %d", obj, pinned, block, block->pinned);
 570         SGEN_ASSERT (9, MS_OBJ_ALLOCED (obj, block), "object %p is already free", obj);
 571         MS_CALC_MARK_BIT (word, bit, obj);
 572         SGEN_ASSERT (9, !MS_MARK_BIT (block, word, bit), "object %p has mark bit set");
 573         if (!block->free_list) {
 574                 MSBlockInfo **free_blocks = FREE_BLOCKS (pinned, block->has_references);
 575                 int size_index = MS_BLOCK_OBJ_SIZE_INDEX (size);
 576                 SGEN_ASSERT (9, !block->next_free, "block %p doesn't have a free-list of object but belongs to a free-list of blocks");
 577                 block->next_free = free_blocks [size_index];
 578                 free_blocks [size_index] = block;
 579         }
 580         memset (obj, 0, size);
 581         *(void**)obj = block->free_list;
 582         block->free_list = (void**)obj;
 583 }
 584
 585 static void
 586 major_free_non_pinned_object (char *obj, size_t size)
 587 {
 588         free_object (obj, size, FALSE);
 589 }
 590
 591 /* size is a multiple of SGEN_ALLOC_ALIGN */
 592 static void*
 593 major_alloc_small_pinned_obj (MonoVTable *vtable, size_t size, gboolean has_references)
 594 {
 595         void *res;
 596
 597         res = alloc_obj (vtable, size, TRUE, has_references);
 598          /*If we failed to alloc memory, we better try releasing memory
 599           *as pinned alloc is requested by the runtime.
 600           */
 601          if (!res) {
 602                 sgen_perform_collection (0, GENERATION_OLD, "pinned alloc failure", TRUE);
 603                 res = alloc_obj (vtable, size, TRUE, has_references);
 604          }
 605          return res;
 606 }
 607
 608 static void
 609 free_pinned_object (char *obj, size_t size)
 610 {
 611         free_object (obj, size, TRUE);
 612 }
 613
 614 /*
 615  * size is already rounded up and we hold the GC lock.
 616  */
 617 static void*
 618 major_alloc_degraded (MonoVTable *vtable, size_t size)
 619 {
 620         void *obj;
 621         size_t old_num_sections;
 622
 623         old_num_sections = num_major_sections;
 624
 625         obj = alloc_obj (vtable, size, FALSE, SGEN_VTABLE_HAS_REFERENCES (vtable));
 626         if (G_LIKELY (obj)) {
 627                 HEAVY_STAT (++stat_objects_alloced_degraded);
 628                 HEAVY_STAT (stat_bytes_alloced_degraded += size);
 629                 g_assert (num_major_sections >= old_num_sections);
 630                 sgen_register_major_sections_alloced (num_major_sections - old_num_sections);
 631         }
 632         return obj;
 633 }
 634
 635 /*
 636  * obj is some object.  If it's not in the major heap (i.e. if it's in
 637  * the nursery or LOS), return FALSE.  Otherwise return whether it's
 638  * been marked or copied.
 639  */
 640 static gboolean
 641 major_is_object_live (char *obj)
 642 {
 643         MSBlockInfo *block;
 644         int word, bit;
 645         mword objsize;
 646
 647         if (sgen_ptr_in_nursery (obj))
 648                 return FALSE;
 649
 650         objsize = SGEN_ALIGN_UP (sgen_safe_object_get_size ((MonoObject*)obj));
 651
 652         /* LOS */
 653         if (objsize > SGEN_MAX_SMALL_OBJ_SIZE)
 654                 return FALSE;
 655
 656         /* now we know it's in a major block */
 657         block = MS_BLOCK_FOR_OBJ (obj);
 658         SGEN_ASSERT (9, !block->pinned, "block %p is pinned, BTW why is this bad?");
 659         MS_CALC_MARK_BIT (word, bit, obj);
 660         return MS_MARK_BIT (block, word, bit) ? TRUE : FALSE;
 661 }
 662
 663 static gboolean
 664 major_ptr_is_in_non_pinned_space (char *ptr, char **start)
 665 {
 666         MSBlockInfo *block;
 667
 668         FOREACH_BLOCK (block) {
 669                 if (ptr >= MS_BLOCK_FOR_BLOCK_INFO (block) && ptr <= MS_BLOCK_FOR_BLOCK_INFO (block) + MS_BLOCK_SIZE) {
 670                         int count = MS_BLOCK_FREE / block->obj_size;
 671                         int i;
 672
 673                         *start = NULL;
 674                         for (i = 0; i <= count; ++i) {
 675                                 if (ptr >= MS_BLOCK_OBJ (block, i) && ptr < MS_BLOCK_OBJ (block, i + 1)) {
 676                                         *start = MS_BLOCK_OBJ (block, i);
 677                                         break;
 678                                 }
 679                         }
 680                         return !block->pinned;
 681                 }
 682         } END_FOREACH_BLOCK;
 683         return FALSE;
 684 }
 685
 686 static void
 687 major_iterate_objects (IterateObjectsFlags flags, IterateObjectCallbackFunc callback, void *data)
 688 {
 689         gboolean sweep = flags & ITERATE_OBJECTS_SWEEP;
 690         gboolean non_pinned = flags & ITERATE_OBJECTS_NON_PINNED;
 691         gboolean pinned = flags & ITERATE_OBJECTS_PINNED;
 692         MSBlockInfo *block;
 693
 694         FOREACH_BLOCK (block) {
 695                 int count = MS_BLOCK_FREE / block->obj_size;
 696                 int i;
 697
 698                 if (block->pinned && !pinned)
 699                         continue;
 700                 if (!block->pinned && !non_pinned)
 701                         continue;
 702                 if (sweep && lazy_sweep) {
 703                         sweep_block (block, FALSE);
 704                         SGEN_ASSERT (0, block->swept, "Block must be swept after sweeping");
 705                 }
 706
 707                 for (i = 0; i < count; ++i) {
 708                         void **obj = (void**) MS_BLOCK_OBJ (block, i);
 709                         if (!block->swept) {
 710                                 int word, bit;
 711                                 MS_CALC_MARK_BIT (word, bit, obj);
 712                                 if (!MS_MARK_BIT (block, word, bit))
 713                                         continue;
 714                         }
 715                         if (MS_OBJ_ALLOCED (obj, block))
 716                                 callback ((char*)obj, block->obj_size, data);
 717                 }
 718         } END_FOREACH_BLOCK;
 719 }
 720
 721 static gboolean
 722 major_is_valid_object (char *object)
 723 {
 724         MSBlockInfo *block;
 725
 726         FOREACH_BLOCK (block) {
 727                 int idx;
 728                 char *obj;
 729
 730                 if ((MS_BLOCK_FOR_BLOCK_INFO (block) > object) || ((MS_BLOCK_FOR_BLOCK_INFO (block) + MS_BLOCK_SIZE) <= object))
 731                         continue;
 732
 733                 idx = MS_BLOCK_OBJ_INDEX (object, block);
 734                 obj = (char*)MS_BLOCK_OBJ (block, idx);
 735                 if (obj != object)
 736                         return FALSE;
 737                 return MS_OBJ_ALLOCED (obj, block);
 738         } END_FOREACH_BLOCK;
 739
 740         return FALSE;
 741 }
 742
 743
 744 static MonoVTable*
 745 major_describe_pointer (char *ptr)
 746 {
 747         MSBlockInfo *block;
 748
 749         FOREACH_BLOCK (block) {
 750                 int idx;
 751                 char *obj;
 752                 gboolean live;
 753                 MonoVTable *vtable;
 754                 int w, b;
 755                 gboolean marked;
 756
 757                 if ((MS_BLOCK_FOR_BLOCK_INFO (block) > ptr) || ((MS_BLOCK_FOR_BLOCK_INFO (block) + MS_BLOCK_SIZE) <= ptr))
 758                         continue;
 759
 760                 SGEN_LOG (0, "major-ptr (block %p sz %d pin %d ref %d)\n",
 761                         MS_BLOCK_FOR_BLOCK_INFO (block), block->obj_size, block->pinned, block->has_references);
 762
 763                 idx = MS_BLOCK_OBJ_INDEX (ptr, block);
 764                 obj = (char*)MS_BLOCK_OBJ (block, idx);
 765                 live = MS_OBJ_ALLOCED (obj, block);
 766                 vtable = live ? (MonoVTable*)SGEN_LOAD_VTABLE (obj) : NULL;
 767
 768                 MS_CALC_MARK_BIT (w, b, obj);
 769                 marked = MS_MARK_BIT (block, w, b);
 770
 771                 if (obj == ptr) {
 772                         SGEN_LOG (0, "\t(");
 773                         if (live)
 774                                 SGEN_LOG (0, "object");
 775                         else
 776                                 SGEN_LOG (0, "dead-object");
 777                 } else {
 778                         if (live)
 779                                 SGEN_LOG (0, "interior-ptr offset %td", ptr - obj);
 780                         else
 781                                 SGEN_LOG (0, "dead-interior-ptr offset %td", ptr - obj);
 782                 }
 783
 784                 SGEN_LOG (0, " marked %d)\n", marked ? 1 : 0);
 785
 786                 return vtable;
 787         } END_FOREACH_BLOCK;
 788
 789         return NULL;
 790 }
 791
 792 static void
 793 major_check_scan_starts (void)
 794 {
 795 }
 796
 797 static void
 798 major_dump_heap (FILE *heap_dump_file)
 799 {
 800         MSBlockInfo *block;
 801         int *slots_available = alloca (sizeof (int) * num_block_obj_sizes);
 802         int *slots_used = alloca (sizeof (int) * num_block_obj_sizes);
 803         int i;
 804
 805         for (i = 0; i < num_block_obj_sizes; ++i)
 806                 slots_available [i] = slots_used [i] = 0;
 807
 808         FOREACH_BLOCK (block) {
 809                 int index = ms_find_block_obj_size_index (block->obj_size);
 810                 int count = MS_BLOCK_FREE / block->obj_size;
 811
 812                 slots_available [index] += count;
 813                 for (i = 0; i < count; ++i) {
 814                         if (MS_OBJ_ALLOCED (MS_BLOCK_OBJ (block, i), block))
 815                                 ++slots_used [index];
 816                 }
 817         } END_FOREACH_BLOCK;
 818
 819         fprintf (heap_dump_file, "<occupancies>\n");
 820         for (i = 0; i < num_block_obj_sizes; ++i) {
 821                 fprintf (heap_dump_file, "<occupancy size=\"%d\" available=\"%d\" used=\"%d\" />\n",
 822                                 block_obj_sizes [i], slots_available [i], slots_used [i]);
 823         }
 824         fprintf (heap_dump_file, "</occupancies>\n");
 825
 826         FOREACH_BLOCK (block) {
 827                 int count = MS_BLOCK_FREE / block->obj_size;
 828                 int i;
 829                 int start = -1;
 830
 831                 fprintf (heap_dump_file, "<section type=\"%s\" size=\"%zu\">\n", "old", (size_t)MS_BLOCK_FREE);
 832
 833                 for (i = 0; i <= count; ++i) {
 834                         if ((i < count) && MS_OBJ_ALLOCED (MS_BLOCK_OBJ (block, i), block)) {
 835                                 if (start < 0)
 836                                         start = i;
 837                         } else {
 838                                 if (start >= 0) {
 839                                         sgen_dump_occupied (MS_BLOCK_OBJ (block, start), MS_BLOCK_OBJ (block, i), MS_BLOCK_FOR_BLOCK_INFO (block));
 840                                         start = -1;
 841                                 }
 842                         }
 843                 }
 844
 845                 fprintf (heap_dump_file, "</section>\n");
 846         } END_FOREACH_BLOCK;
 847 }
 848
 849 #define LOAD_VTABLE     SGEN_LOAD_VTABLE
 850
 851 #ifdef SGEN_MARK_ON_ENQUEUE
 852 #define MS_MARK_OBJECT_AND_ENQUEUE_CHECKED(obj,desc,block,queue) do {   \
 853                 int __word, __bit;                                      \
 854                 MS_CALC_MARK_BIT (__word, __bit, (obj));                \
 855                 if (!MS_MARK_BIT ((block), __word, __bit) && MS_OBJ_ALLOCED ((obj), (block))) { \
 856                         MS_SET_MARK_BIT ((block), __word, __bit);       \
 857                         if ((block)->has_references)                    \
 858                                 GRAY_OBJECT_ENQUEUE ((queue), (obj), (desc)); \
 859                         binary_protocol_mark ((obj), (gpointer)LOAD_VTABLE ((obj)), sgen_safe_object_get_size ((MonoObject*)(obj))); \
 860                         INC_NUM_MAJOR_OBJECTS_MARKED ();                \
 861                 }                                                       \
 862         } while (0)
 863 #define MS_MARK_OBJECT_AND_ENQUEUE(obj,desc,block,queue) do {           \
 864                 int __word, __bit;                                      \
 865                 MS_CALC_MARK_BIT (__word, __bit, (obj));                \
 866                 SGEN_ASSERT (9, MS_OBJ_ALLOCED ((obj), (block)), "object %p not allocated", obj); \
 867                 if (!MS_MARK_BIT ((block), __word, __bit)) {            \
 868                         MS_SET_MARK_BIT ((block), __word, __bit);       \
 869                         if ((block)->has_references)                    \
 870                                 GRAY_OBJECT_ENQUEUE ((queue), (obj), (desc)); \
 871                         binary_protocol_mark ((obj), (gpointer)LOAD_VTABLE ((obj)), sgen_safe_object_get_size ((MonoObject*)(obj))); \
 872                         INC_NUM_MAJOR_OBJECTS_MARKED ();                \
 873                 }                                                       \
 874         } while (0)
 875 #define MS_PAR_MARK_OBJECT_AND_ENQUEUE(obj,desc,block,queue) do {       \
 876                 int __word, __bit;                                      \
 877                 gboolean __was_marked;                                  \
 878                 SGEN_ASSERT (9, MS_OBJ_ALLOCED ((obj), (block)), "object %p not allocated", obj); \
 879                 MS_CALC_MARK_BIT (__word, __bit, (obj));                \
 880                 MS_PAR_SET_MARK_BIT (__was_marked, (block), __word, __bit); \
 881                 if (!__was_marked) {                                    \
 882                         if ((block)->has_references)                    \
 883                                 GRAY_OBJECT_ENQUEUE ((queue), (obj), (desc)); \
 884                         binary_protocol_mark ((obj), (gpointer)LOAD_VTABLE ((obj)), sgen_safe_object_get_size ((MonoObject*)(obj))); \
 885                         INC_NUM_MAJOR_OBJECTS_MARKED ();                \
 886                 }                                                       \
 887         } while (0)
 888 #else
 889 #define MS_MARK_OBJECT_AND_ENQUEUE_CHECKED(obj,desc,block,queue) do {   \
 890                 int __word, __bit;                                      \
 891                 SGEN_ASSERT (0, sgen_get_current_collection_generation () == GENERATION_OLD, "Can't majorly enqueue objects when doing minor collection"); \
 892                 MS_CALC_MARK_BIT (__word, __bit, (obj));                \
 893                 if (MS_OBJ_ALLOCED ((obj), (block))) { \
 894                         if ((block)->has_references) {                  \
 895                                 GRAY_OBJECT_ENQUEUE ((queue), (obj), (desc)); \
 896                         } else {                                        \
 897                                 MS_SET_MARK_BIT ((block), __word, __bit); \
 898                                 binary_protocol_mark ((obj), (gpointer)LOAD_VTABLE ((obj)), sgen_safe_object_get_size ((MonoObject*)(obj))); \
 899                         }                                               \
 900                         INC_NUM_MAJOR_OBJECTS_MARKED ();                \
 901                 }                                                       \
 902         } while (0)
 903 #define MS_MARK_OBJECT_AND_ENQUEUE(obj,desc,block,queue) do {           \
 904                 int __word, __bit;                                      \
 905                 SGEN_ASSERT (0, sgen_get_current_collection_generation () == GENERATION_OLD, "Can't majorly enqueue objects when doing minor collection"); \
 906                 MS_CALC_MARK_BIT (__word, __bit, (obj));                \
 907                 SGEN_ASSERT (9, MS_OBJ_ALLOCED ((obj), (block)), "object %p not allocated", obj);       \
 908                 {               \
 909                         if ((block)->has_references) {                  \
 910                                 GRAY_OBJECT_ENQUEUE ((queue), (obj), (desc)); \
 911                         } else {                                        \
 912                                 MS_SET_MARK_BIT ((block), __word, __bit); \
 913                                 binary_protocol_mark ((obj), (gpointer)LOAD_VTABLE ((obj)), sgen_safe_object_get_size ((MonoObject*)(obj))); \
 914                         }                                               \
 915                         INC_NUM_MAJOR_OBJECTS_MARKED ();                \
 916                 }                                                       \
 917         } while (0)
 918 #endif
 919
 920 static void
 921 pin_major_object (char *obj, SgenGrayQueue *queue)
 922 {
 923         MSBlockInfo *block;
 924
 925 #ifdef SGEN_HAVE_CONCURRENT_MARK
 926         if (concurrent_mark)
 927                 g_assert_not_reached ();
 928 #endif
 929
 930         block = MS_BLOCK_FOR_OBJ (obj);
 931         block->has_pinned = TRUE;
 932         MS_MARK_OBJECT_AND_ENQUEUE (obj, sgen_obj_get_descriptor (obj), block, queue);
 933 }
 934
 935 #include "sgen-major-copy-object.h"
 936
 937 #ifdef SGEN_HAVE_CONCURRENT_MARK
 938 static void
 939 major_copy_or_mark_object_concurrent (void **ptr, void *obj, SgenGrayQueue *queue)
 940 {
 941         SGEN_ASSERT (9, sgen_concurrent_collection_in_progress (), "Why are we scanning concurrently when there's no concurrent collection on?");
 942         SGEN_ASSERT (9, !sgen_workers_are_working () || sgen_is_worker_thread (mono_native_thread_id_get ()), "We must not scan from two threads at the same time!");
 943
 944         g_assert (!SGEN_OBJECT_IS_FORWARDED (obj));
 945
 946         if (!sgen_ptr_in_nursery (obj)) {
 947                 mword objsize;
 948
 949                 objsize = SGEN_ALIGN_UP (sgen_safe_object_get_size ((MonoObject*)obj));
 950
 951                 if (objsize <= SGEN_MAX_SMALL_OBJ_SIZE) {
 952                         MSBlockInfo *block = MS_BLOCK_FOR_OBJ (obj);
 953                         MS_MARK_OBJECT_AND_ENQUEUE (obj, sgen_obj_get_descriptor (obj), block, queue);
 954                 } else {
 955                         if (sgen_los_object_is_pinned (obj))
 956                                 return;
 957
 958 #ifdef ENABLE_DTRACE
 959                         if (G_UNLIKELY (MONO_GC_OBJ_PINNED_ENABLED ())) {
 960                                 MonoVTable *vt = (MonoVTable*)SGEN_LOAD_VTABLE (obj);
 961                                 MONO_GC_OBJ_PINNED ((mword)obj, sgen_safe_object_get_size (obj), vt->klass->name_space, vt->klass->name, GENERATION_OLD);
 962                         }
 963 #endif
 964
 965                         sgen_los_pin_object (obj);
 966                         if (SGEN_OBJECT_HAS_REFERENCES (obj))
 967                                 GRAY_OBJECT_ENQUEUE (queue, obj, sgen_obj_get_descriptor (obj));
 968                         INC_NUM_MAJOR_OBJECTS_MARKED ();
 969                 }
 970         }
 971 }
 972 #endif
 973
 974 static void
 975 major_copy_or_mark_object (void **ptr, void *obj, SgenGrayQueue *queue)
 976 {
 977         MSBlockInfo *block;
 978
 979         HEAVY_STAT (++stat_copy_object_called_major);
 980
 981         SGEN_ASSERT (9, !sgen_concurrent_collection_in_progress (), "Why are we scanning non-concurrently when there's a concurrent collection on?");
 982
 983         SGEN_ASSERT (9, obj, "null object from pointer %p", ptr);
 984         SGEN_ASSERT (9, current_collection_generation == GENERATION_OLD, "old gen parallel allocator called from a %d collection", current_collection_generation);
 985
 986         if (sgen_ptr_in_nursery (obj)) {
 987                 int word, bit;
 988                 char *forwarded, *old_obj;
 989
 990                 if ((forwarded = SGEN_OBJECT_IS_FORWARDED (obj))) {
 991                         SGEN_UPDATE_REFERENCE (ptr, forwarded);
 992                         return;
 993                 }
 994                 if (SGEN_OBJECT_IS_PINNED (obj))
 995                         return;
 996
 997                 /* An object in the nursery To Space has already been copied and grayed. Nothing to do. */
 998                 if (sgen_nursery_is_to_space (obj))
 999                         return;
1000
1001                 HEAVY_STAT (++stat_objects_copied_major);
1002
1003         do_copy_object:
1004                 old_obj = obj;
1005                 obj = copy_object_no_checks (obj, queue);
1006                 if (G_UNLIKELY (old_obj == obj)) {
1007                         /*If we fail to evacuate an object we just stop doing it for a given block size as all other will surely fail too.*/
1008                         if (!sgen_ptr_in_nursery (obj)) {
1009                                 int size_index;
1010                                 block = MS_BLOCK_FOR_OBJ (obj);
1011                                 size_index = block->obj_size_index;
1012                                 evacuate_block_obj_sizes [size_index] = FALSE;
1013                                 MS_MARK_OBJECT_AND_ENQUEUE (obj, sgen_obj_get_descriptor (obj), block, queue);
1014                         }
1015                         return;
1016                 }
1017                 SGEN_UPDATE_REFERENCE (ptr, obj);
1018
1019                 /*
1020                  * FIXME: See comment for copy_object_no_checks().  If
1021                  * we have that, we can let the allocation function
1022                  * give us the block info, too, and we won't have to
1023                  * re-fetch it.
1024                  *
1025                  * FIXME (2): We should rework this to avoid all those nursery checks.
1026                  */
1027                 /*
1028                  * For the split nursery allocator the object might
1029                  * still be in the nursery despite having being
1030                  * promoted, in which case we can't mark it.
1031                  */
1032                 if (!sgen_ptr_in_nursery (obj)) {
1033                         block = MS_BLOCK_FOR_OBJ (obj);
1034                         MS_CALC_MARK_BIT (word, bit, obj);
1035                         SGEN_ASSERT (9, !MS_MARK_BIT (block, word, bit), "object %p already marked", obj);
1036 #ifndef SGEN_MARK_ON_ENQUEUE
1037                         if (!SGEN_VTABLE_HAS_REFERENCES (LOAD_VTABLE (obj)))
1038 #endif
1039                         {
1040                                 MS_SET_MARK_BIT (block, word, bit);
1041                                 binary_protocol_mark (obj, (gpointer)LOAD_VTABLE (obj), sgen_safe_object_get_size ((MonoObject*)obj));
1042                         }
1043                 }
1044         } else {
1045                 char *forwarded;
1046                 mword objsize;
1047
1048                 /*
1049                  * If we have don't have a fixed heap we cannot know
1050                  * whether an object is in the LOS or in the small
1051                  * object major heap without checking its size.  To do
1052                  * that, however, we need to know that we actually
1053                  * have a valid object, not a forwarding pointer, so
1054                  * we have to do this check first.
1055                  */
1056                 if ((forwarded = SGEN_OBJECT_IS_FORWARDED (obj))) {
1057                         SGEN_UPDATE_REFERENCE (ptr, forwarded);
1058                         return;
1059                 }
1060
1061                 objsize = SGEN_ALIGN_UP (sgen_safe_object_get_size ((MonoObject*)obj));
1062
1063                 if (objsize <= SGEN_MAX_SMALL_OBJ_SIZE) {
1064                         int size_index;
1065                         gboolean evacuate;
1066
1067                         block = MS_BLOCK_FOR_OBJ (obj);
1068                         size_index = block->obj_size_index;
1069                         evacuate = evacuate_block_obj_sizes [size_index];
1070
1071                         if (evacuate && !block->has_pinned) {
1072                                 g_assert (!SGEN_OBJECT_IS_PINNED (obj));
1073                                 if (block->is_to_space)
1074                                         return;
1075                                 HEAVY_STAT (++stat_major_objects_evacuated);
1076                                 goto do_copy_object;
1077                         } else {
1078                                 MS_MARK_OBJECT_AND_ENQUEUE (obj, sgen_obj_get_descriptor (obj), block, queue);
1079                         }
1080                 } else {
1081                         if (sgen_los_object_is_pinned (obj))
1082                                 return;
1083                         binary_protocol_pin (obj, (gpointer)SGEN_LOAD_VTABLE (obj), sgen_safe_object_get_size ((MonoObject*)obj));
1084
1085 #ifdef ENABLE_DTRACE
1086                         if (G_UNLIKELY (MONO_GC_OBJ_PINNED_ENABLED ())) {
1087                                 MonoVTable *vt = (MonoVTable*)SGEN_LOAD_VTABLE (obj);
1088                                 MONO_GC_OBJ_PINNED ((mword)obj, sgen_safe_object_get_size (obj), vt->klass->name_space, vt->klass->name, GENERATION_OLD);
1089                         }
1090 #endif
1091
1092 #ifdef SGEN_MARK_ON_ENQUEUE
1093                         sgen_los_pin_object (obj);
1094 #endif
1095                         if (SGEN_OBJECT_HAS_REFERENCES (obj))
1096                                 GRAY_OBJECT_ENQUEUE (queue, obj, sgen_obj_get_descriptor (obj));
1097                 }
1098         }
1099 }
1100
1101 static void
1102 major_copy_or_mark_object_canonical (void **ptr, SgenGrayQueue *queue)
1103 {
1104         major_copy_or_mark_object (ptr, *ptr, queue);
1105 }
1106
1107 #ifdef SGEN_HAVE_CONCURRENT_MARK
1108 static void
1109 major_copy_or_mark_object_concurrent_canonical (void **ptr, SgenGrayQueue *queue)
1110 {
1111         major_copy_or_mark_object_concurrent (ptr, *ptr, queue);
1112 }
1113 #endif
1114
1115 static long long
1116 major_get_and_reset_num_major_objects_marked (void)
1117 {
1118 #ifdef SGEN_COUNT_NUMBER_OF_MAJOR_OBJECTS_MARKED
1119         long long num = num_major_objects_marked;
1120         num_major_objects_marked = 0;
1121         return num;
1122 #else
1123         return 0;
1124 #endif
1125 }
1126
1127 #include "sgen-major-scan-object.h"
1128
1129 #ifdef SGEN_HAVE_CONCURRENT_MARK
1130 #define SCAN_FOR_CONCURRENT_MARK
1131 #include "sgen-major-scan-object.h"
1132 #undef SCAN_FOR_CONCURRENT_MARK
1133 #endif
1134
1135 #if !defined (FIXED_HEAP) && !defined (SGEN_PARALLEL_MARK)
1136 //#define USE_PREFETCH_QUEUE
1137
1138 #ifdef HEAVY_STATISTICS
1139 static long long stat_optimized_copy_object_called;
1140 static long long stat_optimized_nursery;
1141 static long long stat_optimized_nursery_forwarded;
1142 static long long stat_optimized_nursery_pinned;
1143 static long long stat_optimized_major_mark;
1144 static long long stat_optimized_major_mark_small;
1145 static long long stat_optimized_major_mark_large;
1146 static long long stat_optimized_major_scan;
1147 static long long stat_optimized_major_scan_fast;
1148 static long long stat_optimized_major_scan_slow;
1149
1150 static long long stat_drain_prefetch_fills;
1151 static long long stat_drain_prefetch_fill_failures;
1152 static long long stat_drain_loops;
1153 #endif
1154
1155 /* Returns whether the object is still in the nursery. */
1156 static gboolean
1157 optimized_copy_or_mark_object (void **ptr, void *obj, SgenGrayQueue *queue)
1158 {
1159 #ifdef SGEN_MARK_ON_ENQUEUE
1160         MSBlockInfo *block;
1161 #endif
1162
1163         HEAVY_STAT (++stat_optimized_copy_object_called);
1164
1165         SGEN_ASSERT (9, obj, "null object from pointer %p", ptr);
1166         SGEN_ASSERT (9, current_collection_generation == GENERATION_OLD, "old gen parallel allocator called from a %d collection", current_collection_generation);
1167
1168         if (sgen_ptr_in_nursery (obj)) {
1169 #ifdef SGEN_MARK_ON_ENQUEUE
1170                 int word, bit;
1171 #endif
1172                 char *forwarded, *old_obj;
1173                 mword vtable_word = *(mword*)obj;
1174
1175                 HEAVY_STAT (++stat_optimized_nursery);
1176
1177                 if (SGEN_VTABLE_IS_PINNED (vtable_word)) {
1178                         HEAVY_STAT (++stat_optimized_nursery_pinned);
1179                         return TRUE;
1180                 }
1181                 if ((forwarded = SGEN_VTABLE_IS_FORWARDED (vtable_word))) {
1182                         HEAVY_STAT (++stat_optimized_nursery_forwarded);
1183                         *ptr = forwarded;
1184                         return FALSE;
1185                 }
1186
1187                 old_obj = obj;
1188                 obj = copy_object_no_checks (obj, queue);
1189                 SGEN_ASSERT (0, old_obj != obj, "Cannot handle copy object failure.");
1190                 HEAVY_STAT (++stat_objects_copied_major);
1191                 *ptr = obj;
1192
1193 #ifdef SGEN_MARK_ON_ENQUEUE
1194                 /*
1195                  * FIXME: See comment for copy_object_no_checks().  If
1196                  * we have that, we can let the allocation function
1197                  * give us the block info, too, and we won't have to
1198                  * re-fetch it.
1199                  *
1200                  * FIXME (2): We should rework this to avoid all those nursery checks.
1201                  */
1202                 /*
1203                  * For the split nursery allocator the object might
1204                  * still be in the nursery despite having being
1205                  * promoted, in which case we can't mark it.
1206                  */
1207                 block = MS_BLOCK_FOR_OBJ (obj);
1208                 MS_CALC_MARK_BIT (word, bit, obj);
1209                 SGEN_ASSERT (9, !MS_MARK_BIT (block, word, bit), "object %p already marked", obj);
1210                 MS_SET_MARK_BIT (block, word, bit);
1211                 binary_protocol_mark (obj, (gpointer)LOAD_VTABLE (obj), sgen_safe_object_get_size ((MonoObject*)obj));
1212 #endif
1213
1214                 return FALSE;
1215         } else {
1216 #ifdef SGEN_MARK_ON_ENQUEUE
1217                 mword vtable_word = *(mword*)obj;
1218                 mword desc = sgen_vtable_get_descriptor ((MonoVTable*)vtable_word);
1219                 int type = desc & 7;
1220
1221                 HEAVY_STAT (++stat_optimized_major);
1222
1223                 if (type == DESC_TYPE_SMALL_BITMAP || type == DESC_TYPE_RUN_LENGTH) {
1224                         int __word, __bit;
1225
1226                         HEAVY_STAT (++stat_optimized_major_small_fast);
1227
1228                         block = MS_BLOCK_FOR_OBJ (obj);
1229                         MS_CALC_MARK_BIT (__word, __bit, (obj));
1230                         if (!MS_MARK_BIT ((block), __word, __bit)) {
1231                                 MS_SET_MARK_BIT ((block), __word, __bit);
1232                                 GRAY_OBJECT_ENQUEUE ((queue), (obj), (desc));
1233                         }
1234                 } else if (SGEN_ALIGN_UP (sgen_safe_object_get_size ((MonoObject*)obj)) <= SGEN_MAX_SMALL_OBJ_SIZE ) {
1235                         HEAVY_STAT (++stat_optimized_major_small_slow);
1236
1237                         block = MS_BLOCK_FOR_OBJ (obj);
1238                         MS_MARK_OBJECT_AND_ENQUEUE (obj, desc, block, queue);
1239                 } else {
1240                         HEAVY_STAT (++stat_optimized_major_large);
1241
1242                         if (sgen_los_object_is_pinned (obj))
1243                                 return FALSE;
1244                         binary_protocol_pin (obj, (gpointer)SGEN_LOAD_VTABLE (obj), sgen_safe_object_get_size ((MonoObject*)obj));
1245
1246                         sgen_los_pin_object (obj);
1247                         if (SGEN_OBJECT_HAS_REFERENCES (obj))
1248                                 GRAY_OBJECT_ENQUEUE (queue, obj, sgen_obj_get_descriptor (obj));
1249                 }
1250                 return FALSE;
1251 #else
1252                 GRAY_OBJECT_ENQUEUE (queue, obj, 0);
1253 #endif
1254         }
1255         return FALSE;
1256 }
1257
1258 static inline void
1259 sgen_gray_object_dequeue_fast (SgenGrayQueue *queue, char** obj, mword *desc) {
1260         GrayQueueEntry *cursor = queue->prefetch_cursor;
1261         GrayQueueEntry *const end = queue->prefetch + SGEN_GRAY_QUEUE_PREFETCH_SIZE;
1262         *obj = cursor->obj;
1263 #ifdef SGEN_GRAY_QUEUE_HAVE_DESCRIPTORS
1264         *desc = cursor->desc;
1265         GRAY_OBJECT_DEQUEUE (queue, &cursor->obj, &cursor->desc);
1266 #else
1267         GRAY_OBJECT_DEQUEUE (queue, &cursor->obj, NULL);
1268 #endif
1269
1270 #if !defined (SGEN_MARK_ON_ENQUEUE) && defined (BLOCK_INFO_IN_HEADER)
1271         {
1272                 int word, bit;
1273                 MSBlockInfo *block = (MSBlockInfo*)MS_BLOCK_DATA_FOR_OBJ (cursor->obj);
1274                 MS_CALC_MARK_BIT (word, bit, cursor->obj);
1275                 PREFETCH_WRITE (&block->mark_words [word]);
1276         }
1277 #endif
1278
1279         PREFETCH_READ (cursor->obj);
1280         ++cursor;
1281         if (cursor == end)
1282                 cursor = queue->prefetch;
1283         queue->prefetch_cursor = cursor;
1284 }
1285
1286 static gboolean
1287 drain_gray_stack (ScanCopyContext ctx)
1288 {
1289         SgenGrayQueue *queue = ctx.queue;
1290
1291         SGEN_ASSERT (0, ctx.scan_func == major_scan_object, "Wrong scan function");
1292
1293 #ifdef USE_PREFETCH_QUEUE
1294         HEAVY_STAT (++stat_drain_prefetch_fills);
1295         if (!sgen_gray_object_fill_prefetch (queue)) {
1296                 HEAVY_STAT (++stat_drain_prefetch_fill_failures);
1297                 return TRUE;
1298         }
1299 #endif
1300
1301         for (;;) {
1302                 char *obj;
1303                 mword desc;
1304                 int type;
1305
1306                 HEAVY_STAT (++stat_drain_loops);
1307
1308 #ifdef USE_PREFETCH_QUEUE
1309                 sgen_gray_object_dequeue_fast (queue, &obj, &desc);
1310                 if (!obj) {
1311                         HEAVY_STAT (++stat_drain_prefetch_fills);
1312                         if (!sgen_gray_object_fill_prefetch (queue)) {
1313                                 HEAVY_STAT (++stat_drain_prefetch_fill_failures);
1314                                 return TRUE;
1315                         }
1316                         continue;
1317                 }
1318 #else
1319                 GRAY_OBJECT_DEQUEUE (queue, &obj, &desc);
1320                 if (!obj)
1321                         return TRUE;
1322 #endif
1323
1324 #ifndef SGEN_GRAY_QUEUE_HAVE_DESCRIPTORS
1325                 desc = sgen_obj_get_descriptor_safe (obj);
1326 #endif
1327                 type = desc & 7;
1328
1329 #ifndef SGEN_MARK_ON_ENQUEUE
1330                 HEAVY_STAT (++stat_optimized_major_mark);
1331
1332                 /* Mark object or, if already marked, don't process. */
1333                 if (!sgen_ptr_in_nursery (obj)) {
1334                         if (type == DESC_TYPE_SMALL_BITMAP || SGEN_ALIGN_UP (sgen_safe_object_get_size ((MonoObject*)obj)) <= SGEN_MAX_SMALL_OBJ_SIZE) {
1335                                 MSBlockInfo *block = MS_BLOCK_FOR_OBJ (obj);
1336                                 int __word, __bit;
1337
1338                                 HEAVY_STAT (++stat_optimized_major_mark_small);
1339
1340                                 MS_CALC_MARK_BIT (__word, __bit, (obj));
1341                                 if (MS_MARK_BIT ((block), __word, __bit))
1342                                         continue;
1343                                 MS_SET_MARK_BIT ((block), __word, __bit);
1344                         } else {
1345                                 HEAVY_STAT (++stat_optimized_major_mark_large);
1346
1347                                 if (sgen_los_object_is_pinned (obj))
1348                                         continue;
1349                                 sgen_los_pin_object (obj);
1350                         }
1351                 }
1352 #endif
1353
1354                 HEAVY_STAT (++stat_optimized_major_scan);
1355
1356                 /* Now scan the object. */
1357 #ifdef HEAVY_STATISTICS
1358                 sgen_descriptor_count_scanned_object (desc);
1359 #endif
1360                 if (type == DESC_TYPE_SMALL_BITMAP) {
1361                         void **_objptr = (void**)(obj);
1362                         gsize _bmap = (desc) >> 16;
1363                         _objptr += OBJECT_HEADER_WORDS;
1364                         do {
1365                                 int _index = GNUC_BUILTIN_CTZ (_bmap);
1366                                 _objptr += _index;
1367                                 _bmap >>= (_index + 1);
1368
1369                                 void *__old = *(_objptr);
1370                                 if (__old) {
1371                                         gboolean still_in_nursery = optimized_copy_or_mark_object (_objptr, __old, queue);
1372                                         if (G_UNLIKELY (still_in_nursery && !sgen_ptr_in_nursery ((_objptr)) && !SGEN_OBJECT_IS_CEMENTED (*_objptr))) {
1373                                                 void *__copy = *(_objptr);
1374                                                 sgen_add_to_global_remset ((_objptr), __copy);
1375                                         }
1376                                 }
1377
1378                                 _objptr ++;
1379                         } while (_bmap);
1380 #ifdef SGEN_HEAVY_BINARY_PROTOCOL
1381                         add_scanned_object (obj);
1382                         ++stat_optimized_major_scan_slow;
1383 #endif
1384                 } else {
1385                         HEAVY_STAT (++stat_optimized_major_scan_fast);
1386                         major_scan_object_no_mark (obj, desc, queue);
1387                 }
1388         }
1389 }
1390 #endif
1391
1392 static void
1393 mark_pinned_objects_in_block (MSBlockInfo *block, SgenGrayQueue *queue)
1394 {
1395         void **entry, **end;
1396         int last_index = -1;
1397
1398         if (block->pin_queue_first_entry == block->pin_queue_last_entry)
1399                 return;
1400
1401         block->has_pinned = TRUE;
1402
1403         entry = sgen_pinning_get_entry (block->pin_queue_first_entry);
1404         end = sgen_pinning_get_entry (block->pin_queue_last_entry);
1405
1406         for (; entry < end; ++entry) {
1407                 int index = MS_BLOCK_OBJ_INDEX (*entry, block);
1408                 char *obj;
1409                 SGEN_ASSERT (9, index >= 0 && index < MS_BLOCK_FREE / block->obj_size, "invalid object %p index %d max-index %d", *entry, index, MS_BLOCK_FREE / block->obj_size);
1410                 if (index == last_index)
1411                         continue;
1412                 obj = MS_BLOCK_OBJ (block, index);
1413                 MS_MARK_OBJECT_AND_ENQUEUE_CHECKED (obj, sgen_obj_get_descriptor (obj), block, queue);
1414                 last_index = index;
1415         }
1416 }
1417
1418 static inline void
1419 sweep_block_for_size (MSBlockInfo *block, int count, int obj_size)
1420 {
1421         int obj_index;
1422
1423         for (obj_index = 0; obj_index < count; ++obj_index) {
1424                 int word, bit;
1425                 void *obj = MS_BLOCK_OBJ_FOR_SIZE (block, obj_index, obj_size);
1426
1427                 MS_CALC_MARK_BIT (word, bit, obj);
1428                 if (MS_MARK_BIT (block, word, bit)) {
1429                         SGEN_ASSERT (9, MS_OBJ_ALLOCED (obj, block), "object %p not allocated", obj);
1430                 } else {
1431                         /* an unmarked object */
1432                         if (MS_OBJ_ALLOCED (obj, block)) {
1433                                 /*
1434                                  * FIXME: Merge consecutive
1435                                  * slots for lower reporting
1436                                  * overhead.  Maybe memset
1437                                  * will also benefit?
1438                                  */
1439                                 binary_protocol_empty (obj, obj_size);
1440                                 MONO_GC_MAJOR_SWEPT ((mword)obj, obj_size);
1441                                 memset (obj, 0, obj_size);
1442                         }
1443                         *(void**)obj = block->free_list;
1444                         block->free_list = obj;
1445                 }
1446         }
1447 }
1448
1449 /*
1450  * sweep_block:
1451  *
1452  *   Traverse BLOCK, freeing and zeroing unused objects.
1453  */
1454 static void
1455 sweep_block (MSBlockInfo *block, gboolean during_major_collection)
1456 {
1457         int count;
1458         void *reversed = NULL;
1459
1460         if (!during_major_collection)
1461                 g_assert (!sgen_concurrent_collection_in_progress ());
1462
1463         if (block->swept)
1464                 return;
1465
1466         count = MS_BLOCK_FREE / block->obj_size;
1467
1468         block->free_list = NULL;
1469
1470         /* Use inline instances specialized to constant sizes, this allows the compiler to replace the memset calls with inline code */
1471         // FIXME: Add more sizes
1472         switch (block->obj_size) {
1473         case 16:
1474                 sweep_block_for_size (block, count, 16);
1475                 break;
1476         default:
1477                 sweep_block_for_size (block, count, block->obj_size);
1478                 break;
1479         }
1480
1481         /* reset mark bits */
1482         memset (block->mark_words, 0, sizeof (mword) * MS_NUM_MARK_WORDS);
1483
1484         /* Reverse free list so that it's in address order */
1485         reversed = NULL;
1486         while (block->free_list) {
1487                 void *next = *(void**)block->free_list;
1488                 *(void**)block->free_list = reversed;
1489                 reversed = block->free_list;
1490                 block->free_list = next;
1491         }
1492         block->free_list = reversed;
1493
1494         block->swept = 1;
1495 }
1496
1497 static inline int
1498 bitcount (mword d)
1499 {
1500         int count = 0;
1501
1502 #ifdef __GNUC__
1503         if (sizeof (mword) == sizeof (unsigned long))
1504                 count += __builtin_popcountl (d);
1505         else
1506                 count += __builtin_popcount (d);
1507 #else
1508         while (d) {
1509                 count ++;
1510                 d &= (d - 1);
1511         }
1512 #endif
1513         return count;
1514 }
1515
1516 static void
1517 ms_sweep (void)
1518 {
1519         int i;
1520         MSBlockInfo *block;
1521
1522         /* statistics for evacuation */
1523         int *slots_available = alloca (sizeof (int) * num_block_obj_sizes);
1524         int *slots_used = alloca (sizeof (int) * num_block_obj_sizes);
1525         int *num_blocks = alloca (sizeof (int) * num_block_obj_sizes);
1526
1527 #ifdef SGEN_HAVE_CONCURRENT_MARK
1528         mword total_evacuate_heap = 0;
1529         mword total_evacuate_saved = 0;
1530 #endif
1531
1532         for (i = 0; i < num_block_obj_sizes; ++i)
1533                 slots_available [i] = slots_used [i] = num_blocks [i] = 0;
1534
1535         /* clear all the free lists */
1536         for (i = 0; i < MS_BLOCK_TYPE_MAX; ++i) {
1537                 MSBlockInfo **free_blocks = free_block_lists [i];
1538                 int j;
1539                 for (j = 0; j < num_block_obj_sizes; ++j)
1540                         free_blocks [j] = NULL;
1541         }
1542
1543         /* traverse all blocks, free and zero unmarked objects */
1544         FOREACH_BLOCK (block) {
1545                 int count;
1546                 gboolean have_live = FALSE;
1547                 gboolean has_pinned;
1548                 gboolean have_free = FALSE;
1549                 int obj_size_index;
1550                 int nused = 0;
1551
1552                 obj_size_index = block->obj_size_index;
1553
1554                 has_pinned = block->has_pinned;
1555                 block->has_pinned = block->pinned;
1556
1557                 block->is_to_space = FALSE;
1558                 block->swept = 0;
1559
1560                 count = MS_BLOCK_FREE / block->obj_size;
1561
1562 #ifdef SGEN_HAVE_CONCURRENT_MARK
1563                 if (block->cardtable_mod_union) {
1564                         sgen_free_internal_dynamic (block->cardtable_mod_union, CARDS_PER_BLOCK, INTERNAL_MEM_CARDTABLE_MOD_UNION);
1565                         block->cardtable_mod_union = NULL;
1566                 }
1567 #endif
1568
1569                 /* Count marked objects in the block */
1570                 for (i = 0; i < MS_NUM_MARK_WORDS; ++i) {
1571                         nused += bitcount (block->mark_words [i]);
1572                 }
1573                 if (nused) {
1574                         have_live = TRUE;
1575                 }
1576                 if (nused < count)
1577                         have_free = TRUE;
1578
1579                 if (!lazy_sweep)
1580                         sweep_block (block, TRUE);
1581
1582                 if (have_live) {
1583                         if (!has_pinned) {
1584                                 ++num_blocks [obj_size_index];
1585                                 slots_used [obj_size_index] += nused;
1586                                 slots_available [obj_size_index] += count;
1587                         }
1588
1589                         /*
1590                          * If there are free slots in the block, add
1591                          * the block to the corresponding free list.
1592                          */
1593                         if (have_free) {
1594                                 MSBlockInfo **free_blocks = FREE_BLOCKS (block->pinned, block->has_references);
1595                                 int index = MS_BLOCK_OBJ_SIZE_INDEX (block->obj_size);
1596                                 block->next_free = free_blocks [index];
1597                                 free_blocks [index] = block;
1598                         }
1599
1600                         update_heap_boundaries_for_block (block);
1601                 } else {
1602                         /*
1603                          * Blocks without live objects are removed from the
1604                          * block list and freed.
1605                          */
1606                         DELETE_BLOCK_IN_FOREACH ();
1607
1608                         binary_protocol_empty (MS_BLOCK_OBJ (block, 0), (char*)MS_BLOCK_OBJ (block, count) - (char*)MS_BLOCK_OBJ (block, 0));
1609 #if defined (FIXED_HEAP) || defined (BLOCK_INFO_IN_HEADER)
1610                         ms_free_block (block);
1611 #else
1612                         ms_free_block (block->block);
1613                         sgen_free_internal (block, INTERNAL_MEM_MS_BLOCK_INFO);
1614 #endif
1615
1616                         --num_major_sections;
1617                 }
1618         } END_FOREACH_BLOCK;
1619         sgen_pointer_queue_remove_nulls (&allocated_blocks);
1620
1621         for (i = 0; i < num_block_obj_sizes; ++i) {
1622                 float usage = (float)slots_used [i] / (float)slots_available [i];
1623                 if (num_blocks [i] > 5 && usage < evacuation_threshold) {
1624                         g_assert_not_reached ();
1625                         evacuate_block_obj_sizes [i] = TRUE;
1626                         /*
1627                         g_print ("slot size %d - %d of %d used\n",
1628                                         block_obj_sizes [i], slots_used [i], slots_available [i]);
1629                         */
1630                 } else {
1631                         evacuate_block_obj_sizes [i] = FALSE;
1632                 }
1633 #ifdef SGEN_HAVE_CONCURRENT_MARK
1634                 {
1635                         mword total_bytes = block_obj_sizes [i] * slots_available [i];
1636                         total_evacuate_heap += total_bytes;
1637                         if (evacuate_block_obj_sizes [i])
1638                                 total_evacuate_saved += total_bytes - block_obj_sizes [i] * slots_used [i];
1639                 }
1640 #endif
1641         }
1642
1643 #ifdef SGEN_HAVE_CONCURRENT_MARK
1644         want_evacuation = (float)total_evacuate_saved / (float)total_evacuate_heap > (1 - concurrent_evacuation_threshold);
1645 #endif
1646
1647         have_swept = TRUE;
1648 }
1649
1650 static void
1651 major_sweep (void)
1652 {
1653         ms_sweep ();
1654 }
1655
1656 static int count_pinned_ref;
1657 static int count_pinned_nonref;
1658 static int count_nonpinned_ref;
1659 static int count_nonpinned_nonref;
1660
1661 static void
1662 count_nonpinned_callback (char *obj, size_t size, void *data)
1663 {
1664         MonoVTable *vtable = (MonoVTable*)LOAD_VTABLE (obj);
1665
1666         if (vtable->klass->has_references)
1667                 ++count_nonpinned_ref;
1668         else
1669                 ++count_nonpinned_nonref;
1670 }
1671
1672 static void
1673 count_pinned_callback (char *obj, size_t size, void *data)
1674 {
1675         MonoVTable *vtable = (MonoVTable*)LOAD_VTABLE (obj);
1676
1677         if (vtable->klass->has_references)
1678                 ++count_pinned_ref;
1679         else
1680                 ++count_pinned_nonref;
1681 }
1682
1683 static G_GNUC_UNUSED void
1684 count_ref_nonref_objs (void)
1685 {
1686         int total;
1687
1688         count_pinned_ref = 0;
1689         count_pinned_nonref = 0;
1690         count_nonpinned_ref = 0;
1691         count_nonpinned_nonref = 0;
1692
1693         major_iterate_objects (ITERATE_OBJECTS_SWEEP_NON_PINNED, count_nonpinned_callback, NULL);
1694         major_iterate_objects (ITERATE_OBJECTS_SWEEP_PINNED, count_pinned_callback, NULL);
1695
1696         total = count_pinned_nonref + count_nonpinned_nonref + count_pinned_ref + count_nonpinned_ref;
1697
1698         g_print ("ref: %d pinned %d non-pinned   non-ref: %d pinned %d non-pinned  --  %.1f\n",
1699                         count_pinned_ref, count_nonpinned_ref,
1700                         count_pinned_nonref, count_nonpinned_nonref,
1701                         (count_pinned_nonref + count_nonpinned_nonref) * 100.0 / total);
1702 }
1703
1704 static int
1705 ms_calculate_block_obj_sizes (double factor, int *arr)
1706 {
1707         double target_size = sizeof (MonoObject);
1708         int num_sizes = 0;
1709         int last_size = 0;
1710
1711         do {
1712                 int target_count = (int)ceil (MS_BLOCK_FREE / target_size);
1713                 int size = MIN ((MS_BLOCK_FREE / target_count) & ~(SGEN_ALLOC_ALIGN - 1), SGEN_MAX_SMALL_OBJ_SIZE);
1714
1715                 if (size != last_size) {
1716                         if (arr)
1717                                 arr [num_sizes] = size;
1718                         ++num_sizes;
1719                         last_size = size;
1720                 }
1721
1722                 target_size *= factor;
1723         } while (last_size < SGEN_MAX_SMALL_OBJ_SIZE);
1724
1725         return num_sizes;
1726 }
1727
1728 /* only valid during minor collections */
1729 static mword old_num_major_sections;
1730
1731 static void
1732 major_start_nursery_collection (void)
1733 {
1734 #ifdef MARKSWEEP_CONSISTENCY_CHECK
1735         consistency_check ();
1736 #endif
1737
1738         old_num_major_sections = num_major_sections;
1739 }
1740
1741 static void
1742 major_finish_nursery_collection (void)
1743 {
1744 #ifdef MARKSWEEP_CONSISTENCY_CHECK
1745         consistency_check ();
1746 #endif
1747         sgen_register_major_sections_alloced (num_major_sections - old_num_major_sections);
1748 }
1749
1750 static void
1751 major_start_major_collection (void)
1752 {
1753         int i;
1754
1755         /* clear the free lists */
1756         for (i = 0; i < num_block_obj_sizes; ++i) {
1757                 if (!evacuate_block_obj_sizes [i])
1758                         continue;
1759
1760                 free_block_lists [0][i] = NULL;
1761                 free_block_lists [MS_BLOCK_FLAG_REFS][i] = NULL;
1762         }
1763
1764         // Sweep all unswept blocks
1765         if (lazy_sweep) {
1766                 MSBlockInfo *block;
1767
1768                 MONO_GC_SWEEP_BEGIN (GENERATION_OLD, TRUE);
1769
1770                 FOREACH_BLOCK (block) {
1771                         sweep_block (block, TRUE);
1772                 } END_FOREACH_BLOCK;
1773
1774                 MONO_GC_SWEEP_END (GENERATION_OLD, TRUE);
1775         }
1776 }
1777
1778 static void
1779 major_finish_major_collection (ScannedObjectCounts *counts)
1780 {
1781 #ifdef SGEN_HEAVY_BINARY_PROTOCOL
1782         if (binary_protocol_is_enabled ()) {
1783                 counts->num_scanned_objects = scanned_objects_list.next_slot;
1784
1785                 sgen_pointer_queue_sort_uniq (&scanned_objects_list);
1786                 counts->num_unique_scanned_objects = scanned_objects_list.next_slot;
1787
1788                 sgen_pointer_queue_clear (&scanned_objects_list);
1789         }
1790 #endif
1791 }
1792
1793 #if SIZEOF_VOID_P != 8
1794 static int
1795 compare_pointers (const void *va, const void *vb) {
1796         char *a = *(char**)va, *b = *(char**)vb;
1797         if (a < b)
1798                 return -1;
1799         if (a > b)
1800                 return 1;
1801         return 0;
1802 }
1803 #endif
1804
1805 static void
1806 major_have_computer_minor_collection_allowance (void)
1807 {
1808         size_t section_reserve = sgen_get_minor_collection_allowance () / MS_BLOCK_SIZE;
1809
1810         g_assert (have_swept);
1811
1812 #if SIZEOF_VOID_P != 8
1813         {
1814                 int i, num_empty_blocks_orig, num_blocks, arr_length;
1815                 void *block;
1816                 void **empty_block_arr;
1817                 void **rebuild_next;
1818
1819 #ifdef TARGET_WIN32
1820                 /*
1821                  * sgen_free_os_memory () asserts in mono_vfree () because windows doesn't like freeing the middle of
1822                  * a VirtualAlloc ()-ed block.
1823                  */
1824                 return;
1825 #endif
1826
1827                 if (num_empty_blocks <= section_reserve)
1828                         return;
1829                 SGEN_ASSERT (0, num_empty_blocks > 0, "section reserve can't be negative");
1830
1831                 num_empty_blocks_orig = num_empty_blocks;
1832                 empty_block_arr = (void**)sgen_alloc_internal_dynamic (sizeof (void*) * num_empty_blocks_orig,
1833                                 INTERNAL_MEM_MS_BLOCK_INFO_SORT, FALSE);
1834                 if (!empty_block_arr)
1835                         goto fallback;
1836
1837                 i = 0;
1838                 for (block = empty_blocks; block; block = *(void**)block)
1839                         empty_block_arr [i++] = block;
1840                 SGEN_ASSERT (0, i == num_empty_blocks, "empty block count wrong");
1841
1842                 sgen_qsort (empty_block_arr, num_empty_blocks, sizeof (void*), compare_pointers);
1843
1844                 /*
1845                  * We iterate over the free blocks, trying to find MS_BLOCK_ALLOC_NUM
1846                  * contiguous ones.  If we do, we free them.  If that's not enough to get to
1847                  * section_reserve, we halve the number of contiguous blocks we're looking
1848                  * for and have another go, until we're done with looking for pairs of
1849                  * blocks, at which point we give up and go to the fallback.
1850                  */
1851                 arr_length = num_empty_blocks_orig;
1852                 num_blocks = MS_BLOCK_ALLOC_NUM;
1853                 while (num_empty_blocks > section_reserve && num_blocks > 1) {
1854                         int first = -1;
1855                         int dest = 0;
1856
1857                         dest = 0;
1858                         for (i = 0; i < arr_length; ++i) {
1859                                 int d = dest;
1860                                 void *block = empty_block_arr [i];
1861                                 SGEN_ASSERT (0, block, "we're not shifting correctly");
1862                                 if (i != dest) {
1863                                         empty_block_arr [dest] = block;
1864                                         /*
1865                                          * This is not strictly necessary, but we're
1866                                          * cautious.
1867                                          */
1868                                         empty_block_arr [i] = NULL;
1869                                 }
1870                                 ++dest;
1871
1872                                 if (first < 0) {
1873                                         first = d;
1874                                         continue;
1875                                 }
1876
1877                                 SGEN_ASSERT (0, first >= 0 && d > first, "algorithm is wrong");
1878
1879                                 if ((char*)block != ((char*)empty_block_arr [d-1]) + MS_BLOCK_SIZE) {
1880                                         first = d;
1881                                         continue;
1882                                 }
1883
1884                                 if (d + 1 - first == num_blocks) {
1885                                         /*
1886                                          * We found num_blocks contiguous blocks.  Free them
1887                                          * and null their array entries.  As an optimization
1888                                          * we could, instead of nulling the entries, shift
1889                                          * the following entries over to the left, while
1890                                          * we're iterating.
1891                                          */
1892                                         int j;
1893                                         sgen_free_os_memory (empty_block_arr [first], MS_BLOCK_SIZE * num_blocks, SGEN_ALLOC_HEAP);
1894                                         for (j = first; j <= d; ++j)
1895                                                 empty_block_arr [j] = NULL;
1896                                         dest = first;
1897                                         first = -1;
1898
1899                                         num_empty_blocks -= num_blocks;
1900
1901                                         stat_major_blocks_freed += num_blocks;
1902                                         if (num_blocks == MS_BLOCK_ALLOC_NUM)
1903                                                 stat_major_blocks_freed_ideal += num_blocks;
1904                                         else
1905                                                 stat_major_blocks_freed_less_ideal += num_blocks;
1906
1907                                 }
1908                         }
1909
1910                         SGEN_ASSERT (0, dest <= i && dest <= arr_length, "array length is off");
1911                         arr_length = dest;
1912                         SGEN_ASSERT (0, arr_length == num_empty_blocks, "array length is off");
1913
1914                         num_blocks >>= 1;
1915                 }
1916
1917                 /* rebuild empty_blocks free list */
1918                 rebuild_next = (void**)&empty_blocks;
1919                 for (i = 0; i < arr_length; ++i) {
1920                         void *block = empty_block_arr [i];
1921                         SGEN_ASSERT (0, block, "we're missing blocks");
1922                         *rebuild_next = block;
1923                         rebuild_next = (void**)block;
1924                 }
1925                 *rebuild_next = NULL;
1926
1927                 /* free array */
1928                 sgen_free_internal_dynamic (empty_block_arr, sizeof (void*) * num_empty_blocks_orig, INTERNAL_MEM_MS_BLOCK_INFO_SORT);
1929         }
1930
1931         SGEN_ASSERT (0, num_empty_blocks >= 0, "we freed more blocks than we had in the first place?");
1932
1933  fallback:
1934         /*
1935          * This is our threshold.  If there's not more empty than used blocks, we won't
1936          * release uncontiguous blocks, in fear of fragmenting the address space.
1937          */
1938         if (num_empty_blocks <= num_major_sections)
1939                 return;
1940 #endif
1941
1942         while (num_empty_blocks > section_reserve) {
1943                 void *next = *(void**)empty_blocks;
1944                 sgen_free_os_memory (empty_blocks, MS_BLOCK_SIZE, SGEN_ALLOC_HEAP);
1945                 empty_blocks = next;
1946                 /*
1947                  * Needs not be atomic because this is running
1948                  * single-threaded.
1949                  */
1950                 --num_empty_blocks;
1951
1952                 ++stat_major_blocks_freed;
1953 #if SIZEOF_VOID_P != 8
1954                 ++stat_major_blocks_freed_individual;
1955 #endif
1956         }
1957 }
1958
1959 static void
1960 major_find_pin_queue_start_ends (SgenGrayQueue *queue)
1961 {
1962         MSBlockInfo *block;
1963
1964         FOREACH_BLOCK (block) {
1965                 sgen_find_optimized_pin_queue_area (MS_BLOCK_FOR_BLOCK_INFO (block) + MS_BLOCK_SKIP, MS_BLOCK_FOR_BLOCK_INFO (block) + MS_BLOCK_SIZE,
1966                                 &block->pin_queue_first_entry, &block->pin_queue_last_entry);
1967         } END_FOREACH_BLOCK;
1968 }
1969
1970 static void
1971 major_pin_objects (SgenGrayQueue *queue)
1972 {
1973         MSBlockInfo *block;
1974
1975         FOREACH_BLOCK (block) {
1976                 mark_pinned_objects_in_block (block, queue);
1977         } END_FOREACH_BLOCK;
1978 }
1979
1980 static void
1981 major_init_to_space (void)
1982 {
1983 }
1984
1985 static void
1986 major_report_pinned_memory_usage (void)
1987 {
1988         g_assert_not_reached ();
1989 }
1990
1991 static gint64
1992 major_get_used_size (void)
1993 {
1994         gint64 size = 0;
1995         MSBlockInfo *block;
1996
1997         FOREACH_BLOCK (block) {
1998                 int count = MS_BLOCK_FREE / block->obj_size;
1999                 void **iter;
2000                 size += count * block->obj_size;
2001                 for (iter = block->free_list; iter; iter = (void**)*iter)
2002                         size -= block->obj_size;
2003         } END_FOREACH_BLOCK;
2004
2005         return size;
2006 }
2007
2008 static size_t
2009 get_num_major_sections (void)
2010 {
2011         return num_major_sections;
2012 }
2013
2014 static gboolean
2015 major_handle_gc_param (const char *opt)
2016 {
2017         /*
2018         if (g_str_has_prefix (opt, "evacuation-threshold=")) {
2019                 const char *arg = strchr (opt, '=') + 1;
2020                 int percentage = atoi (arg);
2021                 if (percentage < 0 || percentage > 100) {
2022                         fprintf (stderr, "evacuation-threshold must be an integer in the range 0-100.\n");
2023                         exit (1);
2024                 }
2025                 evacuation_threshold = (float)percentage / 100.0f;
2026                 return TRUE;
2027                 } else */
2028         if (!strcmp (opt, "lazy-sweep")) {
2029                 lazy_sweep = TRUE;
2030                 return TRUE;
2031         } else if (!strcmp (opt, "no-lazy-sweep")) {
2032                 lazy_sweep = FALSE;
2033                 return TRUE;
2034         }
2035
2036         return FALSE;
2037 }
2038
2039 static void
2040 major_print_gc_param_usage (void)
2041 {
2042         fprintf (stderr,
2043                         ""
2044                         "  evacuation-threshold=P (where P is a percentage, an integer in 0-100)\n"
2045                         "  (no-)lazy-sweep\n"
2046                         );
2047 }
2048
2049 static void
2050 major_iterate_live_block_ranges (sgen_cardtable_block_callback callback)
2051 {
2052         MSBlockInfo *block;
2053         gboolean has_references;
2054
2055         FOREACH_BLOCK_HAS_REFERENCES (block, has_references) {
2056                 if (has_references)
2057                         callback ((mword)MS_BLOCK_FOR_BLOCK_INFO (block), MS_BLOCK_SIZE);
2058         } END_FOREACH_BLOCK;
2059 }
2060
2061 #ifdef HEAVY_STATISTICS
2062 extern long long marked_cards;
2063 extern long long scanned_cards;
2064 extern long long scanned_objects;
2065 extern long long remarked_cards;
2066 #endif
2067
2068 #define CARD_WORDS_PER_BLOCK (CARDS_PER_BLOCK / SIZEOF_VOID_P)
2069 /*
2070  * MS blocks are 16K aligned.
2071  * Cardtables are 4K aligned, at least.
2072  * This means that the cardtable of a given block is 32 bytes aligned.
2073  */
2074 static guint8*
2075 initial_skip_card (guint8 *card_data)
2076 {
2077         mword *cards = (mword*)card_data;
2078         mword card;
2079         int i;
2080         for (i = 0; i < CARD_WORDS_PER_BLOCK; ++i) {
2081                 card = cards [i];
2082                 if (card)
2083                         break;
2084         }
2085
2086         if (i == CARD_WORDS_PER_BLOCK)
2087                 return card_data + CARDS_PER_BLOCK;
2088
2089 #if defined(__i386__) && defined(__GNUC__)
2090         return card_data + i * 4 +  (__builtin_ffs (card) - 1) / 8;
2091 #elif defined(__x86_64__) && defined(__GNUC__)
2092         return card_data + i * 8 +  (__builtin_ffsll (card) - 1) / 8;
2093 #elif defined(__s390x__) && defined(__GNUC__)
2094         return card_data + i * 8 +  (__builtin_ffsll (GUINT64_TO_LE(card)) - 1) / 8;
2095 #else
2096         for (i = i * SIZEOF_VOID_P; i < CARDS_PER_BLOCK; ++i) {
2097                 if (card_data [i])
2098                         return &card_data [i];
2099         }
2100         return card_data;
2101 #endif
2102 }
2103
2104
2105 static G_GNUC_UNUSED guint8*
2106 skip_card (guint8 *card_data, guint8 *card_data_end)
2107 {
2108         while (card_data < card_data_end && !*card_data)
2109                 ++card_data;
2110         return card_data;
2111 }
2112
2113 #define MS_BLOCK_OBJ_INDEX_FAST(o,b,os) (((char*)(o) - ((b) + MS_BLOCK_SKIP)) / (os))
2114 #define MS_BLOCK_OBJ_FAST(b,os,i)                       ((b) + MS_BLOCK_SKIP + (os) * (i))
2115 #define MS_OBJ_ALLOCED_FAST(o,b)                (*(void**)(o) && (*(char**)(o) < (b) || *(char**)(o) >= (b) + MS_BLOCK_SIZE))
2116
2117 static void
2118 major_scan_card_table (gboolean mod_union, SgenGrayQueue *queue)
2119 {
2120         MSBlockInfo *block;
2121         gboolean has_references;
2122         ScanObjectFunc scan_func = sgen_get_current_object_ops ()->scan_object;
2123
2124 #ifdef SGEN_HAVE_CONCURRENT_MARK
2125         if (!concurrent_mark)
2126                 g_assert (!mod_union);
2127 #else
2128         g_assert (!mod_union);
2129 #endif
2130
2131         FOREACH_BLOCK_HAS_REFERENCES (block, has_references) {
2132                 int block_obj_size;
2133                 char *block_start;
2134
2135                 if (!has_references)
2136                         continue;
2137
2138                 block_obj_size = block->obj_size;
2139                 block_start = MS_BLOCK_FOR_BLOCK_INFO (block);
2140
2141                 if (block_obj_size >= CARD_SIZE_IN_BYTES) {
2142                         guint8 *cards;
2143 #ifndef SGEN_HAVE_OVERLAPPING_CARDS
2144                         guint8 cards_data [CARDS_PER_BLOCK];
2145 #endif
2146                         char *obj, *end, *base;
2147
2148                         if (mod_union) {
2149 #ifdef SGEN_HAVE_CONCURRENT_MARK
2150                                 cards = block->cardtable_mod_union;
2151                                 /*
2152                                  * This happens when the nursery
2153                                  * collection that precedes finishing
2154                                  * the concurrent collection allocates
2155                                  * new major blocks.
2156                                  */
2157                                 if (!cards)
2158                                         continue;
2159 #endif
2160                         } else {
2161                         /*We can avoid the extra copy since the remark cardtable was cleaned before */
2162 #ifdef SGEN_HAVE_OVERLAPPING_CARDS
2163                                 cards = sgen_card_table_get_card_scan_address ((mword)block_start);
2164 #else
2165                                 cards = cards_data;
2166                                 if (!sgen_card_table_get_card_data (cards_data, (mword)block_start, CARDS_PER_BLOCK))
2167                                         continue;
2168 #endif
2169                         }
2170
2171                         obj = (char*)MS_BLOCK_OBJ_FAST (block_start, block_obj_size, 0);
2172                         end = block_start + MS_BLOCK_SIZE;
2173                         base = sgen_card_table_align_pointer (obj);
2174
2175                         while (obj < end) {
2176                                 size_t card_offset;
2177
2178                                 if (!block->swept)
2179                                         sweep_block (block, FALSE);
2180
2181                                 if (!MS_OBJ_ALLOCED_FAST (obj, block_start))
2182                                         goto next_large;
2183
2184                                 if (mod_union) {
2185                                         /* FIXME: do this more efficiently */
2186                                         int w, b;
2187                                         MS_CALC_MARK_BIT (w, b, obj);
2188                                         if (!MS_MARK_BIT (block, w, b))
2189                                                 goto next_large;
2190                                 }
2191
2192                                 card_offset = (obj - base) >> CARD_BITS;
2193                                 sgen_cardtable_scan_object (obj, block_obj_size, cards + card_offset, mod_union, queue);
2194
2195                         next_large:
2196                                 obj += block_obj_size;
2197                         }
2198                 } else {
2199                         guint8 *card_data, *card_base;
2200                         guint8 *card_data_end;
2201
2202                         /*
2203                          * This is safe in face of card aliasing for the following reason:
2204                          *
2205                          * Major blocks are 16k aligned, or 32 cards aligned.
2206                          * Cards aliasing happens in powers of two, so as long as major blocks are aligned to their
2207                          * sizes, they won't overflow the cardtable overlap modulus.
2208                          */
2209                         if (mod_union) {
2210 #ifdef SGEN_HAVE_CONCURRENT_MARK
2211                                 card_data = card_base = block->cardtable_mod_union;
2212                                 /*
2213                                  * This happens when the nursery
2214                                  * collection that precedes finishing
2215                                  * the concurrent collection allocates
2216                                  * new major blocks.
2217                                  */
2218                                 if (!card_data)
2219                                         continue;
2220 #else
2221                                 g_assert_not_reached ();
2222                                 card_data = NULL;
2223 #endif
2224                         } else {
2225                                 card_data = card_base = sgen_card_table_get_card_scan_address ((mword)block_start);
2226                         }
2227                         card_data_end = card_data + CARDS_PER_BLOCK;
2228
2229                         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)) {
2230                                 size_t index;
2231                                 size_t idx = card_data - card_base;
2232                                 char *start = (char*)(block_start + idx * CARD_SIZE_IN_BYTES);
2233                                 char *end = start + CARD_SIZE_IN_BYTES;
2234                                 char *first_obj, *obj;
2235
2236                                 HEAVY_STAT (++scanned_cards);
2237
2238                                 if (!*card_data)
2239                                         continue;
2240
2241                                 if (!block->swept)
2242                                         sweep_block (block, FALSE);
2243
2244                                 HEAVY_STAT (++marked_cards);
2245
2246                                 sgen_card_table_prepare_card_for_scanning (card_data);
2247
2248                                 if (idx == 0)
2249                                         index = 0;
2250                                 else
2251                                         index = MS_BLOCK_OBJ_INDEX_FAST (start, block_start, block_obj_size);
2252
2253                                 obj = first_obj = (char*)MS_BLOCK_OBJ_FAST (block_start, block_obj_size, index);
2254                                 while (obj < end) {
2255                                         if (!MS_OBJ_ALLOCED_FAST (obj, block_start))
2256                                                 goto next_small;
2257
2258                                         if (mod_union) {
2259                                                 /* FIXME: do this more efficiently */
2260                                                 int w, b;
2261                                                 MS_CALC_MARK_BIT (w, b, obj);
2262                                                 if (!MS_MARK_BIT (block, w, b))
2263                                                         goto next_small;
2264                                         }
2265
2266                                         HEAVY_STAT (++scanned_objects);
2267                                         scan_func (obj, sgen_obj_get_descriptor (obj), queue);
2268                                 next_small:
2269                                         obj += block_obj_size;
2270                                 }
2271                                 HEAVY_STAT (if (*card_data) ++remarked_cards);
2272                                 binary_protocol_card_scan (first_obj, obj - first_obj);
2273                         }
2274                 }
2275         } END_FOREACH_BLOCK;
2276 }
2277
2278 static void
2279 major_count_cards (long long *num_total_cards, long long *num_marked_cards)
2280 {
2281         MSBlockInfo *block;
2282         gboolean has_references;
2283         long long total_cards = 0;
2284         long long marked_cards = 0;
2285
2286         FOREACH_BLOCK_HAS_REFERENCES (block, has_references) {
2287                 guint8 *cards = sgen_card_table_get_card_scan_address ((mword) MS_BLOCK_FOR_BLOCK_INFO (block));
2288                 int i;
2289
2290                 if (!has_references)
2291                         continue;
2292
2293                 total_cards += CARDS_PER_BLOCK;
2294                 for (i = 0; i < CARDS_PER_BLOCK; ++i) {
2295                         if (cards [i])
2296                                 ++marked_cards;
2297                 }
2298         } END_FOREACH_BLOCK;
2299
2300         *num_total_cards = total_cards;
2301         *num_marked_cards = marked_cards;
2302 }
2303
2304 #ifdef SGEN_HAVE_CONCURRENT_MARK
2305 static void
2306 update_cardtable_mod_union (void)
2307 {
2308         MSBlockInfo *block;
2309
2310         FOREACH_BLOCK (block) {
2311                 size_t num_cards;
2312
2313                 block->cardtable_mod_union = sgen_card_table_update_mod_union (block->cardtable_mod_union,
2314                                 MS_BLOCK_FOR_BLOCK_INFO (block), MS_BLOCK_SIZE, &num_cards);
2315
2316                 SGEN_ASSERT (0, num_cards == CARDS_PER_BLOCK, "Number of cards calculation is wrong");
2317         } END_FOREACH_BLOCK;
2318 }
2319
2320 static guint8*
2321 major_get_cardtable_mod_union_for_object (char *obj)
2322 {
2323         MSBlockInfo *block = MS_BLOCK_FOR_OBJ (obj);
2324         return &block->cardtable_mod_union [(obj - (char*)sgen_card_table_align_pointer (MS_BLOCK_FOR_BLOCK_INFO (block))) >> CARD_BITS];
2325 }
2326 #endif
2327
2328 static void
2329 alloc_free_block_lists (MSBlockInfo ***lists)
2330 {
2331         int i;
2332         for (i = 0; i < MS_BLOCK_TYPE_MAX; ++i)
2333                 lists [i] = sgen_alloc_internal_dynamic (sizeof (MSBlockInfo*) * num_block_obj_sizes, INTERNAL_MEM_MS_TABLES, TRUE);
2334 }
2335
2336 #undef pthread_create
2337
2338 static void
2339 post_param_init (SgenMajorCollector *collector)
2340 {
2341         collector->sweeps_lazily = lazy_sweep;
2342 }
2343
2344 #ifdef SGEN_HAVE_CONCURRENT_MARK
2345 static void
2346 sgen_marksweep_init_internal (SgenMajorCollector *collector, gboolean is_concurrent)
2347 #else // SGEN_HAVE_CONCURRENT_MARK
2348 #error unknown configuration
2349 #endif // SGEN_HAVE_CONCURRENT_MARK
2350 {
2351         int i;
2352
2353         sgen_register_fixed_internal_mem_type (INTERNAL_MEM_MS_BLOCK_INFO, sizeof (MSBlockInfo));
2354
2355         num_block_obj_sizes = ms_calculate_block_obj_sizes (MS_BLOCK_OBJ_SIZE_FACTOR, NULL);
2356         block_obj_sizes = sgen_alloc_internal_dynamic (sizeof (int) * num_block_obj_sizes, INTERNAL_MEM_MS_TABLES, TRUE);
2357         ms_calculate_block_obj_sizes (MS_BLOCK_OBJ_SIZE_FACTOR, block_obj_sizes);
2358
2359         evacuate_block_obj_sizes = sgen_alloc_internal_dynamic (sizeof (gboolean) * num_block_obj_sizes, INTERNAL_MEM_MS_TABLES, TRUE);
2360         for (i = 0; i < num_block_obj_sizes; ++i)
2361                 evacuate_block_obj_sizes [i] = FALSE;
2362
2363         /*
2364         {
2365                 int i;
2366                 g_print ("block object sizes:\n");
2367                 for (i = 0; i < num_block_obj_sizes; ++i)
2368                         g_print ("%d\n", block_obj_sizes [i]);
2369         }
2370         */
2371
2372         alloc_free_block_lists (free_block_lists);
2373
2374         for (i = 0; i < MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES; ++i)
2375                 fast_block_obj_size_indexes [i] = ms_find_block_obj_size_index (i * 8);
2376         for (i = 0; i < MS_NUM_FAST_BLOCK_OBJ_SIZE_INDEXES * 8; ++i)
2377                 g_assert (MS_BLOCK_OBJ_SIZE_INDEX (i) == ms_find_block_obj_size_index (i));
2378
2379         mono_counters_register ("# major blocks allocated", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_blocks_alloced);
2380         mono_counters_register ("# major blocks freed", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_blocks_freed);
2381         mono_counters_register ("# major blocks lazy swept", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_blocks_lazy_swept);
2382         mono_counters_register ("# major objects evacuated", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_objects_evacuated);
2383 #if SIZEOF_VOID_P != 8
2384         mono_counters_register ("# major blocks freed ideally", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_blocks_freed_ideal);
2385         mono_counters_register ("# major blocks freed less ideally", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_blocks_freed_less_ideal);
2386         mono_counters_register ("# major blocks freed individually", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_blocks_freed_individual);
2387         mono_counters_register ("# major blocks allocated less ideally", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_major_blocks_alloced_less_ideal);
2388 #endif
2389
2390         collector->section_size = MAJOR_SECTION_SIZE;
2391
2392 #ifdef SGEN_HAVE_CONCURRENT_MARK
2393         concurrent_mark = is_concurrent;
2394         if (is_concurrent) {
2395                 collector->is_concurrent = TRUE;
2396                 collector->want_synchronous_collection = &want_evacuation;
2397         } else
2398 #endif
2399         {
2400                 collector->is_concurrent = FALSE;
2401                 collector->want_synchronous_collection = NULL;
2402         }
2403         collector->get_and_reset_num_major_objects_marked = major_get_and_reset_num_major_objects_marked;
2404         collector->supports_cardtable = TRUE;
2405
2406         collector->have_swept = &have_swept;
2407
2408         collector->alloc_heap = major_alloc_heap;
2409         collector->is_object_live = major_is_object_live;
2410         collector->alloc_small_pinned_obj = major_alloc_small_pinned_obj;
2411         collector->alloc_degraded = major_alloc_degraded;
2412
2413         collector->alloc_object = major_alloc_object;
2414         collector->free_pinned_object = free_pinned_object;
2415         collector->iterate_objects = major_iterate_objects;
2416         collector->free_non_pinned_object = major_free_non_pinned_object;
2417         collector->find_pin_queue_start_ends = major_find_pin_queue_start_ends;
2418         collector->pin_objects = major_pin_objects;
2419         collector->pin_major_object = pin_major_object;
2420         collector->scan_card_table = major_scan_card_table;
2421         collector->iterate_live_block_ranges = (void*)(void*) major_iterate_live_block_ranges;
2422 #ifdef SGEN_HAVE_CONCURRENT_MARK
2423         if (is_concurrent) {
2424                 collector->update_cardtable_mod_union = update_cardtable_mod_union;
2425                 collector->get_cardtable_mod_union_for_object = major_get_cardtable_mod_union_for_object;
2426         }
2427 #endif
2428         collector->init_to_space = major_init_to_space;
2429         collector->sweep = major_sweep;
2430         collector->check_scan_starts = major_check_scan_starts;
2431         collector->dump_heap = major_dump_heap;
2432         collector->get_used_size = major_get_used_size;
2433         collector->start_nursery_collection = major_start_nursery_collection;
2434         collector->finish_nursery_collection = major_finish_nursery_collection;
2435         collector->start_major_collection = major_start_major_collection;
2436         collector->finish_major_collection = major_finish_major_collection;
2437         collector->have_computed_minor_collection_allowance = major_have_computer_minor_collection_allowance;
2438         collector->ptr_is_in_non_pinned_space = major_ptr_is_in_non_pinned_space;
2439         collector->obj_is_from_pinned_alloc = obj_is_from_pinned_alloc;
2440         collector->report_pinned_memory_usage = major_report_pinned_memory_usage;
2441         collector->get_num_major_sections = get_num_major_sections;
2442         collector->handle_gc_param = major_handle_gc_param;
2443         collector->print_gc_param_usage = major_print_gc_param_usage;
2444         collector->post_param_init = post_param_init;
2445         collector->is_valid_object = major_is_valid_object;
2446         collector->describe_pointer = major_describe_pointer;
2447         collector->count_cards = major_count_cards;
2448
2449         collector->major_ops.copy_or_mark_object = major_copy_or_mark_object_canonical;
2450         collector->major_ops.scan_object = major_scan_object;
2451 #ifdef SGEN_HAVE_CONCURRENT_MARK
2452         if (is_concurrent) {
2453                 collector->major_concurrent_ops.copy_or_mark_object = major_copy_or_mark_object_concurrent_canonical;
2454                 collector->major_concurrent_ops.scan_object = major_scan_object_concurrent;
2455                 collector->major_concurrent_ops.scan_vtype = major_scan_vtype_concurrent;
2456         }
2457 #endif
2458
2459 #if !defined (FIXED_HEAP) && !defined (SGEN_PARALLEL_MARK)
2460         /* FIXME: this will not work with evacuation or the split nursery. */
2461         if (!is_concurrent)
2462                 collector->drain_gray_stack = drain_gray_stack;
2463
2464 #ifdef HEAVY_STATISTICS
2465         mono_counters_register ("Optimized copy object called", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_optimized_copy_object_called);
2466         mono_counters_register ("Optimized nursery", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_optimized_nursery);
2467         mono_counters_register ("Optimized nursery forwarded", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_optimized_nursery_forwarded);
2468         mono_counters_register ("Optimized nursery pinned", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_optimized_nursery_pinned);
2469         mono_counters_register ("Optimized major mark", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_optimized_major_mark);
2470         mono_counters_register ("Optimized major mark small", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_optimized_major_mark_small);
2471         mono_counters_register ("Optimized major mark large", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_optimized_major_mark_large);
2472         mono_counters_register ("Optimized major scan", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_optimized_major_scan);
2473         mono_counters_register ("Optimized major scan slow", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_optimized_major_scan_slow);
2474         mono_counters_register ("Optimized major scan fast", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_optimized_major_scan_fast);
2475
2476         mono_counters_register ("Gray stack drain loops", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_drain_loops);
2477         mono_counters_register ("Gray stack prefetch fills", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_drain_prefetch_fills);
2478         mono_counters_register ("Gray stack prefetch failures", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_drain_prefetch_fill_failures);
2479 #endif
2480 #endif
2481
2482 #ifdef HEAVY_STATISTICS
2483         mono_mutex_init (&scanned_objects_list_lock);
2484 #endif
2485
2486         SGEN_ASSERT (0, SGEN_MAX_SMALL_OBJ_SIZE <= MS_BLOCK_FREE / 2, "MAX_SMALL_OBJ_SIZE must be at most MS_BLOCK_FREE / 2");
2487
2488         /*cardtable requires major pages to be 8 cards aligned*/
2489         g_assert ((MS_BLOCK_SIZE % (8 * CARD_SIZE_IN_BYTES)) == 0);
2490 }
2491
2492 #ifdef SGEN_HAVE_CONCURRENT_MARK
2493 void
2494 sgen_marksweep_init (SgenMajorCollector *collector)
2495 {
2496         sgen_marksweep_init_internal (collector, FALSE);
2497 }
2498
2499 void
2500 sgen_marksweep_conc_init (SgenMajorCollector *collector)
2501 {
2502         sgen_marksweep_init_internal (collector, TRUE);
2503 }
2504 #endif
2505
2506 #endif