mono/metadata/sgen-marksweep.c

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