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