1#include "ruby/internal/config.h"
8# ifdef HAVE_SYS_PRCTL_H
13#if !defined(PAGE_SIZE) && defined(HAVE_SYS_USER_H)
18#ifdef BUILDING_MODULAR_GC
19# define nlz_int64(x) (x == 0 ? 64 : (unsigned int)__builtin_clzll((unsigned long long)x))
21# include "internal/bits.h"
31#include "ccan/list/list.h"
34#include "gc/gc_impl.h"
36#ifndef BUILDING_MODULAR_GC
40#ifdef BUILDING_MODULAR_GC
41# define RB_DEBUG_COUNTER_INC(_name) ((void)0)
42# define RB_DEBUG_COUNTER_INC_IF(_name, cond) (!!(cond))
44# include "debug_counter.h"
47#ifdef BUILDING_MODULAR_GC
48# define rb_asan_poison_object(obj) ((void)(obj))
49# define rb_asan_unpoison_object(obj, newobj_p) ((void)(obj), (void)(newobj_p))
50# define asan_unpoisoning_object(obj) if ((obj) || true)
51# define asan_poison_memory_region(ptr, size) ((void)(ptr), (void)(size))
52# define asan_unpoison_memory_region(ptr, size, malloc_p) ((void)(ptr), (size), (malloc_p))
53# define asan_unpoisoning_memory_region(ptr, size) if ((ptr) || (size) || true)
55# define VALGRIND_MAKE_MEM_DEFINED(ptr, size) ((void)(ptr), (void)(size))
56# define VALGRIND_MAKE_MEM_UNDEFINED(ptr, size) ((void)(ptr), (void)(size))
58# include "internal/sanitizers.h"
62#ifndef HAVE_MALLOC_USABLE_SIZE
64# define HAVE_MALLOC_USABLE_SIZE
65# define malloc_usable_size(a) _msize(a)
66# elif defined HAVE_MALLOC_SIZE
67# define HAVE_MALLOC_USABLE_SIZE
68# define malloc_usable_size(a) malloc_size(a)
72#ifdef HAVE_MALLOC_USABLE_SIZE
73# ifdef RUBY_ALTERNATIVE_MALLOC_HEADER
75# elif defined(HAVE_MALLOC_H)
77# elif defined(HAVE_MALLOC_NP_H)
78# include <malloc_np.h>
79# elif defined(HAVE_MALLOC_MALLOC_H)
80# include <malloc/malloc.h>
84#ifdef HAVE_MALLOC_TRIM
89# include <emscripten/emmalloc.h>
93#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
94# include <mach/task.h>
95# include <mach/mach_init.h>
96# include <mach/mach_port.h>
100# define VM_CHECK_MODE RUBY_DEBUG
104#ifndef RACTOR_CHECK_MODE
105# define RACTOR_CHECK_MODE (VM_CHECK_MODE || RUBY_DEBUG) && (SIZEOF_UINT64_T == SIZEOF_VALUE)
108#ifndef RUBY_DEBUG_LOG
109# define RUBY_DEBUG_LOG(...)
112#ifndef GC_HEAP_INIT_SLOTS
113#define GC_HEAP_INIT_SLOTS 10000
115#ifndef GC_HEAP_FREE_SLOTS
116#define GC_HEAP_FREE_SLOTS 4096
118#ifndef GC_HEAP_GROWTH_FACTOR
119#define GC_HEAP_GROWTH_FACTOR 1.8
121#ifndef GC_HEAP_GROWTH_MAX_SLOTS
122#define GC_HEAP_GROWTH_MAX_SLOTS 0
124#ifndef GC_HEAP_REMEMBERED_WB_UNPROTECTED_OBJECTS_LIMIT_RATIO
125# define GC_HEAP_REMEMBERED_WB_UNPROTECTED_OBJECTS_LIMIT_RATIO 0.01
127#ifndef GC_HEAP_OLDOBJECT_LIMIT_FACTOR
128#define GC_HEAP_OLDOBJECT_LIMIT_FACTOR 2.0
131#ifndef GC_HEAP_FREE_SLOTS_MIN_RATIO
132#define GC_HEAP_FREE_SLOTS_MIN_RATIO 0.20
134#ifndef GC_HEAP_FREE_SLOTS_GOAL_RATIO
135#define GC_HEAP_FREE_SLOTS_GOAL_RATIO 0.40
137#ifndef GC_HEAP_FREE_SLOTS_MAX_RATIO
138#define GC_HEAP_FREE_SLOTS_MAX_RATIO 0.65
141#ifndef GC_MALLOC_LIMIT_MIN
142#define GC_MALLOC_LIMIT_MIN (16 * 1024 * 1024 )
144#ifndef GC_MALLOC_LIMIT_MAX
145#define GC_MALLOC_LIMIT_MAX (32 * 1024 * 1024 )
147#ifndef GC_MALLOC_LIMIT_GROWTH_FACTOR
148#define GC_MALLOC_LIMIT_GROWTH_FACTOR 1.4
151#ifndef GC_OLDMALLOC_LIMIT_MIN
152#define GC_OLDMALLOC_LIMIT_MIN (16 * 1024 * 1024 )
154#ifndef GC_OLDMALLOC_LIMIT_GROWTH_FACTOR
155#define GC_OLDMALLOC_LIMIT_GROWTH_FACTOR 1.2
157#ifndef GC_OLDMALLOC_LIMIT_MAX
158#define GC_OLDMALLOC_LIMIT_MAX (128 * 1024 * 1024 )
161#ifndef GC_CAN_COMPILE_COMPACTION
163# define GC_CAN_COMPILE_COMPACTION 0
165# define GC_CAN_COMPILE_COMPACTION 1
169#ifndef PRINT_ENTER_EXIT_TICK
170# define PRINT_ENTER_EXIT_TICK 0
172#ifndef PRINT_ROOT_TICKS
173#define PRINT_ROOT_TICKS 0
176#define USE_TICK_T (PRINT_ENTER_EXIT_TICK || PRINT_ROOT_TICKS)
185 size_t allocated_objects_count;
189 size_t incremental_mark_step_allocated_slots;
194 size_t heap_init_slots[HEAP_COUNT];
195 size_t heap_free_slots;
196 double growth_factor;
197 size_t growth_max_slots;
199 double heap_free_slots_min_ratio;
200 double heap_free_slots_goal_ratio;
201 double heap_free_slots_max_ratio;
202 double uncollectible_wb_unprotected_objects_limit_ratio;
203 double oldobject_limit_factor;
205 size_t malloc_limit_min;
206 size_t malloc_limit_max;
207 double malloc_limit_growth_factor;
209 size_t oldmalloc_limit_min;
210 size_t oldmalloc_limit_max;
211 double oldmalloc_limit_growth_factor;
215 { GC_HEAP_INIT_SLOTS },
217 GC_HEAP_GROWTH_FACTOR,
218 GC_HEAP_GROWTH_MAX_SLOTS,
220 GC_HEAP_FREE_SLOTS_MIN_RATIO,
221 GC_HEAP_FREE_SLOTS_GOAL_RATIO,
222 GC_HEAP_FREE_SLOTS_MAX_RATIO,
223 GC_HEAP_REMEMBERED_WB_UNPROTECTED_OBJECTS_LIMIT_RATIO,
224 GC_HEAP_OLDOBJECT_LIMIT_FACTOR,
228 GC_MALLOC_LIMIT_GROWTH_FACTOR,
230 GC_OLDMALLOC_LIMIT_MIN,
231 GC_OLDMALLOC_LIMIT_MAX,
232 GC_OLDMALLOC_LIMIT_GROWTH_FACTOR,
251#define RGENGC_DEBUG -1
253#define RGENGC_DEBUG 0
256#if RGENGC_DEBUG < 0 && !defined(_MSC_VER)
257# define RGENGC_DEBUG_ENABLED(level) (-(RGENGC_DEBUG) >= (level) && ruby_rgengc_debug >= (level))
258#elif defined(HAVE_VA_ARGS_MACRO)
259# define RGENGC_DEBUG_ENABLED(level) ((RGENGC_DEBUG) >= (level))
261# define RGENGC_DEBUG_ENABLED(level) 0
263int ruby_rgengc_debug;
270#ifndef RGENGC_PROFILE
271# define RGENGC_PROFILE 0
280#ifndef RGENGC_ESTIMATE_OLDMALLOC
281# define RGENGC_ESTIMATE_OLDMALLOC 1
284#ifndef GC_PROFILE_MORE_DETAIL
285# define GC_PROFILE_MORE_DETAIL 0
287#ifndef GC_PROFILE_DETAIL_MEMORY
288# define GC_PROFILE_DETAIL_MEMORY 0
290#ifndef GC_ENABLE_LAZY_SWEEP
291# define GC_ENABLE_LAZY_SWEEP 1
293#ifndef CALC_EXACT_MALLOC_SIZE
294# define CALC_EXACT_MALLOC_SIZE 0
296#if defined(HAVE_MALLOC_USABLE_SIZE) || CALC_EXACT_MALLOC_SIZE > 0
297# ifndef MALLOC_ALLOCATED_SIZE
298# define MALLOC_ALLOCATED_SIZE 0
301# define MALLOC_ALLOCATED_SIZE 0
303#ifndef MALLOC_ALLOCATED_SIZE_CHECK
304# define MALLOC_ALLOCATED_SIZE_CHECK 0
307#ifndef GC_DEBUG_STRESS_TO_CLASS
308# define GC_DEBUG_STRESS_TO_CLASS 1
312 GPR_FLAG_NONE = 0x000,
314 GPR_FLAG_MAJOR_BY_NOFREE = 0x001,
315 GPR_FLAG_MAJOR_BY_OLDGEN = 0x002,
316 GPR_FLAG_MAJOR_BY_SHADY = 0x004,
317 GPR_FLAG_MAJOR_BY_FORCE = 0x008,
318#if RGENGC_ESTIMATE_OLDMALLOC
319 GPR_FLAG_MAJOR_BY_OLDMALLOC = 0x020,
321 GPR_FLAG_MAJOR_MASK = 0x0ff,
324 GPR_FLAG_NEWOBJ = 0x100,
325 GPR_FLAG_MALLOC = 0x200,
326 GPR_FLAG_METHOD = 0x400,
327 GPR_FLAG_CAPI = 0x800,
328 GPR_FLAG_STRESS = 0x1000,
331 GPR_FLAG_IMMEDIATE_SWEEP = 0x2000,
332 GPR_FLAG_HAVE_FINALIZE = 0x4000,
333 GPR_FLAG_IMMEDIATE_MARK = 0x8000,
334 GPR_FLAG_FULL_MARK = 0x10000,
335 GPR_FLAG_COMPACT = 0x20000,
338 (GPR_FLAG_FULL_MARK | GPR_FLAG_IMMEDIATE_MARK |
339 GPR_FLAG_IMMEDIATE_SWEEP | GPR_FLAG_CAPI),
340} gc_profile_record_flag;
346 double gc_invoke_time;
348 size_t heap_total_objects;
349 size_t heap_use_size;
350 size_t heap_total_size;
351 size_t moved_objects;
353#if GC_PROFILE_MORE_DETAIL
355 double gc_sweep_time;
357 size_t heap_use_pages;
358 size_t heap_live_objects;
359 size_t heap_free_objects;
361 size_t allocate_increase;
362 size_t allocate_limit;
365 size_t removing_objects;
366 size_t empty_objects;
367#if GC_PROFILE_DETAIL_MEMORY
373#if MALLOC_ALLOCATED_SIZE
374 size_t allocated_size;
377#if RGENGC_PROFILE > 0
379 size_t remembered_normal_objects;
380 size_t remembered_shady_objects;
388 uint32_t original_shape_id;
391#define RMOVED(obj) ((struct RMoved *)(obj))
393typedef uintptr_t bits_t;
395 BITS_SIZE =
sizeof(bits_t),
396 BITS_BITLENGTH = ( BITS_SIZE * CHAR_BIT )
409#define STACK_CHUNK_SIZE 500
412 VALUE data[STACK_CHUNK_SIZE];
422 size_t unused_cache_size;
425typedef int (*gc_compact_compare_func)(
const void *l,
const void *r,
void *d);
431 size_t total_allocated_pages;
432 size_t force_major_gc_count;
433 size_t force_incremental_marking_finish_count;
434 size_t total_allocated_objects;
435 size_t total_freed_objects;
436 size_t final_slots_count;
443 struct ccan_list_head pages;
446 uintptr_t compact_cursor_index;
455 gc_stress_no_immediate_sweep,
456 gc_stress_full_mark_after_malloc,
471#if MALLOC_ALLOCATED_SIZE
472 size_t allocated_size;
482 unsigned int mode : 2;
483 unsigned int immediate_sweep : 1;
484 unsigned int dont_gc : 1;
485 unsigned int dont_incremental : 1;
486 unsigned int during_gc : 1;
487 unsigned int during_compacting : 1;
488 unsigned int during_reference_updating : 1;
489 unsigned int gc_stressful: 1;
490 unsigned int has_newobj_hook: 1;
491 unsigned int during_minor_gc : 1;
492 unsigned int during_incremental_marking : 1;
493 unsigned int measure_gc : 1;
499 size_t empty_pages_count;
512 size_t allocated_pages;
515 size_t freeable_pages;
517 size_t allocatable_slots;
520 VALUE deferred_final;
527 unsigned int latest_gc_info;
533#if GC_PROFILE_MORE_DETAIL
538 size_t minor_gc_count;
539 size_t major_gc_count;
540 size_t compact_count;
541 size_t read_barrier_faults;
542#if RGENGC_PROFILE > 0
543 size_t total_generated_normal_object_count;
544 size_t total_generated_shady_object_count;
545 size_t total_shade_operation_count;
546 size_t total_promoted_count;
547 size_t total_remembered_normal_object_count;
548 size_t total_remembered_shady_object_count;
550#if RGENGC_PROFILE >= 2
551 size_t generated_normal_object_count_types[
RUBY_T_MASK];
552 size_t generated_shady_object_count_types[
RUBY_T_MASK];
555 size_t remembered_normal_object_count_types[
RUBY_T_MASK];
556 size_t remembered_shady_object_count_types[
RUBY_T_MASK];
561 double gc_sweep_start_time;
562 size_t total_allocated_objects_at_gc_start;
563 size_t heap_used_at_gc_start;
567 unsigned long long marking_time_ns;
569 unsigned long long sweeping_time_ns;
570 struct timespec sweeping_start_time;
573 size_t weak_references_count;
574 size_t retained_weak_references_count;
577 VALUE gc_stress_mode;
580 bool parent_object_old_p;
584 size_t last_major_gc;
585 size_t uncollectible_wb_unprotected_objects;
586 size_t uncollectible_wb_unprotected_objects_limit;
588 size_t old_objects_limit;
590#if RGENGC_ESTIMATE_OLDMALLOC
591 size_t oldmalloc_increase;
592 size_t oldmalloc_increase_limit;
595#if RGENGC_CHECK_MODE >= 2
602 size_t considered_count_table[
T_MASK];
603 size_t moved_count_table[
T_MASK];
604 size_t moved_up_count_table[
T_MASK];
605 size_t moved_down_count_table[
T_MASK];
609 gc_compact_compare_func compare_func;
617#if GC_DEBUG_STRESS_TO_CLASS
618 VALUE stress_to_class;
621 rb_darray(
VALUE *) weak_references;
624 unsigned long live_ractor_cache_count;
627#ifndef HEAP_PAGE_ALIGN_LOG
629#define HEAP_PAGE_ALIGN_LOG 16
632#if RACTOR_CHECK_MODE || GC_DEBUG
633struct rvalue_overhead {
634# if RACTOR_CHECK_MODE
635 uint32_t _ractor_belonging_id;
644# define RVALUE_OVERHEAD (sizeof(struct { \
646 struct rvalue_overhead overhead; \
650size_t rb_gc_impl_obj_slot_size(
VALUE obj);
651# define GET_RVALUE_OVERHEAD(obj) ((struct rvalue_overhead *)((uintptr_t)obj + rb_gc_impl_obj_slot_size(obj)))
653# ifndef RVALUE_OVERHEAD
654# define RVALUE_OVERHEAD 0
658#define BASE_SLOT_SIZE (sizeof(struct RBasic) + sizeof(VALUE[RBIMPL_RVALUE_EMBED_LEN_MAX]) + RVALUE_OVERHEAD)
661# define MAX(a, b) (((a) > (b)) ? (a) : (b))
664# define MIN(a, b) (((a) < (b)) ? (a) : (b))
666#define roomof(x, y) (((x) + (y) - 1) / (y))
667#define CEILDIV(i, mod) roomof(i, mod)
669 HEAP_PAGE_ALIGN = (1UL << HEAP_PAGE_ALIGN_LOG),
670 HEAP_PAGE_ALIGN_MASK = (~(~0UL << HEAP_PAGE_ALIGN_LOG)),
671 HEAP_PAGE_SIZE = HEAP_PAGE_ALIGN,
672 HEAP_PAGE_OBJ_LIMIT = (
unsigned int)((HEAP_PAGE_SIZE -
sizeof(
struct heap_page_header)) / BASE_SLOT_SIZE),
673 HEAP_PAGE_BITMAP_LIMIT = CEILDIV(CEILDIV(HEAP_PAGE_SIZE, BASE_SLOT_SIZE), BITS_BITLENGTH),
674 HEAP_PAGE_BITMAP_SIZE = (BITS_SIZE * HEAP_PAGE_BITMAP_LIMIT),
676#define HEAP_PAGE_ALIGN (1 << HEAP_PAGE_ALIGN_LOG)
677#define HEAP_PAGE_SIZE HEAP_PAGE_ALIGN
679#if !defined(INCREMENTAL_MARK_STEP_ALLOCATIONS)
680# define INCREMENTAL_MARK_STEP_ALLOCATIONS 500
683#undef INIT_HEAP_PAGE_ALLOC_USE_MMAP
689static const bool HEAP_PAGE_ALLOC_USE_MMAP =
false;
691#elif defined(__wasm__)
695static const bool HEAP_PAGE_ALLOC_USE_MMAP =
false;
697#elif HAVE_CONST_PAGE_SIZE
699static const bool HEAP_PAGE_ALLOC_USE_MMAP = (PAGE_SIZE <= HEAP_PAGE_SIZE);
701#elif defined(PAGE_MAX_SIZE) && (PAGE_MAX_SIZE <= HEAP_PAGE_SIZE)
703static const bool HEAP_PAGE_ALLOC_USE_MMAP =
true;
705#elif defined(PAGE_SIZE)
707# define INIT_HEAP_PAGE_ALLOC_USE_MMAP (PAGE_SIZE <= HEAP_PAGE_SIZE)
709#elif defined(HAVE_SYSCONF) && defined(_SC_PAGE_SIZE)
711# define INIT_HEAP_PAGE_ALLOC_USE_MMAP (sysconf(_SC_PAGE_SIZE) <= HEAP_PAGE_SIZE)
715static const bool HEAP_PAGE_ALLOC_USE_MMAP =
false;
718#ifdef INIT_HEAP_PAGE_ALLOC_USE_MMAP
720# define HEAP_PAGE_ALLOC_USE_MMAP (heap_page_alloc_use_mmap != false)
722static bool heap_page_alloc_use_mmap;
725#define RVALUE_AGE_BIT_COUNT 2
726#define RVALUE_AGE_BIT_MASK (((bits_t)1 << RVALUE_AGE_BIT_COUNT) - 1)
727#define RVALUE_OLD_AGE 3
735 unsigned short slot_size;
736 unsigned short total_slots;
737 unsigned short free_slots;
738 unsigned short final_slots;
739 unsigned short pinned_slots;
741 unsigned int before_sweep : 1;
742 unsigned int has_remembered_objects : 1;
743 unsigned int has_uncollectible_wb_unprotected_objects : 1;
752 struct ccan_list_node page_node;
754 bits_t wb_unprotected_bits[HEAP_PAGE_BITMAP_LIMIT];
756 bits_t mark_bits[HEAP_PAGE_BITMAP_LIMIT];
757 bits_t uncollectible_bits[HEAP_PAGE_BITMAP_LIMIT];
758 bits_t marking_bits[HEAP_PAGE_BITMAP_LIMIT];
760 bits_t remembered_bits[HEAP_PAGE_BITMAP_LIMIT];
763 bits_t pinned_bits[HEAP_PAGE_BITMAP_LIMIT];
764 bits_t age_bits[HEAP_PAGE_BITMAP_LIMIT * RVALUE_AGE_BIT_COUNT];
771asan_lock_freelist(
struct heap_page *page)
773 asan_poison_memory_region(&page->freelist,
sizeof(
struct free_list *));
780asan_unlock_freelist(
struct heap_page *page)
782 asan_unpoison_memory_region(&page->freelist,
sizeof(
struct free_list *),
false);
788 if (page->total_slots == 0) {
789 GC_ASSERT(page->start == 0);
790 GC_ASSERT(page->slot_size == 0);
791 GC_ASSERT(page->heap == NULL);
792 GC_ASSERT(page->free_slots == 0);
793 asan_unpoisoning_memory_region(&page->freelist,
sizeof(&page->freelist)) {
794 GC_ASSERT(page->freelist == NULL);
800 GC_ASSERT(page->start != 0);
801 GC_ASSERT(page->slot_size != 0);
802 GC_ASSERT(page->heap != NULL);
808#define GET_PAGE_BODY(x) ((struct heap_page_body *)((bits_t)(x) & ~(HEAP_PAGE_ALIGN_MASK)))
809#define GET_PAGE_HEADER(x) (&GET_PAGE_BODY(x)->header)
810#define GET_HEAP_PAGE(x) (GET_PAGE_HEADER(x)->page)
812#define NUM_IN_PAGE(p) (((bits_t)(p) & HEAP_PAGE_ALIGN_MASK) / BASE_SLOT_SIZE)
813#define BITMAP_INDEX(p) (NUM_IN_PAGE(p) / BITS_BITLENGTH )
814#define BITMAP_OFFSET(p) (NUM_IN_PAGE(p) & (BITS_BITLENGTH-1))
815#define BITMAP_BIT(p) ((bits_t)1 << BITMAP_OFFSET(p))
818#define MARKED_IN_BITMAP(bits, p) ((bits)[BITMAP_INDEX(p)] & BITMAP_BIT(p))
819#define MARK_IN_BITMAP(bits, p) ((bits)[BITMAP_INDEX(p)] = (bits)[BITMAP_INDEX(p)] | BITMAP_BIT(p))
820#define CLEAR_IN_BITMAP(bits, p) ((bits)[BITMAP_INDEX(p)] = (bits)[BITMAP_INDEX(p)] & ~BITMAP_BIT(p))
823#define GET_HEAP_MARK_BITS(x) (&GET_HEAP_PAGE(x)->mark_bits[0])
824#define GET_HEAP_PINNED_BITS(x) (&GET_HEAP_PAGE(x)->pinned_bits[0])
825#define GET_HEAP_UNCOLLECTIBLE_BITS(x) (&GET_HEAP_PAGE(x)->uncollectible_bits[0])
826#define GET_HEAP_WB_UNPROTECTED_BITS(x) (&GET_HEAP_PAGE(x)->wb_unprotected_bits[0])
827#define GET_HEAP_MARKING_BITS(x) (&GET_HEAP_PAGE(x)->marking_bits[0])
829#define RVALUE_AGE_BITMAP_INDEX(n) (NUM_IN_PAGE(n) / (BITS_BITLENGTH / RVALUE_AGE_BIT_COUNT))
830#define RVALUE_AGE_BITMAP_OFFSET(n) ((NUM_IN_PAGE(n) % (BITS_BITLENGTH / RVALUE_AGE_BIT_COUNT)) * RVALUE_AGE_BIT_COUNT)
833RVALUE_AGE_GET(
VALUE obj)
835 bits_t *age_bits = GET_HEAP_PAGE(obj)->age_bits;
836 return (
int)(age_bits[RVALUE_AGE_BITMAP_INDEX(obj)] >> RVALUE_AGE_BITMAP_OFFSET(obj)) & RVALUE_AGE_BIT_MASK;
840RVALUE_AGE_SET(
VALUE obj,
int age)
843 bits_t *age_bits = GET_HEAP_PAGE(obj)->age_bits;
845 age_bits[RVALUE_AGE_BITMAP_INDEX(obj)] &= ~(RVALUE_AGE_BIT_MASK << (RVALUE_AGE_BITMAP_OFFSET(obj)));
847 age_bits[RVALUE_AGE_BITMAP_INDEX(obj)] |= ((bits_t)age << RVALUE_AGE_BITMAP_OFFSET(obj));
848 if (age == RVALUE_OLD_AGE) {
856#define malloc_limit objspace->malloc_params.limit
857#define malloc_increase objspace->malloc_params.increase
858#define malloc_allocated_size objspace->malloc_params.allocated_size
859#define heap_pages_lomem objspace->heap_pages.range[0]
860#define heap_pages_himem objspace->heap_pages.range[1]
861#define heap_pages_freeable_pages objspace->heap_pages.freeable_pages
862#define heap_pages_deferred_final objspace->heap_pages.deferred_final
863#define heaps objspace->heaps
864#define during_gc objspace->flags.during_gc
865#define finalizing objspace->atomic_flags.finalizing
866#define finalizer_table objspace->finalizer_table
867#define ruby_gc_stressful objspace->flags.gc_stressful
868#define ruby_gc_stress_mode objspace->gc_stress_mode
869#if GC_DEBUG_STRESS_TO_CLASS
870#define stress_to_class objspace->stress_to_class
871#define set_stress_to_class(c) (stress_to_class = (c))
873#define stress_to_class ((void)objspace, 0)
874#define set_stress_to_class(c) ((void)objspace, (c))
878#define dont_gc_on() (fprintf(stderr, "dont_gc_on@%s:%d\n", __FILE__, __LINE__), objspace->flags.dont_gc = 1)
879#define dont_gc_off() (fprintf(stderr, "dont_gc_off@%s:%d\n", __FILE__, __LINE__), objspace->flags.dont_gc = 0)
880#define dont_gc_set(b) (fprintf(stderr, "dont_gc_set(%d)@%s:%d\n", __FILE__, __LINE__), objspace->flags.dont_gc = (int)(b))
881#define dont_gc_val() (objspace->flags.dont_gc)
883#define dont_gc_on() (objspace->flags.dont_gc = 1)
884#define dont_gc_off() (objspace->flags.dont_gc = 0)
885#define dont_gc_set(b) (objspace->flags.dont_gc = (int)(b))
886#define dont_gc_val() (objspace->flags.dont_gc)
889#define gc_config_full_mark_set(b) (objspace->gc_config.full_mark = (int)(b))
890#define gc_config_full_mark_val (objspace->gc_config.full_mark)
892#ifndef DURING_GC_COULD_MALLOC_REGION_START
893# define DURING_GC_COULD_MALLOC_REGION_START() \
894 assert(rb_during_gc()); \
895 bool _prev_enabled = rb_gc_impl_gc_enabled_p(objspace); \
896 rb_gc_impl_gc_disable(objspace, false)
899#ifndef DURING_GC_COULD_MALLOC_REGION_END
900# define DURING_GC_COULD_MALLOC_REGION_END() \
901 if (_prev_enabled) rb_gc_impl_gc_enable(objspace)
904static inline enum gc_mode
905gc_mode_verify(
enum gc_mode mode)
907#if RGENGC_CHECK_MODE > 0
910 case gc_mode_marking:
911 case gc_mode_sweeping:
912 case gc_mode_compacting:
915 rb_bug(
"gc_mode_verify: unreachable (%d)", (
int)mode);
924 for (
int i = 0; i < HEAP_COUNT; i++) {
925 if ((&heaps[i])->sweeping_page) {
936 for (
int i = 0; i < HEAP_COUNT; i++) {
937 count += (&heaps[i])->total_pages;
946 for (
int i = 0; i < HEAP_COUNT; i++) {
948 count += heap->total_allocated_objects;
957 for (
int i = 0; i < HEAP_COUNT; i++) {
959 count += heap->total_freed_objects;
968 for (
int i = 0; i < HEAP_COUNT; i++) {
970 count += heap->final_slots_count;
975#define gc_mode(objspace) gc_mode_verify((enum gc_mode)(objspace)->flags.mode)
976#define gc_mode_set(objspace, m) ((objspace)->flags.mode = (unsigned int)gc_mode_verify(m))
977#define gc_needs_major_flags objspace->rgengc.need_major_gc
979#define is_marking(objspace) (gc_mode(objspace) == gc_mode_marking)
980#define is_sweeping(objspace) (gc_mode(objspace) == gc_mode_sweeping)
981#define is_full_marking(objspace) ((objspace)->flags.during_minor_gc == FALSE)
982#define is_incremental_marking(objspace) ((objspace)->flags.during_incremental_marking != FALSE)
983#define will_be_incremental_marking(objspace) ((objspace)->rgengc.need_major_gc != GPR_FLAG_NONE)
984#define GC_INCREMENTAL_SWEEP_SLOT_COUNT 2048
985#define GC_INCREMENTAL_SWEEP_POOL_SLOT_COUNT 1024
986#define is_lazy_sweeping(objspace) (GC_ENABLE_LAZY_SWEEP && has_sweeping_pages(objspace))
988#if SIZEOF_LONG == SIZEOF_VOIDP
989# define obj_id_to_ref(objid) ((objid) ^ FIXNUM_FLAG)
990#elif SIZEOF_LONG_LONG == SIZEOF_VOIDP
991# define obj_id_to_ref(objid) (FIXNUM_P(objid) ? \
992 ((objid) ^ FIXNUM_FLAG) : (NUM2PTR(objid) << 1))
1000 void (*dfree)(
void *);
1004#define RZOMBIE(o) ((struct RZombie *)(o))
1006static bool ruby_enable_autocompact =
false;
1007#if RGENGC_CHECK_MODE
1008static gc_compact_compare_func ruby_autocompact_compare_func;
1012static int garbage_collect(
rb_objspace_t *,
unsigned int reason);
1017enum gc_enter_event {
1018 gc_enter_event_start,
1019 gc_enter_event_continue,
1020 gc_enter_event_rest,
1021 gc_enter_event_finalizer,
1024static inline void gc_enter(
rb_objspace_t *
objspace,
enum gc_enter_event event,
unsigned int *lock_lev);
1025static inline void gc_exit(
rb_objspace_t *
objspace,
enum gc_enter_event event,
unsigned int *lock_lev);
1040static int gc_mark_stacked_objects_incremental(
rb_objspace_t *,
size_t count);
1041NO_SANITIZE(
"memory",
static inline bool is_pointer_to_heap(
rb_objspace_t *
objspace,
const void *ptr));
1043static void gc_verify_internal_consistency(
void *objspace_ptr);
1045static double getrusage_time(
void);
1049static inline void gc_prof_mark_timer_start(
rb_objspace_t *);
1051static inline void gc_prof_sweep_timer_start(
rb_objspace_t *);
1052static inline void gc_prof_sweep_timer_stop(
rb_objspace_t *);
1056#define gc_prof_record(objspace) (objspace)->profile.current_record
1057#define gc_prof_enabled(objspace) ((objspace)->profile.run && (objspace)->profile.current_record)
1059#ifdef HAVE_VA_ARGS_MACRO
1060# define gc_report(level, objspace, ...) \
1061 if (!RGENGC_DEBUG_ENABLED(level)) {} else gc_report_body(level, objspace, __VA_ARGS__)
1063# define gc_report if (!RGENGC_DEBUG_ENABLED(0)) {} else gc_report_body
1065PRINTF_ARGS(
static void gc_report_body(
int level,
rb_objspace_t *
objspace,
const char *fmt, ...), 3, 4);
1067static void gc_finalize_deferred(
void *dmy);
1078#if defined(__GNUC__) && defined(__i386__)
1079typedef unsigned long long tick_t;
1080#define PRItick "llu"
1084 unsigned long long int x;
1085 __asm__ __volatile__ (
"rdtsc" :
"=A" (x));
1089#elif defined(__GNUC__) && defined(__x86_64__)
1090typedef unsigned long long tick_t;
1091#define PRItick "llu"
1093static __inline__ tick_t
1096 unsigned long hi, lo;
1097 __asm__ __volatile__ (
"rdtsc" :
"=a"(lo),
"=d"(hi));
1098 return ((
unsigned long long)lo)|( ((
unsigned long long)hi)<<32);
1101#elif defined(__powerpc64__) && (GCC_VERSION_SINCE(4,8,0) || defined(__clang__))
1102typedef unsigned long long tick_t;
1103#define PRItick "llu"
1105static __inline__ tick_t
1108 unsigned long long val = __builtin_ppc_get_timebase();
1112#elif defined(__POWERPC__) && defined(__APPLE__)
1116typedef unsigned long long tick_t;
1117#define PRItick "llu"
1119static __inline__ tick_t
1122 unsigned long int upper, lower, tmp;
1123 # define mftbu(r) __asm__ volatile("mftbu %0" : "=r"(r))
1124 # define mftb(r) __asm__ volatile("mftb %0" : "=r"(r))
1129 }
while (tmp != upper);
1130 return ((tick_t)upper << 32) | lower;
1133#elif defined(__aarch64__) && defined(__GNUC__)
1134typedef unsigned long tick_t;
1137static __inline__ tick_t
1141 __asm__ __volatile__ (
"mrs %0, cntvct_el0" :
"=r" (val));
1146#elif defined(_WIN32) && defined(_MSC_VER)
1148typedef unsigned __int64 tick_t;
1149#define PRItick "llu"
1158typedef clock_t tick_t;
1159#define PRItick "llu"
1168#define MEASURE_LINE(expr) expr
1173#define RVALUE_MARKED_BITMAP(obj) MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(obj), (obj))
1174#define RVALUE_WB_UNPROTECTED_BITMAP(obj) MARKED_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), (obj))
1175#define RVALUE_MARKING_BITMAP(obj) MARKED_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), (obj))
1176#define RVALUE_UNCOLLECTIBLE_BITMAP(obj) MARKED_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(obj), (obj))
1177#define RVALUE_PINNED_BITMAP(obj) MARKED_IN_BITMAP(GET_HEAP_PINNED_BITS(obj), (obj))
1182 check_rvalue_consistency(
objspace, obj);
1183 return RVALUE_MARKED_BITMAP(obj) != 0;
1189 check_rvalue_consistency(
objspace, obj);
1190 return RVALUE_PINNED_BITMAP(obj) != 0;
1196 check_rvalue_consistency(
objspace, obj);
1197 return RVALUE_WB_UNPROTECTED_BITMAP(obj) != 0;
1203 check_rvalue_consistency(
objspace, obj);
1204 return RVALUE_MARKING_BITMAP(obj) != 0;
1210 check_rvalue_consistency(
objspace, obj);
1211 return MARKED_IN_BITMAP(GET_HEAP_PAGE(obj)->remembered_bits, obj) != 0;
1217 check_rvalue_consistency(
objspace, obj);
1218 return RVALUE_UNCOLLECTIBLE_BITMAP(obj) != 0;
1221#define RVALUE_PAGE_WB_UNPROTECTED(page, obj) MARKED_IN_BITMAP((page)->wb_unprotected_bits, (obj))
1222#define RVALUE_PAGE_UNCOLLECTIBLE(page, obj) MARKED_IN_BITMAP((page)->uncollectible_bits, (obj))
1223#define RVALUE_PAGE_MARKING(page, obj) MARKED_IN_BITMAP((page)->marking_bits, (obj))
1234 int lev = RB_GC_VM_LOCK_NO_BARRIER();
1237 fprintf(stderr,
"check_rvalue_consistency: %p is a special const.\n", (
void *)obj);
1240 else if (!is_pointer_to_heap(
objspace, (
void *)obj)) {
1242 while (empty_page) {
1243 if ((uintptr_t)empty_page->body <= (uintptr_t)obj &&
1244 (uintptr_t)obj < (uintptr_t)empty_page->body + HEAP_PAGE_SIZE) {
1245 GC_ASSERT(heap_page_in_global_empty_pages_pool(
objspace, empty_page));
1246 fprintf(stderr,
"check_rvalue_consistency: %p is in an empty page (%p).\n",
1247 (
void *)obj, (
void *)empty_page);
1252 fprintf(stderr,
"check_rvalue_consistency: %p is not a Ruby object.\n", (
void *)obj);
1258 const int wb_unprotected_bit = RVALUE_WB_UNPROTECTED_BITMAP(obj) != 0;
1259 const int uncollectible_bit = RVALUE_UNCOLLECTIBLE_BITMAP(obj) != 0;
1260 const int mark_bit = RVALUE_MARKED_BITMAP(obj) != 0;
1261 const int marking_bit = RVALUE_MARKING_BITMAP(obj) != 0;
1262 const int remembered_bit = MARKED_IN_BITMAP(GET_HEAP_PAGE(obj)->remembered_bits, obj) != 0;
1263 const int age = RVALUE_AGE_GET((
VALUE)obj);
1265 if (heap_page_in_global_empty_pages_pool(
objspace, GET_HEAP_PAGE(obj))) {
1266 fprintf(stderr,
"check_rvalue_consistency: %s is in tomb page.\n", rb_obj_info(obj));
1270 fprintf(stderr,
"check_rvalue_consistency: %s is T_NONE.\n", rb_obj_info(obj));
1274 fprintf(stderr,
"check_rvalue_consistency: %s is T_ZOMBIE.\n", rb_obj_info(obj));
1279 rb_obj_memsize_of((
VALUE)obj);
1286 if (age > 0 && wb_unprotected_bit) {
1287 fprintf(stderr,
"check_rvalue_consistency: %s is not WB protected, but age is %d > 0.\n", rb_obj_info(obj), age);
1291 if (!is_marking(
objspace) && uncollectible_bit && !mark_bit) {
1292 fprintf(stderr,
"check_rvalue_consistency: %s is uncollectible, but is not marked while !gc.\n", rb_obj_info(obj));
1297 if (uncollectible_bit && age != RVALUE_OLD_AGE && !wb_unprotected_bit) {
1298 fprintf(stderr,
"check_rvalue_consistency: %s is uncollectible, but not old (age: %d) and not WB unprotected.\n",
1299 rb_obj_info(obj), age);
1302 if (remembered_bit && age != RVALUE_OLD_AGE) {
1303 fprintf(stderr,
"check_rvalue_consistency: %s is remembered, but not old (age: %d).\n",
1304 rb_obj_info(obj), age);
1316 if (is_incremental_marking(
objspace) && marking_bit) {
1317 if (!is_marking(
objspace) && !mark_bit) {
1318 fprintf(stderr,
"check_rvalue_consistency: %s is marking, but not marked.\n", rb_obj_info(obj));
1324 RB_GC_VM_UNLOCK_NO_BARRIER(lev);
1326 if (err > 0 && terminate) {
1327 rb_bug(
"check_rvalue_consistency_force: there is %d errors.", err);
1332#if RGENGC_CHECK_MODE == 0
1342 check_rvalue_consistency_force(
objspace, obj, TRUE);
1355 asan_unpoisoning_object(obj) {
1366 check_rvalue_consistency(
objspace, obj);
1375 MARK_IN_BITMAP(&page->uncollectible_bits[0], obj);
1378#if RGENGC_PROFILE >= 2
1379 objspace->profile.total_promoted_count++;
1387 RB_DEBUG_COUNTER_INC(obj_promote);
1388 RVALUE_PAGE_OLD_UNCOLLECTIBLE_SET(
objspace, GET_HEAP_PAGE(obj), obj);
1395 int age = RVALUE_AGE_GET((
VALUE)obj);
1397 if (RGENGC_CHECK_MODE && age == RVALUE_OLD_AGE) {
1398 rb_bug(
"RVALUE_AGE_INC: can not increment age of OLD object %s.", rb_obj_info(obj));
1402 RVALUE_AGE_SET(obj, age);
1404 if (age == RVALUE_OLD_AGE) {
1405 RVALUE_OLD_UNCOLLECTIBLE_SET(
objspace, obj);
1408 check_rvalue_consistency(
objspace, obj);
1414 check_rvalue_consistency(
objspace, obj);
1415 GC_ASSERT(!RVALUE_OLD_P(
objspace, obj));
1416 RVALUE_AGE_SET(obj, RVALUE_OLD_AGE - 1);
1417 check_rvalue_consistency(
objspace, obj);
1421RVALUE_AGE_RESET(
VALUE obj)
1423 RVALUE_AGE_SET(obj, 0);
1429 check_rvalue_consistency(
objspace, obj);
1430 GC_ASSERT(RVALUE_OLD_P(
objspace, obj));
1432 if (!is_incremental_marking(
objspace) && RVALUE_REMEMBERED(
objspace, obj)) {
1433 CLEAR_IN_BITMAP(GET_HEAP_PAGE(obj)->remembered_bits, obj);
1436 CLEAR_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(obj), obj);
1437 RVALUE_AGE_RESET(obj);
1439 if (RVALUE_MARKED(
objspace, obj)) {
1443 check_rvalue_consistency(
objspace, obj);
1455 return !RVALUE_MARKED(
objspace, obj);
1459rb_gc_impl_gc_enabled_p(
void *objspace_ptr)
1462 return !dont_gc_val();
1466rb_gc_impl_gc_enable(
void *objspace_ptr)
1474rb_gc_impl_gc_disable(
void *objspace_ptr,
bool finish_current_gc)
1478 if (finish_current_gc) {
1492 return calloc(1, n);
1496rb_gc_impl_set_event_hook(
void *objspace_ptr,
const rb_event_flag_t event)
1504rb_gc_impl_get_total_time(
void *objspace_ptr)
1508 unsigned long long marking_time =
objspace->profile.marking_time_ns;
1509 unsigned long long sweeping_time =
objspace->profile.sweeping_time_ns;
1511 return marking_time + sweeping_time;
1515rb_gc_impl_set_measure_total_time(
void *objspace_ptr,
VALUE flag)
1523rb_gc_impl_get_measure_total_time(
void *objspace_ptr)
1533 size_t heap_idx = heap - heaps;
1534 return gc_params.heap_init_slots[heap_idx];
1539rb_gc_impl_garbage_object_p(
void *objspace_ptr,
VALUE ptr)
1545 asan_unpoisoning_object(ptr) {
1557 if (dead)
return true;
1558 return is_lazy_sweeping(
objspace) && GET_HEAP_PAGE(ptr)->flags.before_sweep &&
1569 rb_asan_unpoison_object(obj,
false);
1571 asan_unlock_freelist(page);
1575 slot->next = page->freelist;
1576 page->freelist = slot;
1577 asan_lock_freelist(page);
1579 RVALUE_AGE_RESET(obj);
1581 if (RGENGC_CHECK_MODE &&
1583 !(page->start <= (uintptr_t)obj &&
1584 (uintptr_t)obj < ((uintptr_t)page->start + (page->total_slots * page->slot_size)) &&
1585 obj % BASE_SLOT_SIZE == 0)) {
1586 rb_bug(
"heap_page_add_freeobj: %p is not rvalue.", (
void *)obj);
1589 rb_asan_poison_object(obj);
1590 gc_report(3,
objspace,
"heap_page_add_freeobj: add %p to freelist\n", (
void *)obj);
1595 rb_heap_t *heap,
size_t free_slots,
size_t total_slots)
1597 double goal_ratio = gc_params.heap_free_slots_goal_ratio;
1598 size_t target_total_slots;
1600 if (goal_ratio == 0.0) {
1601 target_total_slots = (size_t)(total_slots * gc_params.growth_factor);
1603 else if (total_slots == 0) {
1604 target_total_slots = minimum_slots_for_heap(
objspace, heap);
1610 double f = (double)(total_slots - free_slots) / ((1 - goal_ratio) * total_slots);
1612 if (f > gc_params.growth_factor) f = gc_params.growth_factor;
1613 if (f < 1.0) f = 1.1;
1615 target_total_slots = (size_t)(f * total_slots);
1619 "free_slots(%8"PRIuSIZE
")/total_slots(%8"PRIuSIZE
")=%1.2f,"
1620 " G(%1.2f), f(%1.2f),"
1621 " total_slots(%8"PRIuSIZE
") => target_total_slots(%8"PRIuSIZE
")\n",
1622 free_slots, total_slots, free_slots/(
double)total_slots,
1623 goal_ratio, f, total_slots, target_total_slots);
1627 if (gc_params.growth_max_slots > 0) {
1628 size_t max_total_slots = (size_t)(total_slots + gc_params.growth_max_slots);
1629 if (target_total_slots > max_total_slots) target_total_slots = max_total_slots;
1632 size_t extend_slot_count = target_total_slots - total_slots;
1634 if (extend_slot_count == 0) extend_slot_count = 1;
1636 objspace->heap_pages.allocatable_slots += extend_slot_count;
1642 asan_unlock_freelist(page);
1643 GC_ASSERT(page->free_slots != 0);
1644 GC_ASSERT(page->freelist != NULL);
1646 page->free_next = heap->free_pages;
1647 heap->free_pages = page;
1649 RUBY_DEBUG_LOG(
"page:%p freelist:%p", (
void *)page, (
void *)page->freelist);
1651 asan_lock_freelist(page);
1657 asan_unlock_freelist(page);
1658 GC_ASSERT(page->free_slots != 0);
1659 GC_ASSERT(page->freelist != NULL);
1661 page->free_next = heap->pooled_pages;
1662 heap->pooled_pages = page;
1663 objspace->rincgc.pooled_slots += page->free_slots;
1665 asan_lock_freelist(page);
1671 ccan_list_del(&page->page_node);
1672 heap->total_pages--;
1673 heap->total_slots -= page->total_slots;
1677gc_aligned_free(
void *ptr,
size_t size)
1679#if defined __MINGW32__
1680 __mingw_aligned_free(ptr);
1683#elif defined(HAVE_POSIX_MEMALIGN) || defined(HAVE_MEMALIGN)
1686 free(((
void**)ptr)[-1]);
1693 GC_ASSERT((uintptr_t)page_body % HEAP_PAGE_ALIGN == 0);
1695 if (HEAP_PAGE_ALLOC_USE_MMAP) {
1697 GC_ASSERT(HEAP_PAGE_SIZE % sysconf(_SC_PAGE_SIZE) == 0);
1698 if (munmap(page_body, HEAP_PAGE_SIZE)) {
1699 rb_bug(
"heap_page_body_free: munmap failed");
1704 gc_aligned_free(page_body, HEAP_PAGE_SIZE);
1711 objspace->heap_pages.freed_pages++;
1712 heap_page_body_free(page->body);
1719 if (
objspace->empty_pages != NULL && heap_pages_freeable_pages > 0) {
1720 GC_ASSERT(
objspace->empty_pages_count > 0);
1725 for (i = j = 0; i < rb_darray_size(
objspace->heap_pages.sorted); i++) {
1728 if (heap_page_in_global_empty_pages_pool(
objspace, page) && heap_pages_freeable_pages > 0) {
1730 heap_pages_freeable_pages--;
1733 if (heap_page_in_global_empty_pages_pool(
objspace, page)) {
1734 page->free_next =
objspace->empty_pages;
1740 rb_darray_set(
objspace->heap_pages.sorted, j, page);
1746 rb_darray_pop(
objspace->heap_pages.sorted, i - j);
1747 GC_ASSERT(rb_darray_size(
objspace->heap_pages.sorted) == j);
1750 uintptr_t himem = (uintptr_t)hipage->body + HEAP_PAGE_SIZE;
1751 GC_ASSERT(himem <= heap_pages_himem);
1752 heap_pages_himem = himem;
1755 uintptr_t lomem = (uintptr_t)lopage->body +
sizeof(
struct heap_page_header);
1756 GC_ASSERT(lomem >= heap_pages_lomem);
1757 heap_pages_lomem = lomem;
1762gc_aligned_malloc(
size_t alignment,
size_t size)
1765 GC_ASSERT(((alignment - 1) & alignment) == 0);
1766 GC_ASSERT(alignment %
sizeof(
void*) == 0);
1770#if defined __MINGW32__
1771 res = __mingw_aligned_malloc(size, alignment);
1773 void *_aligned_malloc(
size_t,
size_t);
1774 res = _aligned_malloc(size, alignment);
1775#elif defined(HAVE_POSIX_MEMALIGN)
1776 if (posix_memalign(&res, alignment, size) != 0) {
1779#elif defined(HAVE_MEMALIGN)
1780 res = memalign(alignment, size);
1783 res = malloc(alignment + size +
sizeof(
void*));
1784 aligned = (
char*)res + alignment +
sizeof(
void*);
1785 aligned -= ((
VALUE)aligned & (alignment - 1));
1786 ((
void**)aligned)[-1] = res;
1787 res = (
void*)aligned;
1790 GC_ASSERT((uintptr_t)res % alignment == 0);
1796heap_page_body_allocate(
void)
1800 if (HEAP_PAGE_ALLOC_USE_MMAP) {
1802 GC_ASSERT(HEAP_PAGE_ALIGN % sysconf(_SC_PAGE_SIZE) == 0);
1804 size_t mmap_size = HEAP_PAGE_ALIGN + HEAP_PAGE_SIZE;
1805 char *ptr = mmap(NULL, mmap_size,
1806 PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
1807 if (ptr == MAP_FAILED) {
1816#if defined(HAVE_SYS_PRCTL_H) && defined(PR_SET_VMA) && defined(PR_SET_VMA_ANON_NAME)
1817 prctl(PR_SET_VMA, PR_SET_VMA_ANON_NAME, ptr, mmap_size,
"Ruby:GC:default:heap_page_body_allocate");
1821 char *aligned = ptr + HEAP_PAGE_ALIGN;
1822 aligned -= ((
VALUE)aligned & (HEAP_PAGE_ALIGN - 1));
1823 GC_ASSERT(aligned > ptr);
1824 GC_ASSERT(aligned <= ptr + HEAP_PAGE_ALIGN);
1826 size_t start_out_of_range_size = aligned - ptr;
1827 GC_ASSERT(start_out_of_range_size % sysconf(_SC_PAGE_SIZE) == 0);
1828 if (start_out_of_range_size > 0) {
1829 if (munmap(ptr, start_out_of_range_size)) {
1830 rb_bug(
"heap_page_body_allocate: munmap failed for start");
1834 size_t end_out_of_range_size = HEAP_PAGE_ALIGN - start_out_of_range_size;
1835 GC_ASSERT(end_out_of_range_size % sysconf(_SC_PAGE_SIZE) == 0);
1836 if (end_out_of_range_size > 0) {
1837 if (munmap(aligned + HEAP_PAGE_SIZE, end_out_of_range_size)) {
1838 rb_bug(
"heap_page_body_allocate: munmap failed for end");
1846 page_body = gc_aligned_malloc(HEAP_PAGE_ALIGN, HEAP_PAGE_SIZE);
1849 GC_ASSERT((uintptr_t)page_body % HEAP_PAGE_ALIGN == 0);
1858 if (
objspace->empty_pages == NULL) {
1859 GC_ASSERT(
objspace->empty_pages_count == 0);
1862 GC_ASSERT(
objspace->empty_pages_count > 0);
1865 objspace->empty_pages = page->free_next;
1875 if (page_body == 0) {
1881 heap_page_body_free(page_body);
1886 uintptr_t end = (uintptr_t)page_body + HEAP_PAGE_SIZE;
1889 size_t hi = rb_darray_size(
objspace->heap_pages.sorted);
1893 size_t mid = (lo + hi) / 2;
1894 mid_page = rb_darray_get(
objspace->heap_pages.sorted, mid);
1895 if ((uintptr_t)mid_page->start < start) {
1898 else if ((uintptr_t)mid_page->start > start) {
1902 rb_bug(
"same heap page is allocated: %p at %"PRIuVALUE, (
void *)page_body, (
VALUE)mid);
1906 rb_darray_insert_without_gc(&
objspace->heap_pages.sorted, hi, page);
1908 if (heap_pages_lomem == 0 || heap_pages_lomem > start) heap_pages_lomem = start;
1909 if (heap_pages_himem < end) heap_pages_himem = end;
1911 page->body = page_body;
1912 page_body->header.page = page;
1914 objspace->heap_pages.allocated_pages++;
1923 GC_ASSERT(!heap->sweeping_page);
1924 GC_ASSERT(heap_page_in_global_empty_pages_pool(
objspace, page));
1928 if (start % BASE_SLOT_SIZE != 0) {
1929 int delta = BASE_SLOT_SIZE - (start % BASE_SLOT_SIZE);
1930 start = start + delta;
1931 GC_ASSERT(NUM_IN_PAGE(start) == 0 || NUM_IN_PAGE(start) == 1);
1937 if (NUM_IN_PAGE(start) == 1) {
1938 start += heap->slot_size - BASE_SLOT_SIZE;
1941 GC_ASSERT(NUM_IN_PAGE(start) * BASE_SLOT_SIZE % heap->slot_size == 0);
1944 int slot_count = (int)((HEAP_PAGE_SIZE - (start - (uintptr_t)page->body))/heap->slot_size);
1946 page->start = start;
1947 page->total_slots = slot_count;
1948 page->slot_size = heap->slot_size;
1951 asan_unlock_freelist(page);
1952 page->freelist = NULL;
1953 asan_unpoison_memory_region(page->body, HEAP_PAGE_SIZE,
false);
1954 for (
VALUE p = (
VALUE)start; p < start + (slot_count * heap->slot_size); p += heap->slot_size) {
1955 heap_page_add_freeobj(
objspace, page, p);
1957 asan_lock_freelist(page);
1959 page->free_slots = slot_count;
1961 heap->total_allocated_pages++;
1963 ccan_list_add_tail(&heap->pages, &page->page_node);
1964 heap->total_pages++;
1965 heap->total_slots += page->total_slots;
1971 gc_report(1,
objspace,
"heap_page_allocate_and_initialize: rb_darray_size(objspace->heap_pages.sorted): %"PRIdSIZE
", "
1972 "allocatable_slots: %"PRIdSIZE
", heap->total_pages: %"PRIdSIZE
"\n",
1973 rb_darray_size(
objspace->heap_pages.sorted),
objspace->heap_pages.allocatable_slots, heap->total_pages);
1975 bool allocated =
false;
1978 if (page == NULL &&
objspace->heap_pages.allocatable_slots > 0) {
1979 page = heap_page_allocate(
objspace);
1982 GC_ASSERT(page != NULL);
1986 heap_add_page(
objspace, heap, page);
1987 heap_add_freepage(heap, page);
1990 if (
objspace->heap_pages.allocatable_slots > (
size_t)page->total_slots) {
1991 objspace->heap_pages.allocatable_slots -= page->total_slots;
1994 objspace->heap_pages.allocatable_slots = 0;
1999 return page != NULL;
2005 size_t prev_allocatable_slots =
objspace->heap_pages.allocatable_slots;
2007 objspace->heap_pages.allocatable_slots = 1;
2008 heap_page_allocate_and_initialize(
objspace, heap);
2009 GC_ASSERT(heap->free_pages != NULL);
2010 objspace->heap_pages.allocatable_slots = prev_allocatable_slots;
2016 unsigned int lock_lev;
2017 gc_enter(
objspace, gc_enter_event_continue, &lock_lev);
2020 if (is_incremental_marking(
objspace)) {
2021 if (gc_marks_continue(
objspace, heap)) {
2028 if (heap->free_pages == NULL && is_lazy_sweeping(
objspace)) {
2032 gc_exit(
objspace, gc_enter_event_continue, &lock_lev);
2038 GC_ASSERT(heap->free_pages == NULL);
2040 if (heap->total_slots < gc_params.heap_init_slots[heap - heaps] &&
2041 heap->sweeping_page == NULL) {
2042 heap_page_allocate_and_initialize_force(
objspace, heap);
2043 GC_ASSERT(heap->free_pages != NULL);
2050 if (heap->free_pages == NULL) {
2051 heap_page_allocate_and_initialize(
objspace, heap);
2056 if (heap->free_pages == NULL) {
2057 GC_ASSERT(
objspace->empty_pages_count == 0);
2058 GC_ASSERT(
objspace->heap_pages.allocatable_slots == 0);
2060 if (gc_start(
objspace, GPR_FLAG_NEWOBJ) == FALSE) {
2064 if (
objspace->heap_pages.allocatable_slots == 0 && !gc_config_full_mark_val) {
2065 heap_allocatable_slots_expand(
objspace, heap,
2066 heap->freed_slots + heap->empty_slots,
2068 GC_ASSERT(
objspace->heap_pages.allocatable_slots > 0);
2076 if (heap->free_pages == NULL && !heap_page_allocate_and_initialize(
objspace, heap)) {
2077 if (gc_needs_major_flags == GPR_FLAG_NONE) {
2078 rb_bug(
"cannot create a new page after GC");
2081 if (gc_start(
objspace, GPR_FLAG_NEWOBJ) == FALSE) {
2088 if (heap->free_pages == NULL &&
2089 !heap_page_allocate_and_initialize(
objspace, heap)) {
2090 rb_bug(
"cannot create a new page after major GC");
2098 GC_ASSERT(heap->free_pages != NULL);
2102static inline const char*
2103rb_gc_impl_source_location_cstr(
int *ptr)
2124 RBASIC(obj)->flags = flags;
2126#if RBASIC_SHAPE_ID_FIELD
2127 RBASIC(obj)->shape_id = 0;
2132 RVALUE_AGE_SET_CANDIDATE(
objspace, obj);
2135#if RACTOR_CHECK_MODE
2136 void rb_ractor_setup_belonging(
VALUE obj);
2137 rb_ractor_setup_belonging(obj);
2140#if RGENGC_CHECK_MODE
2141 int lev = RB_GC_VM_LOCK_NO_BARRIER();
2143 check_rvalue_consistency(
objspace, obj);
2145 GC_ASSERT(RVALUE_MARKED(
objspace, obj) == FALSE);
2146 GC_ASSERT(RVALUE_MARKING(
objspace, obj) == FALSE);
2147 GC_ASSERT(RVALUE_OLD_P(
objspace, obj) == FALSE);
2148 GC_ASSERT(RVALUE_WB_UNPROTECTED(
objspace, obj) == FALSE);
2150 if (RVALUE_REMEMBERED(
objspace, obj)) rb_bug(
"newobj: %s is remembered.", rb_obj_info(obj));
2152 RB_GC_VM_UNLOCK_NO_BARRIER(lev);
2155 if (RB_UNLIKELY(wb_protected == FALSE)) {
2156 MARK_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), obj);
2161 objspace->profile.total_generated_normal_object_count++;
2162#if RGENGC_PROFILE >= 2
2167 objspace->profile.total_generated_shady_object_count++;
2168#if RGENGC_PROFILE >= 2
2175 GET_RVALUE_OVERHEAD(obj)->file = rb_gc_impl_source_location_cstr(&GET_RVALUE_OVERHEAD(obj)->line);
2179 gc_report(5,
objspace,
"newobj: %s\n", rb_obj_info(obj));
2186rb_gc_impl_obj_slot_size(
VALUE obj)
2188 return GET_HEAP_PAGE(obj)->slot_size - RVALUE_OVERHEAD;
2192heap_slot_size(
unsigned char pool_id)
2194 GC_ASSERT(pool_id < HEAP_COUNT);
2196 size_t slot_size = (1 << pool_id) * BASE_SLOT_SIZE;
2198#if RGENGC_CHECK_MODE
2200 GC_ASSERT(heaps[pool_id].slot_size == (
short)slot_size);
2203 slot_size -= RVALUE_OVERHEAD;
2209rb_gc_impl_size_allocatable_p(
size_t size)
2211 return size <= heap_slot_size(HEAP_COUNT - 1);
2214static const size_t ALLOCATED_COUNT_STEP = 1024;
2221 struct free_slot *p = heap_cache->freelist;
2223 if (RB_UNLIKELY(is_incremental_marking(
objspace))) {
2225 if (cache->incremental_mark_step_allocated_slots >= INCREMENTAL_MARK_STEP_ALLOCATIONS) {
2230 cache->incremental_mark_step_allocated_slots++;
2236 rb_asan_unpoison_object(obj,
true);
2237 heap_cache->freelist = p->next;
2239 if (rb_gc_multi_ractor_p()) {
2240 heap_cache->allocated_objects_count++;
2242 if (heap_cache->allocated_objects_count >= ALLOCATED_COUNT_STEP) {
2244 heap_cache->allocated_objects_count = 0;
2249 heap->total_allocated_objects++;
2250 GC_ASSERT(heap->total_slots >=
2251 (heap->total_allocated_objects - heap->total_freed_objects - heap->final_slots_count));
2254#if RGENGC_CHECK_MODE
2255 GC_ASSERT(rb_gc_impl_obj_slot_size(obj) == heap_slot_size(heap_idx));
2257 MEMZERO((
char *)obj,
char, heap_slot_size(heap_idx));
2271 if (heap->free_pages == NULL) {
2275 page = heap->free_pages;
2276 heap->free_pages = page->free_next;
2278 GC_ASSERT(page->free_slots != 0);
2280 asan_unlock_freelist(page);
2289 gc_report(3,
objspace,
"ractor_set_cache: Using page %p\n", (
void *)page->body);
2293 GC_ASSERT(heap_cache->freelist == NULL);
2294 GC_ASSERT(page->free_slots != 0);
2295 GC_ASSERT(page->freelist != NULL);
2297 heap_cache->using_page = page;
2298 heap_cache->freelist = page->freelist;
2299 page->free_slots = 0;
2300 page->freelist = NULL;
2302 rb_asan_unpoison_object((
VALUE)heap_cache->freelist,
false);
2304 rb_asan_poison_object((
VALUE)heap_cache->freelist);
2308heap_idx_for_size(
size_t size)
2310 size += RVALUE_OVERHEAD;
2312 size_t slot_count = CEILDIV(size, BASE_SLOT_SIZE);
2315 size_t heap_idx = 64 - nlz_int64(slot_count - 1);
2317 if (heap_idx >= HEAP_COUNT) {
2318 rb_bug(
"heap_idx_for_size: allocation size too large "
2319 "(size=%"PRIuSIZE
"u, heap_idx=%"PRIuSIZE
"u)", size, heap_idx);
2322#if RGENGC_CHECK_MODE
2324 GC_ASSERT(size <= (
size_t)heaps[heap_idx].slot_size);
2325 if (heap_idx > 0) GC_ASSERT(size > (
size_t)heaps[heap_idx - 1].slot_size);
2332rb_gc_impl_heap_id_for_size(
void *objspace_ptr,
size_t size)
2334 return heap_idx_for_size(size);
2338static size_t heap_sizes[HEAP_COUNT + 1] = { 0 };
2341rb_gc_impl_heap_sizes(
void *objspace_ptr)
2343 if (heap_sizes[0] == 0) {
2344 for (
unsigned char i = 0; i < HEAP_COUNT; i++) {
2345 heap_sizes[i] = heap_slot_size(i);
2360 unsigned int lev = 0;
2361 bool unlock_vm =
false;
2364 lev = RB_GC_CR_LOCK();
2369 if (is_incremental_marking(
objspace)) {
2371 cache->incremental_mark_step_allocated_slots = 0;
2374 obj = ractor_cache_allocate_slot(
objspace, cache, heap_idx);
2380 ractor_cache_set_page(
objspace, cache, heap_idx, page);
2383 obj = ractor_cache_allocate_slot(
objspace, cache, heap_idx);
2388 RB_GC_CR_UNLOCK(lev);
2391 if (RB_UNLIKELY(obj ==
Qfalse)) {
2400 VALUE obj = ractor_cache_allocate_slot(
objspace, cache, heap_idx);
2402 if (RB_UNLIKELY(obj ==
Qfalse)) {
2403 obj = newobj_cache_miss(
objspace, cache, heap_idx, vm_locked);
2417 lev = RB_GC_CR_LOCK();
2419 if (RB_UNLIKELY(during_gc || ruby_gc_stressful)) {
2423 if (rb_memerror_reentered()) {
2426 rb_bug(
"object allocation during garbage collection phase");
2429 if (ruby_gc_stressful) {
2430 if (!garbage_collect(
objspace, GPR_FLAG_NEWOBJ)) {
2436 obj = newobj_alloc(
objspace, cache, heap_idx,
true);
2437 newobj_init(klass, flags, wb_protected,
objspace, obj);
2439 RB_GC_CR_UNLOCK(lev);
2444NOINLINE(
static VALUE newobj_slowpath_wb_protected(
VALUE klass,
VALUE flags,
2446NOINLINE(
static VALUE newobj_slowpath_wb_unprotected(
VALUE klass,
VALUE flags,
2452 return newobj_slowpath(klass, flags,
objspace, cache, TRUE, heap_idx);
2458 return newobj_slowpath(klass, flags,
objspace, cache, FALSE, heap_idx);
2462rb_gc_impl_new_obj(
void *objspace_ptr,
void *cache_ptr,
VALUE klass,
VALUE flags,
bool wb_protected,
size_t alloc_size)
2467 RB_DEBUG_COUNTER_INC(obj_newobj);
2468 (void)RB_DEBUG_COUNTER_INC_IF(obj_newobj_wb_unprotected, !wb_protected);
2470 if (RB_UNLIKELY(stress_to_class)) {
2471 if (rb_hash_lookup2(stress_to_class, klass,
Qundef) !=
Qundef) {
2476 size_t heap_idx = heap_idx_for_size(alloc_size);
2480 if (!RB_UNLIKELY(during_gc || ruby_gc_stressful) &&
2482 obj = newobj_alloc(
objspace, cache, heap_idx,
false);
2483 newobj_init(klass, flags, wb_protected,
objspace, obj);
2486 RB_DEBUG_COUNTER_INC(obj_newobj_slowpath);
2488 obj = wb_protected ?
2489 newobj_slowpath_wb_protected(klass, flags,
objspace, cache, heap_idx) :
2490 newobj_slowpath_wb_unprotected(klass, flags,
objspace, cache, heap_idx);
2497ptr_in_page_body_p(
const void *ptr,
const void *memb)
2500 uintptr_t p_body = (uintptr_t)page->body;
2502 if ((uintptr_t)ptr >= p_body) {
2503 return (uintptr_t)ptr < (p_body + HEAP_PAGE_SIZE) ? 0 : 1;
2516 if (ptr < (uintptr_t)heap_pages_lomem ||
2517 ptr > (uintptr_t)heap_pages_himem) {
2521 res = bsearch((
void *)ptr, rb_darray_ref(
objspace->heap_pages.sorted, 0),
2523 ptr_in_page_body_p);
2537 register uintptr_t p = (uintptr_t)ptr;
2540 RB_DEBUG_COUNTER_INC(gc_isptr_trial);
2542 if (p < heap_pages_lomem || p > heap_pages_himem)
return FALSE;
2543 RB_DEBUG_COUNTER_INC(gc_isptr_range);
2545 if (p % BASE_SLOT_SIZE != 0)
return FALSE;
2546 RB_DEBUG_COUNTER_INC(gc_isptr_align);
2548 page = heap_page_for_ptr(
objspace, (uintptr_t)ptr);
2550 RB_DEBUG_COUNTER_INC(gc_isptr_maybe);
2551 if (heap_page_in_global_empty_pages_pool(
objspace, page)) {
2555 if (p < page->start)
return FALSE;
2556 if (p >= page->start + (page->total_slots * page->slot_size))
return FALSE;
2557 if ((NUM_IN_PAGE(p) * BASE_SLOT_SIZE) % page->slot_size != 0)
return FALSE;
2566rb_gc_impl_pointer_to_heap_p(
void *objspace_ptr,
const void *ptr)
2568 return is_pointer_to_heap(objspace_ptr, ptr);
2571#define ZOMBIE_OBJ_KEPT_FLAGS (FL_FINALIZE)
2574rb_gc_impl_make_zombie(
void *objspace_ptr,
VALUE obj,
void (*dfree)(
void *),
void *data)
2578 struct RZombie *zombie = RZOMBIE(obj);
2579 zombie->flags =
T_ZOMBIE | (zombie->flags & ZOMBIE_OBJ_KEPT_FLAGS);
2580 zombie->dfree = dfree;
2581 zombie->data = data;
2582 VALUE prev, next = heap_pages_deferred_final;
2584 zombie->next = prev = next;
2586 }
while (next != prev);
2588 struct heap_page *page = GET_HEAP_PAGE(obj);
2589 page->final_slots++;
2590 page->heap->final_slots_count++;
2593typedef int each_obj_callback(
void *,
void *,
size_t,
void *);
2594typedef int each_page_callback(
struct heap_page *,
void *);
2598 bool reenable_incremental;
2600 each_obj_callback *each_obj_callback;
2601 each_page_callback *each_page_callback;
2605 size_t pages_counts[HEAP_COUNT];
2609objspace_each_objects_ensure(
VALUE arg)
2615 if (data->reenable_incremental) {
2616 objspace->flags.dont_incremental = FALSE;
2619 for (
int i = 0; i < HEAP_COUNT; i++) {
2620 struct heap_page **pages = data->pages[i];
2628objspace_each_objects_try(
VALUE arg)
2634 for (
int i = 0; i < HEAP_COUNT; i++) {
2636 size_t size = heap->total_pages *
sizeof(
struct heap_page *);
2638 struct heap_page **pages = malloc(size);
2639 if (!pages) rb_memerror();
2647 size_t pages_count = 0;
2648 ccan_list_for_each(&heap->pages, page, page_node) {
2649 pages[pages_count] = page;
2652 data->pages[i] = pages;
2653 data->pages_counts[i] = pages_count;
2654 GC_ASSERT(pages_count == heap->total_pages);
2657 for (
int i = 0; i < HEAP_COUNT; i++) {
2659 size_t pages_count = data->pages_counts[i];
2660 struct heap_page **pages = data->pages[i];
2663 for (
size_t i = 0; i < pages_count; i++) {
2666 if (page == NULL)
break;
2670 if (pages[i] != page)
continue;
2672 uintptr_t pstart = (uintptr_t)page->start;
2673 uintptr_t pend = pstart + (page->total_slots * heap->slot_size);
2675 if (data->each_obj_callback &&
2676 (*data->each_obj_callback)((
void *)pstart, (
void *)pend, heap->slot_size, data->data)) {
2679 if (data->each_page_callback &&
2680 (*data->each_page_callback)(page, data->data)) {
2684 page = ccan_list_next(&heap->pages, page, page_node);
2696 bool reenable_incremental = FALSE;
2698 reenable_incremental = !
objspace->flags.dont_incremental;
2701 objspace->flags.dont_incremental = TRUE;
2712objspace_each_objects(
rb_objspace_t *
objspace, each_obj_callback *callback,
void *data,
bool protected)
2716 .each_obj_callback = callback,
2717 .each_page_callback = NULL,
2724rb_gc_impl_each_objects(
void *objspace_ptr, each_obj_callback *callback,
void *data)
2726 objspace_each_objects(objspace_ptr, callback, data, TRUE);
2729#if GC_CAN_COMPILE_COMPACTION
2731objspace_each_pages(
rb_objspace_t *
objspace, each_page_callback *callback,
void *data,
bool protected)
2735 .each_obj_callback = NULL,
2736 .each_page_callback = callback,
2744rb_gc_impl_define_finalizer(
void *objspace_ptr,
VALUE obj,
VALUE block)
2754 int lev = RB_GC_VM_LOCK();
2756 if (st_lookup(finalizer_table, obj, &data)) {
2757 table = (
VALUE)data;
2764 for (i = 0; i <
len; i++) {
2767 RB_GC_VM_UNLOCK(lev);
2778 st_add_direct(finalizer_table, obj, table);
2781 RB_GC_VM_UNLOCK(lev);
2787rb_gc_impl_undefine_finalizer(
void *objspace_ptr,
VALUE obj)
2793 st_data_t data = obj;
2795 int lev = RB_GC_VM_LOCK();
2796 st_delete(finalizer_table, &data, 0);
2797 RB_GC_VM_UNLOCK(lev);
2803rb_gc_impl_copy_finalizer(
void *objspace_ptr,
VALUE dest,
VALUE obj)
2811 int lev = RB_GC_VM_LOCK();
2812 if (RB_LIKELY(st_lookup(finalizer_table, obj, &data))) {
2815 st_insert(finalizer_table, dest, table);
2819 rb_bug(
"rb_gc_copy_finalizer: FL_FINALIZE set but not found in finalizer_table: %s", rb_obj_info(obj));
2821 RB_GC_VM_UNLOCK(lev);
2825get_final(
long i,
void *data)
2835 if (RZOMBIE(zombie)->dfree) {
2836 RZOMBIE(zombie)->dfree(RZOMBIE(zombie)->data);
2839 st_data_t key = (st_data_t)zombie;
2843 if (st_delete(finalizer_table, &key, &table)) {
2847 rb_bug(
"FL_FINALIZE flag is set, but finalizers are not found");
2851 GC_ASSERT(!st_lookup(finalizer_table, key, NULL));
2861 rb_asan_unpoison_object(zombie,
false);
2862 next_zombie = RZOMBIE(zombie)->next;
2863 page = GET_HEAP_PAGE(zombie);
2865 int lev = RB_GC_VM_LOCK();
2870 GC_ASSERT(page->heap->final_slots_count > 0);
2871 GC_ASSERT(page->final_slots > 0);
2873 page->heap->final_slots_count--;
2874 page->final_slots--;
2876 heap_page_add_freeobj(
objspace, page, zombie);
2877 page->heap->total_freed_objects++;
2879 RB_GC_VM_UNLOCK(lev);
2881 zombie = next_zombie;
2897 rb_gc_set_pending_interrupt();
2898 finalize_deferred_heap_pages(
objspace);
2899 rb_gc_unset_pending_interrupt();
2903gc_finalize_deferred(
void *dmy)
2922gc_abort(
void *objspace_ptr)
2926 if (is_incremental_marking(
objspace)) {
2929 while (pop_mark_stack(&
objspace->mark_stack, &obj));
2931 objspace->flags.during_incremental_marking = FALSE;
2935 for (
int i = 0; i < HEAP_COUNT; i++) {
2938 heap->sweeping_page = NULL;
2941 ccan_list_for_each(&heap->pages, page, page_node) {
2942 page->flags.before_sweep =
false;
2947 for (
int i = 0; i < HEAP_COUNT; i++) {
2949 rgengc_mark_and_rememberset_clear(
objspace, heap);
2952 gc_mode_set(
objspace, gc_mode_none);
2956rb_gc_impl_shutdown_free_objects(
void *objspace_ptr)
2960 for (
size_t i = 0; i < rb_darray_size(
objspace->heap_pages.sorted); i++) {
2962 short stride = page->slot_size;
2964 uintptr_t p = (uintptr_t)page->start;
2965 uintptr_t pend = p + page->total_slots * stride;
2966 for (; p < pend; p += stride) {
2968 asan_unpoisoning_object(vp) {
2970 rb_gc_obj_free_vm_weak_references(vp);
2971 if (rb_gc_obj_free(
objspace, vp)) {
2981rb_gc_impl_shutdown_call_finalizer_i(st_data_t key, st_data_t val, st_data_t _data)
2997rb_gc_impl_shutdown_call_finalizer(
void *objspace_ptr)
3001#if RGENGC_CHECK_MODE >= 2
3002 gc_verify_internal_consistency(
objspace);
3006 objspace->flags.dont_incremental = 1;
3015 while (finalizer_table->num_entries) {
3016 st_foreach(finalizer_table, rb_gc_impl_shutdown_call_finalizer_i, 0);
3021 GC_ASSERT(heap_pages_deferred_final == 0);
3030 unsigned int lock_lev;
3031 gc_enter(
objspace, gc_enter_event_finalizer, &lock_lev);
3034 for (
size_t i = 0; i < rb_darray_size(
objspace->heap_pages.sorted); i++) {
3036 short stride = page->slot_size;
3038 uintptr_t p = (uintptr_t)page->start;
3039 uintptr_t pend = p + page->total_slots * stride;
3040 for (; p < pend; p += stride) {
3042 asan_unpoisoning_object(vp) {
3043 if (rb_gc_shutdown_call_finalizer_p(vp)) {
3044 rb_gc_obj_free_vm_weak_references(vp);
3045 if (rb_gc_obj_free(
objspace, vp)) {
3053 gc_exit(
objspace, gc_enter_event_finalizer, &lock_lev);
3055 finalize_deferred_heap_pages(
objspace);
3057 st_free_table(finalizer_table);
3058 finalizer_table = 0;
3063rb_gc_impl_each_object(
void *objspace_ptr,
void (*func)(
VALUE obj,
void *data),
void *data)
3067 for (
size_t i = 0; i < rb_darray_size(
objspace->heap_pages.sorted); i++) {
3069 short stride = page->slot_size;
3071 uintptr_t p = (uintptr_t)page->start;
3072 uintptr_t pend = p + page->total_slots * stride;
3073 for (; p < pend; p += stride) {
3076 asan_unpoisoning_object(obj) {
3092 size_t total_slots = 0;
3093 for (
int i = 0; i < HEAP_COUNT; i++) {
3095 total_slots += heap->total_slots;
3113gc_setup_mark_bits(
struct heap_page *page)
3116 memcpy(&page->mark_bits[0], &page->uncollectible_bits[0], HEAP_PAGE_BITMAP_SIZE);
3123enum {HEAP_PAGE_LOCK = PAGE_NOACCESS, HEAP_PAGE_UNLOCK = PAGE_READWRITE};
3129 return VirtualProtect(body, HEAP_PAGE_SIZE, protect, &old_protect) != 0;
3131#elif defined(__wasi__)
3133enum {HEAP_PAGE_LOCK, HEAP_PAGE_UNLOCK};
3134#define protect_page_body(body, protect) 1
3136enum {HEAP_PAGE_LOCK = PROT_NONE, HEAP_PAGE_UNLOCK = PROT_READ | PROT_WRITE};
3137#define protect_page_body(body, protect) !mprotect((body), HEAP_PAGE_SIZE, (protect))
3143 if (!protect_page_body(body, HEAP_PAGE_LOCK)) {
3144 rb_bug(
"Couldn't protect page %p, errno: %s", (
void *)body, strerror(
errno));
3147 gc_report(5,
objspace,
"Protecting page in move %p\n", (
void *)body);
3154 if (!protect_page_body(body, HEAP_PAGE_UNLOCK)) {
3155 rb_bug(
"Couldn't unprotect page %p, errno: %s", (
void *)body, strerror(
errno));
3158 gc_report(5,
objspace,
"Unprotecting page in move %p\n", (
void *)body);
3165 GC_ASSERT(gc_is_moveable_obj(
objspace, src));
3167 struct heap_page *src_page = GET_HEAP_PAGE(src);
3175 GC_ASSERT(RVALUE_MARKED(
objspace, src));
3177 asan_unlock_freelist(free_page);
3179 asan_lock_freelist(free_page);
3181 rb_asan_unpoison_object(dest,
false);
3188 asan_unlock_freelist(free_page);
3189 free_page->freelist = ((
struct free_slot *)dest)->next;
3190 asan_lock_freelist(free_page);
3194 if (src_page->slot_size > free_page->slot_size) {
3197 else if (free_page->slot_size > src_page->slot_size) {
3201 objspace->rcompactor.total_moved++;
3203 gc_move(
objspace, src, dest, src_page->slot_size, free_page->slot_size);
3205 free_page->free_slots--;
3213 struct heap_page *cursor = heap->compact_cursor;
3216 unlock_page_body(
objspace, cursor->body);
3217 cursor = ccan_list_next(&heap->pages, cursor, page_node);
3222#if GC_CAN_COMPILE_COMPACTION
3226#if defined(__MINGW32__) || defined(_WIN32)
3227# define GC_COMPACTION_SUPPORTED 1
3231# define GC_COMPACTION_SUPPORTED (GC_CAN_COMPILE_COMPACTION && HEAP_PAGE_ALLOC_USE_MMAP)
3234#if GC_CAN_COMPILE_COMPACTION
3236read_barrier_handler(uintptr_t address)
3244 if (page_body == NULL) {
3245 rb_bug(
"read_barrier_handler: segmentation fault at %p", (
void *)address);
3248 int lev = RB_GC_VM_LOCK();
3250 unlock_page_body(
objspace, page_body);
3252 objspace->profile.read_barrier_faults++;
3254 invalidate_moved_page(
objspace, GET_HEAP_PAGE(address));
3256 RB_GC_VM_UNLOCK(lev);
3260#if !GC_CAN_COMPILE_COMPACTION
3262uninstall_handlers(
void)
3268install_handlers(
void)
3272#elif defined(_WIN32)
3273static LPTOP_LEVEL_EXCEPTION_FILTER old_handler;
3274typedef void (*signal_handler)(int);
3275static signal_handler old_sigsegv_handler;
3278read_barrier_signal(EXCEPTION_POINTERS *info)
3281 if (info->ExceptionRecord->ExceptionCode == EXCEPTION_ACCESS_VIOLATION) {
3286 read_barrier_handler((uintptr_t)info->ExceptionRecord->ExceptionInformation[1]);
3287 return EXCEPTION_CONTINUE_EXECUTION;
3290 return EXCEPTION_CONTINUE_SEARCH;
3295uninstall_handlers(
void)
3297 signal(SIGSEGV, old_sigsegv_handler);
3298 SetUnhandledExceptionFilter(old_handler);
3302install_handlers(
void)
3305 old_sigsegv_handler = signal(SIGSEGV, NULL);
3308 old_handler = SetUnhandledExceptionFilter(read_barrier_signal);
3311static struct sigaction old_sigbus_handler;
3312static struct sigaction old_sigsegv_handler;
3314#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
3315static exception_mask_t old_exception_masks[32];
3316static mach_port_t old_exception_ports[32];
3317static exception_behavior_t old_exception_behaviors[32];
3318static thread_state_flavor_t old_exception_flavors[32];
3319static mach_msg_type_number_t old_exception_count;
3322disable_mach_bad_access_exc(
void)
3324 old_exception_count =
sizeof(old_exception_masks) /
sizeof(old_exception_masks[0]);
3325 task_swap_exception_ports(
3326 mach_task_self(), EXC_MASK_BAD_ACCESS,
3327 MACH_PORT_NULL, EXCEPTION_DEFAULT, 0,
3328 old_exception_masks, &old_exception_count,
3329 old_exception_ports, old_exception_behaviors, old_exception_flavors
3334restore_mach_bad_access_exc(
void)
3336 for (mach_msg_type_number_t i = 0; i < old_exception_count; i++) {
3337 task_set_exception_ports(
3339 old_exception_masks[i], old_exception_ports[i],
3340 old_exception_behaviors[i], old_exception_flavors[i]
3347read_barrier_signal(
int sig, siginfo_t *info,
void *data)
3350 struct sigaction prev_sigbus, prev_sigsegv;
3351 sigaction(SIGBUS, &old_sigbus_handler, &prev_sigbus);
3352 sigaction(SIGSEGV, &old_sigsegv_handler, &prev_sigsegv);
3355 sigset_t set, prev_set;
3357 sigaddset(&set, SIGBUS);
3358 sigaddset(&set, SIGSEGV);
3359 sigprocmask(SIG_UNBLOCK, &set, &prev_set);
3360#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
3361 disable_mach_bad_access_exc();
3364 read_barrier_handler((uintptr_t)info->si_addr);
3367#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
3368 restore_mach_bad_access_exc();
3370 sigaction(SIGBUS, &prev_sigbus, NULL);
3371 sigaction(SIGSEGV, &prev_sigsegv, NULL);
3372 sigprocmask(SIG_SETMASK, &prev_set, NULL);
3376uninstall_handlers(
void)
3378#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
3379 restore_mach_bad_access_exc();
3381 sigaction(SIGBUS, &old_sigbus_handler, NULL);
3382 sigaction(SIGSEGV, &old_sigsegv_handler, NULL);
3386install_handlers(
void)
3388 struct sigaction action;
3389 memset(&action, 0,
sizeof(
struct sigaction));
3390 sigemptyset(&action.sa_mask);
3391 action.sa_sigaction = read_barrier_signal;
3392 action.sa_flags = SA_SIGINFO | SA_ONSTACK;
3394 sigaction(SIGBUS, &action, &old_sigbus_handler);
3395 sigaction(SIGSEGV, &action, &old_sigsegv_handler);
3396#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
3397 disable_mach_bad_access_exc();
3405 for (
int i = 0; i < HEAP_COUNT; i++) {
3407 gc_unprotect_pages(
objspace, heap);
3410 uninstall_handlers();
3415 for (
int i = 0; i < HEAP_COUNT; i++) {
3417 heap->compact_cursor = NULL;
3418 heap->free_pages = NULL;
3419 heap->compact_cursor_index = 0;
3424 record->moved_objects =
objspace->rcompactor.total_moved - record->moved_objects;
3426 objspace->flags.during_compacting = FALSE;
3439 struct heap_page *sweep_page = ctx->page;
3440 short slot_size = sweep_page->slot_size;
3441 short slot_bits = slot_size / BASE_SLOT_SIZE;
3442 GC_ASSERT(slot_bits > 0);
3446 GC_ASSERT(vp % BASE_SLOT_SIZE == 0);
3448 rb_asan_unpoison_object(vp,
false);
3452 gc_report(2,
objspace,
"page_sweep: free %p\n", (
void *)p);
3453#if RGENGC_CHECK_MODE
3455 if (RVALUE_OLD_P(
objspace, vp)) rb_bug(
"page_sweep: %p - old while minor GC.", (
void *)p);
3456 if (RVALUE_REMEMBERED(
objspace, vp)) rb_bug(
"page_sweep: %p - remembered.", (
void *)p);
3460 if (RVALUE_WB_UNPROTECTED(
objspace, vp)) CLEAR_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(vp), vp);
3462#if RGENGC_CHECK_MODE
3463#define CHECK(x) if (x(objspace, vp) != FALSE) rb_bug("obj_free: " #x "(%s) != FALSE", rb_obj_info(vp))
3464 CHECK(RVALUE_WB_UNPROTECTED);
3465 CHECK(RVALUE_MARKED);
3466 CHECK(RVALUE_MARKING);
3467 CHECK(RVALUE_UNCOLLECTIBLE);
3473 rb_gc_obj_free_vm_weak_references(vp);
3474 if (rb_gc_obj_free(
objspace, vp)) {
3477 (void)VALGRIND_MAKE_MEM_UNDEFINED((
void*)p, BASE_SLOT_SIZE);
3478 heap_page_add_freeobj(
objspace, sweep_page, vp);
3479 gc_report(3,
objspace,
"page_sweep: %s is added to freelist\n", rb_obj_info(vp));
3488 if (
objspace->flags.during_compacting) {
3494 rb_bug(
"T_MOVED shouldn't be seen until compaction is finished");
3496 gc_report(3,
objspace,
"page_sweep: %s is added to freelist\n", rb_obj_info(vp));
3498 heap_page_add_freeobj(
objspace, sweep_page, vp);
3509 bitset >>= slot_bits;
3516 struct heap_page *sweep_page = ctx->page;
3517 GC_ASSERT(sweep_page->heap == heap);
3520 bits_t *bits, bitset;
3522 gc_report(2,
objspace,
"page_sweep: start.\n");
3524#if RGENGC_CHECK_MODE
3525 if (!
objspace->flags.immediate_sweep) {
3526 GC_ASSERT(sweep_page->flags.before_sweep == TRUE);
3529 sweep_page->flags.before_sweep = FALSE;
3530 sweep_page->free_slots = 0;
3532 p = (uintptr_t)sweep_page->start;
3533 bits = sweep_page->mark_bits;
3535 int page_rvalue_count = sweep_page->total_slots * (sweep_page->slot_size / BASE_SLOT_SIZE);
3536 int out_of_range_bits = (NUM_IN_PAGE(p) + page_rvalue_count) % BITS_BITLENGTH;
3537 if (out_of_range_bits != 0) {
3538 bits[BITMAP_INDEX(p) + page_rvalue_count / BITS_BITLENGTH] |= ~(((bits_t)1 << out_of_range_bits) - 1);
3544 int bitmap_plane_count = CEILDIV(NUM_IN_PAGE(p) + page_rvalue_count, BITS_BITLENGTH);
3545 GC_ASSERT(bitmap_plane_count == HEAP_PAGE_BITMAP_LIMIT - 1 ||
3546 bitmap_plane_count == HEAP_PAGE_BITMAP_LIMIT);
3550 bitset >>= NUM_IN_PAGE(p);
3552 gc_sweep_plane(
objspace, heap, p, bitset, ctx);
3554 p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
3556 for (
int i = 1; i < bitmap_plane_count; i++) {
3559 gc_sweep_plane(
objspace, heap, p, bitset, ctx);
3561 p += BITS_BITLENGTH * BASE_SLOT_SIZE;
3564 if (!heap->compact_cursor) {
3565 gc_setup_mark_bits(sweep_page);
3568#if GC_PROFILE_MORE_DETAIL
3571 record->removing_objects += ctx->final_slots + ctx->freed_slots;
3572 record->empty_objects += ctx->empty_slots;
3575 if (0) fprintf(stderr,
"gc_sweep_page(%"PRIdSIZE
"): total_slots: %d, freed_slots: %d, empty_slots: %d, final_slots: %d\n",
3577 sweep_page->total_slots,
3578 ctx->freed_slots, ctx->empty_slots, ctx->final_slots);
3580 sweep_page->free_slots += ctx->freed_slots + ctx->empty_slots;
3581 sweep_page->heap->total_freed_objects += ctx->freed_slots;
3583 if (heap_pages_deferred_final && !finalizing) {
3584 gc_finalize_deferred_register(
objspace);
3587#if RGENGC_CHECK_MODE
3588 short freelist_len = 0;
3589 asan_unlock_freelist(sweep_page);
3590 struct free_slot *ptr = sweep_page->freelist;
3593 rb_asan_unpoison_object((
VALUE)ptr,
false);
3595 rb_asan_poison_object((
VALUE)ptr);
3598 asan_lock_freelist(sweep_page);
3599 if (freelist_len != sweep_page->free_slots) {
3600 rb_bug(
"inconsistent freelist length: expected %d but was %d", sweep_page->free_slots, freelist_len);
3604 gc_report(2,
objspace,
"page_sweep: end.\n");
3608gc_mode_name(
enum gc_mode mode)
3611 case gc_mode_none:
return "none";
3612 case gc_mode_marking:
return "marking";
3613 case gc_mode_sweeping:
return "sweeping";
3614 case gc_mode_compacting:
return "compacting";
3615 default: rb_bug(
"gc_mode_name: unknown mode: %d", (
int)mode);
3622#if RGENGC_CHECK_MODE
3623 enum gc_mode prev_mode = gc_mode(
objspace);
3624 switch (prev_mode) {
3625 case gc_mode_none: GC_ASSERT(mode == gc_mode_marking);
break;
3626 case gc_mode_marking: GC_ASSERT(mode == gc_mode_sweeping);
break;
3627 case gc_mode_sweeping: GC_ASSERT(mode == gc_mode_none || mode == gc_mode_compacting);
break;
3628 case gc_mode_compacting: GC_ASSERT(mode == gc_mode_none);
break;
3631 if (0) fprintf(stderr,
"gc_mode_transition: %s->%s\n", gc_mode_name(gc_mode(
objspace)), gc_mode_name(mode));
3639 asan_unlock_freelist(page);
3640 if (page->freelist) {
3642 rb_asan_unpoison_object((
VALUE)p,
false);
3646 rb_asan_poison_object((
VALUE)prev);
3647 rb_asan_unpoison_object((
VALUE)p,
false);
3650 rb_asan_poison_object((
VALUE)p);
3653 page->freelist = freelist;
3655 asan_lock_freelist(page);
3662 heap->sweeping_page = ccan_list_top(&heap->pages,
struct heap_page, page_node);
3663 heap->free_pages = NULL;
3664 heap->pooled_pages = NULL;
3665 if (!
objspace->flags.immediate_sweep) {
3668 ccan_list_for_each(&heap->pages, page, page_node) {
3669 page->flags.before_sweep = TRUE;
3674#if defined(__GNUC__) && __GNUC__ == 4 && __GNUC_MINOR__ == 4
3678#if GC_CAN_COMPILE_COMPACTION
3679static void gc_sort_heap_by_compare_func(
rb_objspace_t *
objspace, gc_compact_compare_func compare_func);
3680static int compare_pinned_slots(
const void *left,
const void *right,
void *d);
3684gc_ractor_newobj_cache_clear(
void *c,
void *data)
3689 newobj_cache->incremental_mark_step_allocated_slots = 0;
3691 for (
size_t heap_idx = 0; heap_idx < HEAP_COUNT; heap_idx++) {
3697 cache->allocated_objects_count = 0;
3699 struct heap_page *page = cache->using_page;
3700 struct free_slot *freelist = cache->freelist;
3701 RUBY_DEBUG_LOG(
"ractor using_page:%p freelist:%p", (
void *)page, (
void *)freelist);
3703 heap_page_freelist_append(page, freelist);
3705 cache->using_page = NULL;
3706 cache->freelist = NULL;
3713 gc_mode_transition(
objspace, gc_mode_sweeping);
3716#if GC_CAN_COMPILE_COMPACTION
3717 if (
objspace->flags.during_compacting) {
3718 gc_sort_heap_by_compare_func(
3720 objspace->rcompactor.compare_func ?
objspace->rcompactor.compare_func : compare_pinned_slots
3725 for (
int i = 0; i < HEAP_COUNT; i++) {
3727 gc_sweep_start_heap(
objspace, heap);
3730 if (heap->sweeping_page == NULL) {
3731 GC_ASSERT(heap->total_pages == 0);
3732 GC_ASSERT(heap->total_slots == 0);
3733 gc_sweep_finish_heap(
objspace, heap);
3737 rb_gc_ractor_newobj_cache_foreach(gc_ractor_newobj_cache_clear, NULL);
3743 size_t total_slots = heap->total_slots;
3744 size_t swept_slots = heap->freed_slots + heap->empty_slots;
3746 size_t init_slots = gc_params.heap_init_slots[heap - heaps];
3747 size_t min_free_slots = (size_t)(MAX(total_slots, init_slots) * gc_params.heap_free_slots_min_ratio);
3749 if (swept_slots < min_free_slots &&
3751 ((heap->empty_slots == 0 && total_slots > 0) || heap->freed_slots > heap->empty_slots)) {
3757 while (swept_slots < min_free_slots &&
3758 (resurrected_page = heap_page_resurrect(
objspace))) {
3759 heap_add_page(
objspace, heap, resurrected_page);
3760 heap_add_freepage(heap, resurrected_page);
3762 swept_slots += resurrected_page->free_slots;
3765 if (swept_slots < min_free_slots) {
3769 objspace->profile.count -
objspace->rgengc.last_major_gc < RVALUE_OLD_AGE) {
3770 if (
objspace->heap_pages.allocatable_slots < min_free_slots) {
3771 heap_allocatable_slots_expand(
objspace, heap, swept_slots, heap->total_slots);
3775 gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_NOFREE;
3776 heap->force_major_gc_count++;
3785 gc_report(1,
objspace,
"gc_sweep_finish\n");
3788 heap_pages_free_unused_pages(
objspace);
3790 for (
int i = 0; i < HEAP_COUNT; i++) {
3793 heap->freed_slots = 0;
3794 heap->empty_slots = 0;
3796 if (!will_be_incremental_marking(
objspace)) {
3797 struct heap_page *end_page = heap->free_pages;
3799 while (end_page->free_next) end_page = end_page->free_next;
3800 end_page->free_next = heap->pooled_pages;
3803 heap->free_pages = heap->pooled_pages;
3805 heap->pooled_pages = NULL;
3811 gc_mode_transition(
objspace, gc_mode_none);
3813#if RGENGC_CHECK_MODE >= 2
3814 gc_verify_internal_consistency(
objspace);
3821 struct heap_page *sweep_page = heap->sweeping_page;
3822 int swept_slots = 0;
3823 int pooled_slots = 0;
3825 if (sweep_page == NULL)
return FALSE;
3827#if GC_ENABLE_LAZY_SWEEP
3828 gc_prof_sweep_timer_start(
objspace);
3832 RUBY_DEBUG_LOG(
"sweep_page:%p", (
void *)sweep_page);
3840 gc_sweep_page(
objspace, heap, &ctx);
3841 int free_slots = ctx.freed_slots + ctx.empty_slots;
3843 heap->sweeping_page = ccan_list_next(&heap->pages, sweep_page, page_node);
3845 if (free_slots == sweep_page->total_slots) {
3847 heap_unlink_page(
objspace, heap, sweep_page);
3849 sweep_page->start = 0;
3850 sweep_page->total_slots = 0;
3851 sweep_page->slot_size = 0;
3852 sweep_page->heap = NULL;
3853 sweep_page->free_slots = 0;
3855 asan_unlock_freelist(sweep_page);
3856 sweep_page->freelist = NULL;
3857 asan_lock_freelist(sweep_page);
3859 asan_poison_memory_region(sweep_page->body, HEAP_PAGE_SIZE);
3862 sweep_page->free_next =
objspace->empty_pages;
3863 objspace->empty_pages = sweep_page;
3865 else if (free_slots > 0) {
3866 heap->freed_slots += ctx.freed_slots;
3867 heap->empty_slots += ctx.empty_slots;
3869 if (pooled_slots < GC_INCREMENTAL_SWEEP_POOL_SLOT_COUNT) {
3870 heap_add_poolpage(
objspace, heap, sweep_page);
3871 pooled_slots += free_slots;
3874 heap_add_freepage(heap, sweep_page);
3875 swept_slots += free_slots;
3876 if (swept_slots > GC_INCREMENTAL_SWEEP_SLOT_COUNT) {
3882 sweep_page->free_next = NULL;
3884 }
while ((sweep_page = heap->sweeping_page));
3886 if (!heap->sweeping_page) {
3887 gc_sweep_finish_heap(
objspace, heap);
3889 if (!has_sweeping_pages(
objspace)) {
3894#if GC_ENABLE_LAZY_SWEEP
3895 gc_prof_sweep_timer_stop(
objspace);
3898 return heap->free_pages != NULL;
3904 for (
int i = 0; i < HEAP_COUNT; i++) {
3907 while (heap->sweeping_page) {
3916 GC_ASSERT(dont_gc_val() == FALSE ||
objspace->profile.latest_gc_info & GPR_FLAG_METHOD);
3917 if (!GC_ENABLE_LAZY_SWEEP)
return;
3921 for (
int i = 0; i < HEAP_COUNT; i++) {
3923 if (gc_sweep_step(
objspace, heap)) {
3924 GC_ASSERT(heap->free_pages != NULL);
3926 else if (heap == sweep_heap) {
3927 if (
objspace->empty_pages_count > 0 ||
objspace->heap_pages.allocatable_slots > 0) {
3938 heap_page_allocate_and_initialize(
objspace, heap);
3940 GC_ASSERT(heap->free_pages != NULL);
3945 GC_ASSERT(gc_mode(
objspace) == gc_mode_none);
3955rb_gc_impl_location(
void *objspace_ptr,
VALUE value)
3959 asan_unpoisoning_object(value) {
3961 destination = (
VALUE)RMOVED(value)->destination;
3965 destination = value;
3972#if GC_CAN_COMPILE_COMPACTION
3983 GC_ASSERT(RVALUE_PINNED(
objspace, forwarding_object));
3984 GC_ASSERT(!RVALUE_MARKED(
objspace, forwarding_object));
3986 CLEAR_IN_BITMAP(GET_HEAP_PINNED_BITS(forwarding_object), forwarding_object);
3988 object = rb_gc_impl_location(
objspace, forwarding_object);
3990 uint32_t original_shape_id = 0;
3992 original_shape_id = RMOVED(forwarding_object)->original_shape_id;
3995 gc_move(
objspace,
object, forwarding_object, GET_HEAP_PAGE(
object)->slot_size, page->slot_size);
3999 if (original_shape_id) {
4000 rb_gc_set_shape(forwarding_object, original_shape_id);
4003 struct heap_page *orig_page = GET_HEAP_PAGE(
object);
4004 orig_page->free_slots++;
4005 heap_page_add_freeobj(
objspace, orig_page,
object);
4007 GC_ASSERT(RVALUE_MARKED(
objspace, forwarding_object));
4012 p += BASE_SLOT_SIZE;
4022 bits_t *mark_bits, *pin_bits;
4025 mark_bits = page->mark_bits;
4026 pin_bits = page->pinned_bits;
4028 uintptr_t p = page->start;
4031 bitset = pin_bits[0] & ~mark_bits[0];
4032 bitset >>= NUM_IN_PAGE(p);
4033 invalidate_moved_plane(
objspace, page, p, bitset);
4034 p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
4036 for (i=1; i < HEAP_PAGE_BITMAP_LIMIT; i++) {
4039 bitset = pin_bits[i] & ~mark_bits[i];
4041 invalidate_moved_plane(
objspace, page, p, bitset);
4042 p += BITS_BITLENGTH * BASE_SLOT_SIZE;
4051 gc_mode_transition(
objspace, gc_mode_compacting);
4053 for (
int i = 0; i < HEAP_COUNT; i++) {
4055 ccan_list_for_each(&heap->pages, page, page_node) {
4056 page->flags.before_sweep = TRUE;
4059 heap->compact_cursor = ccan_list_tail(&heap->pages,
struct heap_page, page_node);
4060 heap->compact_cursor_index = 0;
4065 record->moved_objects =
objspace->rcompactor.total_moved;
4068 memset(
objspace->rcompactor.considered_count_table, 0,
T_MASK *
sizeof(
size_t));
4069 memset(
objspace->rcompactor.moved_count_table, 0,
T_MASK *
sizeof(
size_t));
4070 memset(
objspace->rcompactor.moved_up_count_table, 0,
T_MASK *
sizeof(
size_t));
4071 memset(
objspace->rcompactor.moved_down_count_table, 0,
T_MASK *
sizeof(
size_t));
4084 const unsigned int immediate_sweep =
objspace->flags.immediate_sweep;
4086 gc_report(1,
objspace,
"gc_sweep: immediate: %d\n", immediate_sweep);
4089 if (
objspace->flags.during_compacting) {
4093 if (immediate_sweep) {
4094#if !GC_ENABLE_LAZY_SWEEP
4095 gc_prof_sweep_timer_start(
objspace);
4098#if !GC_ENABLE_LAZY_SWEEP
4099 gc_prof_sweep_timer_stop(
objspace);
4105 for (
int i = 0; i < HEAP_COUNT; i++) {
4117stack_chunk_alloc(
void)
4131 return stack->chunk == NULL;
4137 size_t size = stack->index;
4138 stack_chunk_t *chunk = stack->chunk ? stack->chunk->next : NULL;
4141 size += stack->limit;
4142 chunk = chunk->next;
4150 chunk->next = stack->cache;
4151 stack->cache = chunk;
4152 stack->cache_size++;
4160 if (stack->unused_cache_size > (stack->cache_size/2)) {
4161 chunk = stack->cache;
4162 stack->cache = stack->cache->next;
4163 stack->cache_size--;
4166 stack->unused_cache_size = stack->cache_size;
4174 GC_ASSERT(stack->index == stack->limit);
4176 if (stack->cache_size > 0) {
4177 next = stack->cache;
4178 stack->cache = stack->cache->next;
4179 stack->cache_size--;
4180 if (stack->unused_cache_size > stack->cache_size)
4181 stack->unused_cache_size = stack->cache_size;
4184 next = stack_chunk_alloc();
4186 next->next = stack->chunk;
4187 stack->chunk = next;
4196 prev = stack->chunk->next;
4197 GC_ASSERT(stack->index == 0);
4198 add_stack_chunk_cache(stack, stack->chunk);
4199 stack->chunk = prev;
4200 stack->index = stack->limit;
4208 while (chunk != NULL) {
4218 mark_stack_chunk_list_free(stack->chunk);
4224 mark_stack_chunk_list_free(stack->cache);
4225 stack->cache_size = 0;
4226 stack->unused_cache_size = 0;
4253 if (stack->index == stack->limit) {
4254 push_mark_stack_chunk(stack);
4256 stack->chunk->data[stack->index++] = obj;
4266 rb_bug(
"push_mark_stack() called for broken object");
4270 rb_bug(
"push_mark_stack: unexpected T_NODE object");
4274 rb_bug(
"rb_gc_mark(): unknown data type 0x%x(%p) %s",
4276 is_pointer_to_heap((
rb_objspace_t *)rb_gc_get_objspace(), (
void *)obj) ?
"corrupted object" :
"non object");
4282 if (is_mark_stack_empty(stack)) {
4285 if (stack->index == 1) {
4286 *data = stack->chunk->data[--stack->index];
4287 pop_mark_stack_chunk(stack);
4290 *data = stack->chunk->data[--stack->index];
4301 stack->index = stack->limit = STACK_CHUNK_SIZE;
4303 for (i=0; i < 4; i++) {
4304 add_stack_chunk_cache(stack, stack_chunk_alloc());
4306 stack->unused_cache_size = stack->cache_size;
4314 if (
objspace->rgengc.parent_object_old_p) {
4315 if (RVALUE_WB_UNPROTECTED(
objspace, obj) || !RVALUE_OLD_P(
objspace, obj)) {
4324 if (RVALUE_MARKED(
objspace, obj))
return 0;
4325 MARK_IN_BITMAP(GET_HEAP_MARK_BITS(obj), obj);
4339 if(!gc_config_full_mark_val)
4342 struct heap_page *page = GET_HEAP_PAGE(obj);
4344 GC_ASSERT(RVALUE_MARKING(
objspace, obj) == FALSE);
4345 check_rvalue_consistency(
objspace, obj);
4347 if (!RVALUE_PAGE_WB_UNPROTECTED(page, obj)) {
4348 if (!RVALUE_OLD_P(
objspace, obj)) {
4349 gc_report(3,
objspace,
"gc_aging: YOUNG: %s\n", rb_obj_info(obj));
4352 else if (is_full_marking(
objspace)) {
4353 GC_ASSERT(RVALUE_PAGE_UNCOLLECTIBLE(page, obj) == FALSE);
4354 RVALUE_PAGE_OLD_UNCOLLECTIBLE_SET(
objspace, page, obj);
4357 check_rvalue_consistency(
objspace, obj);
4365#if RGENGC_CHECK_MODE
4366 if (RVALUE_MARKED(
objspace, obj) == FALSE) rb_bug(
"gc_grey: %s is not marked.", rb_obj_info(obj));
4367 if (RVALUE_MARKING(
objspace, obj) == TRUE) rb_bug(
"gc_grey: %s is marking/remembered.", rb_obj_info(obj));
4370 if (is_incremental_marking(
objspace)) {
4371 MARK_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), obj);
4374 push_mark_stack(&
objspace->mark_stack, obj);
4381 enum {info_size = 256};
4382 char obj_info_buf[info_size];
4383 rb_raw_obj_info(obj_info_buf, info_size, obj);
4385 char parent_obj_info_buf[info_size];
4386 rb_raw_obj_info(parent_obj_info_buf, info_size,
objspace->rgengc.parent_object);
4388 rb_bug(
"try to mark T_NONE object (obj: %s, parent: %s)", obj_info_buf, parent_obj_info_buf);
4395 GC_ASSERT(during_gc);
4396 GC_ASSERT(!
objspace->flags.during_reference_updating);
4398 rgengc_check_relation(
objspace, obj);
4399 if (!gc_mark_set(
objspace, obj))
return;
4402 RUBY_DEBUG_LOG(
"%p (%s) parent:%p (%s)",
4403 (
void *)obj, obj_type_name(obj),
4404 (
void *)
objspace->rgengc.parent_object, obj_type_name(
objspace->rgengc.parent_object));
4407 gc_mark_check_t_none(
objspace, obj);
4417 if (RB_UNLIKELY(
objspace->flags.during_compacting)) {
4418 if (RB_LIKELY(during_gc)) {
4419 if (!RVALUE_PINNED(
objspace, obj)) {
4420 GC_ASSERT(GET_HEAP_PAGE(obj)->pinned_slots <= GET_HEAP_PAGE(obj)->total_slots);
4421 GET_HEAP_PAGE(obj)->pinned_slots++;
4422 MARK_IN_BITMAP(GET_HEAP_PINNED_BITS(obj), obj);
4436rb_gc_impl_mark_and_move(
void *objspace_ptr,
VALUE *ptr)
4440 if (RB_UNLIKELY(
objspace->flags.during_reference_updating)) {
4441 GC_ASSERT(
objspace->flags.during_compacting);
4442 GC_ASSERT(during_gc);
4445 if (destination != *ptr) {
4455rb_gc_impl_mark(
void *objspace_ptr,
VALUE obj)
4463rb_gc_impl_mark_and_pin(
void *objspace_ptr,
VALUE obj)
4471rb_gc_impl_mark_maybe(
void *objspace_ptr,
VALUE obj)
4475 (void)VALGRIND_MAKE_MEM_DEFINED(&obj,
sizeof(obj));
4477 if (is_pointer_to_heap(
objspace, (
void *)obj)) {
4478 asan_unpoisoning_object(obj) {
4493rb_gc_impl_mark_weak(
void *objspace_ptr,
VALUE *ptr)
4499 gc_mark_check_t_none(
objspace, obj);
4505 GC_ASSERT(RVALUE_MARKED(
objspace, obj));
4506 GC_ASSERT(!
objspace->flags.during_compacting);
4511 rgengc_check_relation(
objspace, obj);
4513 rb_darray_append_without_gc(&
objspace->weak_references, ptr);
4515 objspace->profile.weak_references_count++;
4519rb_gc_impl_remove_weak(
void *objspace_ptr,
VALUE parent_obj,
VALUE *ptr)
4525 if (!is_incremental_marking(
objspace))
return;
4528 if (!RVALUE_MARKED(
objspace, parent_obj))
return;
4531 rb_darray_foreach(
objspace->weak_references, i, ptr_ptr) {
4532 if (*ptr_ptr == ptr) {
4540pin_value(st_data_t key, st_data_t value, st_data_t data)
4542 rb_gc_impl_mark_and_pin((
void *)data, (
VALUE)value);
4550 asan_unpoison_memory_region(&
objspace->rgengc.parent_object,
sizeof(
objspace->rgengc.parent_object),
false);
4551 asan_unpoison_memory_region(&
objspace->rgengc.parent_object_old_p,
sizeof(
objspace->rgengc.parent_object_old_p),
false);
4552 objspace->rgengc.parent_object = obj;
4553 objspace->rgengc.parent_object_old_p = old_p;
4565 asan_poison_memory_region(&
objspace->rgengc.parent_object,
sizeof(
objspace->rgengc.parent_object));
4566 asan_poison_memory_region(&
objspace->rgengc.parent_object_old_p,
sizeof(
objspace->rgengc.parent_object_old_p));
4572#define MARK_CHECKPOINT(category) do { \
4573 if (categoryp) *categoryp = category; \
4576 MARK_CHECKPOINT(
"objspace");
4579 if (finalizer_table != NULL) {
4580 st_foreach(finalizer_table, pin_value, (st_data_t)
objspace);
4583 if (stress_to_class) rb_gc_mark(stress_to_class);
4585 rb_gc_save_machine_context();
4586 rb_gc_mark_roots(
objspace, categoryp);
4587 gc_mark_set_parent_invalid(
objspace);
4594 rb_gc_mark_children(
objspace, obj);
4595 gc_mark_set_parent_invalid(
objspace);
4607 size_t marked_slots_at_the_beginning =
objspace->marked_slots;
4608 size_t popped_count = 0;
4610 while (pop_mark_stack(mstack, &obj)) {
4611 if (obj ==
Qundef)
continue;
4613 if (RGENGC_CHECK_MODE && !RVALUE_MARKED(
objspace, obj)) {
4614 rb_bug(
"gc_mark_stacked_objects: %s is not marked.", rb_obj_info(obj));
4619 if (RGENGC_CHECK_MODE && !RVALUE_MARKING(
objspace, obj)) {
4620 rb_bug(
"gc_mark_stacked_objects: incremental, but marking bit is 0");
4622 CLEAR_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), obj);
4625 if (popped_count + (
objspace->marked_slots - marked_slots_at_the_beginning) > count) {
4634 if (RGENGC_CHECK_MODE >= 3) gc_verify_internal_consistency(
objspace);
4636 if (is_mark_stack_empty(mstack)) {
4637 shrink_stack_chunk_cache(mstack);
4648 return gc_mark_stacked_objects(
objspace, TRUE, count);
4654 return gc_mark_stacked_objects(
objspace, FALSE, 0);
4657#if RGENGC_CHECK_MODE >= 4
4659#define MAKE_ROOTSIG(obj) (((VALUE)(obj) << 1) | 0x01)
4660#define IS_ROOTSIG(obj) ((VALUE)(obj) & 0x01)
4661#define GET_ROOTSIG(obj) ((const char *)((VALUE)(obj) >> 1))
4669static struct reflist *
4670reflist_create(
VALUE obj)
4672 struct reflist *refs =
xmalloc(
sizeof(
struct reflist));
4675 refs->list[0] = obj;
4681reflist_destruct(
struct reflist *refs)
4688reflist_add(
struct reflist *refs,
VALUE obj)
4690 if (refs->pos == refs->size) {
4692 SIZED_REALLOC_N(refs->list,
VALUE, refs->size, refs->size/2);
4695 refs->list[refs->pos++] = obj;
4699reflist_dump(
struct reflist *refs)
4702 for (i=0; i<refs->pos; i++) {
4703 VALUE obj = refs->list[i];
4704 if (IS_ROOTSIG(obj)) {
4705 fprintf(stderr,
"<root@%s>", GET_ROOTSIG(obj));
4708 fprintf(stderr,
"<%s>", rb_obj_info(obj));
4710 if (i+1 < refs->pos) fprintf(stderr,
", ");
4715reflist_referred_from_machine_context(
struct reflist *refs)
4718 for (i=0; i<refs->pos; i++) {
4719 VALUE obj = refs->list[i];
4720 if (IS_ROOTSIG(obj) && strcmp(GET_ROOTSIG(obj),
"machine_context") == 0)
return 1;
4735 const char *category;
4741allrefs_add(
struct allrefs *data,
VALUE obj)
4743 struct reflist *refs;
4746 if (st_lookup(data->references, obj, &r)) {
4747 refs = (
struct reflist *)r;
4748 reflist_add(refs, data->root_obj);
4752 refs = reflist_create(data->root_obj);
4753 st_insert(data->references, obj, (st_data_t)refs);
4759allrefs_i(
VALUE obj,
void *ptr)
4761 struct allrefs *data = (
struct allrefs *)ptr;
4763 if (allrefs_add(data, obj)) {
4764 push_mark_stack(&data->mark_stack, obj);
4769allrefs_roots_i(
VALUE obj,
void *ptr)
4771 struct allrefs *data = (
struct allrefs *)ptr;
4772 if (strlen(data->category) == 0) rb_bug(
"!!!");
4773 data->root_obj = MAKE_ROOTSIG(data->category);
4775 if (allrefs_add(data, obj)) {
4776 push_mark_stack(&data->mark_stack, obj);
4779#define PUSH_MARK_FUNC_DATA(v) do { \
4780 struct gc_mark_func_data_struct *prev_mark_func_data = GET_VM()->gc.mark_func_data; \
4781 GET_VM()->gc.mark_func_data = (v);
4783#define POP_MARK_FUNC_DATA() GET_VM()->gc.mark_func_data = prev_mark_func_data;} while (0)
4788 struct allrefs data;
4789 struct gc_mark_func_data_struct mfd;
4791 int prev_dont_gc = dont_gc_val();
4795 data.references = st_init_numtable();
4796 init_mark_stack(&data.mark_stack);
4798 mfd.mark_func = allrefs_roots_i;
4802 PUSH_MARK_FUNC_DATA(&mfd);
4803 GET_VM()->gc.mark_func_data = &mfd;
4804 mark_roots(
objspace, &data.category);
4805 POP_MARK_FUNC_DATA();
4808 while (pop_mark_stack(&data.mark_stack, &obj)) {
4809 rb_objspace_reachable_objects_from(data.root_obj = obj, allrefs_i, &data);
4811 free_stack_chunks(&data.mark_stack);
4813 dont_gc_set(prev_dont_gc);
4814 return data.references;
4818objspace_allrefs_destruct_i(st_data_t key, st_data_t value, st_data_t ptr)
4820 struct reflist *refs = (
struct reflist *)value;
4821 reflist_destruct(refs);
4826objspace_allrefs_destruct(
struct st_table *refs)
4828 st_foreach(refs, objspace_allrefs_destruct_i, 0);
4829 st_free_table(refs);
4832#if RGENGC_CHECK_MODE >= 5
4834allrefs_dump_i(st_data_t k, st_data_t v, st_data_t ptr)
4837 struct reflist *refs = (
struct reflist *)v;
4838 fprintf(stderr,
"[allrefs_dump_i] %s <- ", rb_obj_info(obj));
4840 fprintf(stderr,
"\n");
4848 fprintf(stderr,
"[all refs] (size: %"PRIuVALUE
")\n", size);
4849 st_foreach(
objspace->rgengc.allrefs_table, allrefs_dump_i, 0);
4854gc_check_after_marks_i(st_data_t k, st_data_t v, st_data_t ptr)
4857 struct reflist *refs = (
struct reflist *)v;
4861 if (!RVALUE_MARKED(
objspace, obj)) {
4862 fprintf(stderr,
"gc_check_after_marks_i: %s is not marked and not oldgen.\n", rb_obj_info(obj));
4863 fprintf(stderr,
"gc_check_after_marks_i: %p is referred from ", (
void *)obj);
4866 if (reflist_referred_from_machine_context(refs)) {
4867 fprintf(stderr,
" (marked from machine stack).\n");
4872 fprintf(stderr,
"\n");
4879gc_marks_check(
rb_objspace_t *
objspace, st_foreach_callback_func *checker_func,
const char *checker_name)
4881 size_t saved_malloc_increase =
objspace->malloc_params.increase;
4882#if RGENGC_ESTIMATE_OLDMALLOC
4883 size_t saved_oldmalloc_increase =
objspace->rgengc.oldmalloc_increase;
4890 st_foreach(
objspace->rgengc.allrefs_table, checker_func, (st_data_t)
objspace);
4893 if (
objspace->rgengc.error_count > 0) {
4894#if RGENGC_CHECK_MODE >= 5
4897 if (checker_name) rb_bug(
"%s: GC has problem.", checker_name);
4900 objspace_allrefs_destruct(
objspace->rgengc.allrefs_table);
4901 objspace->rgengc.allrefs_table = 0;
4904 objspace->malloc_params.increase = saved_malloc_increase;
4905#if RGENGC_ESTIMATE_OLDMALLOC
4906 objspace->rgengc.oldmalloc_increase = saved_oldmalloc_increase;
4914 size_t live_object_count;
4915 size_t zombie_object_count;
4918 size_t old_object_count;
4919 size_t remembered_shady_count;
4923check_generation_i(
const VALUE child,
void *ptr)
4926 const VALUE parent = data->parent;
4928 if (RGENGC_CHECK_MODE) GC_ASSERT(RVALUE_OLD_P(data->objspace, parent));
4930 if (!RVALUE_OLD_P(data->objspace, child)) {
4931 if (!RVALUE_REMEMBERED(data->objspace, parent) &&
4932 !RVALUE_REMEMBERED(data->objspace, child) &&
4933 !RVALUE_UNCOLLECTIBLE(data->objspace, child)) {
4934 fprintf(stderr,
"verify_internal_consistency_reachable_i: WB miss (O->Y) %s -> %s\n", rb_obj_info(parent), rb_obj_info(child));
4941check_color_i(
const VALUE child,
void *ptr)
4944 const VALUE parent = data->parent;
4946 if (!RVALUE_WB_UNPROTECTED(data->objspace, parent) && RVALUE_WHITE_P(data->objspace, child)) {
4947 fprintf(stderr,
"verify_internal_consistency_reachable_i: WB miss (B->W) - %s -> %s\n",
4948 rb_obj_info(parent), rb_obj_info(child));
4954check_children_i(
const VALUE child,
void *ptr)
4957 if (check_rvalue_consistency_force(data->objspace, child, FALSE) != 0) {
4958 fprintf(stderr,
"check_children_i: %s has error (referenced from %s)",
4959 rb_obj_info(child), rb_obj_info(data->parent));
4966verify_internal_consistency_i(
void *page_start,
void *page_end,
size_t stride,
4972 for (obj = (
VALUE)page_start; obj != (
VALUE)page_end; obj += stride) {
4973 asan_unpoisoning_object(obj) {
4974 if (!rb_gc_impl_garbage_object_p(
objspace, obj)) {
4976 data->live_object_count++;
4981 if (!gc_object_moved_p(
objspace, obj)) {
4983 rb_objspace_reachable_objects_from(obj, check_children_i, (
void *)data);
4987 if (RVALUE_OLD_P(
objspace, obj)) data->old_object_count++;
4988 if (RVALUE_WB_UNPROTECTED(
objspace, obj) && RVALUE_UNCOLLECTIBLE(
objspace, obj)) data->remembered_shady_count++;
4993 rb_objspace_reachable_objects_from(obj, check_generation_i, (
void *)data);
4996 if (is_incremental_marking(
objspace)) {
4997 if (RVALUE_BLACK_P(
objspace, obj)) {
5000 rb_objspace_reachable_objects_from(obj, check_color_i, (
void *)data);
5006 data->zombie_object_count++;
5009 fprintf(stderr,
"verify_internal_consistency_i: T_ZOMBIE has extra flags set: %s\n",
5015 fprintf(stderr,
"verify_internal_consistency_i: FL_FINALIZE %s but %s finalizer_table: %s\n",
5016 FL_TEST(obj,
FL_FINALIZE) ?
"set" :
"not set", st_is_member(finalizer_table, obj) ?
"in" :
"not in",
5031 unsigned int has_remembered_shady = FALSE;
5032 unsigned int has_remembered_old = FALSE;
5033 int remembered_old_objects = 0;
5034 int free_objects = 0;
5035 int zombie_objects = 0;
5037 short slot_size = page->slot_size;
5038 uintptr_t start = (uintptr_t)page->start;
5039 uintptr_t end = start + page->total_slots * slot_size;
5041 for (uintptr_t ptr = start; ptr < end; ptr += slot_size) {
5043 asan_unpoisoning_object(val) {
5048 if (RVALUE_PAGE_UNCOLLECTIBLE(page, val) && RVALUE_PAGE_WB_UNPROTECTED(page, val)) {
5049 has_remembered_shady = TRUE;
5051 if (RVALUE_PAGE_MARKING(page, val)) {
5052 has_remembered_old = TRUE;
5053 remembered_old_objects++;
5058 if (!is_incremental_marking(
objspace) &&
5059 page->flags.has_remembered_objects == FALSE && has_remembered_old == TRUE) {
5061 for (uintptr_t ptr = start; ptr < end; ptr += slot_size) {
5063 if (RVALUE_PAGE_MARKING(page, val)) {
5064 fprintf(stderr,
"marking -> %s\n", rb_obj_info(val));
5067 rb_bug(
"page %p's has_remembered_objects should be false, but there are remembered old objects (%d). %s",
5068 (
void *)page, remembered_old_objects, obj ? rb_obj_info(obj) :
"");
5071 if (page->flags.has_uncollectible_wb_unprotected_objects == FALSE && has_remembered_shady == TRUE) {
5072 rb_bug(
"page %p's has_remembered_shady should be false, but there are remembered shady objects. %s",
5073 (
void *)page, obj ? rb_obj_info(obj) :
"");
5078 if (page->free_slots != free_objects) {
5079 rb_bug(
"page %p's free_slots should be %d, but %d", (
void *)page, page->free_slots, free_objects);
5082 if (page->final_slots != zombie_objects) {
5083 rb_bug(
"page %p's final_slots should be %d, but %d", (
void *)page, page->final_slots, zombie_objects);
5086 return remembered_old_objects;
5092 int remembered_old_objects = 0;
5095 ccan_list_for_each(head, page, page_node) {
5096 asan_unlock_freelist(page);
5101 rb_asan_unpoison_object(vp,
false);
5103 fprintf(stderr,
"freelist slot expected to be T_NONE but was: %s\n", rb_obj_info(vp));
5106 rb_asan_poison_object(prev);
5108 asan_lock_freelist(page);
5110 if (page->flags.has_remembered_objects == FALSE) {
5111 remembered_old_objects += gc_verify_heap_page(
objspace, page,
Qfalse);
5115 return remembered_old_objects;
5121 int remembered_old_objects = 0;
5122 for (
int i = 0; i < HEAP_COUNT; i++) {
5123 remembered_old_objects += gc_verify_heap_pages_(
objspace, &((&heaps[i])->pages));
5125 return remembered_old_objects;
5134 gc_report(5,
objspace,
"gc_verify_internal_consistency: start\n");
5137 for (
size_t i = 0; i < rb_darray_size(
objspace->heap_pages.sorted); i++) {
5139 short slot_size = page->slot_size;
5141 uintptr_t start = (uintptr_t)page->start;
5142 uintptr_t end = start + page->total_slots * slot_size;
5144 verify_internal_consistency_i((
void *)start, (
void *)end, slot_size, &data);
5147 if (data.err_count != 0) {
5148#if RGENGC_CHECK_MODE >= 5
5149 objspace->rgengc.error_count = data.err_count;
5150 gc_marks_check(
objspace, NULL, NULL);
5153 rb_bug(
"gc_verify_internal_consistency: found internal inconsistency.");
5163 !rb_gc_multi_ractor_p()) {
5164 if (objspace_live_slots(
objspace) != data.live_object_count) {
5165 fprintf(stderr,
"heap_pages_final_slots: %"PRIdSIZE
", total_freed_objects: %"PRIdSIZE
"\n",
5167 rb_bug(
"inconsistent live slot number: expect %"PRIuSIZE
", but %"PRIuSIZE
".",
5168 objspace_live_slots(
objspace), data.live_object_count);
5173 if (
objspace->rgengc.old_objects != data.old_object_count) {
5174 rb_bug(
"inconsistent old slot number: expect %"PRIuSIZE
", but %"PRIuSIZE
".",
5175 objspace->rgengc.old_objects, data.old_object_count);
5177 if (
objspace->rgengc.uncollectible_wb_unprotected_objects != data.remembered_shady_count) {
5178 rb_bug(
"inconsistent number of wb unprotected objects: expect %"PRIuSIZE
", but %"PRIuSIZE
".",
5179 objspace->rgengc.uncollectible_wb_unprotected_objects, data.remembered_shady_count);
5184 size_t list_count = 0;
5187 VALUE z = heap_pages_deferred_final;
5190 z = RZOMBIE(z)->next;
5194 if (total_final_slots_count(
objspace) != data.zombie_object_count ||
5195 total_final_slots_count(
objspace) != list_count) {
5197 rb_bug(
"inconsistent finalizing object count:\n"
5198 " expect %"PRIuSIZE
"\n"
5199 " but %"PRIuSIZE
" zombies\n"
5200 " heap_pages_deferred_final list has %"PRIuSIZE
" items.",
5202 data.zombie_object_count,
5207 gc_report(5,
objspace,
"gc_verify_internal_consistency: OK\n");
5211gc_verify_internal_consistency(
void *objspace_ptr)
5215 unsigned int lev = RB_GC_VM_LOCK();
5219 unsigned int prev_during_gc = during_gc;
5222 gc_verify_internal_consistency_(
objspace);
5224 during_gc = prev_during_gc;
5226 RB_GC_VM_UNLOCK(lev);
5230heap_move_pooled_pages_to_free_pages(
rb_heap_t *heap)
5232 if (heap->pooled_pages) {
5233 if (heap->free_pages) {
5234 struct heap_page *free_pages_tail = heap->free_pages;
5235 while (free_pages_tail->free_next) {
5236 free_pages_tail = free_pages_tail->free_next;
5238 free_pages_tail->free_next = heap->pooled_pages;
5241 heap->free_pages = heap->pooled_pages;
5244 heap->pooled_pages = NULL;
5251 struct heap_page *page = GET_HEAP_PAGE(obj);
5252 bits_t *uncollectible_bits = &page->uncollectible_bits[0];
5254 if (!MARKED_IN_BITMAP(uncollectible_bits, obj)) {
5255 page->flags.has_uncollectible_wb_unprotected_objects = TRUE;
5256 MARK_IN_BITMAP(uncollectible_bits, obj);
5257 objspace->rgengc.uncollectible_wb_unprotected_objects++;
5259#if RGENGC_PROFILE > 0
5260 objspace->profile.total_remembered_shady_object_count++;
5261#if RGENGC_PROFILE >= 2
5278 gc_report(2,
objspace,
"gc_marks_wb_unprotected_objects: marked shady: %s\n", rb_obj_info((
VALUE)p));
5283 p += BASE_SLOT_SIZE;
5294 ccan_list_for_each(&heap->pages, page, page_node) {
5295 bits_t *mark_bits = page->mark_bits;
5296 bits_t *wbun_bits = page->wb_unprotected_bits;
5297 uintptr_t p = page->start;
5300 bits_t bits = mark_bits[0] & wbun_bits[0];
5301 bits >>= NUM_IN_PAGE(p);
5302 gc_marks_wb_unprotected_objects_plane(
objspace, p, bits);
5303 p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
5305 for (j=1; j<HEAP_PAGE_BITMAP_LIMIT; j++) {
5306 bits_t bits = mark_bits[j] & wbun_bits[j];
5308 gc_marks_wb_unprotected_objects_plane(
objspace, p, bits);
5309 p += BITS_BITLENGTH * BASE_SLOT_SIZE;
5313 gc_mark_stacked_objects_all(
objspace);
5319 size_t retained_weak_references_count = 0;
5321 rb_darray_foreach(
objspace->weak_references, i, ptr_ptr) {
5322 if (!*ptr_ptr)
continue;
5324 VALUE obj = **ptr_ptr;
5328 if (!RVALUE_MARKED(
objspace, obj)) {
5332 retained_weak_references_count++;
5336 objspace->profile.retained_weak_references_count = retained_weak_references_count;
5338 rb_darray_clear(
objspace->weak_references);
5339 rb_darray_resize_capa_without_gc(&
objspace->weak_references, retained_weak_references_count);
5346 if (is_incremental_marking(
objspace)) {
5347 if (RGENGC_CHECK_MODE && is_mark_stack_empty(&
objspace->mark_stack) == 0) {
5348 rb_bug(
"gc_marks_finish: mark stack is not empty (%"PRIdSIZE
").",
5349 mark_stack_size(&
objspace->mark_stack));
5353 while (gc_mark_stacked_objects_incremental(
objspace, INT_MAX) ==
false);
5355#if RGENGC_CHECK_MODE >= 2
5356 if (gc_verify_heap_pages(
objspace) != 0) {
5357 rb_bug(
"gc_marks_finish (incremental): there are remembered old objects.");
5361 objspace->flags.during_incremental_marking = FALSE;
5363 for (
int i = 0; i < HEAP_COUNT; i++) {
5364 gc_marks_wb_unprotected_objects(
objspace, &heaps[i]);
5368 gc_update_weak_references(
objspace);
5370#if RGENGC_CHECK_MODE >= 2
5371 gc_verify_internal_consistency(
objspace);
5374#if RGENGC_CHECK_MODE >= 4
5376 gc_marks_check(
objspace, gc_check_after_marks_i,
"after_marks");
5381 const unsigned long r_mul =
objspace->live_ractor_cache_count > 8 ? 8 :
objspace->live_ractor_cache_count;
5383 size_t total_slots = objspace_available_slots(
objspace);
5384 size_t sweep_slots = total_slots -
objspace->marked_slots;
5385 size_t max_free_slots = (size_t)(total_slots * gc_params.heap_free_slots_max_ratio);
5386 size_t min_free_slots = (size_t)(total_slots * gc_params.heap_free_slots_min_ratio);
5387 if (min_free_slots < gc_params.heap_free_slots * r_mul) {
5388 min_free_slots = gc_params.heap_free_slots * r_mul;
5391 int full_marking = is_full_marking(
objspace);
5396 size_t total_init_slots = 0;
5397 for (
int i = 0; i < HEAP_COUNT; i++) {
5398 total_init_slots += gc_params.heap_init_slots[i] * r_mul;
5401 if (max_free_slots < total_init_slots) {
5402 max_free_slots = total_init_slots;
5405 if (sweep_slots > max_free_slots) {
5406 heap_pages_freeable_pages = (sweep_slots - max_free_slots) / HEAP_PAGE_OBJ_LIMIT;
5409 heap_pages_freeable_pages = 0;
5412 if (
objspace->heap_pages.allocatable_slots == 0 && sweep_slots < min_free_slots) {
5413 if (!full_marking) {
5414 if (
objspace->profile.count -
objspace->rgengc.last_major_gc < RVALUE_OLD_AGE) {
5415 full_marking = TRUE;
5418 gc_report(1,
objspace,
"gc_marks_finish: next is full GC!!)\n");
5419 gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_NOFREE;
5424 heap_allocatable_slots_expand(
objspace, NULL, sweep_slots, total_slots);
5430 const double r = gc_params.oldobject_limit_factor;
5431 objspace->rgengc.uncollectible_wb_unprotected_objects_limit = MAX(
5432 (
size_t)(
objspace->rgengc.uncollectible_wb_unprotected_objects * r),
5433 (
size_t)(
objspace->rgengc.old_objects * gc_params.uncollectible_wb_unprotected_objects_limit_ratio)
5435 objspace->rgengc.old_objects_limit = (size_t)(
objspace->rgengc.old_objects * r);
5438 if (
objspace->rgengc.uncollectible_wb_unprotected_objects >
objspace->rgengc.uncollectible_wb_unprotected_objects_limit) {
5439 gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_SHADY;
5442 gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_OLDGEN;
5445 gc_report(1,
objspace,
"gc_marks_finish (marks %"PRIdSIZE
" objects, "
5446 "old %"PRIdSIZE
" objects, total %"PRIdSIZE
" slots, "
5447 "sweep %"PRIdSIZE
" slots, allocatable %"PRIdSIZE
" slots, next GC: %s)\n",
5449 gc_needs_major_flags ?
"major" :
"minor");
5453 rb_ractor_finish_marking();
5459gc_compact_heap_cursors_met_p(
rb_heap_t *heap)
5461 return heap->sweeping_page == heap->compact_cursor;
5468 size_t obj_size = rb_gc_obj_optimal_size(obj);
5469 if (obj_size == 0) {
5474 if (rb_gc_impl_size_allocatable_p(obj_size)) {
5475 idx = heap_idx_for_size(obj_size);
5485 GC_ASSERT(gc_is_moveable_obj(
objspace, src));
5488 uint32_t orig_shape = 0;
5489 uint32_t new_shape = 0;
5491 if (gc_compact_heap_cursors_met_p(dest_pool)) {
5492 return dest_pool != heap;
5496 orig_shape = rb_gc_get_shape(src);
5498 if (dest_pool != heap) {
5499 new_shape = rb_gc_rebuild_shape(src, dest_pool - heaps);
5501 if (new_shape == 0) {
5507 while (!try_move(
objspace, dest_pool, dest_pool->free_pages, src)) {
5509 .page = dest_pool->sweeping_page,
5518 lock_page_body(
objspace, GET_PAGE_BODY(src));
5519 gc_sweep_page(
objspace, dest_pool, &ctx);
5520 unlock_page_body(
objspace, GET_PAGE_BODY(src));
5522 if (dest_pool->sweeping_page->free_slots > 0) {
5523 heap_add_freepage(dest_pool, dest_pool->sweeping_page);
5526 dest_pool->sweeping_page = ccan_list_next(&dest_pool->pages, dest_pool->sweeping_page, page_node);
5527 if (gc_compact_heap_cursors_met_p(dest_pool)) {
5528 return dest_pool != heap;
5532 if (orig_shape != 0) {
5533 if (new_shape != 0) {
5535 rb_gc_set_shape(dest, new_shape);
5537 RMOVED(src)->original_shape_id = orig_shape;
5546 short slot_size = page->slot_size;
5547 short slot_bits = slot_size / BASE_SLOT_SIZE;
5548 GC_ASSERT(slot_bits > 0);
5552 GC_ASSERT(vp % BASE_SLOT_SIZE == 0);
5557 if (gc_is_moveable_obj(
objspace, vp)) {
5558 if (!gc_compact_move(
objspace, heap, vp)) {
5565 bitset >>= slot_bits;
5575 GC_ASSERT(page == heap->compact_cursor);
5577 bits_t *mark_bits, *pin_bits;
5579 uintptr_t p = page->start;
5581 mark_bits = page->mark_bits;
5582 pin_bits = page->pinned_bits;
5585 bitset = (mark_bits[0] & ~pin_bits[0]);
5586 bitset >>= NUM_IN_PAGE(p);
5588 if (!gc_compact_plane(
objspace, heap, (uintptr_t)p, bitset, page))
5591 p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
5593 for (
int j = 1; j < HEAP_PAGE_BITMAP_LIMIT; j++) {
5594 bitset = (mark_bits[j] & ~pin_bits[j]);
5596 if (!gc_compact_plane(
objspace, heap, (uintptr_t)p, bitset, page))
5599 p += BITS_BITLENGTH * BASE_SLOT_SIZE;
5608 for (
int i = 0; i < HEAP_COUNT; i++) {
5611 if (heap->total_pages > 0 &&
5612 !gc_compact_heap_cursors_met_p(heap)) {
5624#if RGENGC_CHECK_MODE >= 2
5625 gc_verify_internal_consistency(
objspace);
5628 while (!gc_compact_all_compacted_p(
objspace)) {
5629 for (
int i = 0; i < HEAP_COUNT; i++) {
5632 if (gc_compact_heap_cursors_met_p(heap)) {
5636 struct heap_page *start_page = heap->compact_cursor;
5638 if (!gc_compact_page(
objspace, heap, start_page)) {
5639 lock_page_body(
objspace, start_page->body);
5646 lock_page_body(
objspace, start_page->body);
5647 heap->compact_cursor = ccan_list_prev(&heap->pages, heap->compact_cursor, page_node);
5653#if RGENGC_CHECK_MODE >= 2
5654 gc_verify_internal_consistency(
objspace);
5661 gc_report(1,
objspace,
"gc_marks_rest\n");
5663 for (
int i = 0; i < HEAP_COUNT; i++) {
5664 (&heaps[i])->pooled_pages = NULL;
5667 if (is_incremental_marking(
objspace)) {
5668 while (gc_mark_stacked_objects_incremental(
objspace, INT_MAX) == FALSE);
5671 gc_mark_stacked_objects_all(
objspace);
5680 bool marking_finished =
false;
5683 if (gc_mark_stacked_objects_incremental(
objspace, slots)) {
5686 marking_finished =
true;
5689 return marking_finished;
5695 GC_ASSERT(dont_gc_val() == FALSE ||
objspace->profile.latest_gc_info & GPR_FLAG_METHOD);
5696 bool marking_finished =
true;
5700 if (heap->free_pages) {
5701 gc_report(2,
objspace,
"gc_marks_continue: has pooled pages");
5706 gc_report(2,
objspace,
"gc_marks_continue: no more pooled pages (stack depth: %"PRIdSIZE
").\n",
5707 mark_stack_size(&
objspace->mark_stack));
5708 heap->force_incremental_marking_finish_count++;
5714 return marking_finished;
5721 gc_report(1,
objspace,
"gc_marks_start: (%s)\n", full_mark ?
"full" :
"minor");
5722 gc_mode_transition(
objspace, gc_mode_marking);
5725 size_t incremental_marking_steps = (
objspace->rincgc.pooled_slots / INCREMENTAL_MARK_STEP_ALLOCATIONS) + 1;
5726 objspace->rincgc.step_slots = (
objspace->marked_slots * 2) / incremental_marking_steps;
5728 if (0) fprintf(stderr,
"objspace->marked_slots: %"PRIdSIZE
", "
5729 "objspace->rincgc.pooled_page_num: %"PRIdSIZE
", "
5730 "objspace->rincgc.step_slots: %"PRIdSIZE
", \n",
5732 objspace->flags.during_minor_gc = FALSE;
5733 if (ruby_enable_autocompact) {
5734 objspace->flags.during_compacting |= TRUE;
5736 objspace->profile.major_gc_count++;
5737 objspace->rgengc.uncollectible_wb_unprotected_objects = 0;
5742 for (
int i = 0; i < HEAP_COUNT; i++) {
5744 rgengc_mark_and_rememberset_clear(
objspace, heap);
5745 heap_move_pooled_pages_to_free_pages(heap);
5747 if (
objspace->flags.during_compacting) {
5750 ccan_list_for_each(&heap->pages, page, page_node) {
5751 page->pinned_slots = 0;
5757 objspace->flags.during_minor_gc = TRUE;
5759 objspace->rgengc.old_objects +
objspace->rgengc.uncollectible_wb_unprotected_objects;
5760 objspace->profile.minor_gc_count++;
5762 for (
int i = 0; i < HEAP_COUNT; i++) {
5763 rgengc_rememberset_mark(
objspace, &heaps[i]);
5769 gc_report(1,
objspace,
"gc_marks_start: (%s) end, stack in %"PRIdSIZE
"\n",
5776 gc_prof_mark_timer_start(
objspace);
5779 bool marking_finished =
false;
5783 gc_marks_start(
objspace, full_mark);
5784 if (!is_incremental_marking(
objspace)) {
5786 marking_finished =
true;
5789#if RGENGC_PROFILE > 0
5792 record->old_objects =
objspace->rgengc.old_objects;
5799 return marking_finished;
5807 if (level <= RGENGC_DEBUG) {
5811 const char *status =
" ";
5814 status = is_full_marking(
objspace) ?
"+" :
"-";
5820 if (is_incremental_marking(
objspace)) {
5825 va_start(args, fmt);
5826 vsnprintf(buf, 1024, fmt, args);
5829 fprintf(out,
"%s|", status);
5839 struct heap_page *page = GET_HEAP_PAGE(obj);
5840 bits_t *bits = &page->remembered_bits[0];
5842 if (MARKED_IN_BITMAP(bits, obj)) {
5846 page->flags.has_remembered_objects = TRUE;
5847 MARK_IN_BITMAP(bits, obj);
5858 gc_report(6,
objspace,
"rgengc_remember: %s %s\n", rb_obj_info(obj),
5859 RVALUE_REMEMBERED(
objspace, obj) ?
"was already remembered" :
"is remembered now");
5861 check_rvalue_consistency(
objspace, obj);
5863 if (RGENGC_CHECK_MODE) {
5864 if (RVALUE_WB_UNPROTECTED(
objspace, obj)) rb_bug(
"rgengc_remember: %s is not wb protected.", rb_obj_info(obj));
5867#if RGENGC_PROFILE > 0
5868 if (!RVALUE_REMEMBERED(
objspace, obj)) {
5869 if (RVALUE_WB_UNPROTECTED(
objspace, obj) == 0) {
5870 objspace->profile.total_remembered_normal_object_count++;
5871#if RGENGC_PROFILE >= 2
5878 return rgengc_remembersetbits_set(
objspace, obj);
5881#ifndef PROFILE_REMEMBERSET_MARK
5882#define PROFILE_REMEMBERSET_MARK 0
5892 gc_report(2,
objspace,
"rgengc_rememberset_mark: mark %s\n", rb_obj_info(obj));
5893 GC_ASSERT(RVALUE_UNCOLLECTIBLE(
objspace, obj));
5894 GC_ASSERT(RVALUE_OLD_P(
objspace, obj) || RVALUE_WB_UNPROTECTED(
objspace, obj));
5898 p += BASE_SLOT_SIZE;
5909#if PROFILE_REMEMBERSET_MARK
5910 int has_old = 0, has_shady = 0, has_both = 0, skip = 0;
5912 gc_report(1,
objspace,
"rgengc_rememberset_mark: start\n");
5914 ccan_list_for_each(&heap->pages, page, page_node) {
5915 if (page->flags.has_remembered_objects | page->flags.has_uncollectible_wb_unprotected_objects) {
5916 uintptr_t p = page->start;
5917 bits_t bitset, bits[HEAP_PAGE_BITMAP_LIMIT];
5918 bits_t *remembered_bits = page->remembered_bits;
5919 bits_t *uncollectible_bits = page->uncollectible_bits;
5920 bits_t *wb_unprotected_bits = page->wb_unprotected_bits;
5921#if PROFILE_REMEMBERSET_MARK
5922 if (page->flags.has_remembered_objects && page->flags.has_uncollectible_wb_unprotected_objects) has_both++;
5923 else if (page->flags.has_remembered_objects) has_old++;
5924 else if (page->flags.has_uncollectible_wb_unprotected_objects) has_shady++;
5926 for (j=0; j<HEAP_PAGE_BITMAP_LIMIT; j++) {
5927 bits[j] = remembered_bits[j] | (uncollectible_bits[j] & wb_unprotected_bits[j]);
5928 remembered_bits[j] = 0;
5930 page->flags.has_remembered_objects = FALSE;
5933 bitset >>= NUM_IN_PAGE(p);
5934 rgengc_rememberset_mark_plane(
objspace, p, bitset);
5935 p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
5937 for (j=1; j < HEAP_PAGE_BITMAP_LIMIT; j++) {
5939 rgengc_rememberset_mark_plane(
objspace, p, bitset);
5940 p += BITS_BITLENGTH * BASE_SLOT_SIZE;
5943#if PROFILE_REMEMBERSET_MARK
5950#if PROFILE_REMEMBERSET_MARK
5951 fprintf(stderr,
"%d\t%d\t%d\t%d\n", has_both, has_old, has_shady, skip);
5953 gc_report(1,
objspace,
"rgengc_rememberset_mark: finished\n");
5961 ccan_list_for_each(&heap->pages, page, page_node) {
5962 memset(&page->mark_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
5963 memset(&page->uncollectible_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
5964 memset(&page->marking_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
5965 memset(&page->remembered_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
5966 memset(&page->pinned_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
5967 page->flags.has_uncollectible_wb_unprotected_objects = FALSE;
5968 page->flags.has_remembered_objects = FALSE;
5979 if (RGENGC_CHECK_MODE) {
5980 if (!RVALUE_OLD_P(
objspace, a)) rb_bug(
"gc_writebarrier_generational: %s is not an old object.", rb_obj_info(a));
5981 if ( RVALUE_OLD_P(
objspace, b)) rb_bug(
"gc_writebarrier_generational: %s is an old object.", rb_obj_info(b));
5982 if (is_incremental_marking(
objspace)) rb_bug(
"gc_writebarrier_generational: called while incremental marking: %s -> %s", rb_obj_info(a), rb_obj_info(b));
5986 if (!RVALUE_REMEMBERED(
objspace, a)) {
5987 int lev = RB_GC_VM_LOCK_NO_BARRIER();
5991 RB_GC_VM_UNLOCK_NO_BARRIER(lev);
5993 gc_report(1,
objspace,
"gc_writebarrier_generational: %s (remembered) -> %s\n", rb_obj_info(a), rb_obj_info(b));
5996 check_rvalue_consistency(
objspace, a);
5997 check_rvalue_consistency(
objspace, b);
6003 gc_mark_set_parent(
objspace, parent);
6004 rgengc_check_relation(
objspace, obj);
6005 if (gc_mark_set(
objspace, obj) != FALSE) {
6009 gc_mark_set_parent_invalid(
objspace);
6017 gc_report(2,
objspace,
"gc_writebarrier_incremental: [LG] %p -> %s\n", (
void *)a, rb_obj_info(b));
6021 if (!RVALUE_WB_UNPROTECTED(
objspace, a)) {
6022 gc_report(2,
objspace,
"gc_writebarrier_incremental: [IN] %p -> %s\n", (
void *)a, rb_obj_info(b));
6030 if (RB_UNLIKELY(
objspace->flags.during_compacting)) {
6031 MARK_IN_BITMAP(GET_HEAP_PINNED_BITS(b), b);
6037rb_gc_impl_writebarrier(
void *objspace_ptr,
VALUE a,
VALUE b)
6041 if (RGENGC_CHECK_MODE) {
6042 if (
SPECIAL_CONST_P(a)) rb_bug(
"rb_gc_writebarrier: a is special const: %"PRIxVALUE, a);
6047 GC_ASSERT(!during_gc);
6056 if (!is_incremental_marking(
objspace)) {
6061 gc_writebarrier_generational(a, b,
objspace);
6067 int lev = RB_GC_VM_LOCK_NO_BARRIER();
6069 if (is_incremental_marking(
objspace)) {
6070 gc_writebarrier_incremental(a, b,
objspace);
6076 RB_GC_VM_UNLOCK_NO_BARRIER(lev);
6078 if (retry)
goto retry;
6084rb_gc_impl_writebarrier_unprotect(
void *objspace_ptr,
VALUE obj)
6088 if (RVALUE_WB_UNPROTECTED(
objspace, obj)) {
6092 gc_report(2,
objspace,
"rb_gc_writebarrier_unprotect: %s %s\n", rb_obj_info(obj),
6093 RVALUE_REMEMBERED(
objspace, obj) ?
" (already remembered)" :
"");
6095 unsigned int lev = RB_GC_VM_LOCK_NO_BARRIER();
6098 gc_report(1,
objspace,
"rb_gc_writebarrier_unprotect: %s\n", rb_obj_info(obj));
6101 gc_remember_unprotected(
objspace, obj);
6104 objspace->profile.total_shade_operation_count++;
6105#if RGENGC_PROFILE >= 2
6111 RVALUE_AGE_RESET(obj);
6114 RB_DEBUG_COUNTER_INC(obj_wb_unprotect);
6115 MARK_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), obj);
6117 RB_GC_VM_UNLOCK_NO_BARRIER(lev);
6122rb_gc_impl_copy_attributes(
void *objspace_ptr,
VALUE dest,
VALUE obj)
6126 if (RVALUE_WB_UNPROTECTED(
objspace, obj)) {
6127 rb_gc_impl_writebarrier_unprotect(
objspace, dest);
6129 rb_gc_impl_copy_finalizer(
objspace, dest, obj);
6133rb_gc_impl_active_gc_name(
void)
6139rb_gc_impl_writebarrier_remember(
void *objspace_ptr,
VALUE obj)
6143 gc_report(1,
objspace,
"rb_gc_writebarrier_remember: %s\n", rb_obj_info(obj));
6146 int lev = RB_GC_VM_LOCK_NO_BARRIER();
6148 if (is_incremental_marking(
objspace)) {
6149 if (RVALUE_BLACK_P(
objspace, obj)) {
6153 else if (RVALUE_OLD_P(
objspace, obj)) {
6157 RB_GC_VM_UNLOCK_NO_BARRIER(lev);
6163 ID ID_wb_protected, ID_age, ID_old, ID_uncollectible, ID_marking,
6164 ID_marked, ID_pinned, ID_object_id, ID_shareable;
6167#define RB_GC_OBJECT_METADATA_ENTRY_COUNT (sizeof(struct rb_gc_object_metadata_names) / sizeof(ID))
6171rb_gc_impl_object_metadata(
void *objspace_ptr,
VALUE obj)
6177 if (!names.ID_marked) {
6178#define I(s) names.ID_##s = rb_intern(#s)
6191#define SET_ENTRY(na, v) do { \
6192 GC_ASSERT(n <= RB_GC_OBJECT_METADATA_ENTRY_COUNT); \
6193 object_metadata_entries[n].name = names.ID_##na; \
6194 object_metadata_entries[n].val = v; \
6198 if (!RVALUE_WB_UNPROTECTED(
objspace, obj)) SET_ENTRY(wb_protected,
Qtrue);
6199 SET_ENTRY(age,
INT2FIX(RVALUE_AGE_GET(obj)));
6201 if (RVALUE_UNCOLLECTIBLE(
objspace, obj)) SET_ENTRY(uncollectible,
Qtrue);
6202 if (RVALUE_MARKING(
objspace, obj)) SET_ENTRY(marking,
Qtrue);
6205 if (rb_obj_id_p(obj)) SET_ENTRY(object_id, rb_obj_id(obj));
6208 object_metadata_entries[n].name = 0;
6209 object_metadata_entries[n].val = 0;
6212 return object_metadata_entries;
6216rb_gc_impl_ractor_cache_alloc(
void *objspace_ptr,
void *ractor)
6220 objspace->live_ractor_cache_count++;
6226rb_gc_impl_ractor_cache_free(
void *objspace_ptr,
void *cache)
6230 objspace->live_ractor_cache_count--;
6231 gc_ractor_newobj_cache_clear(cache, NULL);
6238 if (!heap->free_pages) {
6239 if (!heap_page_allocate_and_initialize(
objspace, heap)) {
6240 objspace->heap_pages.allocatable_slots = 1;
6241 heap_page_allocate_and_initialize(
objspace, heap);
6249 if (dont_gc_val() || during_gc) {
6250 for (
int i = 0; i < HEAP_COUNT; i++) {
6267 size_t old_limit = malloc_limit;
6269 if (inc > malloc_limit) {
6270 malloc_limit = (size_t)(inc * gc_params.malloc_limit_growth_factor);
6271 if (malloc_limit > gc_params.malloc_limit_max) {
6272 malloc_limit = gc_params.malloc_limit_max;
6276 malloc_limit = (size_t)(malloc_limit * 0.98);
6277 if (malloc_limit < gc_params.malloc_limit_min) {
6278 malloc_limit = gc_params.malloc_limit_min;
6283 if (old_limit != malloc_limit) {
6284 fprintf(stderr,
"[%"PRIuSIZE
"] malloc_limit: %"PRIuSIZE
" -> %"PRIuSIZE
"\n",
6285 rb_gc_count(), old_limit, malloc_limit);
6288 fprintf(stderr,
"[%"PRIuSIZE
"] malloc_limit: not changed (%"PRIuSIZE
")\n",
6289 rb_gc_count(), malloc_limit);
6295#if RGENGC_ESTIMATE_OLDMALLOC
6297 if (
objspace->rgengc.oldmalloc_increase >
objspace->rgengc.oldmalloc_increase_limit) {
6298 gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_OLDMALLOC;
6299 objspace->rgengc.oldmalloc_increase_limit =
6300 (size_t)(
objspace->rgengc.oldmalloc_increase_limit * gc_params.oldmalloc_limit_growth_factor);
6302 if (
objspace->rgengc.oldmalloc_increase_limit > gc_params.oldmalloc_limit_max) {
6303 objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_max;
6307 if (0) fprintf(stderr,
"%"PRIdSIZE
"\t%d\t%"PRIuSIZE
"\t%"PRIuSIZE
"\t%"PRIdSIZE
"\n",
6309 gc_needs_major_flags,
6310 objspace->rgengc.oldmalloc_increase,
6311 objspace->rgengc.oldmalloc_increase_limit,
6312 gc_params.oldmalloc_limit_max);
6316 objspace->rgengc.oldmalloc_increase = 0;
6318 if ((
objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_BY_OLDMALLOC) == 0) {
6319 objspace->rgengc.oldmalloc_increase_limit =
6320 (size_t)(
objspace->rgengc.oldmalloc_increase_limit / ((gc_params.oldmalloc_limit_growth_factor - 1)/10 + 1));
6321 if (
objspace->rgengc.oldmalloc_increase_limit < gc_params.oldmalloc_limit_min) {
6322 objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_min;
6334 int lev = RB_GC_VM_LOCK();
6336#if GC_PROFILE_MORE_DETAIL
6337 objspace->profile.prepare_time = getrusage_time();
6342#if GC_PROFILE_MORE_DETAIL
6343 objspace->profile.prepare_time = getrusage_time() -
objspace->profile.prepare_time;
6348 RB_GC_VM_UNLOCK(lev);
6356 unsigned int do_full_mark = !!(reason & GPR_FLAG_FULL_MARK);
6358 if (!rb_darray_size(
objspace->heap_pages.sorted))
return TRUE;
6359 if (!(reason & GPR_FLAG_METHOD) && !ready_to_gc(
objspace))
return TRUE;
6361 GC_ASSERT(gc_mode(
objspace) == gc_mode_none,
"gc_mode is %s\n", gc_mode_name(gc_mode(
objspace)));
6362 GC_ASSERT(!is_lazy_sweeping(
objspace));
6363 GC_ASSERT(!is_incremental_marking(
objspace));
6365 unsigned int lock_lev;
6366 gc_enter(
objspace, gc_enter_event_start, &lock_lev);
6369 objspace->flags.immediate_sweep = !!(reason & GPR_FLAG_IMMEDIATE_SWEEP);
6371#if RGENGC_CHECK_MODE >= 2
6372 gc_verify_internal_consistency(
objspace);
6375 if (ruby_gc_stressful) {
6376 int flag =
FIXNUM_P(ruby_gc_stress_mode) ?
FIX2INT(ruby_gc_stress_mode) : 0;
6378 if ((flag & (1 << gc_stress_no_major)) == 0) {
6379 do_full_mark = TRUE;
6382 objspace->flags.immediate_sweep = !(flag & (1<<gc_stress_no_immediate_sweep));
6385 if (gc_needs_major_flags) {
6386 reason |= gc_needs_major_flags;
6387 do_full_mark = TRUE;
6391 if (!gc_config_full_mark_val) {
6392 do_full_mark = FALSE;
6394 gc_needs_major_flags = GPR_FLAG_NONE;
6396 if (do_full_mark && (reason & GPR_FLAG_MAJOR_MASK) == 0) {
6397 reason |= GPR_FLAG_MAJOR_BY_FORCE;
6400 if (
objspace->flags.dont_incremental ||
6401 reason & GPR_FLAG_IMMEDIATE_MARK ||
6402 ruby_gc_stressful) {
6403 objspace->flags.during_incremental_marking = FALSE;
6406 objspace->flags.during_incremental_marking = do_full_mark;
6410 if (do_full_mark && ruby_enable_autocompact) {
6411 objspace->flags.during_compacting = TRUE;
6412#if RGENGC_CHECK_MODE
6413 objspace->rcompactor.compare_func = ruby_autocompact_compare_func;
6417 objspace->flags.during_compacting = !!(reason & GPR_FLAG_COMPACT);
6420 if (!GC_ENABLE_LAZY_SWEEP ||
objspace->flags.dont_incremental) {
6421 objspace->flags.immediate_sweep = TRUE;
6424 if (
objspace->flags.immediate_sweep) reason |= GPR_FLAG_IMMEDIATE_SWEEP;
6426 gc_report(1,
objspace,
"gc_start(reason: %x) => %u, %d, %d\n",
6428 do_full_mark, !is_incremental_marking(
objspace),
objspace->flags.immediate_sweep);
6430 RB_DEBUG_COUNTER_INC(gc_count);
6432 if (reason & GPR_FLAG_MAJOR_MASK) {
6433 (void)RB_DEBUG_COUNTER_INC_IF(gc_major_nofree, reason & GPR_FLAG_MAJOR_BY_NOFREE);
6434 (void)RB_DEBUG_COUNTER_INC_IF(gc_major_oldgen, reason & GPR_FLAG_MAJOR_BY_OLDGEN);
6435 (void)RB_DEBUG_COUNTER_INC_IF(gc_major_shady, reason & GPR_FLAG_MAJOR_BY_SHADY);
6436 (void)RB_DEBUG_COUNTER_INC_IF(gc_major_force, reason & GPR_FLAG_MAJOR_BY_FORCE);
6437#if RGENGC_ESTIMATE_OLDMALLOC
6438 (void)RB_DEBUG_COUNTER_INC_IF(gc_major_oldmalloc, reason & GPR_FLAG_MAJOR_BY_OLDMALLOC);
6442 (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_newobj, reason & GPR_FLAG_NEWOBJ);
6443 (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_malloc, reason & GPR_FLAG_MALLOC);
6444 (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_method, reason & GPR_FLAG_METHOD);
6445 (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_capi, reason & GPR_FLAG_CAPI);
6446 (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_stress, reason & GPR_FLAG_STRESS);
6450 objspace->profile.latest_gc_info = reason;
6451 objspace->profile.total_allocated_objects_at_gc_start = total_allocated_objects(
objspace);
6452 objspace->profile.heap_used_at_gc_start = rb_darray_size(
objspace->heap_pages.sorted);
6453 objspace->profile.weak_references_count = 0;
6454 objspace->profile.retained_weak_references_count = 0;
6455 gc_prof_setup_new_record(
objspace, reason);
6456 gc_reset_malloc_info(
objspace, do_full_mark);
6460 GC_ASSERT(during_gc);
6464 if (gc_marks(
objspace, do_full_mark)) {
6470 gc_exit(
objspace, gc_enter_event_start, &lock_lev);
6478 unsigned int lock_lev;
6479 gc_enter(
objspace, gc_enter_event_rest, &lock_lev);
6481 if (RGENGC_CHECK_MODE >= 2) gc_verify_internal_consistency(
objspace);
6483 if (is_incremental_marking(
objspace)) {
6497 gc_exit(
objspace, gc_enter_event_rest, &lock_lev);
6503 unsigned int reason;
6512 if (is_full_marking(
objspace)) buff[i++] =
'F';
6513 if (is_incremental_marking(
objspace)) buff[i++] =
'I';
6517 if (is_lazy_sweeping(
objspace)) buff[i++] =
'L';
6528 static char buff[0x10];
6529 gc_current_status_fill(
objspace, buff);
6533#if PRINT_ENTER_EXIT_TICK
6535static tick_t last_exit_tick;
6536static tick_t enter_tick;
6537static int enter_count = 0;
6538static char last_gc_status[0x10];
6543 if (direction == 0) {
6545 enter_tick = tick();
6546 gc_current_status_fill(
objspace, last_gc_status);
6549 tick_t exit_tick = tick();
6550 char current_gc_status[0x10];
6551 gc_current_status_fill(
objspace, current_gc_status);
6554 fprintf(stderr,
"%"PRItick
"\t%"PRItick
"\t%s\t[%s->%s|%c]\n",
6555 enter_tick - last_exit_tick,
6556 exit_tick - enter_tick,
6558 last_gc_status, current_gc_status,
6559 (
objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_MASK) ?
'+' :
'-');
6560 last_exit_tick = exit_tick;
6563 fprintf(stderr,
"%"PRItick
"\t%"PRItick
"\t%s\t[%s->%s|%c]\n",
6565 exit_tick - enter_tick,
6567 last_gc_status, current_gc_status,
6568 (
objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_MASK) ?
'+' :
'-');
6581gc_enter_event_cstr(
enum gc_enter_event event)
6584 case gc_enter_event_start:
return "start";
6585 case gc_enter_event_continue:
return "continue";
6586 case gc_enter_event_rest:
return "rest";
6587 case gc_enter_event_finalizer:
return "finalizer";
6593gc_enter_count(
enum gc_enter_event event)
6596 case gc_enter_event_start: RB_DEBUG_COUNTER_INC(gc_enter_start);
break;
6597 case gc_enter_event_continue: RB_DEBUG_COUNTER_INC(gc_enter_continue);
break;
6598 case gc_enter_event_rest: RB_DEBUG_COUNTER_INC(gc_enter_rest);
break;
6599 case gc_enter_event_finalizer: RB_DEBUG_COUNTER_INC(gc_enter_finalizer);
break;
6603static bool current_process_time(
struct timespec *ts);
6608 if (!current_process_time(ts)) {
6614static unsigned long long
6619 if ((ts->tv_sec > 0 || ts->tv_nsec > 0) &&
6620 current_process_time(&end_time) &&
6621 end_time.tv_sec >= ts->tv_sec) {
6622 return (
unsigned long long)(end_time.tv_sec - ts->tv_sec) * (1000 * 1000 * 1000) +
6623 (end_time.tv_nsec - ts->tv_nsec);
6632 *lock_lev = RB_GC_VM_LOCK();
6635 case gc_enter_event_rest:
6638 case gc_enter_event_start:
6639 case gc_enter_event_continue:
6647 gc_enter_count(event);
6648 if (RB_UNLIKELY(during_gc != 0)) rb_bug(
"during_gc != 0");
6649 if (RGENGC_CHECK_MODE >= 3) gc_verify_internal_consistency(
objspace);
6652 RUBY_DEBUG_LOG(
"%s (%s)",gc_enter_event_cstr(event), gc_current_status(
objspace));
6653 gc_report(1,
objspace,
"gc_enter: %s [%s]\n", gc_enter_event_cstr(event), gc_current_status(
objspace));
6654 gc_record(
objspace, 0, gc_enter_event_cstr(event));
6662 GC_ASSERT(during_gc != 0);
6666 gc_record(
objspace, 1, gc_enter_event_cstr(event));
6667 RUBY_DEBUG_LOG(
"%s (%s)", gc_enter_event_cstr(event), gc_current_status(
objspace));
6668 gc_report(1,
objspace,
"gc_exit: %s [%s]\n", gc_enter_event_cstr(event), gc_current_status(
objspace));
6671 RB_GC_VM_UNLOCK(*lock_lev);
6675#define MEASURE_GC (objspace->flags.measure_gc)
6681 GC_ASSERT(during_gc != 0);
6684 gc_clock_start(&
objspace->profile.marking_start_time);
6691 GC_ASSERT(during_gc != 0);
6694 objspace->profile.marking_time_ns += gc_clock_end(&
objspace->profile.marking_start_time);
6701 GC_ASSERT(during_gc != 0);
6704 gc_clock_start(&
objspace->profile.sweeping_start_time);
6711 GC_ASSERT(during_gc != 0);
6714 objspace->profile.sweeping_time_ns += gc_clock_end(&
objspace->profile.sweeping_start_time);
6719gc_with_gvl(
void *ptr)
6722 return (
void *)(
VALUE)garbage_collect(oar->objspace, oar->reason);
6725int ruby_thread_has_gvl_p(
void);
6730 if (dont_gc_val()) {
6736 else if (!ruby_thread_has_gvl_p()) {
6740 oar.reason = reason;
6746 return garbage_collect(
objspace, reason);
6751gc_set_candidate_object_i(
void *vstart,
void *vend,
size_t stride,
void *data)
6756 for (; v != (
VALUE)vend; v += stride) {
6757 asan_unpoisoning_object(v) {
6763 rb_gc_prepare_heap_process_object(v);
6765 RVALUE_AGE_SET_CANDIDATE(
objspace, v);
6775rb_gc_impl_start(
void *objspace_ptr,
bool full_mark,
bool immediate_mark,
bool immediate_sweep,
bool compact)
6778 unsigned int reason = (GPR_FLAG_FULL_MARK |
6779 GPR_FLAG_IMMEDIATE_MARK |
6780 GPR_FLAG_IMMEDIATE_SWEEP |
6783 int full_marking_p = gc_config_full_mark_val;
6784 gc_config_full_mark_set(TRUE);
6788 GC_ASSERT(GC_COMPACTION_SUPPORTED);
6790 reason |= GPR_FLAG_COMPACT;
6793 if (!full_mark) reason &= ~GPR_FLAG_FULL_MARK;
6794 if (!immediate_mark) reason &= ~GPR_FLAG_IMMEDIATE_MARK;
6795 if (!immediate_sweep) reason &= ~GPR_FLAG_IMMEDIATE_SWEEP;
6801 gc_config_full_mark_set(full_marking_p);
6805rb_gc_impl_prepare_heap(
void *objspace_ptr)
6809 size_t orig_total_slots = objspace_available_slots(
objspace);
6810 size_t orig_allocatable_slots =
objspace->heap_pages.allocatable_slots;
6812 rb_gc_impl_each_objects(
objspace, gc_set_candidate_object_i, objspace_ptr);
6814 double orig_max_free_slots = gc_params.heap_free_slots_max_ratio;
6816 gc_params.heap_free_slots_max_ratio = 0.0;
6817 rb_gc_impl_start(
objspace,
true,
true,
true,
true);
6818 gc_params.heap_free_slots_max_ratio = orig_max_free_slots;
6820 objspace->heap_pages.allocatable_slots = 0;
6821 heap_pages_freeable_pages =
objspace->empty_pages_count;
6822 heap_pages_free_unused_pages(objspace_ptr);
6823 GC_ASSERT(heap_pages_freeable_pages == 0);
6824 GC_ASSERT(
objspace->empty_pages_count == 0);
6825 objspace->heap_pages.allocatable_slots = orig_allocatable_slots;
6827 size_t total_slots = objspace_available_slots(
objspace);
6828 if (orig_total_slots > total_slots) {
6829 objspace->heap_pages.allocatable_slots += orig_total_slots - total_slots;
6832#if defined(HAVE_MALLOC_TRIM) && !defined(RUBY_ALTERNATIVE_MALLOC_HEADER)
6878 GC_ASSERT(st_is_member(finalizer_table, obj));
6882 GC_ASSERT(RVALUE_MARKED(
objspace, obj));
6883 GC_ASSERT(!RVALUE_PINNED(
objspace, obj));
6888 rb_bug(
"gc_is_moveable_obj: unreachable (%d)", (
int)
BUILTIN_TYPE(obj));
6895void rb_mv_generic_ivar(
VALUE src,
VALUE dst);
6905 gc_report(4,
objspace,
"Moving object: %p -> %p\n", (
void *)src, (
void *)dest);
6908 GC_ASSERT(!MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(dest), dest));
6910 GC_ASSERT(!RVALUE_MARKING(
objspace, src));
6913 marked = RVALUE_MARKED(
objspace, src);
6914 wb_unprotected = RVALUE_WB_UNPROTECTED(
objspace, src);
6915 uncollectible = RVALUE_UNCOLLECTIBLE(
objspace, src);
6916 bool remembered = RVALUE_REMEMBERED(
objspace, src);
6917 age = RVALUE_AGE_GET(src);
6920 CLEAR_IN_BITMAP(GET_HEAP_MARK_BITS(src), src);
6921 CLEAR_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(src), src);
6922 CLEAR_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(src), src);
6923 CLEAR_IN_BITMAP(GET_HEAP_PAGE(src)->remembered_bits, src);
6926 memcpy((
void *)dest, (
void *)src, MIN(src_slot_size, slot_size));
6928 if (RVALUE_OVERHEAD > 0) {
6929 void *dest_overhead = (
void *)(((uintptr_t)dest) + slot_size - RVALUE_OVERHEAD);
6930 void *src_overhead = (
void *)(((uintptr_t)src) + src_slot_size - RVALUE_OVERHEAD);
6932 memcpy(dest_overhead, src_overhead, RVALUE_OVERHEAD);
6935 memset((
void *)src, 0, src_slot_size);
6936 RVALUE_AGE_RESET(src);
6940 MARK_IN_BITMAP(GET_HEAP_PAGE(dest)->remembered_bits, dest);
6943 CLEAR_IN_BITMAP(GET_HEAP_PAGE(dest)->remembered_bits, dest);
6947 MARK_IN_BITMAP(GET_HEAP_MARK_BITS(dest), dest);
6950 CLEAR_IN_BITMAP(GET_HEAP_MARK_BITS(dest), dest);
6953 if (wb_unprotected) {
6954 MARK_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(dest), dest);
6957 CLEAR_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(dest), dest);
6960 if (uncollectible) {
6961 MARK_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(dest), dest);
6964 CLEAR_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(dest), dest);
6967 RVALUE_AGE_SET(dest, age);
6970 RMOVED(src)->dummy =
Qundef;
6971 RMOVED(src)->destination = dest;
6974 GET_HEAP_PAGE(src)->heap->total_freed_objects++;
6975 GET_HEAP_PAGE(dest)->heap->total_allocated_objects++;
6980#if GC_CAN_COMPILE_COMPACTION
6982compare_pinned_slots(
const void *left,
const void *right,
void *dummy)
6987 left_page = *(
struct heap_page *
const *)left;
6988 right_page = *(
struct heap_page *
const *)right;
6990 return left_page->pinned_slots - right_page->pinned_slots;
6994compare_free_slots(
const void *left,
const void *right,
void *dummy)
6999 left_page = *(
struct heap_page *
const *)left;
7000 right_page = *(
struct heap_page *
const *)right;
7002 return left_page->free_slots - right_page->free_slots;
7008 for (
int j = 0; j < HEAP_COUNT; j++) {
7011 size_t total_pages = heap->total_pages;
7013 struct heap_page *page = 0, **page_list = malloc(size);
7016 heap->free_pages = NULL;
7017 ccan_list_for_each(&heap->pages, page, page_node) {
7018 page_list[i++] = page;
7022 GC_ASSERT((
size_t)i == total_pages);
7029 ccan_list_head_init(&heap->pages);
7031 for (i = 0; i < total_pages; i++) {
7032 ccan_list_add(&heap->pages, &page_list[i]->page_node);
7033 if (page_list[i]->free_slots != 0) {
7034 heap_add_freepage(heap, page_list[i]);
7044rb_gc_impl_object_moved_p(
void *objspace_ptr,
VALUE obj)
7046 return gc_object_moved_p(objspace_ptr, obj);
7054 page->flags.has_uncollectible_wb_unprotected_objects = FALSE;
7055 page->flags.has_remembered_objects = FALSE;
7058 for (; v != (
VALUE)vend; v += stride) {
7059 asan_unpoisoning_object(v) {
7066 if (RVALUE_WB_UNPROTECTED(
objspace, v)) {
7067 page->flags.has_uncollectible_wb_unprotected_objects = TRUE;
7069 if (RVALUE_REMEMBERED(
objspace, v)) {
7070 page->flags.has_remembered_objects = TRUE;
7072 if (page->flags.before_sweep) {
7074 rb_gc_update_object_references(
objspace, v);
7078 rb_gc_update_object_references(
objspace, v);
7088gc_update_references_weak_table_i(
VALUE obj,
void *data)
7091 asan_unpoisoning_object(obj) {
7098gc_update_references_weak_table_replace_i(
VALUE *obj,
void *data)
7100 *obj = rb_gc_location(*obj);
7108 objspace->flags.during_reference_updating =
true;
7110 rb_gc_before_updating_jit_code();
7114 for (
int i = 0; i < HEAP_COUNT; i++) {
7115 bool should_set_mark_bits = TRUE;
7118 ccan_list_for_each(&heap->pages, page, page_node) {
7119 uintptr_t start = (uintptr_t)page->start;
7120 uintptr_t end = start + (page->total_slots * heap->slot_size);
7122 gc_ref_update((
void *)start, (
void *)end, heap->slot_size,
objspace, page);
7123 if (page == heap->sweeping_page) {
7124 should_set_mark_bits = FALSE;
7126 if (should_set_mark_bits) {
7127 gc_setup_mark_bits(page);
7132 gc_update_table_refs(finalizer_table);
7134 rb_gc_update_vm_references((
void *)
objspace);
7136 for (
int table = 0; table < RB_GC_VM_WEAK_TABLE_COUNT; table++) {
7137 rb_gc_vm_weak_table_foreach(
7138 gc_update_references_weak_table_i,
7139 gc_update_references_weak_table_replace_i,
7146 rb_gc_after_updating_jit_code();
7148 objspace->flags.during_reference_updating =
false;
7151#if GC_CAN_COMPILE_COMPACTION
7153root_obj_check_moved_i(
const char *category,
VALUE obj,
void *data)
7157 if (gc_object_moved_p(
objspace, obj)) {
7158 rb_bug(
"ROOT %s points to MOVED: %p -> %s", category, (
void *)obj, rb_obj_info(rb_gc_impl_location(
objspace, obj)));
7163reachable_object_check_moved_i(
VALUE ref,
void *data)
7166 if (gc_object_moved_p(rb_gc_get_objspace(), ref)) {
7167 rb_bug(
"Object %s points to MOVED: %p -> %s", rb_obj_info(parent), (
void *)ref, rb_obj_info(rb_gc_impl_location(rb_gc_get_objspace(), ref)));
7172heap_check_moved_i(
void *vstart,
void *vend,
size_t stride,
void *data)
7177 for (; v != (
VALUE)vend; v += stride) {
7178 if (gc_object_moved_p(
objspace, v)) {
7182 asan_unpoisoning_object(v) {
7188 if (!rb_gc_impl_garbage_object_p(
objspace, v)) {
7189 rb_objspace_reachable_objects_from(v, reachable_object_check_moved_i, (
void *)v);
7201rb_gc_impl_during_gc_p(
void *objspace_ptr)
7208#if RGENGC_PROFILE >= 2
7241 default:
return "unknown";
7246gc_count_add_each_types(
VALUE hash,
const char *name,
const size_t *types)
7250 for (i=0; i<
T_MASK; i++) {
7251 const char *
type = type_name(i, 0);
7254 rb_hash_aset(hash,
ID2SYM(rb_intern(name)), result);
7259rb_gc_impl_gc_count(
void *objspace_ptr)
7269 static VALUE sym_major_by =
Qnil, sym_gc_by, sym_immediate_sweep, sym_have_finalizer, sym_state, sym_need_major_by;
7270 static VALUE sym_nofree, sym_oldgen, sym_shady, sym_force, sym_stress;
7271#if RGENGC_ESTIMATE_OLDMALLOC
7272 static VALUE sym_oldmalloc;
7274 static VALUE sym_newobj, sym_malloc, sym_method, sym_capi;
7275 static VALUE sym_none, sym_marking, sym_sweeping;
7276 static VALUE sym_weak_references_count, sym_retained_weak_references_count;
7278 VALUE major_by, need_major_by;
7279 unsigned int flags = orig_flags ? orig_flags :
objspace->profile.latest_gc_info;
7288 rb_bug(
"gc_info_decode: non-hash or symbol given");
7291 if (
NIL_P(sym_major_by)) {
7292#define S(s) sym_##s = ID2SYM(rb_intern_const(#s))
7305#if RGENGC_ESTIMATE_OLDMALLOC
7317 S(weak_references_count);
7318 S(retained_weak_references_count);
7322#define SET(name, attr) \
7323 if (key == sym_##name) \
7325 else if (hash != Qnil) \
7326 rb_hash_aset(hash, sym_##name, (attr));
7329 (flags & GPR_FLAG_MAJOR_BY_NOFREE) ? sym_nofree :
7330 (flags & GPR_FLAG_MAJOR_BY_OLDGEN) ? sym_oldgen :
7331 (flags & GPR_FLAG_MAJOR_BY_SHADY) ? sym_shady :
7332 (flags & GPR_FLAG_MAJOR_BY_FORCE) ? sym_force :
7333#if RGENGC_ESTIMATE_OLDMALLOC
7334 (flags & GPR_FLAG_MAJOR_BY_OLDMALLOC) ? sym_oldmalloc :
7337 SET(major_by, major_by);
7339 if (orig_flags == 0) {
7340 unsigned int need_major_flags = gc_needs_major_flags;
7342 (need_major_flags & GPR_FLAG_MAJOR_BY_NOFREE) ? sym_nofree :
7343 (need_major_flags & GPR_FLAG_MAJOR_BY_OLDGEN) ? sym_oldgen :
7344 (need_major_flags & GPR_FLAG_MAJOR_BY_SHADY) ? sym_shady :
7345 (need_major_flags & GPR_FLAG_MAJOR_BY_FORCE) ? sym_force :
7346#if RGENGC_ESTIMATE_OLDMALLOC
7347 (need_major_flags & GPR_FLAG_MAJOR_BY_OLDMALLOC) ? sym_oldmalloc :
7350 SET(need_major_by, need_major_by);
7354 (flags & GPR_FLAG_NEWOBJ) ? sym_newobj :
7355 (flags & GPR_FLAG_MALLOC) ? sym_malloc :
7356 (flags & GPR_FLAG_METHOD) ? sym_method :
7357 (flags & GPR_FLAG_CAPI) ? sym_capi :
7358 (flags & GPR_FLAG_STRESS) ? sym_stress :
7362 SET(have_finalizer, (flags & GPR_FLAG_HAVE_FINALIZE) ?
Qtrue :
Qfalse);
7363 SET(immediate_sweep, (flags & GPR_FLAG_IMMEDIATE_SWEEP) ?
Qtrue :
Qfalse);
7365 if (orig_flags == 0) {
7366 SET(state, gc_mode(
objspace) == gc_mode_none ? sym_none :
7367 gc_mode(
objspace) == gc_mode_marking ? sym_marking : sym_sweeping);
7370 SET(weak_references_count,
LONG2FIX(
objspace->profile.weak_references_count));
7371 SET(retained_weak_references_count,
LONG2FIX(
objspace->profile.retained_weak_references_count));
7383rb_gc_impl_latest_gc_info(
void *objspace_ptr,
VALUE key)
7387 return gc_info_decode(
objspace, key, 0);
7394 gc_stat_sym_marking_time,
7395 gc_stat_sym_sweeping_time,
7396 gc_stat_sym_heap_allocated_pages,
7397 gc_stat_sym_heap_empty_pages,
7398 gc_stat_sym_heap_allocatable_slots,
7399 gc_stat_sym_heap_available_slots,
7400 gc_stat_sym_heap_live_slots,
7401 gc_stat_sym_heap_free_slots,
7402 gc_stat_sym_heap_final_slots,
7403 gc_stat_sym_heap_marked_slots,
7404 gc_stat_sym_heap_eden_pages,
7405 gc_stat_sym_total_allocated_pages,
7406 gc_stat_sym_total_freed_pages,
7407 gc_stat_sym_total_allocated_objects,
7408 gc_stat_sym_total_freed_objects,
7409 gc_stat_sym_malloc_increase_bytes,
7410 gc_stat_sym_malloc_increase_bytes_limit,
7411 gc_stat_sym_minor_gc_count,
7412 gc_stat_sym_major_gc_count,
7413 gc_stat_sym_compact_count,
7414 gc_stat_sym_read_barrier_faults,
7415 gc_stat_sym_total_moved_objects,
7416 gc_stat_sym_remembered_wb_unprotected_objects,
7417 gc_stat_sym_remembered_wb_unprotected_objects_limit,
7418 gc_stat_sym_old_objects,
7419 gc_stat_sym_old_objects_limit,
7420#if RGENGC_ESTIMATE_OLDMALLOC
7421 gc_stat_sym_oldmalloc_increase_bytes,
7422 gc_stat_sym_oldmalloc_increase_bytes_limit,
7424 gc_stat_sym_weak_references_count,
7426 gc_stat_sym_total_generated_normal_object_count,
7427 gc_stat_sym_total_generated_shady_object_count,
7428 gc_stat_sym_total_shade_operation_count,
7429 gc_stat_sym_total_promoted_count,
7430 gc_stat_sym_total_remembered_normal_object_count,
7431 gc_stat_sym_total_remembered_shady_object_count,
7436static VALUE gc_stat_symbols[gc_stat_sym_last];
7439setup_gc_stat_symbols(
void)
7441 if (gc_stat_symbols[0] == 0) {
7442#define S(s) gc_stat_symbols[gc_stat_sym_##s] = ID2SYM(rb_intern_const(#s))
7447 S(heap_allocated_pages);
7448 S(heap_empty_pages);
7449 S(heap_allocatable_slots);
7450 S(heap_available_slots);
7453 S(heap_final_slots);
7454 S(heap_marked_slots);
7456 S(total_allocated_pages);
7457 S(total_freed_pages);
7458 S(total_allocated_objects);
7459 S(total_freed_objects);
7460 S(malloc_increase_bytes);
7461 S(malloc_increase_bytes_limit);
7465 S(read_barrier_faults);
7466 S(total_moved_objects);
7467 S(remembered_wb_unprotected_objects);
7468 S(remembered_wb_unprotected_objects_limit);
7470 S(old_objects_limit);
7471#if RGENGC_ESTIMATE_OLDMALLOC
7472 S(oldmalloc_increase_bytes);
7473 S(oldmalloc_increase_bytes_limit);
7475 S(weak_references_count);
7477 S(total_generated_normal_object_count);
7478 S(total_generated_shady_object_count);
7479 S(total_shade_operation_count);
7480 S(total_promoted_count);
7481 S(total_remembered_normal_object_count);
7482 S(total_remembered_shady_object_count);
7489ns_to_ms(uint64_t ns)
7491 return ns / (1000 * 1000);
7495rb_gc_impl_stat(
void *objspace_ptr,
VALUE hash_or_sym)
7500 setup_gc_stat_symbols();
7509 rb_bug(
"non-hash or symbol given");
7512#define SET(name, attr) \
7513 if (key == gc_stat_symbols[gc_stat_sym_##name]) \
7514 return SIZET2NUM(attr); \
7515 else if (hash != Qnil) \
7516 rb_hash_aset(hash, gc_stat_symbols[gc_stat_sym_##name], SIZET2NUM(attr));
7518 SET(count,
objspace->profile.count);
7519 SET(time, (
size_t)ns_to_ms(
objspace->profile.marking_time_ns +
objspace->profile.sweeping_time_ns));
7520 SET(marking_time, (
size_t)ns_to_ms(
objspace->profile.marking_time_ns));
7521 SET(sweeping_time, (
size_t)ns_to_ms(
objspace->profile.sweeping_time_ns));
7524 SET(heap_allocated_pages, rb_darray_size(
objspace->heap_pages.sorted));
7525 SET(heap_empty_pages,
objspace->empty_pages_count)
7526 SET(heap_allocatable_slots,
objspace->heap_pages.allocatable_slots);
7527 SET(heap_available_slots, objspace_available_slots(
objspace));
7528 SET(heap_live_slots, objspace_live_slots(
objspace));
7529 SET(heap_free_slots, objspace_free_slots(
objspace));
7530 SET(heap_final_slots, total_final_slots_count(
objspace));
7531 SET(heap_marked_slots,
objspace->marked_slots);
7532 SET(heap_eden_pages, heap_eden_total_pages(
objspace));
7533 SET(total_allocated_pages,
objspace->heap_pages.allocated_pages);
7534 SET(total_freed_pages,
objspace->heap_pages.freed_pages);
7535 SET(total_allocated_objects, total_allocated_objects(
objspace));
7536 SET(total_freed_objects, total_freed_objects(
objspace));
7537 SET(malloc_increase_bytes, malloc_increase);
7538 SET(malloc_increase_bytes_limit, malloc_limit);
7539 SET(minor_gc_count,
objspace->profile.minor_gc_count);
7540 SET(major_gc_count,
objspace->profile.major_gc_count);
7541 SET(compact_count,
objspace->profile.compact_count);
7542 SET(read_barrier_faults,
objspace->profile.read_barrier_faults);
7543 SET(total_moved_objects,
objspace->rcompactor.total_moved);
7544 SET(remembered_wb_unprotected_objects,
objspace->rgengc.uncollectible_wb_unprotected_objects);
7545 SET(remembered_wb_unprotected_objects_limit,
objspace->rgengc.uncollectible_wb_unprotected_objects_limit);
7546 SET(old_objects,
objspace->rgengc.old_objects);
7547 SET(old_objects_limit,
objspace->rgengc.old_objects_limit);
7548#if RGENGC_ESTIMATE_OLDMALLOC
7549 SET(oldmalloc_increase_bytes,
objspace->rgengc.oldmalloc_increase);
7550 SET(oldmalloc_increase_bytes_limit,
objspace->rgengc.oldmalloc_increase_limit);
7554 SET(total_generated_normal_object_count,
objspace->profile.total_generated_normal_object_count);
7555 SET(total_generated_shady_object_count,
objspace->profile.total_generated_shady_object_count);
7556 SET(total_shade_operation_count,
objspace->profile.total_shade_operation_count);
7557 SET(total_promoted_count,
objspace->profile.total_promoted_count);
7558 SET(total_remembered_normal_object_count,
objspace->profile.total_remembered_normal_object_count);
7559 SET(total_remembered_shady_object_count,
objspace->profile.total_remembered_shady_object_count);
7568#if defined(RGENGC_PROFILE) && RGENGC_PROFILE >= 2
7570 gc_count_add_each_types(hash,
"generated_normal_object_count_types",
objspace->profile.generated_normal_object_count_types);
7571 gc_count_add_each_types(hash,
"generated_shady_object_count_types",
objspace->profile.generated_shady_object_count_types);
7572 gc_count_add_each_types(hash,
"shade_operation_count_types",
objspace->profile.shade_operation_count_types);
7573 gc_count_add_each_types(hash,
"promoted_types",
objspace->profile.promoted_types);
7574 gc_count_add_each_types(hash,
"remembered_normal_object_count_types",
objspace->profile.remembered_normal_object_count_types);
7575 gc_count_add_each_types(hash,
"remembered_shady_object_count_types",
objspace->profile.remembered_shady_object_count_types);
7582enum gc_stat_heap_sym {
7583 gc_stat_heap_sym_slot_size,
7584 gc_stat_heap_sym_heap_eden_pages,
7585 gc_stat_heap_sym_heap_eden_slots,
7586 gc_stat_heap_sym_total_allocated_pages,
7587 gc_stat_heap_sym_force_major_gc_count,
7588 gc_stat_heap_sym_force_incremental_marking_finish_count,
7589 gc_stat_heap_sym_total_allocated_objects,
7590 gc_stat_heap_sym_total_freed_objects,
7591 gc_stat_heap_sym_last
7594static VALUE gc_stat_heap_symbols[gc_stat_heap_sym_last];
7597setup_gc_stat_heap_symbols(
void)
7599 if (gc_stat_heap_symbols[0] == 0) {
7600#define S(s) gc_stat_heap_symbols[gc_stat_heap_sym_##s] = ID2SYM(rb_intern_const(#s))
7604 S(total_allocated_pages);
7605 S(force_major_gc_count);
7606 S(force_incremental_marking_finish_count);
7607 S(total_allocated_objects);
7608 S(total_freed_objects);
7616#define SET(name, attr) \
7617 if (key == gc_stat_heap_symbols[gc_stat_heap_sym_##name]) \
7618 return SIZET2NUM(attr); \
7619 else if (hash != Qnil) \
7620 rb_hash_aset(hash, gc_stat_heap_symbols[gc_stat_heap_sym_##name], SIZET2NUM(attr));
7622 SET(slot_size, heap->slot_size);
7623 SET(heap_eden_pages, heap->total_pages);
7624 SET(heap_eden_slots, heap->total_slots);
7625 SET(total_allocated_pages, heap->total_allocated_pages);
7626 SET(force_major_gc_count, heap->force_major_gc_count);
7627 SET(force_incremental_marking_finish_count, heap->force_incremental_marking_finish_count);
7628 SET(total_allocated_objects, heap->total_allocated_objects);
7629 SET(total_freed_objects, heap->total_freed_objects);
7641rb_gc_impl_stat_heap(
void *objspace_ptr,
VALUE heap_name,
VALUE hash_or_sym)
7645 setup_gc_stat_heap_symbols();
7647 if (
NIL_P(heap_name)) {
7649 rb_bug(
"non-hash given");
7652 for (
int i = 0; i < HEAP_COUNT; i++) {
7655 hash = rb_hash_new();
7656 rb_hash_aset(hash_or_sym,
INT2FIX(i), hash);
7659 stat_one_heap(&heaps[i], hash,
Qnil);
7663 int heap_idx =
FIX2INT(heap_name);
7665 if (heap_idx < 0 || heap_idx >= HEAP_COUNT) {
7666 rb_raise(rb_eArgError,
"size pool index out of range");
7670 return stat_one_heap(&heaps[heap_idx],
Qnil, hash_or_sym);
7673 return stat_one_heap(&heaps[heap_idx], hash_or_sym,
Qnil);
7676 rb_bug(
"non-hash or symbol given");
7680 rb_bug(
"heap_name must be nil or an Integer");
7692#define RBOOL(v) (v ? Qtrue : Qfalse)
7696rb_gc_impl_config_get(
void *objspace_ptr)
7698#define sym(name) ID2SYM(rb_intern_const(name))
7700 VALUE hash = rb_hash_new();
7702 rb_hash_aset(hash, sym(
"rgengc_allow_full_mark"), RBOOL(gc_config_full_mark_val));
7711 if (
rb_sym2id(key) == rb_intern(
"rgengc_allow_full_mark")) {
7713 gc_config_full_mark_set(
RTEST(value));
7719rb_gc_impl_config_set(
void *objspace_ptr,
VALUE hash)
7724 rb_raise(rb_eArgError,
"expected keyword arguments");
7731rb_gc_impl_stress_get(
void *objspace_ptr)
7734 return ruby_gc_stress_mode;
7738rb_gc_impl_stress_set(
void *objspace_ptr,
VALUE flag)
7747get_envparam_size(
const char *name,
size_t *default_value,
size_t lower_bound)
7749 const char *ptr = getenv(name);
7752 if (ptr != NULL && *ptr) {
7755#if SIZEOF_SIZE_T == SIZEOF_LONG_LONG
7756 val = strtoll(ptr, &end, 0);
7758 val = strtol(ptr, &end, 0);
7770 unit = 1024*1024*1024;
7774 while (*end && isspace((
unsigned char)*end)) end++;
7776 if (
RTEST(
ruby_verbose)) fprintf(stderr,
"invalid string for %s: %s\n", name, ptr);
7780 if (val < -(ssize_t)(SIZE_MAX / 2 / unit) || (ssize_t)(SIZE_MAX / 2 / unit) < val) {
7781 if (
RTEST(
ruby_verbose)) fprintf(stderr,
"%s=%s is ignored because it overflows\n", name, ptr);
7786 if (val > 0 && (
size_t)val > lower_bound) {
7788 fprintf(stderr,
"%s=%"PRIdSIZE
" (default value: %"PRIuSIZE
")\n", name, val, *default_value);
7790 *default_value = (size_t)val;
7795 fprintf(stderr,
"%s=%"PRIdSIZE
" (default value: %"PRIuSIZE
") is ignored because it must be greater than %"PRIuSIZE
".\n",
7796 name, val, *default_value, lower_bound);
7805get_envparam_double(
const char *name,
double *default_value,
double lower_bound,
double upper_bound,
int accept_zero)
7807 const char *ptr = getenv(name);
7810 if (ptr != NULL && *ptr) {
7813 if (!*ptr || *end) {
7814 if (
RTEST(
ruby_verbose)) fprintf(stderr,
"invalid string for %s: %s\n", name, ptr);
7818 if (accept_zero && val == 0.0) {
7821 else if (val <= lower_bound) {
7823 fprintf(stderr,
"%s=%f (default value: %f) is ignored because it must be greater than %f.\n",
7824 name, val, *default_value, lower_bound);
7827 else if (upper_bound != 0.0 &&
7828 val > upper_bound) {
7830 fprintf(stderr,
"%s=%f (default value: %f) is ignored because it must be lower than %f.\n",
7831 name, val, *default_value, upper_bound);
7841 if (
RTEST(
ruby_verbose)) fprintf(stderr,
"%s=%f (default value: %f)\n", name, val, *default_value);
7842 *default_value = val;
7887rb_gc_impl_set_params(
void *objspace_ptr)
7891 if (get_envparam_size(
"RUBY_GC_HEAP_FREE_SLOTS", &gc_params.heap_free_slots, 0)) {
7895 for (
int i = 0; i < HEAP_COUNT; i++) {
7896 char env_key[
sizeof(
"RUBY_GC_HEAP_" "_INIT_SLOTS") +
DECIMAL_SIZE_OF_BITS(
sizeof(
int) * CHAR_BIT)];
7897 snprintf(env_key,
sizeof(env_key),
"RUBY_GC_HEAP_%d_INIT_SLOTS", i);
7899 get_envparam_size(env_key, &gc_params.heap_init_slots[i], 0);
7902 get_envparam_double(
"RUBY_GC_HEAP_GROWTH_FACTOR", &gc_params.growth_factor, 1.0, 0.0, FALSE);
7903 get_envparam_size (
"RUBY_GC_HEAP_GROWTH_MAX_SLOTS", &gc_params.growth_max_slots, 0);
7904 get_envparam_double(
"RUBY_GC_HEAP_FREE_SLOTS_MIN_RATIO", &gc_params.heap_free_slots_min_ratio,
7906 get_envparam_double(
"RUBY_GC_HEAP_FREE_SLOTS_MAX_RATIO", &gc_params.heap_free_slots_max_ratio,
7907 gc_params.heap_free_slots_min_ratio, 1.0, FALSE);
7908 get_envparam_double(
"RUBY_GC_HEAP_FREE_SLOTS_GOAL_RATIO", &gc_params.heap_free_slots_goal_ratio,
7909 gc_params.heap_free_slots_min_ratio, gc_params.heap_free_slots_max_ratio, TRUE);
7910 get_envparam_double(
"RUBY_GC_HEAP_OLDOBJECT_LIMIT_FACTOR", &gc_params.oldobject_limit_factor, 0.0, 0.0, TRUE);
7911 get_envparam_double(
"RUBY_GC_HEAP_REMEMBERED_WB_UNPROTECTED_OBJECTS_LIMIT_RATIO", &gc_params.uncollectible_wb_unprotected_objects_limit_ratio, 0.0, 0.0, TRUE);
7913 if (get_envparam_size(
"RUBY_GC_MALLOC_LIMIT", &gc_params.malloc_limit_min, 0)) {
7914 malloc_limit = gc_params.malloc_limit_min;
7916 get_envparam_size (
"RUBY_GC_MALLOC_LIMIT_MAX", &gc_params.malloc_limit_max, 0);
7917 if (!gc_params.malloc_limit_max) {
7918 gc_params.malloc_limit_max = SIZE_MAX;
7920 get_envparam_double(
"RUBY_GC_MALLOC_LIMIT_GROWTH_FACTOR", &gc_params.malloc_limit_growth_factor, 1.0, 0.0, FALSE);
7922#if RGENGC_ESTIMATE_OLDMALLOC
7923 if (get_envparam_size(
"RUBY_GC_OLDMALLOC_LIMIT", &gc_params.oldmalloc_limit_min, 0)) {
7924 objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_min;
7926 get_envparam_size (
"RUBY_GC_OLDMALLOC_LIMIT_MAX", &gc_params.oldmalloc_limit_max, 0);
7927 get_envparam_double(
"RUBY_GC_OLDMALLOC_LIMIT_GROWTH_FACTOR", &gc_params.oldmalloc_limit_growth_factor, 1.0, 0.0, FALSE);
7934#ifdef HAVE_MALLOC_USABLE_SIZE
7936 hint = malloc_usable_size(ptr);
7943 MEMOP_TYPE_MALLOC = 0,
7949atomic_sub_nounderflow(
size_t *var,
size_t sub)
7951 if (sub == 0)
return;
7955 if (val < sub) sub = val;
7960#define gc_stress_full_mark_after_malloc_p() \
7961 (FIXNUM_P(ruby_gc_stress_mode) && (FIX2LONG(ruby_gc_stress_mode) & (1<<gc_stress_full_mark_after_malloc)))
7967 unsigned int reason = (GPR_FLAG_IMMEDIATE_MARK | GPR_FLAG_IMMEDIATE_SWEEP |
7968 GPR_FLAG_STRESS | GPR_FLAG_MALLOC);
7970 if (gc_stress_full_mark_after_malloc_p()) {
7971 reason |= GPR_FLAG_FULL_MARK;
7973 garbage_collect_with_gvl(
objspace, reason);
7978objspace_malloc_increase_report(
rb_objspace_t *
objspace,
void *mem,
size_t new_size,
size_t old_size,
enum memop_type
type,
bool gc_allowed)
7980 if (0) fprintf(stderr,
"increase - ptr: %p, type: %s, new_size: %"PRIdSIZE
", old_size: %"PRIdSIZE
"\n",
7982 type == MEMOP_TYPE_MALLOC ?
"malloc" :
7983 type == MEMOP_TYPE_FREE ?
"free " :
7984 type == MEMOP_TYPE_REALLOC ?
"realloc":
"error",
7985 new_size, old_size);
7990objspace_malloc_increase_body(
rb_objspace_t *
objspace,
void *mem,
size_t new_size,
size_t old_size,
enum memop_type
type,
bool gc_allowed)
7992 if (new_size > old_size) {
7994#if RGENGC_ESTIMATE_OLDMALLOC
7999 atomic_sub_nounderflow(&malloc_increase, old_size - new_size);
8000#if RGENGC_ESTIMATE_OLDMALLOC
8001 atomic_sub_nounderflow(&
objspace->rgengc.oldmalloc_increase, old_size - new_size);
8005 if (
type == MEMOP_TYPE_MALLOC && gc_allowed) {
8008 if (ruby_thread_has_gvl_p() && is_lazy_sweeping(
objspace)) {
8012 garbage_collect_with_gvl(
objspace, GPR_FLAG_MALLOC);
8016#if MALLOC_ALLOCATED_SIZE
8017 if (new_size >= old_size) {
8021 size_t dec_size = old_size - new_size;
8023#if MALLOC_ALLOCATED_SIZE_CHECK
8024 size_t allocated_size =
objspace->malloc_params.allocated_size;
8025 if (allocated_size < dec_size) {
8026 rb_bug(
"objspace_malloc_increase: underflow malloc_params.allocated_size.");
8029 atomic_sub_nounderflow(&
objspace->malloc_params.allocated_size, dec_size);
8033 case MEMOP_TYPE_MALLOC:
8036 case MEMOP_TYPE_FREE:
8038 size_t allocations =
objspace->malloc_params.allocations;
8039 if (allocations > 0) {
8040 atomic_sub_nounderflow(&
objspace->malloc_params.allocations, 1);
8042#if MALLOC_ALLOCATED_SIZE_CHECK
8044 GC_ASSERT(
objspace->malloc_params.allocations > 0);
8049 case MEMOP_TYPE_REALLOC:
break;
8055#define objspace_malloc_increase(...) \
8056 for (bool malloc_increase_done = objspace_malloc_increase_report(__VA_ARGS__); \
8057 !malloc_increase_done; \
8058 malloc_increase_done = objspace_malloc_increase_body(__VA_ARGS__))
8067 if (size == 0) size = 1;
8069#if CALC_EXACT_MALLOC_SIZE
8083 return during_gc && !dont_gc_val() && !rb_gc_multi_ractor_p() && ruby_thread_has_gvl_p();
8089 size = objspace_malloc_size(
objspace, mem, size);
8090 objspace_malloc_increase(
objspace, mem, size, 0, MEMOP_TYPE_MALLOC, gc_allowed) {}
8092#if CALC_EXACT_MALLOC_SIZE
8103#if defined(__GNUC__) && RUBY_DEBUG
8104#define RB_BUG_INSTEAD_OF_RB_MEMERROR 1
8107#ifndef RB_BUG_INSTEAD_OF_RB_MEMERROR
8108# define RB_BUG_INSTEAD_OF_RB_MEMERROR 0
8111#define GC_MEMERROR(...) \
8112 ((RB_BUG_INSTEAD_OF_RB_MEMERROR+0) ? rb_bug("" __VA_ARGS__) : (void)0)
8114#define TRY_WITH_GC(siz, expr) do { \
8115 const gc_profile_record_flag gpr = \
8116 GPR_FLAG_FULL_MARK | \
8117 GPR_FLAG_IMMEDIATE_MARK | \
8118 GPR_FLAG_IMMEDIATE_SWEEP | \
8120 objspace_malloc_gc_stress(objspace); \
8122 if (RB_LIKELY((expr))) { \
8125 else if (gc_allowed && !garbage_collect_with_gvl(objspace, gpr)) { \
8127 GC_MEMERROR("TRY_WITH_GC: could not GC"); \
8129 else if ((expr)) { \
8133 GC_MEMERROR("TRY_WITH_GC: could not allocate:" \
8134 "%"PRIdSIZE" bytes for %s", \
8142 if (RB_UNLIKELY(malloc_during_gc_p(
objspace))) {
8145 rb_bug(
"Cannot %s during GC", msg);
8150rb_gc_impl_free(
void *objspace_ptr,
void *ptr,
size_t old_size)
8161#if CALC_EXACT_MALLOC_SIZE
8164 old_size = info->size;
8166 old_size = objspace_malloc_size(
objspace, ptr, old_size);
8168 objspace_malloc_increase(
objspace, ptr, 0, old_size, MEMOP_TYPE_FREE,
true) {
8171 RB_DEBUG_COUNTER_INC(heap_xfree);
8176rb_gc_impl_malloc(
void *objspace_ptr,
size_t size,
bool gc_allowed)
8179 check_malloc_not_in_gc(
objspace,
"malloc");
8183 size = objspace_malloc_prepare(
objspace, size);
8184 TRY_WITH_GC(size, mem = malloc(size));
8185 RB_DEBUG_COUNTER_INC(heap_xmalloc);
8186 if (!mem)
return mem;
8187 return objspace_malloc_fixup(
objspace, mem, size, gc_allowed);
8191rb_gc_impl_calloc(
void *objspace_ptr,
size_t size,
bool gc_allowed)
8195 if (RB_UNLIKELY(malloc_during_gc_p(
objspace))) {
8196 rb_warn(
"calloc during GC detected, this could cause crashes if it triggers another GC");
8197#if RGENGC_CHECK_MODE || RUBY_DEBUG
8198 rb_bug(
"Cannot calloc during GC");
8204 size = objspace_malloc_prepare(
objspace, size);
8205 TRY_WITH_GC(size, mem = calloc1(size));
8206 if (!mem)
return mem;
8207 return objspace_malloc_fixup(
objspace, mem, size, gc_allowed);
8211rb_gc_impl_realloc(
void *objspace_ptr,
void *ptr,
size_t new_size,
size_t old_size,
bool gc_allowed)
8215 check_malloc_not_in_gc(
objspace,
"realloc");
8219 if (!ptr)
return rb_gc_impl_malloc(
objspace, new_size, gc_allowed);
8226 if (new_size == 0) {
8227 if ((mem = rb_gc_impl_malloc(
objspace, 0, gc_allowed)) != NULL) {
8250 rb_gc_impl_free(
objspace, ptr, old_size);
8264#if CALC_EXACT_MALLOC_SIZE
8269 old_size = info->size;
8273 old_size = objspace_malloc_size(
objspace, ptr, old_size);
8275 if (!mem)
return mem;
8276 new_size = objspace_malloc_size(
objspace, mem, new_size);
8278#if CALC_EXACT_MALLOC_SIZE
8281 info->size = new_size;
8286 objspace_malloc_increase(
objspace, mem, new_size, old_size, MEMOP_TYPE_REALLOC, gc_allowed);
8288 RB_DEBUG_COUNTER_INC(heap_xrealloc);
8293rb_gc_impl_adjust_memory_usage(
void *objspace_ptr, ssize_t diff)
8298 objspace_malloc_increase(
objspace, 0, diff, 0, MEMOP_TYPE_REALLOC,
true);
8300 else if (diff < 0) {
8301 objspace_malloc_increase(
objspace, 0, 0, -diff, MEMOP_TYPE_REALLOC,
true);
8310#define GC_PROFILE_RECORD_DEFAULT_SIZE 100
8313current_process_time(
struct timespec *ts)
8315#if defined(HAVE_CLOCK_GETTIME) && defined(CLOCK_PROCESS_CPUTIME_ID)
8317 static int try_clock_gettime = 1;
8318 if (try_clock_gettime && clock_gettime(CLOCK_PROCESS_CPUTIME_ID, ts) == 0) {
8322 try_clock_gettime = 0;
8329 struct rusage usage;
8331 if (getrusage(RUSAGE_SELF, &usage) == 0) {
8332 time = usage.ru_utime;
8333 ts->tv_sec = time.tv_sec;
8334 ts->tv_nsec = (int32_t)time.tv_usec * 1000;
8342 FILETIME creation_time, exit_time, kernel_time, user_time;
8345 if (GetProcessTimes(GetCurrentProcess(),
8346 &creation_time, &exit_time, &kernel_time, &user_time) != 0) {
8347 memcpy(&ui, &user_time,
sizeof(FILETIME));
8348#define PER100NSEC (uint64_t)(1000 * 1000 * 10)
8349 ts->tv_nsec = (long)(ui.QuadPart % PER100NSEC);
8350 ts->tv_sec = (time_t)(ui.QuadPart / PER100NSEC);
8363 if (current_process_time(&ts)) {
8364 return ts.tv_sec + ts.tv_nsec * 1e-9;
8376 size_t index =
objspace->profile.next_index;
8383 objspace->profile.size = GC_PROFILE_RECORD_DEFAULT_SIZE;
8386 if (index >=
objspace->profile.size) {
8390 if (!ptr) rb_memerror();
8394 rb_bug(
"gc_profile malloc or realloc miss");
8400 record->flags = reason | (ruby_gc_stressful ? GPR_FLAG_STRESS : 0);
8401#if MALLOC_ALLOCATED_SIZE
8402 record->allocated_size = malloc_allocated_size;
8404#if GC_PROFILE_MORE_DETAIL && GC_PROFILE_DETAIL_MEMORY
8407 struct rusage usage;
8408 if (getrusage(RUSAGE_SELF, &usage) == 0) {
8409 record->maxrss = usage.ru_maxrss;
8410 record->minflt = usage.ru_minflt;
8411 record->majflt = usage.ru_majflt;
8424#if GC_PROFILE_MORE_DETAIL
8425 record->prepare_time =
objspace->profile.prepare_time;
8427 record->gc_time = 0;
8428 record->gc_invoke_time = getrusage_time();
8433elapsed_time_from(
double time)
8435 double now = getrusage_time();
8449 record->gc_time = elapsed_time_from(record->gc_invoke_time);
8450 record->gc_invoke_time -=
objspace->profile.invoke_time;
8454#ifdef BUILDING_MODULAR_GC
8455# define RUBY_DTRACE_GC_HOOK(name)
8457# define RUBY_DTRACE_GC_HOOK(name) \
8458 do {if (RUBY_DTRACE_GC_##name##_ENABLED()) RUBY_DTRACE_GC_##name();} while (0)
8464 RUBY_DTRACE_GC_HOOK(MARK_BEGIN);
8465#if GC_PROFILE_MORE_DETAIL
8467 gc_prof_record(
objspace)->gc_mark_time = getrusage_time();
8475 RUBY_DTRACE_GC_HOOK(MARK_END);
8476#if GC_PROFILE_MORE_DETAIL
8479 record->gc_mark_time = elapsed_time_from(record->gc_mark_time);
8487 RUBY_DTRACE_GC_HOOK(SWEEP_BEGIN);
8491 if (record->gc_time > 0 || GC_PROFILE_MORE_DETAIL) {
8492 objspace->profile.gc_sweep_start_time = getrusage_time();
8500 RUBY_DTRACE_GC_HOOK(SWEEP_END);
8506 if (record->gc_time > 0) {
8507 sweep_time = elapsed_time_from(
objspace->profile.gc_sweep_start_time);
8509 record->gc_time += sweep_time;
8511 else if (GC_PROFILE_MORE_DETAIL) {
8512 sweep_time = elapsed_time_from(
objspace->profile.gc_sweep_start_time);
8515#if GC_PROFILE_MORE_DETAIL
8516 record->gc_sweep_time += sweep_time;
8517 if (heap_pages_deferred_final) record->flags |= GPR_FLAG_HAVE_FINALIZE;
8519 if (heap_pages_deferred_final)
objspace->profile.latest_gc_info |= GPR_FLAG_HAVE_FINALIZE;
8526#if GC_PROFILE_MORE_DETAIL
8529 record->allocate_increase = malloc_increase;
8530 record->allocate_limit = malloc_limit;
8540 size_t live =
objspace->profile.total_allocated_objects_at_gc_start - total_freed_objects(
objspace);
8541 size_t total =
objspace->profile.heap_used_at_gc_start * HEAP_PAGE_OBJ_LIMIT;
8543#if GC_PROFILE_MORE_DETAIL
8544 record->heap_use_pages =
objspace->profile.heap_used_at_gc_start;
8545 record->heap_live_objects = live;
8546 record->heap_free_objects = total - live;
8549 record->heap_total_objects = total;
8550 record->heap_use_size = live * BASE_SLOT_SIZE;
8551 record->heap_total_size = total * BASE_SLOT_SIZE;
8567 void *p =
objspace->profile.records;
8571 objspace->profile.current_record = 0;
8627gc_profile_record_get(
VALUE _)
8638 for (i =0; i <
objspace->profile.next_index; i++) {
8641 prof = rb_hash_new();
8642 rb_hash_aset(prof,
ID2SYM(rb_intern(
"GC_FLAGS")), gc_info_decode(
objspace, rb_hash_new(), record->flags));
8643 rb_hash_aset(prof,
ID2SYM(rb_intern(
"GC_TIME")),
DBL2NUM(record->gc_time));
8644 rb_hash_aset(prof,
ID2SYM(rb_intern(
"GC_INVOKE_TIME")),
DBL2NUM(record->gc_invoke_time));
8645 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HEAP_USE_SIZE")),
SIZET2NUM(record->heap_use_size));
8646 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HEAP_TOTAL_SIZE")),
SIZET2NUM(record->heap_total_size));
8647 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HEAP_TOTAL_OBJECTS")),
SIZET2NUM(record->heap_total_objects));
8648 rb_hash_aset(prof,
ID2SYM(rb_intern(
"MOVED_OBJECTS")),
SIZET2NUM(record->moved_objects));
8649 rb_hash_aset(prof,
ID2SYM(rb_intern(
"GC_IS_MARKED")),
Qtrue);
8650#if GC_PROFILE_MORE_DETAIL
8651 rb_hash_aset(prof,
ID2SYM(rb_intern(
"GC_MARK_TIME")),
DBL2NUM(record->gc_mark_time));
8652 rb_hash_aset(prof,
ID2SYM(rb_intern(
"GC_SWEEP_TIME")),
DBL2NUM(record->gc_sweep_time));
8653 rb_hash_aset(prof,
ID2SYM(rb_intern(
"ALLOCATE_INCREASE")),
SIZET2NUM(record->allocate_increase));
8654 rb_hash_aset(prof,
ID2SYM(rb_intern(
"ALLOCATE_LIMIT")),
SIZET2NUM(record->allocate_limit));
8655 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HEAP_USE_PAGES")),
SIZET2NUM(record->heap_use_pages));
8656 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HEAP_LIVE_OBJECTS")),
SIZET2NUM(record->heap_live_objects));
8657 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HEAP_FREE_OBJECTS")),
SIZET2NUM(record->heap_free_objects));
8659 rb_hash_aset(prof,
ID2SYM(rb_intern(
"REMOVING_OBJECTS")),
SIZET2NUM(record->removing_objects));
8660 rb_hash_aset(prof,
ID2SYM(rb_intern(
"EMPTY_OBJECTS")),
SIZET2NUM(record->empty_objects));
8662 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HAVE_FINALIZE")), (record->flags & GPR_FLAG_HAVE_FINALIZE) ?
Qtrue :
Qfalse);
8665#if RGENGC_PROFILE > 0
8666 rb_hash_aset(prof,
ID2SYM(rb_intern(
"OLD_OBJECTS")),
SIZET2NUM(record->old_objects));
8667 rb_hash_aset(prof,
ID2SYM(rb_intern(
"REMEMBERED_NORMAL_OBJECTS")),
SIZET2NUM(record->remembered_normal_objects));
8668 rb_hash_aset(prof,
ID2SYM(rb_intern(
"REMEMBERED_SHADY_OBJECTS")),
SIZET2NUM(record->remembered_shady_objects));
8676#if GC_PROFILE_MORE_DETAIL
8677#define MAJOR_REASON_MAX 0x10
8680gc_profile_dump_major_reason(
unsigned int flags,
char *buff)
8682 unsigned int reason = flags & GPR_FLAG_MAJOR_MASK;
8685 if (reason == GPR_FLAG_NONE) {
8691 if (reason & GPR_FLAG_MAJOR_BY_##x) { \
8692 buff[i++] = #x[0]; \
8693 if (i >= MAJOR_REASON_MAX) rb_bug("gc_profile_dump_major_reason: overflow"); \
8699#if RGENGC_ESTIMATE_OLDMALLOC
8714 size_t count =
objspace->profile.next_index;
8715#ifdef MAJOR_REASON_MAX
8716 char reason_str[MAJOR_REASON_MAX];
8719 if (
objspace->profile.run && count ) {
8723 append(out, rb_sprintf(
"GC %"PRIuSIZE
" invokes.\n",
objspace->profile.count));
8724 append(out,
rb_str_new_cstr(
"Index Invoke Time(sec) Use Size(byte) Total Size(byte) Total Object GC Time(ms)\n"));
8726 for (i = 0; i < count; i++) {
8727 record = &
objspace->profile.records[i];
8728 append(out, rb_sprintf(
"%5"PRIuSIZE
" %19.3f %20"PRIuSIZE
" %20"PRIuSIZE
" %20"PRIuSIZE
" %30.20f\n",
8729 i+1, record->gc_invoke_time, record->heap_use_size,
8730 record->heap_total_size, record->heap_total_objects, record->gc_time*1000));
8733#if GC_PROFILE_MORE_DETAIL
8734 const char *str =
"\n\n" \
8736 "Prepare Time = Previously GC's rest sweep time\n"
8737 "Index Flags Allocate Inc. Allocate Limit"
8738#if CALC_EXACT_MALLOC_SIZE
8741 " Use Page Mark Time(ms) Sweep Time(ms) Prepare Time(ms) LivingObj FreeObj RemovedObj EmptyObj"
8743 " OldgenObj RemNormObj RemShadObj"
8745#if GC_PROFILE_DETAIL_MEMORY
8746 " MaxRSS(KB) MinorFLT MajorFLT"
8751 for (i = 0; i < count; i++) {
8752 record = &
objspace->profile.records[i];
8753 append(out, rb_sprintf(
"%5"PRIuSIZE
" %4s/%c/%6s%c %13"PRIuSIZE
" %15"PRIuSIZE
8754#
if CALC_EXACT_MALLOC_SIZE
8757 " %9"PRIuSIZE
" %17.12f %17.12f %17.12f %10"PRIuSIZE
" %10"PRIuSIZE
" %10"PRIuSIZE
" %10"PRIuSIZE
8759 "%10"PRIuSIZE
" %10"PRIuSIZE
" %10"PRIuSIZE
8761#
if GC_PROFILE_DETAIL_MEMORY
8767 gc_profile_dump_major_reason(record->flags, reason_str),
8768 (record->flags & GPR_FLAG_HAVE_FINALIZE) ?
'F' :
'.',
8769 (record->flags & GPR_FLAG_NEWOBJ) ?
"NEWOBJ" :
8770 (record->flags & GPR_FLAG_MALLOC) ?
"MALLOC" :
8771 (record->flags & GPR_FLAG_METHOD) ?
"METHOD" :
8772 (record->flags & GPR_FLAG_CAPI) ?
"CAPI__" :
"??????",
8773 (record->flags & GPR_FLAG_STRESS) ?
'!' :
' ',
8774 record->allocate_increase, record->allocate_limit,
8775#if CALC_EXACT_MALLOC_SIZE
8776 record->allocated_size,
8778 record->heap_use_pages,
8779 record->gc_mark_time*1000,
8780 record->gc_sweep_time*1000,
8781 record->prepare_time*1000,
8783 record->heap_live_objects,
8784 record->heap_free_objects,
8785 record->removing_objects,
8786 record->empty_objects
8789 record->old_objects,
8790 record->remembered_normal_objects,
8791 record->remembered_shady_objects
8793#if GC_PROFILE_DETAIL_MEMORY
8795 record->maxrss / 1024,
8818gc_profile_result(
VALUE _)
8835gc_profile_report(
int argc,
VALUE *argv,
VALUE self)
8840 gc_profile_dump_on(out, rb_io_write);
8853gc_profile_total_time(
VALUE self)
8860 size_t count =
objspace->profile.next_index;
8862 for (i = 0; i < count; i++) {
8863 time +=
objspace->profile.records[i].gc_time;
8877gc_profile_enable_get(
VALUE self)
8892gc_profile_enable(
VALUE _)
8896 objspace->profile.current_record = 0;
8909gc_profile_disable(
VALUE _)
8914 objspace->profile.current_record = 0;
8929gc_verify_internal_consistency_m(
VALUE dummy)
8931 gc_verify_internal_consistency(rb_gc_get_objspace());
8935#if GC_CAN_COMPILE_COMPACTION
8949 GC_ASSERT(GC_COMPACTION_SUPPORTED);
8951 ruby_enable_autocompact =
RTEST(v);
8953#if RGENGC_CHECK_MODE
8954 ruby_autocompact_compare_func = NULL;
8958 if (
id == rb_intern(
"empty")) {
8959 ruby_autocompact_compare_func = compare_free_slots;
8967# define gc_set_auto_compact rb_f_notimplement
8970#if GC_CAN_COMPILE_COMPACTION
8978gc_get_auto_compact(
VALUE _)
8983# define gc_get_auto_compact rb_f_notimplement
8986#if GC_CAN_COMPILE_COMPACTION
9012gc_compact_stats(
VALUE self)
9015 VALUE h = rb_hash_new();
9016 VALUE considered = rb_hash_new();
9017 VALUE moved = rb_hash_new();
9018 VALUE moved_up = rb_hash_new();
9019 VALUE moved_down = rb_hash_new();
9021 for (
size_t i = 0; i <
T_MASK; i++) {
9022 if (
objspace->rcompactor.considered_count_table[i]) {
9023 rb_hash_aset(considered, type_sym(i),
SIZET2NUM(
objspace->rcompactor.considered_count_table[i]));
9026 if (
objspace->rcompactor.moved_count_table[i]) {
9027 rb_hash_aset(moved, type_sym(i),
SIZET2NUM(
objspace->rcompactor.moved_count_table[i]));
9030 if (
objspace->rcompactor.moved_up_count_table[i]) {
9031 rb_hash_aset(moved_up, type_sym(i),
SIZET2NUM(
objspace->rcompactor.moved_up_count_table[i]));
9034 if (
objspace->rcompactor.moved_down_count_table[i]) {
9035 rb_hash_aset(moved_down, type_sym(i),
SIZET2NUM(
objspace->rcompactor.moved_down_count_table[i]));
9039 rb_hash_aset(h,
ID2SYM(rb_intern(
"considered")), considered);
9040 rb_hash_aset(h,
ID2SYM(rb_intern(
"moved")), moved);
9041 rb_hash_aset(h,
ID2SYM(rb_intern(
"moved_up")), moved_up);
9042 rb_hash_aset(h,
ID2SYM(rb_intern(
"moved_down")), moved_down);
9047# define gc_compact_stats rb_f_notimplement
9050#if GC_CAN_COMPILE_COMPACTION
9069gc_compact(
VALUE self)
9072 int full_marking_p = gc_config_full_mark_val;
9073 gc_config_full_mark_set(TRUE);
9076 rb_gc_impl_start(rb_gc_get_objspace(),
true,
true,
true,
true);
9077 gc_config_full_mark_set(full_marking_p);
9079 return gc_compact_stats(self);
9082# define gc_compact rb_f_notimplement
9085#if GC_CAN_COMPILE_COMPACTION
9086struct desired_compaction_pages_i_data {
9088 size_t required_slots[HEAP_COUNT];
9092desired_compaction_pages_i(
struct heap_page *page,
void *data)
9094 struct desired_compaction_pages_i_data *tdata = data;
9097 VALUE vend = vstart + (
VALUE)(page->total_slots * page->heap->slot_size);
9100 for (
VALUE v = vstart; v != vend; v += page->heap->slot_size) {
9101 asan_unpoisoning_object(v) {
9105 size_t dest_pool_idx = dest_pool - heaps;
9106 tdata->required_slots[dest_pool_idx]++;
9130gc_verify_compaction_references(
int argc,
VALUE* argv,
VALUE self)
9132 static ID keywords[3] = {0};
9134 keywords[0] = rb_intern(
"toward");
9135 keywords[1] = rb_intern(
"double_heap");
9136 keywords[2] = rb_intern(
"expand_heap");
9143 int kwarg_count =
rb_get_kwargs(options, keywords, 0, 3, arguments);
9144 bool toward_empty = kwarg_count > 0 &&
SYMBOL_P(arguments[0]) &&
SYM2ID(arguments[0]) == rb_intern(
"empty");
9145 bool expand_heap = (kwarg_count > 1 &&
RTEST(arguments[1])) || (kwarg_count > 2 &&
RTEST(arguments[2]));
9150 rb_gc_impl_start(
objspace,
true,
true,
true,
false);
9152 unsigned int lev = RB_GC_VM_LOCK();
9158 struct desired_compaction_pages_i_data desired_compaction = {
9160 .required_slots = {0},
9163 objspace_each_pages(
objspace, desired_compaction_pages_i, &desired_compaction, TRUE);
9166 size_t max_existing_pages = 0;
9167 for (
int i = 0; i < HEAP_COUNT; i++) {
9169 max_existing_pages = MAX(max_existing_pages, heap->total_pages);
9173 for (
int i = 0; i < HEAP_COUNT; i++) {
9176 size_t pages_to_add = 0;
9183 pages_to_add += max_existing_pages - heap->total_pages;
9188 objspace->heap_pages.allocatable_slots = desired_compaction.required_slots[i];
9189 while (
objspace->heap_pages.allocatable_slots > 0) {
9190 heap_page_allocate_and_initialize(
objspace, heap);
9198 for (; pages_to_add > 0; pages_to_add--) {
9199 heap_page_allocate_and_initialize_force(
objspace, heap);
9205 objspace->rcompactor.compare_func = compare_free_slots;
9208 RB_GC_VM_UNLOCK(lev);
9210 rb_gc_impl_start(rb_gc_get_objspace(),
true,
true,
true,
true);
9212 rb_objspace_reachable_objects_from_root(root_obj_check_moved_i,
objspace);
9215 objspace->rcompactor.compare_func = NULL;
9217 return gc_compact_stats(self);
9220# define gc_verify_compaction_references rb_f_notimplement
9224rb_gc_impl_objspace_free(
void *objspace_ptr)
9229 rb_bug(
"lazy sweeping underway when freeing object space");
9234 for (
size_t i = 0; i < rb_darray_size(
objspace->heap_pages.sorted); i++) {
9237 rb_darray_free_without_gc(
objspace->heap_pages.sorted);
9238 heap_pages_lomem = 0;
9239 heap_pages_himem = 0;
9241 for (
int i = 0; i < HEAP_COUNT; i++) {
9243 heap->total_pages = 0;
9244 heap->total_slots = 0;
9247 free_stack_chunks(&
objspace->mark_stack);
9248 mark_stack_free_cache(&
objspace->mark_stack);
9250 rb_darray_free_without_gc(
objspace->weak_references);
9255#if MALLOC_ALLOCATED_SIZE
9266gc_malloc_allocated_size(
VALUE self)
9282gc_malloc_allocations(
VALUE self)
9289void rb_gc_impl_before_fork(
void *objspace_ptr) { }
9290void rb_gc_impl_after_fork(
void *objspace_ptr, rb_pid_t pid) {
9292 rb_gc_ractor_newobj_cache_foreach(gc_ractor_newobj_cache_clear, NULL);
9296VALUE rb_ident_hash_new_with_size(st_index_t size);
9306rb_gcdebug_add_stress_to_class(
int argc,
VALUE *argv,
VALUE self)
9310 if (!stress_to_class) {
9311 set_stress_to_class(rb_ident_hash_new_with_size(argc));
9314 for (
int i = 0; i < argc; i++) {
9315 VALUE klass = argv[i];
9316 rb_hash_aset(stress_to_class, klass,
Qtrue);
9331rb_gcdebug_remove_stress_to_class(
int argc,
VALUE *argv,
VALUE self)
9335 if (stress_to_class) {
9336 for (
int i = 0; i < argc; ++i) {
9337 rb_hash_delete(stress_to_class, argv[i]);
9340 if (rb_hash_size(stress_to_class) == 0) {
9341 stress_to_class = 0;
9349rb_gc_impl_objspace_alloc(
void)
9357rb_gc_impl_objspace_init(
void *objspace_ptr)
9361 gc_config_full_mark_set(TRUE);
9364 malloc_limit = gc_params.malloc_limit_min;
9366 if (
objspace->finalize_deferred_pjob == POSTPONED_JOB_HANDLE_INVALID) {
9367 rb_bug(
"Could not preregister postponed job for GC");
9370 for (
int i = 0; i < HEAP_COUNT; i++) {
9373 heap->slot_size = (1 << i) * BASE_SLOT_SIZE;
9375 ccan_list_head_init(&heap->pages);
9378 rb_darray_make_without_gc(&
objspace->heap_pages.sorted, 0);
9379 rb_darray_make_without_gc(&
objspace->weak_references, 0);
9386#if defined(INIT_HEAP_PAGE_ALLOC_USE_MMAP)
9388 heap_page_alloc_use_mmap = INIT_HEAP_PAGE_ALLOC_USE_MMAP;
9390#if RGENGC_ESTIMATE_OLDMALLOC
9391 objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_min;
9394 for (
int i = 0; i < HEAP_COUNT; i++) {
9396 gc_params.heap_init_slots[i] = GC_HEAP_INIT_SLOTS;
9399 init_mark_stack(&
objspace->mark_stack);
9401 objspace->profile.invoke_time = getrusage_time();
9402 finalizer_table = st_init_numtable();
9406rb_gc_impl_init(
void)
9408 VALUE gc_constants = rb_hash_new();
9409 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"DEBUG")), GC_DEBUG ?
Qtrue :
Qfalse);
9410 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"BASE_SLOT_SIZE")),
SIZET2NUM(BASE_SLOT_SIZE - RVALUE_OVERHEAD));
9412 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"RVALUE_OVERHEAD")),
SIZET2NUM(RVALUE_OVERHEAD));
9413 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"HEAP_PAGE_OBJ_LIMIT")),
SIZET2NUM(HEAP_PAGE_OBJ_LIMIT));
9414 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"HEAP_PAGE_BITMAP_SIZE")),
SIZET2NUM(HEAP_PAGE_BITMAP_SIZE));
9415 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"HEAP_PAGE_SIZE")),
SIZET2NUM(HEAP_PAGE_SIZE));
9416 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"HEAP_COUNT")),
LONG2FIX(HEAP_COUNT));
9417 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"RVARGC_MAX_ALLOCATE_SIZE")),
LONG2FIX(heap_slot_size(HEAP_COUNT - 1)));
9418 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"RVALUE_OLD_AGE")),
LONG2FIX(RVALUE_OLD_AGE));
9419 if (RB_BUG_INSTEAD_OF_RB_MEMERROR+0) {
9420 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"RB_BUG_INSTEAD_OF_RB_MEMERROR")),
Qtrue);
9424 rb_define_const(
rb_mGC,
"INTERNAL_CONSTANTS", gc_constants);
9426 if (GC_COMPACTION_SUPPORTED) {
9441 if (GC_DEBUG_STRESS_TO_CLASS) {
9449#if MALLOC_ALLOCATED_SIZE
9468#define OPT(o) if (o) rb_ary_push(opts, rb_interned_str(#o, sizeof(#o) - 1))
9472 OPT(RGENGC_CHECK_MODE);
9473 OPT(RGENGC_PROFILE);
9474 OPT(RGENGC_ESTIMATE_OLDMALLOC);
9475 OPT(GC_PROFILE_MORE_DETAIL);
9476 OPT(GC_ENABLE_LAZY_SWEEP);
9477 OPT(CALC_EXACT_MALLOC_SIZE);
9478 OPT(MALLOC_ALLOCATED_SIZE);
9479 OPT(MALLOC_ALLOCATED_SIZE_CHECK);
9480 OPT(GC_PROFILE_DETAIL_MEMORY);
9481 OPT(GC_COMPACTION_SUPPORTED);
#define RUBY_ASSERT(...)
Asserts that the given expression is truthy if and only if RUBY_DEBUG is truthy.
#define RUBY_ATOMIC_VALUE_CAS(var, oldval, newval)
Identical to RUBY_ATOMIC_CAS, except it expects its arguments are VALUE.
#define RUBY_ATOMIC_SIZE_EXCHANGE(var, val)
Identical to RUBY_ATOMIC_EXCHANGE, except it expects its arguments are size_t.
#define RUBY_ATOMIC_SIZE_INC(var)
Identical to RUBY_ATOMIC_INC, except it expects its argument is size_t.
#define RUBY_ATOMIC_SIZE_CAS(var, oldval, newval)
Identical to RUBY_ATOMIC_CAS, except it expects its arguments are size_t.
std::atomic< unsigned > rb_atomic_t
Type that is eligible for atomic operations.
#define RUBY_ATOMIC_SIZE_ADD(var, val)
Identical to RUBY_ATOMIC_ADD, except it expects its arguments are size_t.
#define RUBY_ATOMIC_VALUE_EXCHANGE(var, val)
Identical to RUBY_ATOMIC_EXCHANGE, except it expects its arguments are VALUE.
#define RUBY_ATOMIC_SET(var, val)
Identical to RUBY_ATOMIC_EXCHANGE, except for the return type.
#define RUBY_ATOMIC_EXCHANGE(var, val)
Atomically replaces the value pointed by var with val.
#define rb_define_singleton_method(klass, mid, func, arity)
Defines klass.mid.
unsigned int rb_postponed_job_handle_t
The type of a handle returned from rb_postponed_job_preregister and passed to rb_postponed_job_trigge...
void rb_postponed_job_trigger(rb_postponed_job_handle_t h)
Triggers a pre-registered job registered with rb_postponed_job_preregister, scheduling it for executi...
rb_postponed_job_handle_t rb_postponed_job_preregister(unsigned int flags, rb_postponed_job_func_t func, void *data)
Pre-registers a func in Ruby's postponed job preregistration table, returning an opaque handle which ...
#define RUBY_INTERNAL_EVENT_GC_EXIT
gc_exit() is called.
#define RUBY_INTERNAL_EVENT_GC_ENTER
gc_enter() is called.
#define RUBY_INTERNAL_EVENT_GC_END_SWEEP
GC ended sweep phase.
#define RUBY_INTERNAL_EVENT_GC_END_MARK
GC ended mark phase.
#define RUBY_INTERNAL_EVENT_OBJSPACE_MASK
Bitmask of GC events.
#define RUBY_INTERNAL_EVENT_FREEOBJ
Object swept.
#define RUBY_INTERNAL_EVENT_GC_START
GC started.
uint32_t rb_event_flag_t
Represents event(s).
#define RUBY_INTERNAL_EVENT_NEWOBJ
Object allocated.
static VALUE RB_FL_TEST(VALUE obj, VALUE flags)
Tests if the given flag(s) are set or not.
static void RB_FL_SET_RAW(VALUE obj, VALUE flags)
This is an implementation detail of RB_FL_SET().
static void RB_FL_UNSET_RAW(VALUE obj, VALUE flags)
This is an implementation detail of RB_FL_UNSET().
@ RUBY_FL_PROMOTED
Ruby objects are "generational".
VALUE rb_define_module_under(VALUE outer, const char *name)
Defines a module under the namespace of outer.
int rb_scan_args_kw(int kw_flag, int argc, const VALUE *argv, const char *fmt,...)
Identical to rb_scan_args(), except it also accepts kw_splat.
int rb_keyword_given_p(void)
Determines if the current method is given a keyword argument.
int rb_get_kwargs(VALUE keyword_hash, const ID *table, int required, int optional, VALUE *values)
Keyword argument deconstructor.
#define T_COMPLEX
Old name of RUBY_T_COMPLEX.
#define T_FILE
Old name of RUBY_T_FILE.
#define T_STRING
Old name of RUBY_T_STRING.
#define xfree
Old name of ruby_xfree.
#define T_MASK
Old name of RUBY_T_MASK.
#define Qundef
Old name of RUBY_Qundef.
#define INT2FIX
Old name of RB_INT2FIX.
#define OBJ_FROZEN
Old name of RB_OBJ_FROZEN.
#define T_NIL
Old name of RUBY_T_NIL.
#define T_FLOAT
Old name of RUBY_T_FLOAT.
#define T_IMEMO
Old name of RUBY_T_IMEMO.
#define ID2SYM
Old name of RB_ID2SYM.
#define T_BIGNUM
Old name of RUBY_T_BIGNUM.
#define SPECIAL_CONST_P
Old name of RB_SPECIAL_CONST_P.
#define T_STRUCT
Old name of RUBY_T_STRUCT.
#define OBJ_FREEZE
Old name of RB_OBJ_FREEZE.
#define T_FIXNUM
Old name of RUBY_T_FIXNUM.
#define SYM2ID
Old name of RB_SYM2ID.
#define T_DATA
Old name of RUBY_T_DATA.
#define FL_SHAREABLE
Old name of RUBY_FL_SHAREABLE.
#define T_NONE
Old name of RUBY_T_NONE.
#define T_NODE
Old name of RUBY_T_NODE.
#define SIZET2NUM
Old name of RB_SIZE2NUM.
#define xmalloc
Old name of ruby_xmalloc.
#define LONG2FIX
Old name of RB_INT2FIX.
#define FIX2INT
Old name of RB_FIX2INT.
#define FL_FINALIZE
Old name of RUBY_FL_FINALIZE.
#define T_MODULE
Old name of RUBY_T_MODULE.
#define T_TRUE
Old name of RUBY_T_TRUE.
#define T_RATIONAL
Old name of RUBY_T_RATIONAL.
#define T_ICLASS
Old name of RUBY_T_ICLASS.
#define T_HASH
Old name of RUBY_T_HASH.
#define ALLOC_N
Old name of RB_ALLOC_N.
#define FL_TEST_RAW
Old name of RB_FL_TEST_RAW.
#define FL_SET
Old name of RB_FL_SET.
#define rb_ary_new3
Old name of rb_ary_new_from_args.
#define T_FALSE
Old name of RUBY_T_FALSE.
#define ULL2NUM
Old name of RB_ULL2NUM.
#define T_UNDEF
Old name of RUBY_T_UNDEF.
#define Qtrue
Old name of RUBY_Qtrue.
#define T_ZOMBIE
Old name of RUBY_T_ZOMBIE.
#define Qnil
Old name of RUBY_Qnil.
#define Qfalse
Old name of RUBY_Qfalse.
#define T_ARRAY
Old name of RUBY_T_ARRAY.
#define T_OBJECT
Old name of RUBY_T_OBJECT.
#define NIL_P
Old name of RB_NIL_P.
#define FL_WB_PROTECTED
Old name of RUBY_FL_WB_PROTECTED.
#define T_SYMBOL
Old name of RUBY_T_SYMBOL.
#define DBL2NUM
Old name of rb_float_new.
#define T_MATCH
Old name of RUBY_T_MATCH.
#define T_CLASS
Old name of RUBY_T_CLASS.
#define BUILTIN_TYPE
Old name of RB_BUILTIN_TYPE.
#define T_MOVED
Old name of RUBY_T_MOVED.
#define FL_TEST
Old name of RB_FL_TEST.
#define FL_UNSET
Old name of RB_FL_UNSET.
#define FIXNUM_P
Old name of RB_FIXNUM_P.
#define SYMBOL_P
Old name of RB_SYMBOL_P.
#define T_REGEXP
Old name of RUBY_T_REGEXP.
#define ruby_verbose
This variable controls whether the interpreter is in debug mode.
VALUE rb_eRuntimeError
RuntimeError exception.
void rb_warn(const char *fmt,...)
Identical to rb_warning(), except it reports unless $VERBOSE is nil.
VALUE rb_obj_hide(VALUE obj)
Make the object invisible from Ruby code.
VALUE rb_equal(VALUE lhs, VALUE rhs)
This function is an optimised version of calling #==.
VALUE rb_stdout
STDOUT constant.
#define RB_GNUC_EXTENSION_BLOCK(x)
This is expanded to the passed token for non-GCC compilers.
Routines to manipulate encodings of strings.
static bool RB_OBJ_PROMOTED_RAW(VALUE obj)
This is the implementation of RB_OBJ_PROMOTED().
VALUE rb_ary_dup(VALUE ary)
Duplicates an array.
VALUE rb_ary_new(void)
Allocates a new, empty array.
VALUE rb_ary_push(VALUE ary, VALUE elem)
Special case of rb_ary_cat() that it adds only one element.
static int rb_check_arity(int argc, int min, int max)
Ensures that the passed integer is in the passed range.
VALUE rb_str_buf_append(VALUE dst, VALUE src)
Identical to rb_str_cat_cstr(), except it takes Ruby's string instead of C's.
VALUE rb_str_buf_new(long capa)
Allocates a "string buffer".
#define rb_str_new_cstr(str)
Identical to rb_str_new, except it assumes the passed pointer is a pointer to a C string.
const char * rb_sourcefile(void)
Resembles __FILE__.
VALUE rb_f_notimplement(int argc, const VALUE *argv, VALUE obj, VALUE marker)
Raises rb_eNotImpError.
int rb_sourceline(void)
Resembles __LINE__.
#define RB_SYM2ID
Just another name of rb_sym2id.
ID rb_sym2id(VALUE obj)
Converts an instance of rb_cSymbol into an ID.
int len
Length of the buffer.
void * rb_thread_call_with_gvl(void *(*func)(void *), void *data1)
(Re-)acquires the GVL.
#define strtod(s, e)
Just another name of ruby_strtod.
void ruby_qsort(void *, const size_t, const size_t, int(*)(const void *, const void *, void *), void *)
Reentrant implementation of quick sort.
#define DECIMAL_SIZE_OF_BITS(n)
an approximation of ceil(n * log10(2)), up to 1,048,576 (1<<20) without overflow within 32-bit calcul...
#define MEMZERO(p, type, n)
Handy macro to erase a region of memory.
VALUE type(ANYARGS)
ANYARGS-ed function type.
void rb_hash_foreach(VALUE q, int_type *w, VALUE e)
Iteration over the given hash.
VALUE rb_ensure(type *q, VALUE w, type *e, VALUE r)
An equivalent of ensure clause.
#define RARRAY_LEN
Just another name of rb_array_len.
static void RARRAY_ASET(VALUE ary, long i, VALUE v)
Assigns an object in an array.
#define RARRAY_AREF(a, i)
#define RBASIC(obj)
Convenient casting macro.
#define errno
Ractor-aware version of errno.
int ruby_native_thread_p(void)
Queries if the thread which calls this function is a ruby's thread.
static bool RB_SPECIAL_CONST_P(VALUE obj)
Checks if the given object is of enum ruby_special_consts.
#define RTEST
This is an old name of RB_TEST.
#define _(args)
This was a transition path from K&R to ANSI.
Ruby object's base components.
uintptr_t ID
Type that represents a Ruby identifier such as a variable name.
uintptr_t VALUE
Type that represents a Ruby object.
static enum ruby_value_type RB_BUILTIN_TYPE(VALUE obj)
Queries the type of the object.
static bool RB_TYPE_P(VALUE obj, enum ruby_value_type t)
Queries if the given object is of given type.
ruby_value_type
C-level type of an object.
@ RUBY_T_ICLASS
Hidden classes known as IClasses.
@ RUBY_T_FIXNUM
Integers formerly known as Fixnums.
@ RUBY_T_MASK
Bitmask of ruby_value_type.
@ RUBY_T_NONE
Non-object (swept etc.)