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