mono/metadata/sgen-marksweep.c

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