mono/metadata/sgen-marksweep.c

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