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;
582 size_t last_major_gc;
583 size_t uncollectible_wb_unprotected_objects;
584 size_t uncollectible_wb_unprotected_objects_limit;
586 size_t old_objects_limit;
588#if RGENGC_ESTIMATE_OLDMALLOC
589 size_t oldmalloc_increase;
590 size_t oldmalloc_increase_limit;
593#if RGENGC_CHECK_MODE >= 2
600 size_t considered_count_table[
T_MASK];
601 size_t moved_count_table[
T_MASK];
602 size_t moved_up_count_table[
T_MASK];
603 size_t moved_down_count_table[
T_MASK];
607 gc_compact_compare_func compare_func;
615#if GC_DEBUG_STRESS_TO_CLASS
616 VALUE stress_to_class;
619 rb_darray(
VALUE *) weak_references;
622 unsigned long live_ractor_cache_count;
625#ifndef HEAP_PAGE_ALIGN_LOG
627#define HEAP_PAGE_ALIGN_LOG 16
630#if RACTOR_CHECK_MODE || GC_DEBUG
631struct rvalue_overhead {
632# if RACTOR_CHECK_MODE
633 uint32_t _ractor_belonging_id;
642# define RVALUE_OVERHEAD (sizeof(struct { \
644 struct rvalue_overhead overhead; \
648size_t rb_gc_impl_obj_slot_size(
VALUE obj);
649# define GET_RVALUE_OVERHEAD(obj) ((struct rvalue_overhead *)((uintptr_t)obj + rb_gc_impl_obj_slot_size(obj)))
651# ifndef RVALUE_OVERHEAD
652# define RVALUE_OVERHEAD 0
656#define BASE_SLOT_SIZE (sizeof(struct RBasic) + sizeof(VALUE[RBIMPL_RVALUE_EMBED_LEN_MAX]) + RVALUE_OVERHEAD)
659# define MAX(a, b) (((a) > (b)) ? (a) : (b))
662# define MIN(a, b) (((a) < (b)) ? (a) : (b))
664#define roomof(x, y) (((x) + (y) - 1) / (y))
665#define CEILDIV(i, mod) roomof(i, mod)
667 HEAP_PAGE_ALIGN = (1UL << HEAP_PAGE_ALIGN_LOG),
668 HEAP_PAGE_ALIGN_MASK = (~(~0UL << HEAP_PAGE_ALIGN_LOG)),
669 HEAP_PAGE_SIZE = HEAP_PAGE_ALIGN,
670 HEAP_PAGE_OBJ_LIMIT = (
unsigned int)((HEAP_PAGE_SIZE -
sizeof(
struct heap_page_header)) / BASE_SLOT_SIZE),
671 HEAP_PAGE_BITMAP_LIMIT = CEILDIV(CEILDIV(HEAP_PAGE_SIZE, BASE_SLOT_SIZE), BITS_BITLENGTH),
672 HEAP_PAGE_BITMAP_SIZE = (BITS_SIZE * HEAP_PAGE_BITMAP_LIMIT),
674#define HEAP_PAGE_ALIGN (1 << HEAP_PAGE_ALIGN_LOG)
675#define HEAP_PAGE_SIZE HEAP_PAGE_ALIGN
677#if !defined(INCREMENTAL_MARK_STEP_ALLOCATIONS)
678# define INCREMENTAL_MARK_STEP_ALLOCATIONS 500
681#undef INIT_HEAP_PAGE_ALLOC_USE_MMAP
687static const bool HEAP_PAGE_ALLOC_USE_MMAP =
false;
689#elif defined(__wasm__)
693static const bool HEAP_PAGE_ALLOC_USE_MMAP =
false;
695#elif HAVE_CONST_PAGE_SIZE
697static const bool HEAP_PAGE_ALLOC_USE_MMAP = (PAGE_SIZE <= HEAP_PAGE_SIZE);
699#elif defined(PAGE_MAX_SIZE) && (PAGE_MAX_SIZE <= HEAP_PAGE_SIZE)
701static const bool HEAP_PAGE_ALLOC_USE_MMAP =
true;
703#elif defined(PAGE_SIZE)
705# define INIT_HEAP_PAGE_ALLOC_USE_MMAP (PAGE_SIZE <= HEAP_PAGE_SIZE)
707#elif defined(HAVE_SYSCONF) && defined(_SC_PAGE_SIZE)
709# define INIT_HEAP_PAGE_ALLOC_USE_MMAP (sysconf(_SC_PAGE_SIZE) <= HEAP_PAGE_SIZE)
713static const bool HEAP_PAGE_ALLOC_USE_MMAP =
false;
716#ifdef INIT_HEAP_PAGE_ALLOC_USE_MMAP
718# define HEAP_PAGE_ALLOC_USE_MMAP (heap_page_alloc_use_mmap != false)
720static bool heap_page_alloc_use_mmap;
723#define RVALUE_AGE_BIT_COUNT 2
724#define RVALUE_AGE_BIT_MASK (((bits_t)1 << RVALUE_AGE_BIT_COUNT) - 1)
725#define RVALUE_OLD_AGE 3
733 unsigned short slot_size;
734 unsigned short total_slots;
735 unsigned short free_slots;
736 unsigned short final_slots;
737 unsigned short pinned_slots;
739 unsigned int before_sweep : 1;
740 unsigned int has_remembered_objects : 1;
741 unsigned int has_uncollectible_wb_unprotected_objects : 1;
750 struct ccan_list_node page_node;
752 bits_t wb_unprotected_bits[HEAP_PAGE_BITMAP_LIMIT];
754 bits_t mark_bits[HEAP_PAGE_BITMAP_LIMIT];
755 bits_t uncollectible_bits[HEAP_PAGE_BITMAP_LIMIT];
756 bits_t marking_bits[HEAP_PAGE_BITMAP_LIMIT];
758 bits_t remembered_bits[HEAP_PAGE_BITMAP_LIMIT];
761 bits_t pinned_bits[HEAP_PAGE_BITMAP_LIMIT];
762 bits_t age_bits[HEAP_PAGE_BITMAP_LIMIT * RVALUE_AGE_BIT_COUNT];
769asan_lock_freelist(
struct heap_page *page)
771 asan_poison_memory_region(&page->freelist,
sizeof(
struct free_list *));
778asan_unlock_freelist(
struct heap_page *page)
780 asan_unpoison_memory_region(&page->freelist,
sizeof(
struct free_list *),
false);
786 if (page->total_slots == 0) {
787 GC_ASSERT(page->start == 0);
788 GC_ASSERT(page->slot_size == 0);
789 GC_ASSERT(page->heap == NULL);
790 GC_ASSERT(page->free_slots == 0);
791 asan_unpoisoning_memory_region(&page->freelist,
sizeof(&page->freelist)) {
792 GC_ASSERT(page->freelist == NULL);
798 GC_ASSERT(page->start != 0);
799 GC_ASSERT(page->slot_size != 0);
800 GC_ASSERT(page->heap != NULL);
806#define GET_PAGE_BODY(x) ((struct heap_page_body *)((bits_t)(x) & ~(HEAP_PAGE_ALIGN_MASK)))
807#define GET_PAGE_HEADER(x) (&GET_PAGE_BODY(x)->header)
808#define GET_HEAP_PAGE(x) (GET_PAGE_HEADER(x)->page)
810#define NUM_IN_PAGE(p) (((bits_t)(p) & HEAP_PAGE_ALIGN_MASK) / BASE_SLOT_SIZE)
811#define BITMAP_INDEX(p) (NUM_IN_PAGE(p) / BITS_BITLENGTH )
812#define BITMAP_OFFSET(p) (NUM_IN_PAGE(p) & (BITS_BITLENGTH-1))
813#define BITMAP_BIT(p) ((bits_t)1 << BITMAP_OFFSET(p))
816#define MARKED_IN_BITMAP(bits, p) ((bits)[BITMAP_INDEX(p)] & BITMAP_BIT(p))
817#define MARK_IN_BITMAP(bits, p) ((bits)[BITMAP_INDEX(p)] = (bits)[BITMAP_INDEX(p)] | BITMAP_BIT(p))
818#define CLEAR_IN_BITMAP(bits, p) ((bits)[BITMAP_INDEX(p)] = (bits)[BITMAP_INDEX(p)] & ~BITMAP_BIT(p))
821#define GET_HEAP_MARK_BITS(x) (&GET_HEAP_PAGE(x)->mark_bits[0])
822#define GET_HEAP_PINNED_BITS(x) (&GET_HEAP_PAGE(x)->pinned_bits[0])
823#define GET_HEAP_UNCOLLECTIBLE_BITS(x) (&GET_HEAP_PAGE(x)->uncollectible_bits[0])
824#define GET_HEAP_WB_UNPROTECTED_BITS(x) (&GET_HEAP_PAGE(x)->wb_unprotected_bits[0])
825#define GET_HEAP_MARKING_BITS(x) (&GET_HEAP_PAGE(x)->marking_bits[0])
827#define RVALUE_AGE_BITMAP_INDEX(n) (NUM_IN_PAGE(n) / (BITS_BITLENGTH / RVALUE_AGE_BIT_COUNT))
828#define RVALUE_AGE_BITMAP_OFFSET(n) ((NUM_IN_PAGE(n) % (BITS_BITLENGTH / RVALUE_AGE_BIT_COUNT)) * RVALUE_AGE_BIT_COUNT)
831RVALUE_AGE_GET(
VALUE obj)
833 bits_t *age_bits = GET_HEAP_PAGE(obj)->age_bits;
834 return (
int)(age_bits[RVALUE_AGE_BITMAP_INDEX(obj)] >> RVALUE_AGE_BITMAP_OFFSET(obj)) & RVALUE_AGE_BIT_MASK;
838RVALUE_AGE_SET(
VALUE obj,
int age)
841 bits_t *age_bits = GET_HEAP_PAGE(obj)->age_bits;
843 age_bits[RVALUE_AGE_BITMAP_INDEX(obj)] &= ~(RVALUE_AGE_BIT_MASK << (RVALUE_AGE_BITMAP_OFFSET(obj)));
845 age_bits[RVALUE_AGE_BITMAP_INDEX(obj)] |= ((bits_t)age << RVALUE_AGE_BITMAP_OFFSET(obj));
846 if (age == RVALUE_OLD_AGE) {
854#define malloc_limit objspace->malloc_params.limit
855#define malloc_increase objspace->malloc_params.increase
856#define malloc_allocated_size objspace->malloc_params.allocated_size
857#define heap_pages_lomem objspace->heap_pages.range[0]
858#define heap_pages_himem objspace->heap_pages.range[1]
859#define heap_pages_freeable_pages objspace->heap_pages.freeable_pages
860#define heap_pages_deferred_final objspace->heap_pages.deferred_final
861#define heaps objspace->heaps
862#define during_gc objspace->flags.during_gc
863#define finalizing objspace->atomic_flags.finalizing
864#define finalizer_table objspace->finalizer_table
865#define ruby_gc_stressful objspace->flags.gc_stressful
866#define ruby_gc_stress_mode objspace->gc_stress_mode
867#if GC_DEBUG_STRESS_TO_CLASS
868#define stress_to_class objspace->stress_to_class
869#define set_stress_to_class(c) (stress_to_class = (c))
871#define stress_to_class ((void)objspace, 0)
872#define set_stress_to_class(c) ((void)objspace, (c))
876#define dont_gc_on() (fprintf(stderr, "dont_gc_on@%s:%d\n", __FILE__, __LINE__), objspace->flags.dont_gc = 1)
877#define dont_gc_off() (fprintf(stderr, "dont_gc_off@%s:%d\n", __FILE__, __LINE__), objspace->flags.dont_gc = 0)
878#define dont_gc_set(b) (fprintf(stderr, "dont_gc_set(%d)@%s:%d\n", __FILE__, __LINE__), objspace->flags.dont_gc = (int)(b))
879#define dont_gc_val() (objspace->flags.dont_gc)
881#define dont_gc_on() (objspace->flags.dont_gc = 1)
882#define dont_gc_off() (objspace->flags.dont_gc = 0)
883#define dont_gc_set(b) (objspace->flags.dont_gc = (int)(b))
884#define dont_gc_val() (objspace->flags.dont_gc)
887#define gc_config_full_mark_set(b) (objspace->gc_config.full_mark = (int)(b))
888#define gc_config_full_mark_val (objspace->gc_config.full_mark)
890#ifndef DURING_GC_COULD_MALLOC_REGION_START
891# define DURING_GC_COULD_MALLOC_REGION_START() \
892 assert(rb_during_gc()); \
893 bool _prev_enabled = rb_gc_impl_gc_enabled_p(objspace); \
894 rb_gc_impl_gc_disable(objspace, false)
897#ifndef DURING_GC_COULD_MALLOC_REGION_END
898# define DURING_GC_COULD_MALLOC_REGION_END() \
899 if (_prev_enabled) rb_gc_impl_gc_enable(objspace)
902static inline enum gc_mode
903gc_mode_verify(
enum gc_mode mode)
905#if RGENGC_CHECK_MODE > 0
908 case gc_mode_marking:
909 case gc_mode_sweeping:
910 case gc_mode_compacting:
913 rb_bug(
"gc_mode_verify: unreachable (%d)", (
int)mode);
922 for (
int i = 0; i < HEAP_COUNT; i++) {
923 if ((&heaps[i])->sweeping_page) {
934 for (
int i = 0; i < HEAP_COUNT; i++) {
935 count += (&heaps[i])->total_pages;
944 for (
int i = 0; i < HEAP_COUNT; i++) {
946 count += heap->total_allocated_objects;
955 for (
int i = 0; i < HEAP_COUNT; i++) {
957 count += heap->total_freed_objects;
966 for (
int i = 0; i < HEAP_COUNT; i++) {
968 count += heap->final_slots_count;
973#define gc_mode(objspace) gc_mode_verify((enum gc_mode)(objspace)->flags.mode)
974#define gc_mode_set(objspace, m) ((objspace)->flags.mode = (unsigned int)gc_mode_verify(m))
975#define gc_needs_major_flags objspace->rgengc.need_major_gc
977#define is_marking(objspace) (gc_mode(objspace) == gc_mode_marking)
978#define is_sweeping(objspace) (gc_mode(objspace) == gc_mode_sweeping)
979#define is_full_marking(objspace) ((objspace)->flags.during_minor_gc == FALSE)
980#define is_incremental_marking(objspace) ((objspace)->flags.during_incremental_marking != FALSE)
981#define will_be_incremental_marking(objspace) ((objspace)->rgengc.need_major_gc != GPR_FLAG_NONE)
982#define GC_INCREMENTAL_SWEEP_SLOT_COUNT 2048
983#define GC_INCREMENTAL_SWEEP_POOL_SLOT_COUNT 1024
984#define is_lazy_sweeping(objspace) (GC_ENABLE_LAZY_SWEEP && has_sweeping_pages(objspace))
986#if SIZEOF_LONG == SIZEOF_VOIDP
987# define obj_id_to_ref(objid) ((objid) ^ FIXNUM_FLAG)
988#elif SIZEOF_LONG_LONG == SIZEOF_VOIDP
989# define obj_id_to_ref(objid) (FIXNUM_P(objid) ? \
990 ((objid) ^ FIXNUM_FLAG) : (NUM2PTR(objid) << 1))
998 void (*dfree)(
void *);
1002#define RZOMBIE(o) ((struct RZombie *)(o))
1004static bool ruby_enable_autocompact =
false;
1005#if RGENGC_CHECK_MODE
1006static gc_compact_compare_func ruby_autocompact_compare_func;
1010static int garbage_collect(
rb_objspace_t *,
unsigned int reason);
1015enum gc_enter_event {
1016 gc_enter_event_start,
1017 gc_enter_event_continue,
1018 gc_enter_event_rest,
1019 gc_enter_event_finalizer,
1022static inline void gc_enter(
rb_objspace_t *
objspace,
enum gc_enter_event event,
unsigned int *lock_lev);
1023static inline void gc_exit(
rb_objspace_t *
objspace,
enum gc_enter_event event,
unsigned int *lock_lev);
1038static int gc_mark_stacked_objects_incremental(
rb_objspace_t *,
size_t count);
1039NO_SANITIZE(
"memory",
static inline bool is_pointer_to_heap(
rb_objspace_t *
objspace,
const void *ptr));
1041static void gc_verify_internal_consistency(
void *objspace_ptr);
1043static double getrusage_time(
void);
1047static inline void gc_prof_mark_timer_start(
rb_objspace_t *);
1049static inline void gc_prof_sweep_timer_start(
rb_objspace_t *);
1050static inline void gc_prof_sweep_timer_stop(
rb_objspace_t *);
1054#define gc_prof_record(objspace) (objspace)->profile.current_record
1055#define gc_prof_enabled(objspace) ((objspace)->profile.run && (objspace)->profile.current_record)
1057#ifdef HAVE_VA_ARGS_MACRO
1058# define gc_report(level, objspace, ...) \
1059 if (!RGENGC_DEBUG_ENABLED(level)) {} else gc_report_body(level, objspace, __VA_ARGS__)
1061# define gc_report if (!RGENGC_DEBUG_ENABLED(0)) {} else gc_report_body
1063PRINTF_ARGS(
static void gc_report_body(
int level,
rb_objspace_t *
objspace,
const char *fmt, ...), 3, 4);
1065static void gc_finalize_deferred(
void *dmy);
1076#if defined(__GNUC__) && defined(__i386__)
1077typedef unsigned long long tick_t;
1078#define PRItick "llu"
1082 unsigned long long int x;
1083 __asm__ __volatile__ (
"rdtsc" :
"=A" (x));
1087#elif defined(__GNUC__) && defined(__x86_64__)
1088typedef unsigned long long tick_t;
1089#define PRItick "llu"
1091static __inline__ tick_t
1094 unsigned long hi, lo;
1095 __asm__ __volatile__ (
"rdtsc" :
"=a"(lo),
"=d"(hi));
1096 return ((
unsigned long long)lo)|( ((
unsigned long long)hi)<<32);
1099#elif defined(__powerpc64__) && (GCC_VERSION_SINCE(4,8,0) || defined(__clang__))
1100typedef unsigned long long tick_t;
1101#define PRItick "llu"
1103static __inline__ tick_t
1106 unsigned long long val = __builtin_ppc_get_timebase();
1110#elif defined(__POWERPC__) && defined(__APPLE__)
1114typedef unsigned long long tick_t;
1115#define PRItick "llu"
1117static __inline__ tick_t
1120 unsigned long int upper, lower, tmp;
1121 # define mftbu(r) __asm__ volatile("mftbu %0" : "=r"(r))
1122 # define mftb(r) __asm__ volatile("mftb %0" : "=r"(r))
1127 }
while (tmp != upper);
1128 return ((tick_t)upper << 32) | lower;
1131#elif defined(__aarch64__) && defined(__GNUC__)
1132typedef unsigned long tick_t;
1135static __inline__ tick_t
1139 __asm__ __volatile__ (
"mrs %0, cntvct_el0" :
"=r" (val));
1144#elif defined(_WIN32) && defined(_MSC_VER)
1146typedef unsigned __int64 tick_t;
1147#define PRItick "llu"
1156typedef clock_t tick_t;
1157#define PRItick "llu"
1166#define MEASURE_LINE(expr) expr
1171#define RVALUE_MARKED_BITMAP(obj) MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(obj), (obj))
1172#define RVALUE_WB_UNPROTECTED_BITMAP(obj) MARKED_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), (obj))
1173#define RVALUE_MARKING_BITMAP(obj) MARKED_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), (obj))
1174#define RVALUE_UNCOLLECTIBLE_BITMAP(obj) MARKED_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(obj), (obj))
1175#define RVALUE_PINNED_BITMAP(obj) MARKED_IN_BITMAP(GET_HEAP_PINNED_BITS(obj), (obj))
1180 check_rvalue_consistency(
objspace, obj);
1181 return RVALUE_MARKED_BITMAP(obj) != 0;
1187 check_rvalue_consistency(
objspace, obj);
1188 return RVALUE_PINNED_BITMAP(obj) != 0;
1194 check_rvalue_consistency(
objspace, obj);
1195 return RVALUE_WB_UNPROTECTED_BITMAP(obj) != 0;
1201 check_rvalue_consistency(
objspace, obj);
1202 return RVALUE_MARKING_BITMAP(obj) != 0;
1208 check_rvalue_consistency(
objspace, obj);
1209 return MARKED_IN_BITMAP(GET_HEAP_PAGE(obj)->remembered_bits, obj) != 0;
1215 check_rvalue_consistency(
objspace, obj);
1216 return RVALUE_UNCOLLECTIBLE_BITMAP(obj) != 0;
1219#define RVALUE_PAGE_WB_UNPROTECTED(page, obj) MARKED_IN_BITMAP((page)->wb_unprotected_bits, (obj))
1220#define RVALUE_PAGE_UNCOLLECTIBLE(page, obj) MARKED_IN_BITMAP((page)->uncollectible_bits, (obj))
1221#define RVALUE_PAGE_MARKING(page, obj) MARKED_IN_BITMAP((page)->marking_bits, (obj))
1232 int lev = RB_GC_VM_LOCK_NO_BARRIER();
1235 fprintf(stderr,
"check_rvalue_consistency: %p is a special const.\n", (
void *)obj);
1238 else if (!is_pointer_to_heap(
objspace, (
void *)obj)) {
1240 while (empty_page) {
1241 if ((uintptr_t)empty_page->body <= (uintptr_t)obj &&
1242 (uintptr_t)obj < (uintptr_t)empty_page->body + HEAP_PAGE_SIZE) {
1243 GC_ASSERT(heap_page_in_global_empty_pages_pool(
objspace, empty_page));
1244 fprintf(stderr,
"check_rvalue_consistency: %p is in an empty page (%p).\n",
1245 (
void *)obj, (
void *)empty_page);
1250 fprintf(stderr,
"check_rvalue_consistency: %p is not a Ruby object.\n", (
void *)obj);
1256 const int wb_unprotected_bit = RVALUE_WB_UNPROTECTED_BITMAP(obj) != 0;
1257 const int uncollectible_bit = RVALUE_UNCOLLECTIBLE_BITMAP(obj) != 0;
1258 const int mark_bit = RVALUE_MARKED_BITMAP(obj) != 0;
1259 const int marking_bit = RVALUE_MARKING_BITMAP(obj) != 0;
1260 const int remembered_bit = MARKED_IN_BITMAP(GET_HEAP_PAGE(obj)->remembered_bits, obj) != 0;
1261 const int age = RVALUE_AGE_GET((
VALUE)obj);
1263 if (heap_page_in_global_empty_pages_pool(
objspace, GET_HEAP_PAGE(obj))) {
1264 fprintf(stderr,
"check_rvalue_consistency: %s is in tomb page.\n", rb_obj_info(obj));
1268 fprintf(stderr,
"check_rvalue_consistency: %s is T_NONE.\n", rb_obj_info(obj));
1272 fprintf(stderr,
"check_rvalue_consistency: %s is T_ZOMBIE.\n", rb_obj_info(obj));
1277 rb_obj_memsize_of((
VALUE)obj);
1284 if (age > 0 && wb_unprotected_bit) {
1285 fprintf(stderr,
"check_rvalue_consistency: %s is not WB protected, but age is %d > 0.\n", rb_obj_info(obj), age);
1289 if (!is_marking(
objspace) && uncollectible_bit && !mark_bit) {
1290 fprintf(stderr,
"check_rvalue_consistency: %s is uncollectible, but is not marked while !gc.\n", rb_obj_info(obj));
1295 if (uncollectible_bit && age != RVALUE_OLD_AGE && !wb_unprotected_bit) {
1296 fprintf(stderr,
"check_rvalue_consistency: %s is uncollectible, but not old (age: %d) and not WB unprotected.\n",
1297 rb_obj_info(obj), age);
1300 if (remembered_bit && age != RVALUE_OLD_AGE) {
1301 fprintf(stderr,
"check_rvalue_consistency: %s is remembered, but not old (age: %d).\n",
1302 rb_obj_info(obj), age);
1314 if (is_incremental_marking(
objspace) && marking_bit) {
1315 if (!is_marking(
objspace) && !mark_bit) {
1316 fprintf(stderr,
"check_rvalue_consistency: %s is marking, but not marked.\n", rb_obj_info(obj));
1322 RB_GC_VM_UNLOCK_NO_BARRIER(lev);
1324 if (err > 0 && terminate) {
1325 rb_bug(
"check_rvalue_consistency_force: there is %d errors.", err);
1330#if RGENGC_CHECK_MODE == 0
1340 check_rvalue_consistency_force(
objspace, obj, TRUE);
1353 asan_unpoisoning_object(obj) {
1364 check_rvalue_consistency(
objspace, obj);
1373 MARK_IN_BITMAP(&page->uncollectible_bits[0], obj);
1376#if RGENGC_PROFILE >= 2
1377 objspace->profile.total_promoted_count++;
1385 RB_DEBUG_COUNTER_INC(obj_promote);
1386 RVALUE_PAGE_OLD_UNCOLLECTIBLE_SET(
objspace, GET_HEAP_PAGE(obj), obj);
1393 int age = RVALUE_AGE_GET((
VALUE)obj);
1395 if (RGENGC_CHECK_MODE && age == RVALUE_OLD_AGE) {
1396 rb_bug(
"RVALUE_AGE_INC: can not increment age of OLD object %s.", rb_obj_info(obj));
1400 RVALUE_AGE_SET(obj, age);
1402 if (age == RVALUE_OLD_AGE) {
1403 RVALUE_OLD_UNCOLLECTIBLE_SET(
objspace, obj);
1406 check_rvalue_consistency(
objspace, obj);
1412 check_rvalue_consistency(
objspace, obj);
1413 GC_ASSERT(!RVALUE_OLD_P(
objspace, obj));
1414 RVALUE_AGE_SET(obj, RVALUE_OLD_AGE - 1);
1415 check_rvalue_consistency(
objspace, obj);
1419RVALUE_AGE_RESET(
VALUE obj)
1421 RVALUE_AGE_SET(obj, 0);
1427 check_rvalue_consistency(
objspace, obj);
1428 GC_ASSERT(RVALUE_OLD_P(
objspace, obj));
1430 if (!is_incremental_marking(
objspace) && RVALUE_REMEMBERED(
objspace, obj)) {
1431 CLEAR_IN_BITMAP(GET_HEAP_PAGE(obj)->remembered_bits, obj);
1434 CLEAR_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(obj), obj);
1435 RVALUE_AGE_RESET(obj);
1437 if (RVALUE_MARKED(
objspace, obj)) {
1441 check_rvalue_consistency(
objspace, obj);
1453 return !RVALUE_MARKED(
objspace, obj);
1457rb_gc_impl_gc_enabled_p(
void *objspace_ptr)
1460 return !dont_gc_val();
1464rb_gc_impl_gc_enable(
void *objspace_ptr)
1472rb_gc_impl_gc_disable(
void *objspace_ptr,
bool finish_current_gc)
1476 if (finish_current_gc) {
1490 return calloc(1, n);
1494rb_gc_impl_set_event_hook(
void *objspace_ptr,
const rb_event_flag_t event)
1502rb_gc_impl_get_total_time(
void *objspace_ptr)
1506 unsigned long long marking_time =
objspace->profile.marking_time_ns;
1507 unsigned long long sweeping_time =
objspace->profile.sweeping_time_ns;
1509 return marking_time + sweeping_time;
1513rb_gc_impl_set_measure_total_time(
void *objspace_ptr,
VALUE flag)
1521rb_gc_impl_get_measure_total_time(
void *objspace_ptr)
1531 size_t heap_idx = heap - heaps;
1532 return gc_params.heap_init_slots[heap_idx];
1537rb_gc_impl_garbage_object_p(
void *objspace_ptr,
VALUE ptr)
1543 asan_unpoisoning_object(ptr) {
1555 if (dead)
return true;
1556 return is_lazy_sweeping(
objspace) && GET_HEAP_PAGE(ptr)->flags.before_sweep &&
1567 rb_asan_unpoison_object(obj,
false);
1569 asan_unlock_freelist(page);
1573 slot->next = page->freelist;
1574 page->freelist = slot;
1575 asan_lock_freelist(page);
1577 RVALUE_AGE_RESET(obj);
1579 if (RGENGC_CHECK_MODE &&
1581 !(page->start <= (uintptr_t)obj &&
1582 (uintptr_t)obj < ((uintptr_t)page->start + (page->total_slots * page->slot_size)) &&
1583 obj % BASE_SLOT_SIZE == 0)) {
1584 rb_bug(
"heap_page_add_freeobj: %p is not rvalue.", (
void *)obj);
1587 rb_asan_poison_object(obj);
1588 gc_report(3,
objspace,
"heap_page_add_freeobj: add %p to freelist\n", (
void *)obj);
1593 rb_heap_t *heap,
size_t free_slots,
size_t total_slots)
1595 double goal_ratio = gc_params.heap_free_slots_goal_ratio;
1596 size_t target_total_slots;
1598 if (goal_ratio == 0.0) {
1599 target_total_slots = (size_t)(total_slots * gc_params.growth_factor);
1601 else if (total_slots == 0) {
1602 target_total_slots = minimum_slots_for_heap(
objspace, heap);
1608 double f = (double)(total_slots - free_slots) / ((1 - goal_ratio) * total_slots);
1610 if (f > gc_params.growth_factor) f = gc_params.growth_factor;
1611 if (f < 1.0) f = 1.1;
1613 target_total_slots = (size_t)(f * total_slots);
1617 "free_slots(%8"PRIuSIZE
")/total_slots(%8"PRIuSIZE
")=%1.2f,"
1618 " G(%1.2f), f(%1.2f),"
1619 " total_slots(%8"PRIuSIZE
") => target_total_slots(%8"PRIuSIZE
")\n",
1620 free_slots, total_slots, free_slots/(
double)total_slots,
1621 goal_ratio, f, total_slots, target_total_slots);
1625 if (gc_params.growth_max_slots > 0) {
1626 size_t max_total_slots = (size_t)(total_slots + gc_params.growth_max_slots);
1627 if (target_total_slots > max_total_slots) target_total_slots = max_total_slots;
1630 size_t extend_slot_count = target_total_slots - total_slots;
1632 if (extend_slot_count == 0) extend_slot_count = 1;
1634 objspace->heap_pages.allocatable_slots += extend_slot_count;
1640 asan_unlock_freelist(page);
1641 GC_ASSERT(page->free_slots != 0);
1642 GC_ASSERT(page->freelist != NULL);
1644 page->free_next = heap->free_pages;
1645 heap->free_pages = page;
1647 RUBY_DEBUG_LOG(
"page:%p freelist:%p", (
void *)page, (
void *)page->freelist);
1649 asan_lock_freelist(page);
1655 asan_unlock_freelist(page);
1656 GC_ASSERT(page->free_slots != 0);
1657 GC_ASSERT(page->freelist != NULL);
1659 page->free_next = heap->pooled_pages;
1660 heap->pooled_pages = page;
1661 objspace->rincgc.pooled_slots += page->free_slots;
1663 asan_lock_freelist(page);
1669 ccan_list_del(&page->page_node);
1670 heap->total_pages--;
1671 heap->total_slots -= page->total_slots;
1675gc_aligned_free(
void *ptr,
size_t size)
1677#if defined __MINGW32__
1678 __mingw_aligned_free(ptr);
1681#elif defined(HAVE_POSIX_MEMALIGN) || defined(HAVE_MEMALIGN)
1684 free(((
void**)ptr)[-1]);
1691 GC_ASSERT((uintptr_t)page_body % HEAP_PAGE_ALIGN == 0);
1693 if (HEAP_PAGE_ALLOC_USE_MMAP) {
1695 GC_ASSERT(HEAP_PAGE_SIZE % sysconf(_SC_PAGE_SIZE) == 0);
1696 if (munmap(page_body, HEAP_PAGE_SIZE)) {
1697 rb_bug(
"heap_page_body_free: munmap failed");
1702 gc_aligned_free(page_body, HEAP_PAGE_SIZE);
1709 objspace->heap_pages.freed_pages++;
1710 heap_page_body_free(page->body);
1717 if (
objspace->empty_pages != NULL && heap_pages_freeable_pages > 0) {
1718 GC_ASSERT(
objspace->empty_pages_count > 0);
1723 for (i = j = 0; i < rb_darray_size(
objspace->heap_pages.sorted); i++) {
1726 if (heap_page_in_global_empty_pages_pool(
objspace, page) && heap_pages_freeable_pages > 0) {
1728 heap_pages_freeable_pages--;
1731 if (heap_page_in_global_empty_pages_pool(
objspace, page)) {
1732 page->free_next =
objspace->empty_pages;
1738 rb_darray_set(
objspace->heap_pages.sorted, j, page);
1744 rb_darray_pop(
objspace->heap_pages.sorted, i - j);
1745 GC_ASSERT(rb_darray_size(
objspace->heap_pages.sorted) == j);
1748 uintptr_t himem = (uintptr_t)hipage->body + HEAP_PAGE_SIZE;
1749 GC_ASSERT(himem <= heap_pages_himem);
1750 heap_pages_himem = himem;
1753 uintptr_t lomem = (uintptr_t)lopage->body +
sizeof(
struct heap_page_header);
1754 GC_ASSERT(lomem >= heap_pages_lomem);
1755 heap_pages_lomem = lomem;
1760gc_aligned_malloc(
size_t alignment,
size_t size)
1763 GC_ASSERT(((alignment - 1) & alignment) == 0);
1764 GC_ASSERT(alignment %
sizeof(
void*) == 0);
1768#if defined __MINGW32__
1769 res = __mingw_aligned_malloc(size, alignment);
1771 void *_aligned_malloc(
size_t,
size_t);
1772 res = _aligned_malloc(size, alignment);
1773#elif defined(HAVE_POSIX_MEMALIGN)
1774 if (posix_memalign(&res, alignment, size) != 0) {
1777#elif defined(HAVE_MEMALIGN)
1778 res = memalign(alignment, size);
1781 res = malloc(alignment + size +
sizeof(
void*));
1782 aligned = (
char*)res + alignment +
sizeof(
void*);
1783 aligned -= ((
VALUE)aligned & (alignment - 1));
1784 ((
void**)aligned)[-1] = res;
1785 res = (
void*)aligned;
1788 GC_ASSERT((uintptr_t)res % alignment == 0);
1794heap_page_body_allocate(
void)
1798 if (HEAP_PAGE_ALLOC_USE_MMAP) {
1800 GC_ASSERT(HEAP_PAGE_ALIGN % sysconf(_SC_PAGE_SIZE) == 0);
1802 size_t mmap_size = HEAP_PAGE_ALIGN + HEAP_PAGE_SIZE;
1803 char *ptr = mmap(NULL, mmap_size,
1804 PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
1805 if (ptr == MAP_FAILED) {
1814#if defined(HAVE_SYS_PRCTL_H) && defined(PR_SET_VMA) && defined(PR_SET_VMA_ANON_NAME)
1815 prctl(PR_SET_VMA, PR_SET_VMA_ANON_NAME, ptr, mmap_size,
"Ruby:GC:default:heap_page_body_allocate");
1819 char *aligned = ptr + HEAP_PAGE_ALIGN;
1820 aligned -= ((
VALUE)aligned & (HEAP_PAGE_ALIGN - 1));
1821 GC_ASSERT(aligned > ptr);
1822 GC_ASSERT(aligned <= ptr + HEAP_PAGE_ALIGN);
1824 size_t start_out_of_range_size = aligned - ptr;
1825 GC_ASSERT(start_out_of_range_size % sysconf(_SC_PAGE_SIZE) == 0);
1826 if (start_out_of_range_size > 0) {
1827 if (munmap(ptr, start_out_of_range_size)) {
1828 rb_bug(
"heap_page_body_allocate: munmap failed for start");
1832 size_t end_out_of_range_size = HEAP_PAGE_ALIGN - start_out_of_range_size;
1833 GC_ASSERT(end_out_of_range_size % sysconf(_SC_PAGE_SIZE) == 0);
1834 if (end_out_of_range_size > 0) {
1835 if (munmap(aligned + HEAP_PAGE_SIZE, end_out_of_range_size)) {
1836 rb_bug(
"heap_page_body_allocate: munmap failed for end");
1844 page_body = gc_aligned_malloc(HEAP_PAGE_ALIGN, HEAP_PAGE_SIZE);
1847 GC_ASSERT((uintptr_t)page_body % HEAP_PAGE_ALIGN == 0);
1856 if (
objspace->empty_pages == NULL) {
1857 GC_ASSERT(
objspace->empty_pages_count == 0);
1860 GC_ASSERT(
objspace->empty_pages_count > 0);
1863 objspace->empty_pages = page->free_next;
1873 if (page_body == 0) {
1879 heap_page_body_free(page_body);
1884 uintptr_t end = (uintptr_t)page_body + HEAP_PAGE_SIZE;
1887 size_t hi = rb_darray_size(
objspace->heap_pages.sorted);
1891 size_t mid = (lo + hi) / 2;
1892 mid_page = rb_darray_get(
objspace->heap_pages.sorted, mid);
1893 if ((uintptr_t)mid_page->start < start) {
1896 else if ((uintptr_t)mid_page->start > start) {
1900 rb_bug(
"same heap page is allocated: %p at %"PRIuVALUE, (
void *)page_body, (
VALUE)mid);
1904 rb_darray_insert_without_gc(&
objspace->heap_pages.sorted, hi, page);
1906 if (heap_pages_lomem == 0 || heap_pages_lomem > start) heap_pages_lomem = start;
1907 if (heap_pages_himem < end) heap_pages_himem = end;
1909 page->body = page_body;
1910 page_body->header.page = page;
1912 objspace->heap_pages.allocated_pages++;
1921 GC_ASSERT(!heap->sweeping_page);
1922 GC_ASSERT(heap_page_in_global_empty_pages_pool(
objspace, page));
1926 if (start % BASE_SLOT_SIZE != 0) {
1927 int delta = BASE_SLOT_SIZE - (start % BASE_SLOT_SIZE);
1928 start = start + delta;
1929 GC_ASSERT(NUM_IN_PAGE(start) == 0 || NUM_IN_PAGE(start) == 1);
1935 if (NUM_IN_PAGE(start) == 1) {
1936 start += heap->slot_size - BASE_SLOT_SIZE;
1939 GC_ASSERT(NUM_IN_PAGE(start) * BASE_SLOT_SIZE % heap->slot_size == 0);
1942 int slot_count = (int)((HEAP_PAGE_SIZE - (start - (uintptr_t)page->body))/heap->slot_size);
1944 page->start = start;
1945 page->total_slots = slot_count;
1946 page->slot_size = heap->slot_size;
1949 asan_unlock_freelist(page);
1950 page->freelist = NULL;
1951 asan_unpoison_memory_region(page->body, HEAP_PAGE_SIZE,
false);
1952 for (
VALUE p = (
VALUE)start; p < start + (slot_count * heap->slot_size); p += heap->slot_size) {
1953 heap_page_add_freeobj(
objspace, page, p);
1955 asan_lock_freelist(page);
1957 page->free_slots = slot_count;
1959 heap->total_allocated_pages++;
1961 ccan_list_add_tail(&heap->pages, &page->page_node);
1962 heap->total_pages++;
1963 heap->total_slots += page->total_slots;
1969 gc_report(1,
objspace,
"heap_page_allocate_and_initialize: rb_darray_size(objspace->heap_pages.sorted): %"PRIdSIZE
", "
1970 "allocatable_slots: %"PRIdSIZE
", heap->total_pages: %"PRIdSIZE
"\n",
1971 rb_darray_size(
objspace->heap_pages.sorted),
objspace->heap_pages.allocatable_slots, heap->total_pages);
1973 bool allocated =
false;
1976 if (page == NULL &&
objspace->heap_pages.allocatable_slots > 0) {
1977 page = heap_page_allocate(
objspace);
1980 GC_ASSERT(page != NULL);
1984 heap_add_page(
objspace, heap, page);
1985 heap_add_freepage(heap, page);
1988 if (
objspace->heap_pages.allocatable_slots > (
size_t)page->total_slots) {
1989 objspace->heap_pages.allocatable_slots -= page->total_slots;
1992 objspace->heap_pages.allocatable_slots = 0;
1997 return page != NULL;
2003 size_t prev_allocatable_slots =
objspace->heap_pages.allocatable_slots;
2005 objspace->heap_pages.allocatable_slots = 1;
2006 heap_page_allocate_and_initialize(
objspace, heap);
2007 GC_ASSERT(heap->free_pages != NULL);
2008 objspace->heap_pages.allocatable_slots = prev_allocatable_slots;
2014 unsigned int lock_lev;
2015 gc_enter(
objspace, gc_enter_event_continue, &lock_lev);
2018 if (is_incremental_marking(
objspace)) {
2019 if (gc_marks_continue(
objspace, heap)) {
2026 if (heap->free_pages == NULL && is_lazy_sweeping(
objspace)) {
2030 gc_exit(
objspace, gc_enter_event_continue, &lock_lev);
2036 GC_ASSERT(heap->free_pages == NULL);
2038 if (heap->total_slots < gc_params.heap_init_slots[heap - heaps] &&
2039 heap->sweeping_page == NULL) {
2040 heap_page_allocate_and_initialize_force(
objspace, heap);
2041 GC_ASSERT(heap->free_pages != NULL);
2048 if (heap->free_pages == NULL) {
2049 heap_page_allocate_and_initialize(
objspace, heap);
2054 if (heap->free_pages == NULL) {
2055 GC_ASSERT(
objspace->empty_pages_count == 0);
2056 GC_ASSERT(
objspace->heap_pages.allocatable_slots == 0);
2058 if (gc_start(
objspace, GPR_FLAG_NEWOBJ) == FALSE) {
2062 if (
objspace->heap_pages.allocatable_slots == 0 && !gc_config_full_mark_val) {
2063 heap_allocatable_slots_expand(
objspace, heap,
2064 heap->freed_slots + heap->empty_slots,
2066 GC_ASSERT(
objspace->heap_pages.allocatable_slots > 0);
2074 if (heap->free_pages == NULL && !heap_page_allocate_and_initialize(
objspace, heap)) {
2075 if (gc_needs_major_flags == GPR_FLAG_NONE) {
2076 rb_bug(
"cannot create a new page after GC");
2079 if (gc_start(
objspace, GPR_FLAG_NEWOBJ) == FALSE) {
2086 if (heap->free_pages == NULL &&
2087 !heap_page_allocate_and_initialize(
objspace, heap)) {
2088 rb_bug(
"cannot create a new page after major GC");
2096 GC_ASSERT(heap->free_pages != NULL);
2110static inline const char*
2111rb_gc_impl_source_location_cstr(
int *ptr)
2132 RBASIC(obj)->flags = flags;
2134#if RBASIC_SHAPE_ID_FIELD
2135 RBASIC(obj)->shape_id = 0;
2140 RVALUE_AGE_SET_CANDIDATE(
objspace, obj);
2143#if RACTOR_CHECK_MODE
2144 void rb_ractor_setup_belonging(
VALUE obj);
2145 rb_ractor_setup_belonging(obj);
2148#if RGENGC_CHECK_MODE
2149 newobj_fill(obj, 0, 0, 0);
2151 int lev = RB_GC_VM_LOCK_NO_BARRIER();
2153 check_rvalue_consistency(
objspace, obj);
2155 GC_ASSERT(RVALUE_MARKED(
objspace, obj) == FALSE);
2156 GC_ASSERT(RVALUE_MARKING(
objspace, obj) == FALSE);
2157 GC_ASSERT(RVALUE_OLD_P(
objspace, obj) == FALSE);
2158 GC_ASSERT(RVALUE_WB_UNPROTECTED(
objspace, obj) == FALSE);
2160 if (RVALUE_REMEMBERED(
objspace, obj)) rb_bug(
"newobj: %s is remembered.", rb_obj_info(obj));
2162 RB_GC_VM_UNLOCK_NO_BARRIER(lev);
2165 if (RB_UNLIKELY(wb_protected == FALSE)) {
2166 MARK_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), obj);
2171 objspace->profile.total_generated_normal_object_count++;
2172#if RGENGC_PROFILE >= 2
2177 objspace->profile.total_generated_shady_object_count++;
2178#if RGENGC_PROFILE >= 2
2185 GET_RVALUE_OVERHEAD(obj)->file = rb_gc_impl_source_location_cstr(&GET_RVALUE_OVERHEAD(obj)->line);
2189 gc_report(5,
objspace,
"newobj: %s\n", rb_obj_info(obj));
2196rb_gc_impl_obj_slot_size(
VALUE obj)
2198 return GET_HEAP_PAGE(obj)->slot_size - RVALUE_OVERHEAD;
2202heap_slot_size(
unsigned char pool_id)
2204 GC_ASSERT(pool_id < HEAP_COUNT);
2206 size_t slot_size = (1 << pool_id) * BASE_SLOT_SIZE;
2208#if RGENGC_CHECK_MODE
2210 GC_ASSERT(heaps[pool_id].slot_size == (
short)slot_size);
2213 slot_size -= RVALUE_OVERHEAD;
2219rb_gc_impl_size_allocatable_p(
size_t size)
2221 return size <= heap_slot_size(HEAP_COUNT - 1);
2224static const size_t ALLOCATED_COUNT_STEP = 1024;
2231 struct free_slot *p = heap_cache->freelist;
2233 if (RB_UNLIKELY(is_incremental_marking(
objspace))) {
2235 if (cache->incremental_mark_step_allocated_slots >= INCREMENTAL_MARK_STEP_ALLOCATIONS) {
2240 cache->incremental_mark_step_allocated_slots++;
2246 rb_asan_unpoison_object(obj,
true);
2247 heap_cache->freelist = p->next;
2249 if (rb_gc_multi_ractor_p()) {
2250 heap_cache->allocated_objects_count++;
2252 if (heap_cache->allocated_objects_count >= ALLOCATED_COUNT_STEP) {
2254 heap_cache->allocated_objects_count = 0;
2259 heap->total_allocated_objects++;
2260 GC_ASSERT(heap->total_slots >=
2261 (heap->total_allocated_objects - heap->total_freed_objects - heap->final_slots_count));
2264#if RGENGC_CHECK_MODE
2265 GC_ASSERT(rb_gc_impl_obj_slot_size(obj) == heap_slot_size(heap_idx));
2267 MEMZERO((
char *)obj,
char, heap_slot_size(heap_idx));
2281 if (heap->free_pages == NULL) {
2285 page = heap->free_pages;
2286 heap->free_pages = page->free_next;
2288 GC_ASSERT(page->free_slots != 0);
2290 asan_unlock_freelist(page);
2299 gc_report(3,
objspace,
"ractor_set_cache: Using page %p\n", (
void *)page->body);
2303 GC_ASSERT(heap_cache->freelist == NULL);
2304 GC_ASSERT(page->free_slots != 0);
2305 GC_ASSERT(page->freelist != NULL);
2307 heap_cache->using_page = page;
2308 heap_cache->freelist = page->freelist;
2309 page->free_slots = 0;
2310 page->freelist = NULL;
2312 rb_asan_unpoison_object((
VALUE)heap_cache->freelist,
false);
2314 rb_asan_poison_object((
VALUE)heap_cache->freelist);
2318heap_idx_for_size(
size_t size)
2320 size += RVALUE_OVERHEAD;
2322 size_t slot_count = CEILDIV(size, BASE_SLOT_SIZE);
2325 size_t heap_idx = 64 - nlz_int64(slot_count - 1);
2327 if (heap_idx >= HEAP_COUNT) {
2328 rb_bug(
"heap_idx_for_size: allocation size too large "
2329 "(size=%"PRIuSIZE
"u, heap_idx=%"PRIuSIZE
"u)", size, heap_idx);
2332#if RGENGC_CHECK_MODE
2334 GC_ASSERT(size <= (
size_t)heaps[heap_idx].slot_size);
2335 if (heap_idx > 0) GC_ASSERT(size > (
size_t)heaps[heap_idx - 1].slot_size);
2342rb_gc_impl_heap_id_for_size(
void *objspace_ptr,
size_t size)
2344 return heap_idx_for_size(size);
2348static size_t heap_sizes[HEAP_COUNT + 1] = { 0 };
2351rb_gc_impl_heap_sizes(
void *objspace_ptr)
2353 if (heap_sizes[0] == 0) {
2354 for (
unsigned char i = 0; i < HEAP_COUNT; i++) {
2355 heap_sizes[i] = heap_slot_size(i);
2370 unsigned int lev = 0;
2371 bool unlock_vm =
false;
2374 lev = RB_GC_CR_LOCK();
2379 if (is_incremental_marking(
objspace)) {
2381 cache->incremental_mark_step_allocated_slots = 0;
2384 obj = ractor_cache_allocate_slot(
objspace, cache, heap_idx);
2390 ractor_cache_set_page(
objspace, cache, heap_idx, page);
2393 obj = ractor_cache_allocate_slot(
objspace, cache, heap_idx);
2398 RB_GC_CR_UNLOCK(lev);
2401 if (RB_UNLIKELY(obj ==
Qfalse)) {
2410 VALUE obj = ractor_cache_allocate_slot(
objspace, cache, heap_idx);
2412 if (RB_UNLIKELY(obj ==
Qfalse)) {
2413 obj = newobj_cache_miss(
objspace, cache, heap_idx, vm_locked);
2427 lev = RB_GC_CR_LOCK();
2429 if (RB_UNLIKELY(during_gc || ruby_gc_stressful)) {
2433 if (rb_memerror_reentered()) {
2436 rb_bug(
"object allocation during garbage collection phase");
2439 if (ruby_gc_stressful) {
2440 if (!garbage_collect(
objspace, GPR_FLAG_NEWOBJ)) {
2446 obj = newobj_alloc(
objspace, cache, heap_idx,
true);
2447 newobj_init(klass, flags, wb_protected,
objspace, obj);
2449 RB_GC_CR_UNLOCK(lev);
2454NOINLINE(
static VALUE newobj_slowpath_wb_protected(
VALUE klass,
VALUE flags,
2456NOINLINE(
static VALUE newobj_slowpath_wb_unprotected(
VALUE klass,
VALUE flags,
2462 return newobj_slowpath(klass, flags,
objspace, cache, TRUE, heap_idx);
2468 return newobj_slowpath(klass, flags,
objspace, cache, FALSE, heap_idx);
2472rb_gc_impl_new_obj(
void *objspace_ptr,
void *cache_ptr,
VALUE klass,
VALUE flags,
VALUE v1,
VALUE v2,
VALUE v3,
bool wb_protected,
size_t alloc_size)
2477 RB_DEBUG_COUNTER_INC(obj_newobj);
2478 (void)RB_DEBUG_COUNTER_INC_IF(obj_newobj_wb_unprotected, !wb_protected);
2480 if (RB_UNLIKELY(stress_to_class)) {
2481 if (rb_hash_lookup2(stress_to_class, klass,
Qundef) !=
Qundef) {
2486 size_t heap_idx = heap_idx_for_size(alloc_size);
2490 if (!RB_UNLIKELY(during_gc || ruby_gc_stressful) &&
2492 obj = newobj_alloc(
objspace, cache, heap_idx,
false);
2493 newobj_init(klass, flags, wb_protected,
objspace, obj);
2496 RB_DEBUG_COUNTER_INC(obj_newobj_slowpath);
2498 obj = wb_protected ?
2499 newobj_slowpath_wb_protected(klass, flags,
objspace, cache, heap_idx) :
2500 newobj_slowpath_wb_unprotected(klass, flags,
objspace, cache, heap_idx);
2503 return newobj_fill(obj, v1, v2, v3);
2507ptr_in_page_body_p(
const void *ptr,
const void *memb)
2510 uintptr_t p_body = (uintptr_t)page->body;
2512 if ((uintptr_t)ptr >= p_body) {
2513 return (uintptr_t)ptr < (p_body + HEAP_PAGE_SIZE) ? 0 : 1;
2526 if (ptr < (uintptr_t)heap_pages_lomem ||
2527 ptr > (uintptr_t)heap_pages_himem) {
2531 res = bsearch((
void *)ptr, rb_darray_ref(
objspace->heap_pages.sorted, 0),
2533 ptr_in_page_body_p);
2547 register uintptr_t p = (uintptr_t)ptr;
2550 RB_DEBUG_COUNTER_INC(gc_isptr_trial);
2552 if (p < heap_pages_lomem || p > heap_pages_himem)
return FALSE;
2553 RB_DEBUG_COUNTER_INC(gc_isptr_range);
2555 if (p % BASE_SLOT_SIZE != 0)
return FALSE;
2556 RB_DEBUG_COUNTER_INC(gc_isptr_align);
2558 page = heap_page_for_ptr(
objspace, (uintptr_t)ptr);
2560 RB_DEBUG_COUNTER_INC(gc_isptr_maybe);
2561 if (heap_page_in_global_empty_pages_pool(
objspace, page)) {
2565 if (p < page->start)
return FALSE;
2566 if (p >= page->start + (page->total_slots * page->slot_size))
return FALSE;
2567 if ((NUM_IN_PAGE(p) * BASE_SLOT_SIZE) % page->slot_size != 0)
return FALSE;
2576rb_gc_impl_pointer_to_heap_p(
void *objspace_ptr,
const void *ptr)
2578 return is_pointer_to_heap(objspace_ptr, ptr);
2581#define ZOMBIE_OBJ_KEPT_FLAGS (FL_FINALIZE)
2584rb_gc_impl_make_zombie(
void *objspace_ptr,
VALUE obj,
void (*dfree)(
void *),
void *data)
2588 struct RZombie *zombie = RZOMBIE(obj);
2589 zombie->flags =
T_ZOMBIE | (zombie->flags & ZOMBIE_OBJ_KEPT_FLAGS);
2590 zombie->dfree = dfree;
2591 zombie->data = data;
2592 VALUE prev, next = heap_pages_deferred_final;
2594 zombie->next = prev = next;
2596 }
while (next != prev);
2598 struct heap_page *page = GET_HEAP_PAGE(obj);
2599 page->final_slots++;
2600 page->heap->final_slots_count++;
2603typedef int each_obj_callback(
void *,
void *,
size_t,
void *);
2604typedef int each_page_callback(
struct heap_page *,
void *);
2608 bool reenable_incremental;
2610 each_obj_callback *each_obj_callback;
2611 each_page_callback *each_page_callback;
2615 size_t pages_counts[HEAP_COUNT];
2619objspace_each_objects_ensure(
VALUE arg)
2625 if (data->reenable_incremental) {
2626 objspace->flags.dont_incremental = FALSE;
2629 for (
int i = 0; i < HEAP_COUNT; i++) {
2630 struct heap_page **pages = data->pages[i];
2638objspace_each_objects_try(
VALUE arg)
2644 for (
int i = 0; i < HEAP_COUNT; i++) {
2646 size_t size = heap->total_pages *
sizeof(
struct heap_page *);
2648 struct heap_page **pages = malloc(size);
2649 if (!pages) rb_memerror();
2657 size_t pages_count = 0;
2658 ccan_list_for_each(&heap->pages, page, page_node) {
2659 pages[pages_count] = page;
2662 data->pages[i] = pages;
2663 data->pages_counts[i] = pages_count;
2664 GC_ASSERT(pages_count == heap->total_pages);
2667 for (
int i = 0; i < HEAP_COUNT; i++) {
2669 size_t pages_count = data->pages_counts[i];
2670 struct heap_page **pages = data->pages[i];
2673 for (
size_t i = 0; i < pages_count; i++) {
2676 if (page == NULL)
break;
2680 if (pages[i] != page)
continue;
2682 uintptr_t pstart = (uintptr_t)page->start;
2683 uintptr_t pend = pstart + (page->total_slots * heap->slot_size);
2685 if (data->each_obj_callback &&
2686 (*data->each_obj_callback)((
void *)pstart, (
void *)pend, heap->slot_size, data->data)) {
2689 if (data->each_page_callback &&
2690 (*data->each_page_callback)(page, data->data)) {
2694 page = ccan_list_next(&heap->pages, page, page_node);
2706 bool reenable_incremental = FALSE;
2708 reenable_incremental = !
objspace->flags.dont_incremental;
2711 objspace->flags.dont_incremental = TRUE;
2722objspace_each_objects(
rb_objspace_t *
objspace, each_obj_callback *callback,
void *data,
bool protected)
2726 .each_obj_callback = callback,
2727 .each_page_callback = NULL,
2734rb_gc_impl_each_objects(
void *objspace_ptr, each_obj_callback *callback,
void *data)
2736 objspace_each_objects(objspace_ptr, callback, data, TRUE);
2739#if GC_CAN_COMPILE_COMPACTION
2741objspace_each_pages(
rb_objspace_t *
objspace, each_page_callback *callback,
void *data,
bool protected)
2745 .each_obj_callback = NULL,
2746 .each_page_callback = callback,
2754rb_gc_impl_define_finalizer(
void *objspace_ptr,
VALUE obj,
VALUE block)
2764 int lev = RB_GC_VM_LOCK();
2766 if (st_lookup(finalizer_table, obj, &data)) {
2767 table = (
VALUE)data;
2774 for (i = 0; i <
len; i++) {
2777 RB_GC_VM_UNLOCK(lev);
2788 st_add_direct(finalizer_table, obj, table);
2791 RB_GC_VM_UNLOCK(lev);
2797rb_gc_impl_undefine_finalizer(
void *objspace_ptr,
VALUE obj)
2803 st_data_t data = obj;
2805 int lev = RB_GC_VM_LOCK();
2806 st_delete(finalizer_table, &data, 0);
2807 RB_GC_VM_UNLOCK(lev);
2813rb_gc_impl_copy_finalizer(
void *objspace_ptr,
VALUE dest,
VALUE obj)
2821 int lev = RB_GC_VM_LOCK();
2822 if (RB_LIKELY(st_lookup(finalizer_table, obj, &data))) {
2825 st_insert(finalizer_table, dest, table);
2829 rb_bug(
"rb_gc_copy_finalizer: FL_FINALIZE set but not found in finalizer_table: %s", rb_obj_info(obj));
2831 RB_GC_VM_UNLOCK(lev);
2835get_final(
long i,
void *data)
2845 if (RZOMBIE(zombie)->dfree) {
2846 RZOMBIE(zombie)->dfree(RZOMBIE(zombie)->data);
2849 st_data_t key = (st_data_t)zombie;
2853 if (st_delete(finalizer_table, &key, &table)) {
2857 rb_bug(
"FL_FINALIZE flag is set, but finalizers are not found");
2861 GC_ASSERT(!st_lookup(finalizer_table, key, NULL));
2871 rb_asan_unpoison_object(zombie,
false);
2872 next_zombie = RZOMBIE(zombie)->next;
2873 page = GET_HEAP_PAGE(zombie);
2875 int lev = RB_GC_VM_LOCK();
2880 GC_ASSERT(page->heap->final_slots_count > 0);
2881 GC_ASSERT(page->final_slots > 0);
2883 page->heap->final_slots_count--;
2884 page->final_slots--;
2886 heap_page_add_freeobj(
objspace, page, zombie);
2887 page->heap->total_freed_objects++;
2889 RB_GC_VM_UNLOCK(lev);
2891 zombie = next_zombie;
2907 rb_gc_set_pending_interrupt();
2908 finalize_deferred_heap_pages(
objspace);
2909 rb_gc_unset_pending_interrupt();
2913gc_finalize_deferred(
void *dmy)
2932gc_abort(
void *objspace_ptr)
2936 if (is_incremental_marking(
objspace)) {
2939 while (pop_mark_stack(&
objspace->mark_stack, &obj));
2941 objspace->flags.during_incremental_marking = FALSE;
2945 for (
int i = 0; i < HEAP_COUNT; i++) {
2948 heap->sweeping_page = NULL;
2951 ccan_list_for_each(&heap->pages, page, page_node) {
2952 page->flags.before_sweep =
false;
2957 for (
int i = 0; i < HEAP_COUNT; i++) {
2959 rgengc_mark_and_rememberset_clear(
objspace, heap);
2962 gc_mode_set(
objspace, gc_mode_none);
2966rb_gc_impl_shutdown_free_objects(
void *objspace_ptr)
2970 for (
size_t i = 0; i < rb_darray_size(
objspace->heap_pages.sorted); i++) {
2972 short stride = page->slot_size;
2974 uintptr_t p = (uintptr_t)page->start;
2975 uintptr_t pend = p + page->total_slots * stride;
2976 for (; p < pend; p += stride) {
2978 asan_unpoisoning_object(vp) {
2980 rb_gc_obj_free_vm_weak_references(vp);
2981 if (rb_gc_obj_free(
objspace, vp)) {
2991rb_gc_impl_shutdown_call_finalizer_i(st_data_t key, st_data_t val, st_data_t _data)
3007rb_gc_impl_shutdown_call_finalizer(
void *objspace_ptr)
3011#if RGENGC_CHECK_MODE >= 2
3012 gc_verify_internal_consistency(
objspace);
3016 objspace->flags.dont_incremental = 1;
3025 while (finalizer_table->num_entries) {
3026 st_foreach(finalizer_table, rb_gc_impl_shutdown_call_finalizer_i, 0);
3031 GC_ASSERT(heap_pages_deferred_final == 0);
3040 unsigned int lock_lev;
3041 gc_enter(
objspace, gc_enter_event_finalizer, &lock_lev);
3044 for (
size_t i = 0; i < rb_darray_size(
objspace->heap_pages.sorted); i++) {
3046 short stride = page->slot_size;
3048 uintptr_t p = (uintptr_t)page->start;
3049 uintptr_t pend = p + page->total_slots * stride;
3050 for (; p < pend; p += stride) {
3052 asan_unpoisoning_object(vp) {
3053 if (rb_gc_shutdown_call_finalizer_p(vp)) {
3054 rb_gc_obj_free_vm_weak_references(vp);
3055 if (rb_gc_obj_free(
objspace, vp)) {
3063 gc_exit(
objspace, gc_enter_event_finalizer, &lock_lev);
3065 finalize_deferred_heap_pages(
objspace);
3067 st_free_table(finalizer_table);
3068 finalizer_table = 0;
3073rb_gc_impl_each_object(
void *objspace_ptr,
void (*func)(
VALUE obj,
void *data),
void *data)
3077 for (
size_t i = 0; i < rb_darray_size(
objspace->heap_pages.sorted); i++) {
3079 short stride = page->slot_size;
3081 uintptr_t p = (uintptr_t)page->start;
3082 uintptr_t pend = p + page->total_slots * stride;
3083 for (; p < pend; p += stride) {
3086 asan_unpoisoning_object(obj) {
3102 size_t total_slots = 0;
3103 for (
int i = 0; i < HEAP_COUNT; i++) {
3105 total_slots += heap->total_slots;
3123gc_setup_mark_bits(
struct heap_page *page)
3126 memcpy(&page->mark_bits[0], &page->uncollectible_bits[0], HEAP_PAGE_BITMAP_SIZE);
3133enum {HEAP_PAGE_LOCK = PAGE_NOACCESS, HEAP_PAGE_UNLOCK = PAGE_READWRITE};
3139 return VirtualProtect(body, HEAP_PAGE_SIZE, protect, &old_protect) != 0;
3141#elif defined(__wasi__)
3143enum {HEAP_PAGE_LOCK, HEAP_PAGE_UNLOCK};
3144#define protect_page_body(body, protect) 1
3146enum {HEAP_PAGE_LOCK = PROT_NONE, HEAP_PAGE_UNLOCK = PROT_READ | PROT_WRITE};
3147#define protect_page_body(body, protect) !mprotect((body), HEAP_PAGE_SIZE, (protect))
3153 if (!protect_page_body(body, HEAP_PAGE_LOCK)) {
3154 rb_bug(
"Couldn't protect page %p, errno: %s", (
void *)body, strerror(
errno));
3157 gc_report(5,
objspace,
"Protecting page in move %p\n", (
void *)body);
3164 if (!protect_page_body(body, HEAP_PAGE_UNLOCK)) {
3165 rb_bug(
"Couldn't unprotect page %p, errno: %s", (
void *)body, strerror(
errno));
3168 gc_report(5,
objspace,
"Unprotecting page in move %p\n", (
void *)body);
3175 GC_ASSERT(gc_is_moveable_obj(
objspace, src));
3177 struct heap_page *src_page = GET_HEAP_PAGE(src);
3185 GC_ASSERT(RVALUE_MARKED(
objspace, src));
3187 asan_unlock_freelist(free_page);
3189 asan_lock_freelist(free_page);
3191 rb_asan_unpoison_object(dest,
false);
3198 asan_unlock_freelist(free_page);
3199 free_page->freelist = ((
struct free_slot *)dest)->next;
3200 asan_lock_freelist(free_page);
3204 if (src_page->slot_size > free_page->slot_size) {
3207 else if (free_page->slot_size > src_page->slot_size) {
3211 objspace->rcompactor.total_moved++;
3213 gc_move(
objspace, src, dest, src_page->slot_size, free_page->slot_size);
3215 free_page->free_slots--;
3223 struct heap_page *cursor = heap->compact_cursor;
3226 unlock_page_body(
objspace, cursor->body);
3227 cursor = ccan_list_next(&heap->pages, cursor, page_node);
3232#if GC_CAN_COMPILE_COMPACTION
3236#if defined(__MINGW32__) || defined(_WIN32)
3237# define GC_COMPACTION_SUPPORTED 1
3241# define GC_COMPACTION_SUPPORTED (GC_CAN_COMPILE_COMPACTION && HEAP_PAGE_ALLOC_USE_MMAP)
3244#if GC_CAN_COMPILE_COMPACTION
3246read_barrier_handler(uintptr_t address)
3254 if (page_body == NULL) {
3255 rb_bug(
"read_barrier_handler: segmentation fault at %p", (
void *)address);
3258 int lev = RB_GC_VM_LOCK();
3260 unlock_page_body(
objspace, page_body);
3262 objspace->profile.read_barrier_faults++;
3264 invalidate_moved_page(
objspace, GET_HEAP_PAGE(address));
3266 RB_GC_VM_UNLOCK(lev);
3270#if !GC_CAN_COMPILE_COMPACTION
3272uninstall_handlers(
void)
3278install_handlers(
void)
3282#elif defined(_WIN32)
3283static LPTOP_LEVEL_EXCEPTION_FILTER old_handler;
3284typedef void (*signal_handler)(int);
3285static signal_handler old_sigsegv_handler;
3288read_barrier_signal(EXCEPTION_POINTERS *info)
3291 if (info->ExceptionRecord->ExceptionCode == EXCEPTION_ACCESS_VIOLATION) {
3296 read_barrier_handler((uintptr_t)info->ExceptionRecord->ExceptionInformation[1]);
3297 return EXCEPTION_CONTINUE_EXECUTION;
3300 return EXCEPTION_CONTINUE_SEARCH;
3305uninstall_handlers(
void)
3307 signal(SIGSEGV, old_sigsegv_handler);
3308 SetUnhandledExceptionFilter(old_handler);
3312install_handlers(
void)
3315 old_sigsegv_handler = signal(SIGSEGV, NULL);
3318 old_handler = SetUnhandledExceptionFilter(read_barrier_signal);
3321static struct sigaction old_sigbus_handler;
3322static struct sigaction old_sigsegv_handler;
3324#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
3325static exception_mask_t old_exception_masks[32];
3326static mach_port_t old_exception_ports[32];
3327static exception_behavior_t old_exception_behaviors[32];
3328static thread_state_flavor_t old_exception_flavors[32];
3329static mach_msg_type_number_t old_exception_count;
3332disable_mach_bad_access_exc(
void)
3334 old_exception_count =
sizeof(old_exception_masks) /
sizeof(old_exception_masks[0]);
3335 task_swap_exception_ports(
3336 mach_task_self(), EXC_MASK_BAD_ACCESS,
3337 MACH_PORT_NULL, EXCEPTION_DEFAULT, 0,
3338 old_exception_masks, &old_exception_count,
3339 old_exception_ports, old_exception_behaviors, old_exception_flavors
3344restore_mach_bad_access_exc(
void)
3346 for (mach_msg_type_number_t i = 0; i < old_exception_count; i++) {
3347 task_set_exception_ports(
3349 old_exception_masks[i], old_exception_ports[i],
3350 old_exception_behaviors[i], old_exception_flavors[i]
3357read_barrier_signal(
int sig, siginfo_t *info,
void *data)
3360 struct sigaction prev_sigbus, prev_sigsegv;
3361 sigaction(SIGBUS, &old_sigbus_handler, &prev_sigbus);
3362 sigaction(SIGSEGV, &old_sigsegv_handler, &prev_sigsegv);
3365 sigset_t set, prev_set;
3367 sigaddset(&set, SIGBUS);
3368 sigaddset(&set, SIGSEGV);
3369 sigprocmask(SIG_UNBLOCK, &set, &prev_set);
3370#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
3371 disable_mach_bad_access_exc();
3374 read_barrier_handler((uintptr_t)info->si_addr);
3377#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
3378 restore_mach_bad_access_exc();
3380 sigaction(SIGBUS, &prev_sigbus, NULL);
3381 sigaction(SIGSEGV, &prev_sigsegv, NULL);
3382 sigprocmask(SIG_SETMASK, &prev_set, NULL);
3386uninstall_handlers(
void)
3388#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
3389 restore_mach_bad_access_exc();
3391 sigaction(SIGBUS, &old_sigbus_handler, NULL);
3392 sigaction(SIGSEGV, &old_sigsegv_handler, NULL);
3396install_handlers(
void)
3398 struct sigaction action;
3399 memset(&action, 0,
sizeof(
struct sigaction));
3400 sigemptyset(&action.sa_mask);
3401 action.sa_sigaction = read_barrier_signal;
3402 action.sa_flags = SA_SIGINFO | SA_ONSTACK;
3404 sigaction(SIGBUS, &action, &old_sigbus_handler);
3405 sigaction(SIGSEGV, &action, &old_sigsegv_handler);
3406#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
3407 disable_mach_bad_access_exc();
3415 for (
int i = 0; i < HEAP_COUNT; i++) {
3417 gc_unprotect_pages(
objspace, heap);
3420 uninstall_handlers();
3425 for (
int i = 0; i < HEAP_COUNT; i++) {
3427 heap->compact_cursor = NULL;
3428 heap->free_pages = NULL;
3429 heap->compact_cursor_index = 0;
3434 record->moved_objects =
objspace->rcompactor.total_moved - record->moved_objects;
3436 objspace->flags.during_compacting = FALSE;
3449 struct heap_page *sweep_page = ctx->page;
3450 short slot_size = sweep_page->slot_size;
3451 short slot_bits = slot_size / BASE_SLOT_SIZE;
3452 GC_ASSERT(slot_bits > 0);
3456 GC_ASSERT(vp % BASE_SLOT_SIZE == 0);
3458 rb_asan_unpoison_object(vp,
false);
3462 gc_report(2,
objspace,
"page_sweep: free %p\n", (
void *)p);
3463#if RGENGC_CHECK_MODE
3465 if (RVALUE_OLD_P(
objspace, vp)) rb_bug(
"page_sweep: %p - old while minor GC.", (
void *)p);
3466 if (RVALUE_REMEMBERED(
objspace, vp)) rb_bug(
"page_sweep: %p - remembered.", (
void *)p);
3470 if (RVALUE_WB_UNPROTECTED(
objspace, vp)) CLEAR_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(vp), vp);
3472#if RGENGC_CHECK_MODE
3473#define CHECK(x) if (x(objspace, vp) != FALSE) rb_bug("obj_free: " #x "(%s) != FALSE", rb_obj_info(vp))
3474 CHECK(RVALUE_WB_UNPROTECTED);
3475 CHECK(RVALUE_MARKED);
3476 CHECK(RVALUE_MARKING);
3477 CHECK(RVALUE_UNCOLLECTIBLE);
3483 rb_gc_obj_free_vm_weak_references(vp);
3484 if (rb_gc_obj_free(
objspace, vp)) {
3487 (void)VALGRIND_MAKE_MEM_UNDEFINED((
void*)p, BASE_SLOT_SIZE);
3488 heap_page_add_freeobj(
objspace, sweep_page, vp);
3489 gc_report(3,
objspace,
"page_sweep: %s is added to freelist\n", rb_obj_info(vp));
3498 if (
objspace->flags.during_compacting) {
3504 rb_bug(
"T_MOVED shouldn't be seen until compaction is finished");
3506 gc_report(3,
objspace,
"page_sweep: %s is added to freelist\n", rb_obj_info(vp));
3508 heap_page_add_freeobj(
objspace, sweep_page, vp);
3519 bitset >>= slot_bits;
3526 struct heap_page *sweep_page = ctx->page;
3527 GC_ASSERT(sweep_page->heap == heap);
3530 bits_t *bits, bitset;
3532 gc_report(2,
objspace,
"page_sweep: start.\n");
3534#if RGENGC_CHECK_MODE
3535 if (!
objspace->flags.immediate_sweep) {
3536 GC_ASSERT(sweep_page->flags.before_sweep == TRUE);
3539 sweep_page->flags.before_sweep = FALSE;
3540 sweep_page->free_slots = 0;
3542 p = (uintptr_t)sweep_page->start;
3543 bits = sweep_page->mark_bits;
3545 int page_rvalue_count = sweep_page->total_slots * (sweep_page->slot_size / BASE_SLOT_SIZE);
3546 int out_of_range_bits = (NUM_IN_PAGE(p) + page_rvalue_count) % BITS_BITLENGTH;
3547 if (out_of_range_bits != 0) {
3548 bits[BITMAP_INDEX(p) + page_rvalue_count / BITS_BITLENGTH] |= ~(((bits_t)1 << out_of_range_bits) - 1);
3554 int bitmap_plane_count = CEILDIV(NUM_IN_PAGE(p) + page_rvalue_count, BITS_BITLENGTH);
3555 GC_ASSERT(bitmap_plane_count == HEAP_PAGE_BITMAP_LIMIT - 1 ||
3556 bitmap_plane_count == HEAP_PAGE_BITMAP_LIMIT);
3560 bitset >>= NUM_IN_PAGE(p);
3562 gc_sweep_plane(
objspace, heap, p, bitset, ctx);
3564 p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
3566 for (
int i = 1; i < bitmap_plane_count; i++) {
3569 gc_sweep_plane(
objspace, heap, p, bitset, ctx);
3571 p += BITS_BITLENGTH * BASE_SLOT_SIZE;
3574 if (!heap->compact_cursor) {
3575 gc_setup_mark_bits(sweep_page);
3578#if GC_PROFILE_MORE_DETAIL
3581 record->removing_objects += ctx->final_slots + ctx->freed_slots;
3582 record->empty_objects += ctx->empty_slots;
3585 if (0) fprintf(stderr,
"gc_sweep_page(%"PRIdSIZE
"): total_slots: %d, freed_slots: %d, empty_slots: %d, final_slots: %d\n",
3587 sweep_page->total_slots,
3588 ctx->freed_slots, ctx->empty_slots, ctx->final_slots);
3590 sweep_page->free_slots += ctx->freed_slots + ctx->empty_slots;
3591 sweep_page->heap->total_freed_objects += ctx->freed_slots;
3593 if (heap_pages_deferred_final && !finalizing) {
3594 gc_finalize_deferred_register(
objspace);
3597#if RGENGC_CHECK_MODE
3598 short freelist_len = 0;
3599 asan_unlock_freelist(sweep_page);
3600 struct free_slot *ptr = sweep_page->freelist;
3603 rb_asan_unpoison_object((
VALUE)ptr,
false);
3605 rb_asan_poison_object((
VALUE)ptr);
3608 asan_lock_freelist(sweep_page);
3609 if (freelist_len != sweep_page->free_slots) {
3610 rb_bug(
"inconsistent freelist length: expected %d but was %d", sweep_page->free_slots, freelist_len);
3614 gc_report(2,
objspace,
"page_sweep: end.\n");
3618gc_mode_name(
enum gc_mode mode)
3621 case gc_mode_none:
return "none";
3622 case gc_mode_marking:
return "marking";
3623 case gc_mode_sweeping:
return "sweeping";
3624 case gc_mode_compacting:
return "compacting";
3625 default: rb_bug(
"gc_mode_name: unknown mode: %d", (
int)mode);
3632#if RGENGC_CHECK_MODE
3633 enum gc_mode prev_mode = gc_mode(
objspace);
3634 switch (prev_mode) {
3635 case gc_mode_none: GC_ASSERT(mode == gc_mode_marking);
break;
3636 case gc_mode_marking: GC_ASSERT(mode == gc_mode_sweeping);
break;
3637 case gc_mode_sweeping: GC_ASSERT(mode == gc_mode_none || mode == gc_mode_compacting);
break;
3638 case gc_mode_compacting: GC_ASSERT(mode == gc_mode_none);
break;
3641 if (0) fprintf(stderr,
"gc_mode_transition: %s->%s\n", gc_mode_name(gc_mode(
objspace)), gc_mode_name(mode));
3649 asan_unlock_freelist(page);
3650 if (page->freelist) {
3652 rb_asan_unpoison_object((
VALUE)p,
false);
3656 rb_asan_poison_object((
VALUE)prev);
3657 rb_asan_unpoison_object((
VALUE)p,
false);
3660 rb_asan_poison_object((
VALUE)p);
3663 page->freelist = freelist;
3665 asan_lock_freelist(page);
3672 heap->sweeping_page = ccan_list_top(&heap->pages,
struct heap_page, page_node);
3673 heap->free_pages = NULL;
3674 heap->pooled_pages = NULL;
3675 if (!
objspace->flags.immediate_sweep) {
3678 ccan_list_for_each(&heap->pages, page, page_node) {
3679 page->flags.before_sweep = TRUE;
3684#if defined(__GNUC__) && __GNUC__ == 4 && __GNUC_MINOR__ == 4
3688#if GC_CAN_COMPILE_COMPACTION
3689static void gc_sort_heap_by_compare_func(
rb_objspace_t *
objspace, gc_compact_compare_func compare_func);
3690static int compare_pinned_slots(
const void *left,
const void *right,
void *d);
3694gc_ractor_newobj_cache_clear(
void *c,
void *data)
3699 newobj_cache->incremental_mark_step_allocated_slots = 0;
3701 for (
size_t heap_idx = 0; heap_idx < HEAP_COUNT; heap_idx++) {
3707 cache->allocated_objects_count = 0;
3709 struct heap_page *page = cache->using_page;
3710 struct free_slot *freelist = cache->freelist;
3711 RUBY_DEBUG_LOG(
"ractor using_page:%p freelist:%p", (
void *)page, (
void *)freelist);
3713 heap_page_freelist_append(page, freelist);
3715 cache->using_page = NULL;
3716 cache->freelist = NULL;
3723 gc_mode_transition(
objspace, gc_mode_sweeping);
3726#if GC_CAN_COMPILE_COMPACTION
3727 if (
objspace->flags.during_compacting) {
3728 gc_sort_heap_by_compare_func(
3730 objspace->rcompactor.compare_func ?
objspace->rcompactor.compare_func : compare_pinned_slots
3735 for (
int i = 0; i < HEAP_COUNT; i++) {
3737 gc_sweep_start_heap(
objspace, heap);
3740 if (heap->sweeping_page == NULL) {
3741 GC_ASSERT(heap->total_pages == 0);
3742 GC_ASSERT(heap->total_slots == 0);
3743 gc_sweep_finish_heap(
objspace, heap);
3747 rb_gc_ractor_newobj_cache_foreach(gc_ractor_newobj_cache_clear, NULL);
3753 size_t total_slots = heap->total_slots;
3754 size_t swept_slots = heap->freed_slots + heap->empty_slots;
3756 size_t init_slots = gc_params.heap_init_slots[heap - heaps];
3757 size_t min_free_slots = (size_t)(MAX(total_slots, init_slots) * gc_params.heap_free_slots_min_ratio);
3759 if (swept_slots < min_free_slots &&
3761 ((heap->empty_slots == 0 && total_slots > 0) || heap->freed_slots > heap->empty_slots)) {
3767 while (swept_slots < min_free_slots &&
3768 (resurrected_page = heap_page_resurrect(
objspace))) {
3769 heap_add_page(
objspace, heap, resurrected_page);
3770 heap_add_freepage(heap, resurrected_page);
3772 swept_slots += resurrected_page->free_slots;
3775 if (swept_slots < min_free_slots) {
3779 objspace->profile.count -
objspace->rgengc.last_major_gc < RVALUE_OLD_AGE) {
3780 if (
objspace->heap_pages.allocatable_slots < min_free_slots) {
3781 heap_allocatable_slots_expand(
objspace, heap, swept_slots, heap->total_slots);
3785 gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_NOFREE;
3786 heap->force_major_gc_count++;
3795 gc_report(1,
objspace,
"gc_sweep_finish\n");
3798 heap_pages_free_unused_pages(
objspace);
3800 for (
int i = 0; i < HEAP_COUNT; i++) {
3803 heap->freed_slots = 0;
3804 heap->empty_slots = 0;
3806 if (!will_be_incremental_marking(
objspace)) {
3807 struct heap_page *end_page = heap->free_pages;
3809 while (end_page->free_next) end_page = end_page->free_next;
3810 end_page->free_next = heap->pooled_pages;
3813 heap->free_pages = heap->pooled_pages;
3815 heap->pooled_pages = NULL;
3821 gc_mode_transition(
objspace, gc_mode_none);
3823#if RGENGC_CHECK_MODE >= 2
3824 gc_verify_internal_consistency(
objspace);
3831 struct heap_page *sweep_page = heap->sweeping_page;
3832 int swept_slots = 0;
3833 int pooled_slots = 0;
3835 if (sweep_page == NULL)
return FALSE;
3837#if GC_ENABLE_LAZY_SWEEP
3838 gc_prof_sweep_timer_start(
objspace);
3842 RUBY_DEBUG_LOG(
"sweep_page:%p", (
void *)sweep_page);
3850 gc_sweep_page(
objspace, heap, &ctx);
3851 int free_slots = ctx.freed_slots + ctx.empty_slots;
3853 heap->sweeping_page = ccan_list_next(&heap->pages, sweep_page, page_node);
3855 if (free_slots == sweep_page->total_slots) {
3857 heap_unlink_page(
objspace, heap, sweep_page);
3859 sweep_page->start = 0;
3860 sweep_page->total_slots = 0;
3861 sweep_page->slot_size = 0;
3862 sweep_page->heap = NULL;
3863 sweep_page->free_slots = 0;
3865 asan_unlock_freelist(sweep_page);
3866 sweep_page->freelist = NULL;
3867 asan_lock_freelist(sweep_page);
3869 asan_poison_memory_region(sweep_page->body, HEAP_PAGE_SIZE);
3872 sweep_page->free_next =
objspace->empty_pages;
3873 objspace->empty_pages = sweep_page;
3875 else if (free_slots > 0) {
3876 heap->freed_slots += ctx.freed_slots;
3877 heap->empty_slots += ctx.empty_slots;
3879 if (pooled_slots < GC_INCREMENTAL_SWEEP_POOL_SLOT_COUNT) {
3880 heap_add_poolpage(
objspace, heap, sweep_page);
3881 pooled_slots += free_slots;
3884 heap_add_freepage(heap, sweep_page);
3885 swept_slots += free_slots;
3886 if (swept_slots > GC_INCREMENTAL_SWEEP_SLOT_COUNT) {
3892 sweep_page->free_next = NULL;
3894 }
while ((sweep_page = heap->sweeping_page));
3896 if (!heap->sweeping_page) {
3897 gc_sweep_finish_heap(
objspace, heap);
3899 if (!has_sweeping_pages(
objspace)) {
3904#if GC_ENABLE_LAZY_SWEEP
3905 gc_prof_sweep_timer_stop(
objspace);
3908 return heap->free_pages != NULL;
3914 for (
int i = 0; i < HEAP_COUNT; i++) {
3917 while (heap->sweeping_page) {
3926 GC_ASSERT(dont_gc_val() == FALSE ||
objspace->profile.latest_gc_info & GPR_FLAG_METHOD);
3927 if (!GC_ENABLE_LAZY_SWEEP)
return;
3931 for (
int i = 0; i < HEAP_COUNT; i++) {
3933 if (gc_sweep_step(
objspace, heap)) {
3934 GC_ASSERT(heap->free_pages != NULL);
3936 else if (heap == sweep_heap) {
3937 if (
objspace->empty_pages_count > 0 ||
objspace->heap_pages.allocatable_slots > 0) {
3948 heap_page_allocate_and_initialize(
objspace, heap);
3950 GC_ASSERT(heap->free_pages != NULL);
3955 GC_ASSERT(gc_mode(
objspace) == gc_mode_none);
3965rb_gc_impl_location(
void *objspace_ptr,
VALUE value)
3969 asan_unpoisoning_object(value) {
3971 destination = (
VALUE)RMOVED(value)->destination;
3975 destination = value;
3982#if GC_CAN_COMPILE_COMPACTION
3993 GC_ASSERT(RVALUE_PINNED(
objspace, forwarding_object));
3994 GC_ASSERT(!RVALUE_MARKED(
objspace, forwarding_object));
3996 CLEAR_IN_BITMAP(GET_HEAP_PINNED_BITS(forwarding_object), forwarding_object);
3998 object = rb_gc_impl_location(
objspace, forwarding_object);
4000 uint32_t original_shape_id = 0;
4002 original_shape_id = RMOVED(forwarding_object)->original_shape_id;
4005 gc_move(
objspace,
object, forwarding_object, GET_HEAP_PAGE(
object)->slot_size, page->slot_size);
4009 if (original_shape_id) {
4010 rb_gc_set_shape(forwarding_object, original_shape_id);
4013 struct heap_page *orig_page = GET_HEAP_PAGE(
object);
4014 orig_page->free_slots++;
4015 heap_page_add_freeobj(
objspace, orig_page,
object);
4017 GC_ASSERT(RVALUE_MARKED(
objspace, forwarding_object));
4022 p += BASE_SLOT_SIZE;
4032 bits_t *mark_bits, *pin_bits;
4035 mark_bits = page->mark_bits;
4036 pin_bits = page->pinned_bits;
4038 uintptr_t p = page->start;
4041 bitset = pin_bits[0] & ~mark_bits[0];
4042 bitset >>= NUM_IN_PAGE(p);
4043 invalidate_moved_plane(
objspace, page, p, bitset);
4044 p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
4046 for (i=1; i < HEAP_PAGE_BITMAP_LIMIT; i++) {
4049 bitset = pin_bits[i] & ~mark_bits[i];
4051 invalidate_moved_plane(
objspace, page, p, bitset);
4052 p += BITS_BITLENGTH * BASE_SLOT_SIZE;
4061 gc_mode_transition(
objspace, gc_mode_compacting);
4063 for (
int i = 0; i < HEAP_COUNT; i++) {
4065 ccan_list_for_each(&heap->pages, page, page_node) {
4066 page->flags.before_sweep = TRUE;
4069 heap->compact_cursor = ccan_list_tail(&heap->pages,
struct heap_page, page_node);
4070 heap->compact_cursor_index = 0;
4075 record->moved_objects =
objspace->rcompactor.total_moved;
4078 memset(
objspace->rcompactor.considered_count_table, 0,
T_MASK *
sizeof(
size_t));
4079 memset(
objspace->rcompactor.moved_count_table, 0,
T_MASK *
sizeof(
size_t));
4080 memset(
objspace->rcompactor.moved_up_count_table, 0,
T_MASK *
sizeof(
size_t));
4081 memset(
objspace->rcompactor.moved_down_count_table, 0,
T_MASK *
sizeof(
size_t));
4094 const unsigned int immediate_sweep =
objspace->flags.immediate_sweep;
4096 gc_report(1,
objspace,
"gc_sweep: immediate: %d\n", immediate_sweep);
4099 if (
objspace->flags.during_compacting) {
4103 if (immediate_sweep) {
4104#if !GC_ENABLE_LAZY_SWEEP
4105 gc_prof_sweep_timer_start(
objspace);
4108#if !GC_ENABLE_LAZY_SWEEP
4109 gc_prof_sweep_timer_stop(
objspace);
4115 for (
int i = 0; i < HEAP_COUNT; i++) {
4127stack_chunk_alloc(
void)
4141 return stack->chunk == NULL;
4147 size_t size = stack->index;
4148 stack_chunk_t *chunk = stack->chunk ? stack->chunk->next : NULL;
4151 size += stack->limit;
4152 chunk = chunk->next;
4160 chunk->next = stack->cache;
4161 stack->cache = chunk;
4162 stack->cache_size++;
4170 if (stack->unused_cache_size > (stack->cache_size/2)) {
4171 chunk = stack->cache;
4172 stack->cache = stack->cache->next;
4173 stack->cache_size--;
4176 stack->unused_cache_size = stack->cache_size;
4184 GC_ASSERT(stack->index == stack->limit);
4186 if (stack->cache_size > 0) {
4187 next = stack->cache;
4188 stack->cache = stack->cache->next;
4189 stack->cache_size--;
4190 if (stack->unused_cache_size > stack->cache_size)
4191 stack->unused_cache_size = stack->cache_size;
4194 next = stack_chunk_alloc();
4196 next->next = stack->chunk;
4197 stack->chunk = next;
4206 prev = stack->chunk->next;
4207 GC_ASSERT(stack->index == 0);
4208 add_stack_chunk_cache(stack, stack->chunk);
4209 stack->chunk = prev;
4210 stack->index = stack->limit;
4218 while (chunk != NULL) {
4228 mark_stack_chunk_list_free(stack->chunk);
4234 mark_stack_chunk_list_free(stack->cache);
4235 stack->cache_size = 0;
4236 stack->unused_cache_size = 0;
4263 if (stack->index == stack->limit) {
4264 push_mark_stack_chunk(stack);
4266 stack->chunk->data[stack->index++] = obj;
4276 rb_bug(
"push_mark_stack() called for broken object");
4280 rb_bug(
"push_mark_stack: unexpected T_NODE object");
4284 rb_bug(
"rb_gc_mark(): unknown data type 0x%x(%p) %s",
4286 is_pointer_to_heap((
rb_objspace_t *)rb_gc_get_objspace(), (
void *)obj) ?
"corrupted object" :
"non object");
4292 if (is_mark_stack_empty(stack)) {
4295 if (stack->index == 1) {
4296 *data = stack->chunk->data[--stack->index];
4297 pop_mark_stack_chunk(stack);
4300 *data = stack->chunk->data[--stack->index];
4311 stack->index = stack->limit = STACK_CHUNK_SIZE;
4313 for (i=0; i < 4; i++) {
4314 add_stack_chunk_cache(stack, stack_chunk_alloc());
4316 stack->unused_cache_size = stack->cache_size;
4327 if (RVALUE_WB_UNPROTECTED(
objspace, obj) || !RVALUE_OLD_P(
objspace, obj)) {
4328 rgengc_remember(
objspace, old_parent);
4332 GC_ASSERT(old_parent ==
objspace->rgengc.parent_object);
4338 if (RVALUE_MARKED(
objspace, obj))
return 0;
4339 MARK_IN_BITMAP(GET_HEAP_MARK_BITS(obj), obj);
4353 if(!gc_config_full_mark_val)
4356 struct heap_page *page = GET_HEAP_PAGE(obj);
4358 GC_ASSERT(RVALUE_MARKING(
objspace, obj) == FALSE);
4359 check_rvalue_consistency(
objspace, obj);
4361 if (!RVALUE_PAGE_WB_UNPROTECTED(page, obj)) {
4362 if (!RVALUE_OLD_P(
objspace, obj)) {
4363 gc_report(3,
objspace,
"gc_aging: YOUNG: %s\n", rb_obj_info(obj));
4366 else if (is_full_marking(
objspace)) {
4367 GC_ASSERT(RVALUE_PAGE_UNCOLLECTIBLE(page, obj) == FALSE);
4368 RVALUE_PAGE_OLD_UNCOLLECTIBLE_SET(
objspace, page, obj);
4371 check_rvalue_consistency(
objspace, obj);
4379#if RGENGC_CHECK_MODE
4380 if (RVALUE_MARKED(
objspace, obj) == FALSE) rb_bug(
"gc_grey: %s is not marked.", rb_obj_info(obj));
4381 if (RVALUE_MARKING(
objspace, obj) == TRUE) rb_bug(
"gc_grey: %s is marking/remembered.", rb_obj_info(obj));
4384 if (is_incremental_marking(
objspace)) {
4385 MARK_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), obj);
4388 push_mark_stack(&
objspace->mark_stack, obj);
4395 enum {info_size = 256};
4396 char obj_info_buf[info_size];
4397 rb_raw_obj_info(obj_info_buf, info_size, obj);
4399 char parent_obj_info_buf[info_size];
4401 strlcpy(parent_obj_info_buf,
"(none)", info_size);
4404 rb_raw_obj_info(parent_obj_info_buf, info_size,
objspace->rgengc.parent_object);
4407 rb_bug(
"try to mark T_NONE object (obj: %s, parent: %s)", obj_info_buf, parent_obj_info_buf);
4414 GC_ASSERT(during_gc);
4416 rgengc_check_relation(
objspace, obj);
4417 if (!gc_mark_set(
objspace, obj))
return;
4420 if (
objspace->rgengc.parent_object) {
4421 RUBY_DEBUG_LOG(
"%p (%s) parent:%p (%s)",
4422 (
void *)obj, obj_type_name(obj),
4423 (
void *)
objspace->rgengc.parent_object, obj_type_name(
objspace->rgengc.parent_object));
4426 RUBY_DEBUG_LOG(
"%p (%s)", (
void *)obj, obj_type_name(obj));
4430 gc_mark_check_t_none(
objspace, obj);
4440 if (RB_UNLIKELY(
objspace->flags.during_compacting)) {
4441 if (RB_LIKELY(during_gc)) {
4442 if (!RVALUE_PINNED(
objspace, obj)) {
4443 GC_ASSERT(GET_HEAP_PAGE(obj)->pinned_slots <= GET_HEAP_PAGE(obj)->total_slots);
4444 GET_HEAP_PAGE(obj)->pinned_slots++;
4445 MARK_IN_BITMAP(GET_HEAP_PINNED_BITS(obj), obj);
4459rb_gc_impl_mark_and_move(
void *objspace_ptr,
VALUE *ptr)
4463 if (RB_UNLIKELY(
objspace->flags.during_reference_updating)) {
4464 GC_ASSERT(
objspace->flags.during_compacting);
4465 GC_ASSERT(during_gc);
4468 if (destination != *ptr) {
4478rb_gc_impl_mark(
void *objspace_ptr,
VALUE obj)
4486rb_gc_impl_mark_and_pin(
void *objspace_ptr,
VALUE obj)
4494rb_gc_impl_mark_maybe(
void *objspace_ptr,
VALUE obj)
4498 (void)VALGRIND_MAKE_MEM_DEFINED(&obj,
sizeof(obj));
4500 if (is_pointer_to_heap(
objspace, (
void *)obj)) {
4501 asan_unpoisoning_object(obj) {
4516rb_gc_impl_mark_weak(
void *objspace_ptr,
VALUE *ptr)
4524 gc_mark_check_t_none(
objspace, obj);
4530 GC_ASSERT(RVALUE_MARKED(
objspace, obj));
4531 GC_ASSERT(!
objspace->flags.during_compacting);
4536 rgengc_check_relation(
objspace, obj);
4538 rb_darray_append_without_gc(&
objspace->weak_references, ptr);
4540 objspace->profile.weak_references_count++;
4544rb_gc_impl_remove_weak(
void *objspace_ptr,
VALUE parent_obj,
VALUE *ptr)
4550 if (!is_incremental_marking(
objspace))
return;
4553 if (!RVALUE_MARKED(
objspace, parent_obj))
return;
4556 rb_darray_foreach(
objspace->weak_references, i, ptr_ptr) {
4557 if (*ptr_ptr == ptr) {
4565pin_value(st_data_t key, st_data_t value, st_data_t data)
4567 rb_gc_impl_mark_and_pin((
void *)data, (
VALUE)value);
4575#define MARK_CHECKPOINT(category) do { \
4576 if (categoryp) *categoryp = category; \
4579 MARK_CHECKPOINT(
"objspace");
4582 if (finalizer_table != NULL) {
4583 st_foreach(finalizer_table, pin_value, (st_data_t)
objspace);
4586 if (stress_to_class) rb_gc_mark(stress_to_class);
4588 rb_gc_save_machine_context();
4589 rb_gc_mark_roots(
objspace, categoryp);
4596 objspace->rgengc.parent_object = obj;
4607 rb_gc_mark_children(
objspace, obj);
4619 size_t marked_slots_at_the_beginning =
objspace->marked_slots;
4620 size_t popped_count = 0;
4622 while (pop_mark_stack(mstack, &obj)) {
4623 if (obj ==
Qundef)
continue;
4625 if (RGENGC_CHECK_MODE && !RVALUE_MARKED(
objspace, obj)) {
4626 rb_bug(
"gc_mark_stacked_objects: %s is not marked.", rb_obj_info(obj));
4631 if (RGENGC_CHECK_MODE && !RVALUE_MARKING(
objspace, obj)) {
4632 rb_bug(
"gc_mark_stacked_objects: incremental, but marking bit is 0");
4634 CLEAR_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), obj);
4637 if (popped_count + (
objspace->marked_slots - marked_slots_at_the_beginning) > count) {
4646 if (RGENGC_CHECK_MODE >= 3) gc_verify_internal_consistency(
objspace);
4648 if (is_mark_stack_empty(mstack)) {
4649 shrink_stack_chunk_cache(mstack);
4660 return gc_mark_stacked_objects(
objspace, TRUE, count);
4666 return gc_mark_stacked_objects(
objspace, FALSE, 0);
4669#if RGENGC_CHECK_MODE >= 4
4671#define MAKE_ROOTSIG(obj) (((VALUE)(obj) << 1) | 0x01)
4672#define IS_ROOTSIG(obj) ((VALUE)(obj) & 0x01)
4673#define GET_ROOTSIG(obj) ((const char *)((VALUE)(obj) >> 1))
4681static struct reflist *
4682reflist_create(
VALUE obj)
4684 struct reflist *refs =
xmalloc(
sizeof(
struct reflist));
4687 refs->list[0] = obj;
4693reflist_destruct(
struct reflist *refs)
4700reflist_add(
struct reflist *refs,
VALUE obj)
4702 if (refs->pos == refs->size) {
4704 SIZED_REALLOC_N(refs->list,
VALUE, refs->size, refs->size/2);
4707 refs->list[refs->pos++] = obj;
4711reflist_dump(
struct reflist *refs)
4714 for (i=0; i<refs->pos; i++) {
4715 VALUE obj = refs->list[i];
4716 if (IS_ROOTSIG(obj)) {
4717 fprintf(stderr,
"<root@%s>", GET_ROOTSIG(obj));
4720 fprintf(stderr,
"<%s>", rb_obj_info(obj));
4722 if (i+1 < refs->pos) fprintf(stderr,
", ");
4727reflist_referred_from_machine_context(
struct reflist *refs)
4730 for (i=0; i<refs->pos; i++) {
4731 VALUE obj = refs->list[i];
4732 if (IS_ROOTSIG(obj) && strcmp(GET_ROOTSIG(obj),
"machine_context") == 0)
return 1;
4747 const char *category;
4753allrefs_add(
struct allrefs *data,
VALUE obj)
4755 struct reflist *refs;
4758 if (st_lookup(data->references, obj, &r)) {
4759 refs = (
struct reflist *)r;
4760 reflist_add(refs, data->root_obj);
4764 refs = reflist_create(data->root_obj);
4765 st_insert(data->references, obj, (st_data_t)refs);
4771allrefs_i(
VALUE obj,
void *ptr)
4773 struct allrefs *data = (
struct allrefs *)ptr;
4775 if (allrefs_add(data, obj)) {
4776 push_mark_stack(&data->mark_stack, obj);
4781allrefs_roots_i(
VALUE obj,
void *ptr)
4783 struct allrefs *data = (
struct allrefs *)ptr;
4784 if (strlen(data->category) == 0) rb_bug(
"!!!");
4785 data->root_obj = MAKE_ROOTSIG(data->category);
4787 if (allrefs_add(data, obj)) {
4788 push_mark_stack(&data->mark_stack, obj);
4791#define PUSH_MARK_FUNC_DATA(v) do { \
4792 struct gc_mark_func_data_struct *prev_mark_func_data = GET_VM()->gc.mark_func_data; \
4793 GET_VM()->gc.mark_func_data = (v);
4795#define POP_MARK_FUNC_DATA() GET_VM()->gc.mark_func_data = prev_mark_func_data;} while (0)
4800 struct allrefs data;
4801 struct gc_mark_func_data_struct mfd;
4803 int prev_dont_gc = dont_gc_val();
4807 data.references = st_init_numtable();
4808 init_mark_stack(&data.mark_stack);
4810 mfd.mark_func = allrefs_roots_i;
4814 PUSH_MARK_FUNC_DATA(&mfd);
4815 GET_VM()->gc.mark_func_data = &mfd;
4816 mark_roots(
objspace, &data.category);
4817 POP_MARK_FUNC_DATA();
4820 while (pop_mark_stack(&data.mark_stack, &obj)) {
4821 rb_objspace_reachable_objects_from(data.root_obj = obj, allrefs_i, &data);
4823 free_stack_chunks(&data.mark_stack);
4825 dont_gc_set(prev_dont_gc);
4826 return data.references;
4830objspace_allrefs_destruct_i(st_data_t key, st_data_t value, st_data_t ptr)
4832 struct reflist *refs = (
struct reflist *)value;
4833 reflist_destruct(refs);
4838objspace_allrefs_destruct(
struct st_table *refs)
4840 st_foreach(refs, objspace_allrefs_destruct_i, 0);
4841 st_free_table(refs);
4844#if RGENGC_CHECK_MODE >= 5
4846allrefs_dump_i(st_data_t k, st_data_t v, st_data_t ptr)
4849 struct reflist *refs = (
struct reflist *)v;
4850 fprintf(stderr,
"[allrefs_dump_i] %s <- ", rb_obj_info(obj));
4852 fprintf(stderr,
"\n");
4860 fprintf(stderr,
"[all refs] (size: %"PRIuVALUE
")\n", size);
4861 st_foreach(
objspace->rgengc.allrefs_table, allrefs_dump_i, 0);
4866gc_check_after_marks_i(st_data_t k, st_data_t v, st_data_t ptr)
4869 struct reflist *refs = (
struct reflist *)v;
4873 if (!RVALUE_MARKED(
objspace, obj)) {
4874 fprintf(stderr,
"gc_check_after_marks_i: %s is not marked and not oldgen.\n", rb_obj_info(obj));
4875 fprintf(stderr,
"gc_check_after_marks_i: %p is referred from ", (
void *)obj);
4878 if (reflist_referred_from_machine_context(refs)) {
4879 fprintf(stderr,
" (marked from machine stack).\n");
4884 fprintf(stderr,
"\n");
4891gc_marks_check(
rb_objspace_t *
objspace, st_foreach_callback_func *checker_func,
const char *checker_name)
4893 size_t saved_malloc_increase =
objspace->malloc_params.increase;
4894#if RGENGC_ESTIMATE_OLDMALLOC
4895 size_t saved_oldmalloc_increase =
objspace->rgengc.oldmalloc_increase;
4902 st_foreach(
objspace->rgengc.allrefs_table, checker_func, (st_data_t)
objspace);
4905 if (
objspace->rgengc.error_count > 0) {
4906#if RGENGC_CHECK_MODE >= 5
4909 if (checker_name) rb_bug(
"%s: GC has problem.", checker_name);
4912 objspace_allrefs_destruct(
objspace->rgengc.allrefs_table);
4913 objspace->rgengc.allrefs_table = 0;
4916 objspace->malloc_params.increase = saved_malloc_increase;
4917#if RGENGC_ESTIMATE_OLDMALLOC
4918 objspace->rgengc.oldmalloc_increase = saved_oldmalloc_increase;
4926 size_t live_object_count;
4927 size_t zombie_object_count;
4930 size_t old_object_count;
4931 size_t remembered_shady_count;
4935check_generation_i(
const VALUE child,
void *ptr)
4938 const VALUE parent = data->parent;
4940 if (RGENGC_CHECK_MODE) GC_ASSERT(RVALUE_OLD_P(data->objspace, parent));
4942 if (!RVALUE_OLD_P(data->objspace, child)) {
4943 if (!RVALUE_REMEMBERED(data->objspace, parent) &&
4944 !RVALUE_REMEMBERED(data->objspace, child) &&
4945 !RVALUE_UNCOLLECTIBLE(data->objspace, child)) {
4946 fprintf(stderr,
"verify_internal_consistency_reachable_i: WB miss (O->Y) %s -> %s\n", rb_obj_info(parent), rb_obj_info(child));
4953check_color_i(
const VALUE child,
void *ptr)
4956 const VALUE parent = data->parent;
4958 if (!RVALUE_WB_UNPROTECTED(data->objspace, parent) && RVALUE_WHITE_P(data->objspace, child)) {
4959 fprintf(stderr,
"verify_internal_consistency_reachable_i: WB miss (B->W) - %s -> %s\n",
4960 rb_obj_info(parent), rb_obj_info(child));
4966check_children_i(
const VALUE child,
void *ptr)
4969 if (check_rvalue_consistency_force(data->objspace, child, FALSE) != 0) {
4970 fprintf(stderr,
"check_children_i: %s has error (referenced from %s)",
4971 rb_obj_info(child), rb_obj_info(data->parent));
4978verify_internal_consistency_i(
void *page_start,
void *page_end,
size_t stride,
4984 for (obj = (
VALUE)page_start; obj != (
VALUE)page_end; obj += stride) {
4985 asan_unpoisoning_object(obj) {
4986 if (!rb_gc_impl_garbage_object_p(
objspace, obj)) {
4988 data->live_object_count++;
4993 if (!gc_object_moved_p(
objspace, obj)) {
4995 rb_objspace_reachable_objects_from(obj, check_children_i, (
void *)data);
4999 if (RVALUE_OLD_P(
objspace, obj)) data->old_object_count++;
5000 if (RVALUE_WB_UNPROTECTED(
objspace, obj) && RVALUE_UNCOLLECTIBLE(
objspace, obj)) data->remembered_shady_count++;
5005 rb_objspace_reachable_objects_from(obj, check_generation_i, (
void *)data);
5008 if (is_incremental_marking(
objspace)) {
5009 if (RVALUE_BLACK_P(
objspace, obj)) {
5012 rb_objspace_reachable_objects_from(obj, check_color_i, (
void *)data);
5018 data->zombie_object_count++;
5021 fprintf(stderr,
"verify_internal_consistency_i: T_ZOMBIE has extra flags set: %s\n",
5027 fprintf(stderr,
"verify_internal_consistency_i: FL_FINALIZE %s but %s finalizer_table: %s\n",
5028 FL_TEST(obj,
FL_FINALIZE) ?
"set" :
"not set", st_is_member(finalizer_table, obj) ?
"in" :
"not in",
5043 unsigned int has_remembered_shady = FALSE;
5044 unsigned int has_remembered_old = FALSE;
5045 int remembered_old_objects = 0;
5046 int free_objects = 0;
5047 int zombie_objects = 0;
5049 short slot_size = page->slot_size;
5050 uintptr_t start = (uintptr_t)page->start;
5051 uintptr_t end = start + page->total_slots * slot_size;
5053 for (uintptr_t ptr = start; ptr < end; ptr += slot_size) {
5055 asan_unpoisoning_object(val) {
5060 if (RVALUE_PAGE_UNCOLLECTIBLE(page, val) && RVALUE_PAGE_WB_UNPROTECTED(page, val)) {
5061 has_remembered_shady = TRUE;
5063 if (RVALUE_PAGE_MARKING(page, val)) {
5064 has_remembered_old = TRUE;
5065 remembered_old_objects++;
5070 if (!is_incremental_marking(
objspace) &&
5071 page->flags.has_remembered_objects == FALSE && has_remembered_old == TRUE) {
5073 for (uintptr_t ptr = start; ptr < end; ptr += slot_size) {
5075 if (RVALUE_PAGE_MARKING(page, val)) {
5076 fprintf(stderr,
"marking -> %s\n", rb_obj_info(val));
5079 rb_bug(
"page %p's has_remembered_objects should be false, but there are remembered old objects (%d). %s",
5080 (
void *)page, remembered_old_objects, obj ? rb_obj_info(obj) :
"");
5083 if (page->flags.has_uncollectible_wb_unprotected_objects == FALSE && has_remembered_shady == TRUE) {
5084 rb_bug(
"page %p's has_remembered_shady should be false, but there are remembered shady objects. %s",
5085 (
void *)page, obj ? rb_obj_info(obj) :
"");
5090 if (page->free_slots != free_objects) {
5091 rb_bug(
"page %p's free_slots should be %d, but %d", (
void *)page, page->free_slots, free_objects);
5094 if (page->final_slots != zombie_objects) {
5095 rb_bug(
"page %p's final_slots should be %d, but %d", (
void *)page, page->final_slots, zombie_objects);
5098 return remembered_old_objects;
5104 int remembered_old_objects = 0;
5107 ccan_list_for_each(head, page, page_node) {
5108 asan_unlock_freelist(page);
5113 rb_asan_unpoison_object(vp,
false);
5115 fprintf(stderr,
"freelist slot expected to be T_NONE but was: %s\n", rb_obj_info(vp));
5118 rb_asan_poison_object(prev);
5120 asan_lock_freelist(page);
5122 if (page->flags.has_remembered_objects == FALSE) {
5123 remembered_old_objects += gc_verify_heap_page(
objspace, page,
Qfalse);
5127 return remembered_old_objects;
5133 int remembered_old_objects = 0;
5134 for (
int i = 0; i < HEAP_COUNT; i++) {
5135 remembered_old_objects += gc_verify_heap_pages_(
objspace, &((&heaps[i])->pages));
5137 return remembered_old_objects;
5146 gc_report(5,
objspace,
"gc_verify_internal_consistency: start\n");
5149 for (
size_t i = 0; i < rb_darray_size(
objspace->heap_pages.sorted); i++) {
5151 short slot_size = page->slot_size;
5153 uintptr_t start = (uintptr_t)page->start;
5154 uintptr_t end = start + page->total_slots * slot_size;
5156 verify_internal_consistency_i((
void *)start, (
void *)end, slot_size, &data);
5159 if (data.err_count != 0) {
5160#if RGENGC_CHECK_MODE >= 5
5161 objspace->rgengc.error_count = data.err_count;
5162 gc_marks_check(
objspace, NULL, NULL);
5165 rb_bug(
"gc_verify_internal_consistency: found internal inconsistency.");
5175 !rb_gc_multi_ractor_p()) {
5176 if (objspace_live_slots(
objspace) != data.live_object_count) {
5177 fprintf(stderr,
"heap_pages_final_slots: %"PRIdSIZE
", total_freed_objects: %"PRIdSIZE
"\n",
5179 rb_bug(
"inconsistent live slot number: expect %"PRIuSIZE
", but %"PRIuSIZE
".",
5180 objspace_live_slots(
objspace), data.live_object_count);
5185 if (
objspace->rgengc.old_objects != data.old_object_count) {
5186 rb_bug(
"inconsistent old slot number: expect %"PRIuSIZE
", but %"PRIuSIZE
".",
5187 objspace->rgengc.old_objects, data.old_object_count);
5189 if (
objspace->rgengc.uncollectible_wb_unprotected_objects != data.remembered_shady_count) {
5190 rb_bug(
"inconsistent number of wb unprotected objects: expect %"PRIuSIZE
", but %"PRIuSIZE
".",
5191 objspace->rgengc.uncollectible_wb_unprotected_objects, data.remembered_shady_count);
5196 size_t list_count = 0;
5199 VALUE z = heap_pages_deferred_final;
5202 z = RZOMBIE(z)->next;
5206 if (total_final_slots_count(
objspace) != data.zombie_object_count ||
5207 total_final_slots_count(
objspace) != list_count) {
5209 rb_bug(
"inconsistent finalizing object count:\n"
5210 " expect %"PRIuSIZE
"\n"
5211 " but %"PRIuSIZE
" zombies\n"
5212 " heap_pages_deferred_final list has %"PRIuSIZE
" items.",
5214 data.zombie_object_count,
5219 gc_report(5,
objspace,
"gc_verify_internal_consistency: OK\n");
5223gc_verify_internal_consistency(
void *objspace_ptr)
5227 unsigned int lev = RB_GC_VM_LOCK();
5231 unsigned int prev_during_gc = during_gc;
5234 gc_verify_internal_consistency_(
objspace);
5236 during_gc = prev_during_gc;
5238 RB_GC_VM_UNLOCK(lev);
5242heap_move_pooled_pages_to_free_pages(
rb_heap_t *heap)
5244 if (heap->pooled_pages) {
5245 if (heap->free_pages) {
5246 struct heap_page *free_pages_tail = heap->free_pages;
5247 while (free_pages_tail->free_next) {
5248 free_pages_tail = free_pages_tail->free_next;
5250 free_pages_tail->free_next = heap->pooled_pages;
5253 heap->free_pages = heap->pooled_pages;
5256 heap->pooled_pages = NULL;
5263 struct heap_page *page = GET_HEAP_PAGE(obj);
5264 bits_t *uncollectible_bits = &page->uncollectible_bits[0];
5266 if (!MARKED_IN_BITMAP(uncollectible_bits, obj)) {
5267 page->flags.has_uncollectible_wb_unprotected_objects = TRUE;
5268 MARK_IN_BITMAP(uncollectible_bits, obj);
5269 objspace->rgengc.uncollectible_wb_unprotected_objects++;
5271#if RGENGC_PROFILE > 0
5272 objspace->profile.total_remembered_shady_object_count++;
5273#if RGENGC_PROFILE >= 2
5290 gc_report(2,
objspace,
"gc_marks_wb_unprotected_objects: marked shady: %s\n", rb_obj_info((
VALUE)p));
5295 p += BASE_SLOT_SIZE;
5306 ccan_list_for_each(&heap->pages, page, page_node) {
5307 bits_t *mark_bits = page->mark_bits;
5308 bits_t *wbun_bits = page->wb_unprotected_bits;
5309 uintptr_t p = page->start;
5312 bits_t bits = mark_bits[0] & wbun_bits[0];
5313 bits >>= NUM_IN_PAGE(p);
5314 gc_marks_wb_unprotected_objects_plane(
objspace, p, bits);
5315 p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
5317 for (j=1; j<HEAP_PAGE_BITMAP_LIMIT; j++) {
5318 bits_t bits = mark_bits[j] & wbun_bits[j];
5320 gc_marks_wb_unprotected_objects_plane(
objspace, p, bits);
5321 p += BITS_BITLENGTH * BASE_SLOT_SIZE;
5325 gc_mark_stacked_objects_all(
objspace);
5331 size_t retained_weak_references_count = 0;
5333 rb_darray_foreach(
objspace->weak_references, i, ptr_ptr) {
5334 if (!*ptr_ptr)
continue;
5336 VALUE obj = **ptr_ptr;
5340 if (!RVALUE_MARKED(
objspace, obj)) {
5344 retained_weak_references_count++;
5348 objspace->profile.retained_weak_references_count = retained_weak_references_count;
5350 rb_darray_clear(
objspace->weak_references);
5351 rb_darray_resize_capa_without_gc(&
objspace->weak_references, retained_weak_references_count);
5358 if (is_incremental_marking(
objspace)) {
5359 if (RGENGC_CHECK_MODE && is_mark_stack_empty(&
objspace->mark_stack) == 0) {
5360 rb_bug(
"gc_marks_finish: mark stack is not empty (%"PRIdSIZE
").",
5361 mark_stack_size(&
objspace->mark_stack));
5365 while (gc_mark_stacked_objects_incremental(
objspace, INT_MAX) ==
false);
5367#if RGENGC_CHECK_MODE >= 2
5368 if (gc_verify_heap_pages(
objspace) != 0) {
5369 rb_bug(
"gc_marks_finish (incremental): there are remembered old objects.");
5373 objspace->flags.during_incremental_marking = FALSE;
5375 for (
int i = 0; i < HEAP_COUNT; i++) {
5376 gc_marks_wb_unprotected_objects(
objspace, &heaps[i]);
5380 gc_update_weak_references(
objspace);
5382#if RGENGC_CHECK_MODE >= 2
5383 gc_verify_internal_consistency(
objspace);
5386#if RGENGC_CHECK_MODE >= 4
5388 gc_marks_check(
objspace, gc_check_after_marks_i,
"after_marks");
5393 const unsigned long r_mul =
objspace->live_ractor_cache_count > 8 ? 8 :
objspace->live_ractor_cache_count;
5395 size_t total_slots = objspace_available_slots(
objspace);
5396 size_t sweep_slots = total_slots -
objspace->marked_slots;
5397 size_t max_free_slots = (size_t)(total_slots * gc_params.heap_free_slots_max_ratio);
5398 size_t min_free_slots = (size_t)(total_slots * gc_params.heap_free_slots_min_ratio);
5399 if (min_free_slots < gc_params.heap_free_slots * r_mul) {
5400 min_free_slots = gc_params.heap_free_slots * r_mul;
5403 int full_marking = is_full_marking(
objspace);
5408 size_t total_init_slots = 0;
5409 for (
int i = 0; i < HEAP_COUNT; i++) {
5410 total_init_slots += gc_params.heap_init_slots[i] * r_mul;
5413 if (max_free_slots < total_init_slots) {
5414 max_free_slots = total_init_slots;
5417 if (sweep_slots > max_free_slots) {
5418 heap_pages_freeable_pages = (sweep_slots - max_free_slots) / HEAP_PAGE_OBJ_LIMIT;
5421 heap_pages_freeable_pages = 0;
5424 if (
objspace->heap_pages.allocatable_slots == 0 && sweep_slots < min_free_slots) {
5425 if (!full_marking) {
5426 if (
objspace->profile.count -
objspace->rgengc.last_major_gc < RVALUE_OLD_AGE) {
5427 full_marking = TRUE;
5430 gc_report(1,
objspace,
"gc_marks_finish: next is full GC!!)\n");
5431 gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_NOFREE;
5436 heap_allocatable_slots_expand(
objspace, NULL, sweep_slots, total_slots);
5442 const double r = gc_params.oldobject_limit_factor;
5443 objspace->rgengc.uncollectible_wb_unprotected_objects_limit = MAX(
5444 (
size_t)(
objspace->rgengc.uncollectible_wb_unprotected_objects * r),
5445 (
size_t)(
objspace->rgengc.old_objects * gc_params.uncollectible_wb_unprotected_objects_limit_ratio)
5447 objspace->rgengc.old_objects_limit = (size_t)(
objspace->rgengc.old_objects * r);
5450 if (
objspace->rgengc.uncollectible_wb_unprotected_objects >
objspace->rgengc.uncollectible_wb_unprotected_objects_limit) {
5451 gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_SHADY;
5454 gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_OLDGEN;
5457 gc_report(1,
objspace,
"gc_marks_finish (marks %"PRIdSIZE
" objects, "
5458 "old %"PRIdSIZE
" objects, total %"PRIdSIZE
" slots, "
5459 "sweep %"PRIdSIZE
" slots, allocatable %"PRIdSIZE
" slots, next GC: %s)\n",
5461 gc_needs_major_flags ?
"major" :
"minor");
5465 rb_ractor_finish_marking();
5471gc_compact_heap_cursors_met_p(
rb_heap_t *heap)
5473 return heap->sweeping_page == heap->compact_cursor;
5480 size_t obj_size = rb_gc_obj_optimal_size(obj);
5481 if (obj_size == 0) {
5486 if (rb_gc_impl_size_allocatable_p(obj_size)) {
5487 idx = heap_idx_for_size(obj_size);
5497 GC_ASSERT(gc_is_moveable_obj(
objspace, src));
5500 uint32_t orig_shape = 0;
5501 uint32_t new_shape = 0;
5503 if (gc_compact_heap_cursors_met_p(dest_pool)) {
5504 return dest_pool != heap;
5508 orig_shape = rb_gc_get_shape(src);
5510 if (dest_pool != heap) {
5511 new_shape = rb_gc_rebuild_shape(src, dest_pool - heaps);
5513 if (new_shape == 0) {
5519 while (!try_move(
objspace, dest_pool, dest_pool->free_pages, src)) {
5521 .page = dest_pool->sweeping_page,
5530 lock_page_body(
objspace, GET_PAGE_BODY(src));
5531 gc_sweep_page(
objspace, dest_pool, &ctx);
5532 unlock_page_body(
objspace, GET_PAGE_BODY(src));
5534 if (dest_pool->sweeping_page->free_slots > 0) {
5535 heap_add_freepage(dest_pool, dest_pool->sweeping_page);
5538 dest_pool->sweeping_page = ccan_list_next(&dest_pool->pages, dest_pool->sweeping_page, page_node);
5539 if (gc_compact_heap_cursors_met_p(dest_pool)) {
5540 return dest_pool != heap;
5544 if (orig_shape != 0) {
5545 if (new_shape != 0) {
5547 rb_gc_set_shape(dest, new_shape);
5549 RMOVED(src)->original_shape_id = orig_shape;
5558 short slot_size = page->slot_size;
5559 short slot_bits = slot_size / BASE_SLOT_SIZE;
5560 GC_ASSERT(slot_bits > 0);
5564 GC_ASSERT(vp % BASE_SLOT_SIZE == 0);
5569 if (gc_is_moveable_obj(
objspace, vp)) {
5570 if (!gc_compact_move(
objspace, heap, vp)) {
5577 bitset >>= slot_bits;
5587 GC_ASSERT(page == heap->compact_cursor);
5589 bits_t *mark_bits, *pin_bits;
5591 uintptr_t p = page->start;
5593 mark_bits = page->mark_bits;
5594 pin_bits = page->pinned_bits;
5597 bitset = (mark_bits[0] & ~pin_bits[0]);
5598 bitset >>= NUM_IN_PAGE(p);
5600 if (!gc_compact_plane(
objspace, heap, (uintptr_t)p, bitset, page))
5603 p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
5605 for (
int j = 1; j < HEAP_PAGE_BITMAP_LIMIT; j++) {
5606 bitset = (mark_bits[j] & ~pin_bits[j]);
5608 if (!gc_compact_plane(
objspace, heap, (uintptr_t)p, bitset, page))
5611 p += BITS_BITLENGTH * BASE_SLOT_SIZE;
5620 for (
int i = 0; i < HEAP_COUNT; i++) {
5623 if (heap->total_pages > 0 &&
5624 !gc_compact_heap_cursors_met_p(heap)) {
5636#if RGENGC_CHECK_MODE >= 2
5637 gc_verify_internal_consistency(
objspace);
5640 while (!gc_compact_all_compacted_p(
objspace)) {
5641 for (
int i = 0; i < HEAP_COUNT; i++) {
5644 if (gc_compact_heap_cursors_met_p(heap)) {
5648 struct heap_page *start_page = heap->compact_cursor;
5650 if (!gc_compact_page(
objspace, heap, start_page)) {
5651 lock_page_body(
objspace, start_page->body);
5658 lock_page_body(
objspace, start_page->body);
5659 heap->compact_cursor = ccan_list_prev(&heap->pages, heap->compact_cursor, page_node);
5665#if RGENGC_CHECK_MODE >= 2
5666 gc_verify_internal_consistency(
objspace);
5673 gc_report(1,
objspace,
"gc_marks_rest\n");
5675 for (
int i = 0; i < HEAP_COUNT; i++) {
5676 (&heaps[i])->pooled_pages = NULL;
5679 if (is_incremental_marking(
objspace)) {
5680 while (gc_mark_stacked_objects_incremental(
objspace, INT_MAX) == FALSE);
5683 gc_mark_stacked_objects_all(
objspace);
5692 bool marking_finished =
false;
5695 if (gc_mark_stacked_objects_incremental(
objspace, slots)) {
5698 marking_finished =
true;
5701 return marking_finished;
5707 GC_ASSERT(dont_gc_val() == FALSE ||
objspace->profile.latest_gc_info & GPR_FLAG_METHOD);
5708 bool marking_finished =
true;
5712 if (heap->free_pages) {
5713 gc_report(2,
objspace,
"gc_marks_continue: has pooled pages");
5718 gc_report(2,
objspace,
"gc_marks_continue: no more pooled pages (stack depth: %"PRIdSIZE
").\n",
5719 mark_stack_size(&
objspace->mark_stack));
5720 heap->force_incremental_marking_finish_count++;
5726 return marking_finished;
5733 gc_report(1,
objspace,
"gc_marks_start: (%s)\n", full_mark ?
"full" :
"minor");
5734 gc_mode_transition(
objspace, gc_mode_marking);
5737 size_t incremental_marking_steps = (
objspace->rincgc.pooled_slots / INCREMENTAL_MARK_STEP_ALLOCATIONS) + 1;
5738 objspace->rincgc.step_slots = (
objspace->marked_slots * 2) / incremental_marking_steps;
5740 if (0) fprintf(stderr,
"objspace->marked_slots: %"PRIdSIZE
", "
5741 "objspace->rincgc.pooled_page_num: %"PRIdSIZE
", "
5742 "objspace->rincgc.step_slots: %"PRIdSIZE
", \n",
5744 objspace->flags.during_minor_gc = FALSE;
5745 if (ruby_enable_autocompact) {
5746 objspace->flags.during_compacting |= TRUE;
5748 objspace->profile.major_gc_count++;
5749 objspace->rgengc.uncollectible_wb_unprotected_objects = 0;
5754 for (
int i = 0; i < HEAP_COUNT; i++) {
5756 rgengc_mark_and_rememberset_clear(
objspace, heap);
5757 heap_move_pooled_pages_to_free_pages(heap);
5759 if (
objspace->flags.during_compacting) {
5762 ccan_list_for_each(&heap->pages, page, page_node) {
5763 page->pinned_slots = 0;
5769 objspace->flags.during_minor_gc = TRUE;
5771 objspace->rgengc.old_objects +
objspace->rgengc.uncollectible_wb_unprotected_objects;
5772 objspace->profile.minor_gc_count++;
5774 for (
int i = 0; i < HEAP_COUNT; i++) {
5775 rgengc_rememberset_mark(
objspace, &heaps[i]);
5781 gc_report(1,
objspace,
"gc_marks_start: (%s) end, stack in %"PRIdSIZE
"\n",
5788 gc_prof_mark_timer_start(
objspace);
5791 bool marking_finished =
false;
5795 gc_marks_start(
objspace, full_mark);
5796 if (!is_incremental_marking(
objspace)) {
5798 marking_finished =
true;
5801#if RGENGC_PROFILE > 0
5804 record->old_objects =
objspace->rgengc.old_objects;
5811 return marking_finished;
5819 if (level <= RGENGC_DEBUG) {
5823 const char *status =
" ";
5826 status = is_full_marking(
objspace) ?
"+" :
"-";
5832 if (is_incremental_marking(
objspace)) {
5837 va_start(args, fmt);
5838 vsnprintf(buf, 1024, fmt, args);
5841 fprintf(out,
"%s|", status);
5851 struct heap_page *page = GET_HEAP_PAGE(obj);
5852 bits_t *bits = &page->remembered_bits[0];
5854 if (MARKED_IN_BITMAP(bits, obj)) {
5858 page->flags.has_remembered_objects = TRUE;
5859 MARK_IN_BITMAP(bits, obj);
5870 gc_report(6,
objspace,
"rgengc_remember: %s %s\n", rb_obj_info(obj),
5871 RVALUE_REMEMBERED(
objspace, obj) ?
"was already remembered" :
"is remembered now");
5873 check_rvalue_consistency(
objspace, obj);
5875 if (RGENGC_CHECK_MODE) {
5876 if (RVALUE_WB_UNPROTECTED(
objspace, obj)) rb_bug(
"rgengc_remember: %s is not wb protected.", rb_obj_info(obj));
5879#if RGENGC_PROFILE > 0
5880 if (!RVALUE_REMEMBERED(
objspace, obj)) {
5881 if (RVALUE_WB_UNPROTECTED(
objspace, obj) == 0) {
5882 objspace->profile.total_remembered_normal_object_count++;
5883#if RGENGC_PROFILE >= 2
5890 return rgengc_remembersetbits_set(
objspace, obj);
5893#ifndef PROFILE_REMEMBERSET_MARK
5894#define PROFILE_REMEMBERSET_MARK 0
5904 gc_report(2,
objspace,
"rgengc_rememberset_mark: mark %s\n", rb_obj_info(obj));
5905 GC_ASSERT(RVALUE_UNCOLLECTIBLE(
objspace, obj));
5906 GC_ASSERT(RVALUE_OLD_P(
objspace, obj) || RVALUE_WB_UNPROTECTED(
objspace, obj));
5910 p += BASE_SLOT_SIZE;
5921#if PROFILE_REMEMBERSET_MARK
5922 int has_old = 0, has_shady = 0, has_both = 0, skip = 0;
5924 gc_report(1,
objspace,
"rgengc_rememberset_mark: start\n");
5926 ccan_list_for_each(&heap->pages, page, page_node) {
5927 if (page->flags.has_remembered_objects | page->flags.has_uncollectible_wb_unprotected_objects) {
5928 uintptr_t p = page->start;
5929 bits_t bitset, bits[HEAP_PAGE_BITMAP_LIMIT];
5930 bits_t *remembered_bits = page->remembered_bits;
5931 bits_t *uncollectible_bits = page->uncollectible_bits;
5932 bits_t *wb_unprotected_bits = page->wb_unprotected_bits;
5933#if PROFILE_REMEMBERSET_MARK
5934 if (page->flags.has_remembered_objects && page->flags.has_uncollectible_wb_unprotected_objects) has_both++;
5935 else if (page->flags.has_remembered_objects) has_old++;
5936 else if (page->flags.has_uncollectible_wb_unprotected_objects) has_shady++;
5938 for (j=0; j<HEAP_PAGE_BITMAP_LIMIT; j++) {
5939 bits[j] = remembered_bits[j] | (uncollectible_bits[j] & wb_unprotected_bits[j]);
5940 remembered_bits[j] = 0;
5942 page->flags.has_remembered_objects = FALSE;
5945 bitset >>= NUM_IN_PAGE(p);
5946 rgengc_rememberset_mark_plane(
objspace, p, bitset);
5947 p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
5949 for (j=1; j < HEAP_PAGE_BITMAP_LIMIT; j++) {
5951 rgengc_rememberset_mark_plane(
objspace, p, bitset);
5952 p += BITS_BITLENGTH * BASE_SLOT_SIZE;
5955#if PROFILE_REMEMBERSET_MARK
5962#if PROFILE_REMEMBERSET_MARK
5963 fprintf(stderr,
"%d\t%d\t%d\t%d\n", has_both, has_old, has_shady, skip);
5965 gc_report(1,
objspace,
"rgengc_rememberset_mark: finished\n");
5973 ccan_list_for_each(&heap->pages, page, page_node) {
5974 memset(&page->mark_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
5975 memset(&page->uncollectible_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
5976 memset(&page->marking_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
5977 memset(&page->remembered_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
5978 memset(&page->pinned_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
5979 page->flags.has_uncollectible_wb_unprotected_objects = FALSE;
5980 page->flags.has_remembered_objects = FALSE;
5991 if (RGENGC_CHECK_MODE) {
5992 if (!RVALUE_OLD_P(
objspace, a)) rb_bug(
"gc_writebarrier_generational: %s is not an old object.", rb_obj_info(a));
5993 if ( RVALUE_OLD_P(
objspace, b)) rb_bug(
"gc_writebarrier_generational: %s is an old object.", rb_obj_info(b));
5994 if (is_incremental_marking(
objspace)) rb_bug(
"gc_writebarrier_generational: called while incremental marking: %s -> %s", rb_obj_info(a), rb_obj_info(b));
5998 if (!RVALUE_REMEMBERED(
objspace, a)) {
5999 int lev = RB_GC_VM_LOCK_NO_BARRIER();
6003 RB_GC_VM_UNLOCK_NO_BARRIER(lev);
6005 gc_report(1,
objspace,
"gc_writebarrier_generational: %s (remembered) -> %s\n", rb_obj_info(a), rb_obj_info(b));
6008 check_rvalue_consistency(
objspace, a);
6009 check_rvalue_consistency(
objspace, b);
6015 gc_mark_set_parent(
objspace, parent);
6016 rgengc_check_relation(
objspace, obj);
6017 if (gc_mark_set(
objspace, obj) == FALSE)
return;
6027 gc_report(2,
objspace,
"gc_writebarrier_incremental: [LG] %p -> %s\n", (
void *)a, rb_obj_info(b));
6031 if (!RVALUE_WB_UNPROTECTED(
objspace, a)) {
6032 gc_report(2,
objspace,
"gc_writebarrier_incremental: [IN] %p -> %s\n", (
void *)a, rb_obj_info(b));
6040 if (RB_UNLIKELY(
objspace->flags.during_compacting)) {
6041 MARK_IN_BITMAP(GET_HEAP_PINNED_BITS(b), b);
6047rb_gc_impl_writebarrier(
void *objspace_ptr,
VALUE a,
VALUE b)
6051 if (RGENGC_CHECK_MODE) {
6052 if (
SPECIAL_CONST_P(a)) rb_bug(
"rb_gc_writebarrier: a is special const: %"PRIxVALUE, a);
6065 if (!is_incremental_marking(
objspace)) {
6070 gc_writebarrier_generational(a, b,
objspace);
6076 int lev = RB_GC_VM_LOCK_NO_BARRIER();
6078 if (is_incremental_marking(
objspace)) {
6079 gc_writebarrier_incremental(a, b,
objspace);
6085 RB_GC_VM_UNLOCK_NO_BARRIER(lev);
6087 if (retry)
goto retry;
6093rb_gc_impl_writebarrier_unprotect(
void *objspace_ptr,
VALUE obj)
6097 if (RVALUE_WB_UNPROTECTED(
objspace, obj)) {
6101 gc_report(2,
objspace,
"rb_gc_writebarrier_unprotect: %s %s\n", rb_obj_info(obj),
6102 RVALUE_REMEMBERED(
objspace, obj) ?
" (already remembered)" :
"");
6104 unsigned int lev = RB_GC_VM_LOCK_NO_BARRIER();
6107 gc_report(1,
objspace,
"rb_gc_writebarrier_unprotect: %s\n", rb_obj_info(obj));
6110 gc_remember_unprotected(
objspace, obj);
6113 objspace->profile.total_shade_operation_count++;
6114#if RGENGC_PROFILE >= 2
6120 RVALUE_AGE_RESET(obj);
6123 RB_DEBUG_COUNTER_INC(obj_wb_unprotect);
6124 MARK_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), obj);
6126 RB_GC_VM_UNLOCK_NO_BARRIER(lev);
6131rb_gc_impl_copy_attributes(
void *objspace_ptr,
VALUE dest,
VALUE obj)
6135 if (RVALUE_WB_UNPROTECTED(
objspace, obj)) {
6136 rb_gc_impl_writebarrier_unprotect(
objspace, dest);
6138 rb_gc_impl_copy_finalizer(
objspace, dest, obj);
6142rb_gc_impl_active_gc_name(
void)
6148rb_gc_impl_writebarrier_remember(
void *objspace_ptr,
VALUE obj)
6152 gc_report(1,
objspace,
"rb_gc_writebarrier_remember: %s\n", rb_obj_info(obj));
6155 int lev = RB_GC_VM_LOCK_NO_BARRIER();
6157 if (is_incremental_marking(
objspace)) {
6158 if (RVALUE_BLACK_P(
objspace, obj)) {
6162 else if (RVALUE_OLD_P(
objspace, obj)) {
6166 RB_GC_VM_UNLOCK_NO_BARRIER(lev);
6172 ID ID_wb_protected, ID_age, ID_old, ID_uncollectible, ID_marking,
6173 ID_marked, ID_pinned, ID_object_id, ID_shareable;
6176#define RB_GC_OBJECT_METADATA_ENTRY_COUNT (sizeof(struct rb_gc_object_metadata_names) / sizeof(ID))
6180rb_gc_impl_object_metadata(
void *objspace_ptr,
VALUE obj)
6186 if (!names.ID_marked) {
6187#define I(s) names.ID_##s = rb_intern(#s)
6200#define SET_ENTRY(na, v) do { \
6201 GC_ASSERT(n <= RB_GC_OBJECT_METADATA_ENTRY_COUNT); \
6202 object_metadata_entries[n].name = names.ID_##na; \
6203 object_metadata_entries[n].val = v; \
6207 if (!RVALUE_WB_UNPROTECTED(
objspace, obj)) SET_ENTRY(wb_protected,
Qtrue);
6208 SET_ENTRY(age,
INT2FIX(RVALUE_AGE_GET(obj)));
6210 if (RVALUE_UNCOLLECTIBLE(
objspace, obj)) SET_ENTRY(uncollectible,
Qtrue);
6211 if (RVALUE_MARKING(
objspace, obj)) SET_ENTRY(marking,
Qtrue);
6214 if (rb_obj_id_p(obj)) SET_ENTRY(object_id, rb_obj_id(obj));
6217 object_metadata_entries[n].name = 0;
6218 object_metadata_entries[n].val = 0;
6221 return object_metadata_entries;
6225rb_gc_impl_ractor_cache_alloc(
void *objspace_ptr,
void *ractor)
6229 objspace->live_ractor_cache_count++;
6235rb_gc_impl_ractor_cache_free(
void *objspace_ptr,
void *cache)
6239 objspace->live_ractor_cache_count--;
6240 gc_ractor_newobj_cache_clear(cache, NULL);
6247 if (!heap->free_pages) {
6248 if (!heap_page_allocate_and_initialize(
objspace, heap)) {
6249 objspace->heap_pages.allocatable_slots = 1;
6250 heap_page_allocate_and_initialize(
objspace, heap);
6258 if (dont_gc_val() || during_gc) {
6259 for (
int i = 0; i < HEAP_COUNT; i++) {
6276 size_t old_limit = malloc_limit;
6278 if (inc > malloc_limit) {
6279 malloc_limit = (size_t)(inc * gc_params.malloc_limit_growth_factor);
6280 if (malloc_limit > gc_params.malloc_limit_max) {
6281 malloc_limit = gc_params.malloc_limit_max;
6285 malloc_limit = (size_t)(malloc_limit * 0.98);
6286 if (malloc_limit < gc_params.malloc_limit_min) {
6287 malloc_limit = gc_params.malloc_limit_min;
6292 if (old_limit != malloc_limit) {
6293 fprintf(stderr,
"[%"PRIuSIZE
"] malloc_limit: %"PRIuSIZE
" -> %"PRIuSIZE
"\n",
6294 rb_gc_count(), old_limit, malloc_limit);
6297 fprintf(stderr,
"[%"PRIuSIZE
"] malloc_limit: not changed (%"PRIuSIZE
")\n",
6298 rb_gc_count(), malloc_limit);
6304#if RGENGC_ESTIMATE_OLDMALLOC
6306 if (
objspace->rgengc.oldmalloc_increase >
objspace->rgengc.oldmalloc_increase_limit) {
6307 gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_OLDMALLOC;
6308 objspace->rgengc.oldmalloc_increase_limit =
6309 (size_t)(
objspace->rgengc.oldmalloc_increase_limit * gc_params.oldmalloc_limit_growth_factor);
6311 if (
objspace->rgengc.oldmalloc_increase_limit > gc_params.oldmalloc_limit_max) {
6312 objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_max;
6316 if (0) fprintf(stderr,
"%"PRIdSIZE
"\t%d\t%"PRIuSIZE
"\t%"PRIuSIZE
"\t%"PRIdSIZE
"\n",
6318 gc_needs_major_flags,
6319 objspace->rgengc.oldmalloc_increase,
6320 objspace->rgengc.oldmalloc_increase_limit,
6321 gc_params.oldmalloc_limit_max);
6325 objspace->rgengc.oldmalloc_increase = 0;
6327 if ((
objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_BY_OLDMALLOC) == 0) {
6328 objspace->rgengc.oldmalloc_increase_limit =
6329 (size_t)(
objspace->rgengc.oldmalloc_increase_limit / ((gc_params.oldmalloc_limit_growth_factor - 1)/10 + 1));
6330 if (
objspace->rgengc.oldmalloc_increase_limit < gc_params.oldmalloc_limit_min) {
6331 objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_min;
6343 int lev = RB_GC_VM_LOCK();
6345#if GC_PROFILE_MORE_DETAIL
6346 objspace->profile.prepare_time = getrusage_time();
6351#if GC_PROFILE_MORE_DETAIL
6352 objspace->profile.prepare_time = getrusage_time() -
objspace->profile.prepare_time;
6357 RB_GC_VM_UNLOCK(lev);
6365 unsigned int do_full_mark = !!(reason & GPR_FLAG_FULL_MARK);
6367 if (!rb_darray_size(
objspace->heap_pages.sorted))
return TRUE;
6368 if (!(reason & GPR_FLAG_METHOD) && !ready_to_gc(
objspace))
return TRUE;
6370 GC_ASSERT(gc_mode(
objspace) == gc_mode_none,
"gc_mode is %s\n", gc_mode_name(gc_mode(
objspace)));
6371 GC_ASSERT(!is_lazy_sweeping(
objspace));
6372 GC_ASSERT(!is_incremental_marking(
objspace));
6374 unsigned int lock_lev;
6375 gc_enter(
objspace, gc_enter_event_start, &lock_lev);
6378 objspace->flags.immediate_sweep = !!(reason & GPR_FLAG_IMMEDIATE_SWEEP);
6380#if RGENGC_CHECK_MODE >= 2
6381 gc_verify_internal_consistency(
objspace);
6384 if (ruby_gc_stressful) {
6385 int flag =
FIXNUM_P(ruby_gc_stress_mode) ?
FIX2INT(ruby_gc_stress_mode) : 0;
6387 if ((flag & (1 << gc_stress_no_major)) == 0) {
6388 do_full_mark = TRUE;
6391 objspace->flags.immediate_sweep = !(flag & (1<<gc_stress_no_immediate_sweep));
6394 if (gc_needs_major_flags) {
6395 reason |= gc_needs_major_flags;
6396 do_full_mark = TRUE;
6400 if (!gc_config_full_mark_val) {
6401 do_full_mark = FALSE;
6403 gc_needs_major_flags = GPR_FLAG_NONE;
6405 if (do_full_mark && (reason & GPR_FLAG_MAJOR_MASK) == 0) {
6406 reason |= GPR_FLAG_MAJOR_BY_FORCE;
6409 if (
objspace->flags.dont_incremental ||
6410 reason & GPR_FLAG_IMMEDIATE_MARK ||
6411 ruby_gc_stressful) {
6412 objspace->flags.during_incremental_marking = FALSE;
6415 objspace->flags.during_incremental_marking = do_full_mark;
6419 if (do_full_mark && ruby_enable_autocompact) {
6420 objspace->flags.during_compacting = TRUE;
6421#if RGENGC_CHECK_MODE
6422 objspace->rcompactor.compare_func = ruby_autocompact_compare_func;
6426 objspace->flags.during_compacting = !!(reason & GPR_FLAG_COMPACT);
6429 if (!GC_ENABLE_LAZY_SWEEP ||
objspace->flags.dont_incremental) {
6430 objspace->flags.immediate_sweep = TRUE;
6433 if (
objspace->flags.immediate_sweep) reason |= GPR_FLAG_IMMEDIATE_SWEEP;
6435 gc_report(1,
objspace,
"gc_start(reason: %x) => %u, %d, %d\n",
6437 do_full_mark, !is_incremental_marking(
objspace),
objspace->flags.immediate_sweep);
6439 RB_DEBUG_COUNTER_INC(gc_count);
6441 if (reason & GPR_FLAG_MAJOR_MASK) {
6442 (void)RB_DEBUG_COUNTER_INC_IF(gc_major_nofree, reason & GPR_FLAG_MAJOR_BY_NOFREE);
6443 (void)RB_DEBUG_COUNTER_INC_IF(gc_major_oldgen, reason & GPR_FLAG_MAJOR_BY_OLDGEN);
6444 (void)RB_DEBUG_COUNTER_INC_IF(gc_major_shady, reason & GPR_FLAG_MAJOR_BY_SHADY);
6445 (void)RB_DEBUG_COUNTER_INC_IF(gc_major_force, reason & GPR_FLAG_MAJOR_BY_FORCE);
6446#if RGENGC_ESTIMATE_OLDMALLOC
6447 (void)RB_DEBUG_COUNTER_INC_IF(gc_major_oldmalloc, reason & GPR_FLAG_MAJOR_BY_OLDMALLOC);
6451 (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_newobj, reason & GPR_FLAG_NEWOBJ);
6452 (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_malloc, reason & GPR_FLAG_MALLOC);
6453 (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_method, reason & GPR_FLAG_METHOD);
6454 (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_capi, reason & GPR_FLAG_CAPI);
6455 (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_stress, reason & GPR_FLAG_STRESS);
6459 objspace->profile.latest_gc_info = reason;
6460 objspace->profile.total_allocated_objects_at_gc_start = total_allocated_objects(
objspace);
6461 objspace->profile.heap_used_at_gc_start = rb_darray_size(
objspace->heap_pages.sorted);
6462 objspace->profile.weak_references_count = 0;
6463 objspace->profile.retained_weak_references_count = 0;
6464 gc_prof_setup_new_record(
objspace, reason);
6465 gc_reset_malloc_info(
objspace, do_full_mark);
6469 GC_ASSERT(during_gc);
6473 if (gc_marks(
objspace, do_full_mark)) {
6479 gc_exit(
objspace, gc_enter_event_start, &lock_lev);
6487 unsigned int lock_lev;
6488 gc_enter(
objspace, gc_enter_event_rest, &lock_lev);
6490 if (RGENGC_CHECK_MODE >= 2) gc_verify_internal_consistency(
objspace);
6492 if (is_incremental_marking(
objspace)) {
6506 gc_exit(
objspace, gc_enter_event_rest, &lock_lev);
6512 unsigned int reason;
6521 if (is_full_marking(
objspace)) buff[i++] =
'F';
6522 if (is_incremental_marking(
objspace)) buff[i++] =
'I';
6526 if (is_lazy_sweeping(
objspace)) buff[i++] =
'L';
6537 static char buff[0x10];
6538 gc_current_status_fill(
objspace, buff);
6542#if PRINT_ENTER_EXIT_TICK
6544static tick_t last_exit_tick;
6545static tick_t enter_tick;
6546static int enter_count = 0;
6547static char last_gc_status[0x10];
6552 if (direction == 0) {
6554 enter_tick = tick();
6555 gc_current_status_fill(
objspace, last_gc_status);
6558 tick_t exit_tick = tick();
6559 char current_gc_status[0x10];
6560 gc_current_status_fill(
objspace, current_gc_status);
6563 fprintf(stderr,
"%"PRItick
"\t%"PRItick
"\t%s\t[%s->%s|%c]\n",
6564 enter_tick - last_exit_tick,
6565 exit_tick - enter_tick,
6567 last_gc_status, current_gc_status,
6568 (
objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_MASK) ?
'+' :
'-');
6569 last_exit_tick = exit_tick;
6572 fprintf(stderr,
"%"PRItick
"\t%"PRItick
"\t%s\t[%s->%s|%c]\n",
6574 exit_tick - enter_tick,
6576 last_gc_status, current_gc_status,
6577 (
objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_MASK) ?
'+' :
'-');
6590gc_enter_event_cstr(
enum gc_enter_event event)
6593 case gc_enter_event_start:
return "start";
6594 case gc_enter_event_continue:
return "continue";
6595 case gc_enter_event_rest:
return "rest";
6596 case gc_enter_event_finalizer:
return "finalizer";
6602gc_enter_count(
enum gc_enter_event event)
6605 case gc_enter_event_start: RB_DEBUG_COUNTER_INC(gc_enter_start);
break;
6606 case gc_enter_event_continue: RB_DEBUG_COUNTER_INC(gc_enter_continue);
break;
6607 case gc_enter_event_rest: RB_DEBUG_COUNTER_INC(gc_enter_rest);
break;
6608 case gc_enter_event_finalizer: RB_DEBUG_COUNTER_INC(gc_enter_finalizer);
break;
6612static bool current_process_time(
struct timespec *ts);
6617 if (!current_process_time(ts)) {
6623static unsigned long long
6628 if ((ts->tv_sec > 0 || ts->tv_nsec > 0) &&
6629 current_process_time(&end_time) &&
6630 end_time.tv_sec >= ts->tv_sec) {
6631 return (
unsigned long long)(end_time.tv_sec - ts->tv_sec) * (1000 * 1000 * 1000) +
6632 (end_time.tv_nsec - ts->tv_nsec);
6641 *lock_lev = RB_GC_VM_LOCK();
6644 case gc_enter_event_rest:
6647 case gc_enter_event_start:
6648 case gc_enter_event_continue:
6656 gc_enter_count(event);
6657 if (RB_UNLIKELY(during_gc != 0)) rb_bug(
"during_gc != 0");
6658 if (RGENGC_CHECK_MODE >= 3) gc_verify_internal_consistency(
objspace);
6661 RUBY_DEBUG_LOG(
"%s (%s)",gc_enter_event_cstr(event), gc_current_status(
objspace));
6662 gc_report(1,
objspace,
"gc_enter: %s [%s]\n", gc_enter_event_cstr(event), gc_current_status(
objspace));
6663 gc_record(
objspace, 0, gc_enter_event_cstr(event));
6671 GC_ASSERT(during_gc != 0);
6675 gc_record(
objspace, 1, gc_enter_event_cstr(event));
6676 RUBY_DEBUG_LOG(
"%s (%s)", gc_enter_event_cstr(event), gc_current_status(
objspace));
6677 gc_report(1,
objspace,
"gc_exit: %s [%s]\n", gc_enter_event_cstr(event), gc_current_status(
objspace));
6680 RB_GC_VM_UNLOCK(*lock_lev);
6684#define MEASURE_GC (objspace->flags.measure_gc)
6690 GC_ASSERT(during_gc != 0);
6693 gc_clock_start(&
objspace->profile.marking_start_time);
6700 GC_ASSERT(during_gc != 0);
6703 objspace->profile.marking_time_ns += gc_clock_end(&
objspace->profile.marking_start_time);
6710 GC_ASSERT(during_gc != 0);
6713 gc_clock_start(&
objspace->profile.sweeping_start_time);
6720 GC_ASSERT(during_gc != 0);
6723 objspace->profile.sweeping_time_ns += gc_clock_end(&
objspace->profile.sweeping_start_time);
6728gc_with_gvl(
void *ptr)
6731 return (
void *)(
VALUE)garbage_collect(oar->objspace, oar->reason);
6734int ruby_thread_has_gvl_p(
void);
6739 if (dont_gc_val()) {
6745 else if (!ruby_thread_has_gvl_p()) {
6749 oar.reason = reason;
6755 return garbage_collect(
objspace, reason);
6760gc_set_candidate_object_i(
void *vstart,
void *vend,
size_t stride,
void *data)
6765 for (; v != (
VALUE)vend; v += stride) {
6766 asan_unpoisoning_object(v) {
6772 rb_gc_prepare_heap_process_object(v);
6774 RVALUE_AGE_SET_CANDIDATE(
objspace, v);
6784rb_gc_impl_start(
void *objspace_ptr,
bool full_mark,
bool immediate_mark,
bool immediate_sweep,
bool compact)
6787 unsigned int reason = (GPR_FLAG_FULL_MARK |
6788 GPR_FLAG_IMMEDIATE_MARK |
6789 GPR_FLAG_IMMEDIATE_SWEEP |
6792 int full_marking_p = gc_config_full_mark_val;
6793 gc_config_full_mark_set(TRUE);
6797 GC_ASSERT(GC_COMPACTION_SUPPORTED);
6799 reason |= GPR_FLAG_COMPACT;
6802 if (!full_mark) reason &= ~GPR_FLAG_FULL_MARK;
6803 if (!immediate_mark) reason &= ~GPR_FLAG_IMMEDIATE_MARK;
6804 if (!immediate_sweep) reason &= ~GPR_FLAG_IMMEDIATE_SWEEP;
6810 gc_config_full_mark_set(full_marking_p);
6814rb_gc_impl_prepare_heap(
void *objspace_ptr)
6818 size_t orig_total_slots = objspace_available_slots(
objspace);
6819 size_t orig_allocatable_slots =
objspace->heap_pages.allocatable_slots;
6821 rb_gc_impl_each_objects(
objspace, gc_set_candidate_object_i, objspace_ptr);
6823 double orig_max_free_slots = gc_params.heap_free_slots_max_ratio;
6825 gc_params.heap_free_slots_max_ratio = 0.0;
6826 rb_gc_impl_start(
objspace,
true,
true,
true,
true);
6827 gc_params.heap_free_slots_max_ratio = orig_max_free_slots;
6829 objspace->heap_pages.allocatable_slots = 0;
6830 heap_pages_freeable_pages =
objspace->empty_pages_count;
6831 heap_pages_free_unused_pages(objspace_ptr);
6832 GC_ASSERT(heap_pages_freeable_pages == 0);
6833 GC_ASSERT(
objspace->empty_pages_count == 0);
6834 objspace->heap_pages.allocatable_slots = orig_allocatable_slots;
6836 size_t total_slots = objspace_available_slots(
objspace);
6837 if (orig_total_slots > total_slots) {
6838 objspace->heap_pages.allocatable_slots += orig_total_slots - total_slots;
6841#if defined(HAVE_MALLOC_TRIM) && !defined(RUBY_ALTERNATIVE_MALLOC_HEADER)
6887 GC_ASSERT(st_is_member(finalizer_table, obj));
6891 GC_ASSERT(RVALUE_MARKED(
objspace, obj));
6892 GC_ASSERT(!RVALUE_PINNED(
objspace, obj));
6897 rb_bug(
"gc_is_moveable_obj: unreachable (%d)", (
int)
BUILTIN_TYPE(obj));
6904void rb_mv_generic_ivar(
VALUE src,
VALUE dst);
6914 gc_report(4,
objspace,
"Moving object: %p -> %p\n", (
void *)src, (
void *)dest);
6917 GC_ASSERT(!MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(dest), dest));
6919 GC_ASSERT(!RVALUE_MARKING(
objspace, src));
6922 marked = RVALUE_MARKED(
objspace, src);
6923 wb_unprotected = RVALUE_WB_UNPROTECTED(
objspace, src);
6924 uncollectible = RVALUE_UNCOLLECTIBLE(
objspace, src);
6925 bool remembered = RVALUE_REMEMBERED(
objspace, src);
6926 age = RVALUE_AGE_GET(src);
6929 CLEAR_IN_BITMAP(GET_HEAP_MARK_BITS(src), src);
6930 CLEAR_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(src), src);
6931 CLEAR_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(src), src);
6932 CLEAR_IN_BITMAP(GET_HEAP_PAGE(src)->remembered_bits, src);
6935 memcpy((
void *)dest, (
void *)src, MIN(src_slot_size, slot_size));
6937 if (RVALUE_OVERHEAD > 0) {
6938 void *dest_overhead = (
void *)(((uintptr_t)dest) + slot_size - RVALUE_OVERHEAD);
6939 void *src_overhead = (
void *)(((uintptr_t)src) + src_slot_size - RVALUE_OVERHEAD);
6941 memcpy(dest_overhead, src_overhead, RVALUE_OVERHEAD);
6944 memset((
void *)src, 0, src_slot_size);
6945 RVALUE_AGE_RESET(src);
6949 MARK_IN_BITMAP(GET_HEAP_PAGE(dest)->remembered_bits, dest);
6952 CLEAR_IN_BITMAP(GET_HEAP_PAGE(dest)->remembered_bits, dest);
6956 MARK_IN_BITMAP(GET_HEAP_MARK_BITS(dest), dest);
6959 CLEAR_IN_BITMAP(GET_HEAP_MARK_BITS(dest), dest);
6962 if (wb_unprotected) {
6963 MARK_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(dest), dest);
6966 CLEAR_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(dest), dest);
6969 if (uncollectible) {
6970 MARK_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(dest), dest);
6973 CLEAR_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(dest), dest);
6976 RVALUE_AGE_SET(dest, age);
6979 RMOVED(src)->dummy =
Qundef;
6980 RMOVED(src)->destination = dest;
6983 GET_HEAP_PAGE(src)->heap->total_freed_objects++;
6984 GET_HEAP_PAGE(dest)->heap->total_allocated_objects++;
6989#if GC_CAN_COMPILE_COMPACTION
6991compare_pinned_slots(
const void *left,
const void *right,
void *dummy)
6996 left_page = *(
struct heap_page *
const *)left;
6997 right_page = *(
struct heap_page *
const *)right;
6999 return left_page->pinned_slots - right_page->pinned_slots;
7003compare_free_slots(
const void *left,
const void *right,
void *dummy)
7008 left_page = *(
struct heap_page *
const *)left;
7009 right_page = *(
struct heap_page *
const *)right;
7011 return left_page->free_slots - right_page->free_slots;
7017 for (
int j = 0; j < HEAP_COUNT; j++) {
7020 size_t total_pages = heap->total_pages;
7022 struct heap_page *page = 0, **page_list = malloc(size);
7025 heap->free_pages = NULL;
7026 ccan_list_for_each(&heap->pages, page, page_node) {
7027 page_list[i++] = page;
7031 GC_ASSERT((
size_t)i == total_pages);
7038 ccan_list_head_init(&heap->pages);
7040 for (i = 0; i < total_pages; i++) {
7041 ccan_list_add(&heap->pages, &page_list[i]->page_node);
7042 if (page_list[i]->free_slots != 0) {
7043 heap_add_freepage(heap, page_list[i]);
7053rb_gc_impl_object_moved_p(
void *objspace_ptr,
VALUE obj)
7055 return gc_object_moved_p(objspace_ptr, obj);
7063 page->flags.has_uncollectible_wb_unprotected_objects = FALSE;
7064 page->flags.has_remembered_objects = FALSE;
7067 for (; v != (
VALUE)vend; v += stride) {
7068 asan_unpoisoning_object(v) {
7075 if (RVALUE_WB_UNPROTECTED(
objspace, v)) {
7076 page->flags.has_uncollectible_wb_unprotected_objects = TRUE;
7078 if (RVALUE_REMEMBERED(
objspace, v)) {
7079 page->flags.has_remembered_objects = TRUE;
7081 if (page->flags.before_sweep) {
7083 rb_gc_update_object_references(
objspace, v);
7087 rb_gc_update_object_references(
objspace, v);
7097gc_update_references_weak_table_i(
VALUE obj,
void *data)
7100 asan_unpoisoning_object(obj) {
7107gc_update_references_weak_table_replace_i(
VALUE *obj,
void *data)
7109 *obj = rb_gc_location(*obj);
7117 objspace->flags.during_reference_updating =
true;
7119 rb_gc_before_updating_jit_code();
7123 for (
int i = 0; i < HEAP_COUNT; i++) {
7124 bool should_set_mark_bits = TRUE;
7127 ccan_list_for_each(&heap->pages, page, page_node) {
7128 uintptr_t start = (uintptr_t)page->start;
7129 uintptr_t end = start + (page->total_slots * heap->slot_size);
7131 gc_ref_update((
void *)start, (
void *)end, heap->slot_size,
objspace, page);
7132 if (page == heap->sweeping_page) {
7133 should_set_mark_bits = FALSE;
7135 if (should_set_mark_bits) {
7136 gc_setup_mark_bits(page);
7141 gc_update_table_refs(finalizer_table);
7143 rb_gc_update_vm_references((
void *)
objspace);
7145 for (
int table = 0; table < RB_GC_VM_WEAK_TABLE_COUNT; table++) {
7146 rb_gc_vm_weak_table_foreach(
7147 gc_update_references_weak_table_i,
7148 gc_update_references_weak_table_replace_i,
7155 rb_gc_after_updating_jit_code();
7157 objspace->flags.during_reference_updating =
false;
7160#if GC_CAN_COMPILE_COMPACTION
7162root_obj_check_moved_i(
const char *category,
VALUE obj,
void *data)
7166 if (gc_object_moved_p(
objspace, obj)) {
7167 rb_bug(
"ROOT %s points to MOVED: %p -> %s", category, (
void *)obj, rb_obj_info(rb_gc_impl_location(
objspace, obj)));
7172reachable_object_check_moved_i(
VALUE ref,
void *data)
7175 if (gc_object_moved_p(rb_gc_get_objspace(), ref)) {
7176 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)));
7181heap_check_moved_i(
void *vstart,
void *vend,
size_t stride,
void *data)
7186 for (; v != (
VALUE)vend; v += stride) {
7187 if (gc_object_moved_p(
objspace, v)) {
7191 asan_unpoisoning_object(v) {
7197 if (!rb_gc_impl_garbage_object_p(
objspace, v)) {
7198 rb_objspace_reachable_objects_from(v, reachable_object_check_moved_i, (
void *)v);
7210rb_gc_impl_during_gc_p(
void *objspace_ptr)
7217#if RGENGC_PROFILE >= 2
7250 default:
return "unknown";
7255gc_count_add_each_types(
VALUE hash,
const char *name,
const size_t *types)
7259 for (i=0; i<
T_MASK; i++) {
7260 const char *
type = type_name(i, 0);
7263 rb_hash_aset(hash,
ID2SYM(rb_intern(name)), result);
7268rb_gc_impl_gc_count(
void *objspace_ptr)
7278 static VALUE sym_major_by =
Qnil, sym_gc_by, sym_immediate_sweep, sym_have_finalizer, sym_state, sym_need_major_by;
7279 static VALUE sym_nofree, sym_oldgen, sym_shady, sym_force, sym_stress;
7280#if RGENGC_ESTIMATE_OLDMALLOC
7281 static VALUE sym_oldmalloc;
7283 static VALUE sym_newobj, sym_malloc, sym_method, sym_capi;
7284 static VALUE sym_none, sym_marking, sym_sweeping;
7285 static VALUE sym_weak_references_count, sym_retained_weak_references_count;
7287 VALUE major_by, need_major_by;
7288 unsigned int flags = orig_flags ? orig_flags :
objspace->profile.latest_gc_info;
7297 rb_bug(
"gc_info_decode: non-hash or symbol given");
7300 if (
NIL_P(sym_major_by)) {
7301#define S(s) sym_##s = ID2SYM(rb_intern_const(#s))
7314#if RGENGC_ESTIMATE_OLDMALLOC
7326 S(weak_references_count);
7327 S(retained_weak_references_count);
7331#define SET(name, attr) \
7332 if (key == sym_##name) \
7334 else if (hash != Qnil) \
7335 rb_hash_aset(hash, sym_##name, (attr));
7338 (flags & GPR_FLAG_MAJOR_BY_NOFREE) ? sym_nofree :
7339 (flags & GPR_FLAG_MAJOR_BY_OLDGEN) ? sym_oldgen :
7340 (flags & GPR_FLAG_MAJOR_BY_SHADY) ? sym_shady :
7341 (flags & GPR_FLAG_MAJOR_BY_FORCE) ? sym_force :
7342#if RGENGC_ESTIMATE_OLDMALLOC
7343 (flags & GPR_FLAG_MAJOR_BY_OLDMALLOC) ? sym_oldmalloc :
7346 SET(major_by, major_by);
7348 if (orig_flags == 0) {
7349 unsigned int need_major_flags = gc_needs_major_flags;
7351 (need_major_flags & GPR_FLAG_MAJOR_BY_NOFREE) ? sym_nofree :
7352 (need_major_flags & GPR_FLAG_MAJOR_BY_OLDGEN) ? sym_oldgen :
7353 (need_major_flags & GPR_FLAG_MAJOR_BY_SHADY) ? sym_shady :
7354 (need_major_flags & GPR_FLAG_MAJOR_BY_FORCE) ? sym_force :
7355#if RGENGC_ESTIMATE_OLDMALLOC
7356 (need_major_flags & GPR_FLAG_MAJOR_BY_OLDMALLOC) ? sym_oldmalloc :
7359 SET(need_major_by, need_major_by);
7363 (flags & GPR_FLAG_NEWOBJ) ? sym_newobj :
7364 (flags & GPR_FLAG_MALLOC) ? sym_malloc :
7365 (flags & GPR_FLAG_METHOD) ? sym_method :
7366 (flags & GPR_FLAG_CAPI) ? sym_capi :
7367 (flags & GPR_FLAG_STRESS) ? sym_stress :
7371 SET(have_finalizer, (flags & GPR_FLAG_HAVE_FINALIZE) ?
Qtrue :
Qfalse);
7372 SET(immediate_sweep, (flags & GPR_FLAG_IMMEDIATE_SWEEP) ?
Qtrue :
Qfalse);
7374 if (orig_flags == 0) {
7375 SET(state, gc_mode(
objspace) == gc_mode_none ? sym_none :
7376 gc_mode(
objspace) == gc_mode_marking ? sym_marking : sym_sweeping);
7379 SET(weak_references_count,
LONG2FIX(
objspace->profile.weak_references_count));
7380 SET(retained_weak_references_count,
LONG2FIX(
objspace->profile.retained_weak_references_count));
7392rb_gc_impl_latest_gc_info(
void *objspace_ptr,
VALUE key)
7396 return gc_info_decode(
objspace, key, 0);
7403 gc_stat_sym_marking_time,
7404 gc_stat_sym_sweeping_time,
7405 gc_stat_sym_heap_allocated_pages,
7406 gc_stat_sym_heap_empty_pages,
7407 gc_stat_sym_heap_allocatable_slots,
7408 gc_stat_sym_heap_available_slots,
7409 gc_stat_sym_heap_live_slots,
7410 gc_stat_sym_heap_free_slots,
7411 gc_stat_sym_heap_final_slots,
7412 gc_stat_sym_heap_marked_slots,
7413 gc_stat_sym_heap_eden_pages,
7414 gc_stat_sym_total_allocated_pages,
7415 gc_stat_sym_total_freed_pages,
7416 gc_stat_sym_total_allocated_objects,
7417 gc_stat_sym_total_freed_objects,
7418 gc_stat_sym_malloc_increase_bytes,
7419 gc_stat_sym_malloc_increase_bytes_limit,
7420 gc_stat_sym_minor_gc_count,
7421 gc_stat_sym_major_gc_count,
7422 gc_stat_sym_compact_count,
7423 gc_stat_sym_read_barrier_faults,
7424 gc_stat_sym_total_moved_objects,
7425 gc_stat_sym_remembered_wb_unprotected_objects,
7426 gc_stat_sym_remembered_wb_unprotected_objects_limit,
7427 gc_stat_sym_old_objects,
7428 gc_stat_sym_old_objects_limit,
7429#if RGENGC_ESTIMATE_OLDMALLOC
7430 gc_stat_sym_oldmalloc_increase_bytes,
7431 gc_stat_sym_oldmalloc_increase_bytes_limit,
7433 gc_stat_sym_weak_references_count,
7435 gc_stat_sym_total_generated_normal_object_count,
7436 gc_stat_sym_total_generated_shady_object_count,
7437 gc_stat_sym_total_shade_operation_count,
7438 gc_stat_sym_total_promoted_count,
7439 gc_stat_sym_total_remembered_normal_object_count,
7440 gc_stat_sym_total_remembered_shady_object_count,
7445static VALUE gc_stat_symbols[gc_stat_sym_last];
7448setup_gc_stat_symbols(
void)
7450 if (gc_stat_symbols[0] == 0) {
7451#define S(s) gc_stat_symbols[gc_stat_sym_##s] = ID2SYM(rb_intern_const(#s))
7456 S(heap_allocated_pages);
7457 S(heap_empty_pages);
7458 S(heap_allocatable_slots);
7459 S(heap_available_slots);
7462 S(heap_final_slots);
7463 S(heap_marked_slots);
7465 S(total_allocated_pages);
7466 S(total_freed_pages);
7467 S(total_allocated_objects);
7468 S(total_freed_objects);
7469 S(malloc_increase_bytes);
7470 S(malloc_increase_bytes_limit);
7474 S(read_barrier_faults);
7475 S(total_moved_objects);
7476 S(remembered_wb_unprotected_objects);
7477 S(remembered_wb_unprotected_objects_limit);
7479 S(old_objects_limit);
7480#if RGENGC_ESTIMATE_OLDMALLOC
7481 S(oldmalloc_increase_bytes);
7482 S(oldmalloc_increase_bytes_limit);
7484 S(weak_references_count);
7486 S(total_generated_normal_object_count);
7487 S(total_generated_shady_object_count);
7488 S(total_shade_operation_count);
7489 S(total_promoted_count);
7490 S(total_remembered_normal_object_count);
7491 S(total_remembered_shady_object_count);
7498ns_to_ms(uint64_t ns)
7500 return ns / (1000 * 1000);
7504rb_gc_impl_stat(
void *objspace_ptr,
VALUE hash_or_sym)
7509 setup_gc_stat_symbols();
7518 rb_bug(
"non-hash or symbol given");
7521#define SET(name, attr) \
7522 if (key == gc_stat_symbols[gc_stat_sym_##name]) \
7523 return SIZET2NUM(attr); \
7524 else if (hash != Qnil) \
7525 rb_hash_aset(hash, gc_stat_symbols[gc_stat_sym_##name], SIZET2NUM(attr));
7527 SET(count,
objspace->profile.count);
7528 SET(time, (
size_t)ns_to_ms(
objspace->profile.marking_time_ns +
objspace->profile.sweeping_time_ns));
7529 SET(marking_time, (
size_t)ns_to_ms(
objspace->profile.marking_time_ns));
7530 SET(sweeping_time, (
size_t)ns_to_ms(
objspace->profile.sweeping_time_ns));
7533 SET(heap_allocated_pages, rb_darray_size(
objspace->heap_pages.sorted));
7534 SET(heap_empty_pages,
objspace->empty_pages_count)
7535 SET(heap_allocatable_slots,
objspace->heap_pages.allocatable_slots);
7536 SET(heap_available_slots, objspace_available_slots(
objspace));
7537 SET(heap_live_slots, objspace_live_slots(
objspace));
7538 SET(heap_free_slots, objspace_free_slots(
objspace));
7539 SET(heap_final_slots, total_final_slots_count(
objspace));
7540 SET(heap_marked_slots,
objspace->marked_slots);
7541 SET(heap_eden_pages, heap_eden_total_pages(
objspace));
7542 SET(total_allocated_pages,
objspace->heap_pages.allocated_pages);
7543 SET(total_freed_pages,
objspace->heap_pages.freed_pages);
7544 SET(total_allocated_objects, total_allocated_objects(
objspace));
7545 SET(total_freed_objects, total_freed_objects(
objspace));
7546 SET(malloc_increase_bytes, malloc_increase);
7547 SET(malloc_increase_bytes_limit, malloc_limit);
7548 SET(minor_gc_count,
objspace->profile.minor_gc_count);
7549 SET(major_gc_count,
objspace->profile.major_gc_count);
7550 SET(compact_count,
objspace->profile.compact_count);
7551 SET(read_barrier_faults,
objspace->profile.read_barrier_faults);
7552 SET(total_moved_objects,
objspace->rcompactor.total_moved);
7553 SET(remembered_wb_unprotected_objects,
objspace->rgengc.uncollectible_wb_unprotected_objects);
7554 SET(remembered_wb_unprotected_objects_limit,
objspace->rgengc.uncollectible_wb_unprotected_objects_limit);
7555 SET(old_objects,
objspace->rgengc.old_objects);
7556 SET(old_objects_limit,
objspace->rgengc.old_objects_limit);
7557#if RGENGC_ESTIMATE_OLDMALLOC
7558 SET(oldmalloc_increase_bytes,
objspace->rgengc.oldmalloc_increase);
7559 SET(oldmalloc_increase_bytes_limit,
objspace->rgengc.oldmalloc_increase_limit);
7563 SET(total_generated_normal_object_count,
objspace->profile.total_generated_normal_object_count);
7564 SET(total_generated_shady_object_count,
objspace->profile.total_generated_shady_object_count);
7565 SET(total_shade_operation_count,
objspace->profile.total_shade_operation_count);
7566 SET(total_promoted_count,
objspace->profile.total_promoted_count);
7567 SET(total_remembered_normal_object_count,
objspace->profile.total_remembered_normal_object_count);
7568 SET(total_remembered_shady_object_count,
objspace->profile.total_remembered_shady_object_count);
7577#if defined(RGENGC_PROFILE) && RGENGC_PROFILE >= 2
7579 gc_count_add_each_types(hash,
"generated_normal_object_count_types",
objspace->profile.generated_normal_object_count_types);
7580 gc_count_add_each_types(hash,
"generated_shady_object_count_types",
objspace->profile.generated_shady_object_count_types);
7581 gc_count_add_each_types(hash,
"shade_operation_count_types",
objspace->profile.shade_operation_count_types);
7582 gc_count_add_each_types(hash,
"promoted_types",
objspace->profile.promoted_types);
7583 gc_count_add_each_types(hash,
"remembered_normal_object_count_types",
objspace->profile.remembered_normal_object_count_types);
7584 gc_count_add_each_types(hash,
"remembered_shady_object_count_types",
objspace->profile.remembered_shady_object_count_types);
7591enum gc_stat_heap_sym {
7592 gc_stat_heap_sym_slot_size,
7593 gc_stat_heap_sym_heap_eden_pages,
7594 gc_stat_heap_sym_heap_eden_slots,
7595 gc_stat_heap_sym_total_allocated_pages,
7596 gc_stat_heap_sym_force_major_gc_count,
7597 gc_stat_heap_sym_force_incremental_marking_finish_count,
7598 gc_stat_heap_sym_total_allocated_objects,
7599 gc_stat_heap_sym_total_freed_objects,
7600 gc_stat_heap_sym_last
7603static VALUE gc_stat_heap_symbols[gc_stat_heap_sym_last];
7606setup_gc_stat_heap_symbols(
void)
7608 if (gc_stat_heap_symbols[0] == 0) {
7609#define S(s) gc_stat_heap_symbols[gc_stat_heap_sym_##s] = ID2SYM(rb_intern_const(#s))
7613 S(total_allocated_pages);
7614 S(force_major_gc_count);
7615 S(force_incremental_marking_finish_count);
7616 S(total_allocated_objects);
7617 S(total_freed_objects);
7625#define SET(name, attr) \
7626 if (key == gc_stat_heap_symbols[gc_stat_heap_sym_##name]) \
7627 return SIZET2NUM(attr); \
7628 else if (hash != Qnil) \
7629 rb_hash_aset(hash, gc_stat_heap_symbols[gc_stat_heap_sym_##name], SIZET2NUM(attr));
7631 SET(slot_size, heap->slot_size);
7632 SET(heap_eden_pages, heap->total_pages);
7633 SET(heap_eden_slots, heap->total_slots);
7634 SET(total_allocated_pages, heap->total_allocated_pages);
7635 SET(force_major_gc_count, heap->force_major_gc_count);
7636 SET(force_incremental_marking_finish_count, heap->force_incremental_marking_finish_count);
7637 SET(total_allocated_objects, heap->total_allocated_objects);
7638 SET(total_freed_objects, heap->total_freed_objects);
7650rb_gc_impl_stat_heap(
void *objspace_ptr,
VALUE heap_name,
VALUE hash_or_sym)
7654 setup_gc_stat_heap_symbols();
7656 if (
NIL_P(heap_name)) {
7658 rb_bug(
"non-hash given");
7661 for (
int i = 0; i < HEAP_COUNT; i++) {
7664 hash = rb_hash_new();
7665 rb_hash_aset(hash_or_sym,
INT2FIX(i), hash);
7668 stat_one_heap(&heaps[i], hash,
Qnil);
7672 int heap_idx =
FIX2INT(heap_name);
7674 if (heap_idx < 0 || heap_idx >= HEAP_COUNT) {
7675 rb_raise(rb_eArgError,
"size pool index out of range");
7679 return stat_one_heap(&heaps[heap_idx],
Qnil, hash_or_sym);
7682 return stat_one_heap(&heaps[heap_idx], hash_or_sym,
Qnil);
7685 rb_bug(
"non-hash or symbol given");
7689 rb_bug(
"heap_name must be nil or an Integer");
7701#define RBOOL(v) (v ? Qtrue : Qfalse)
7705rb_gc_impl_config_get(
void *objspace_ptr)
7707#define sym(name) ID2SYM(rb_intern_const(name))
7709 VALUE hash = rb_hash_new();
7711 rb_hash_aset(hash, sym(
"rgengc_allow_full_mark"), RBOOL(gc_config_full_mark_val));
7720 if (
rb_sym2id(key) == rb_intern(
"rgengc_allow_full_mark")) {
7722 gc_config_full_mark_set(
RTEST(value));
7728rb_gc_impl_config_set(
void *objspace_ptr,
VALUE hash)
7733 rb_raise(rb_eArgError,
"expected keyword arguments");
7740rb_gc_impl_stress_get(
void *objspace_ptr)
7743 return ruby_gc_stress_mode;
7747rb_gc_impl_stress_set(
void *objspace_ptr,
VALUE flag)
7756get_envparam_size(
const char *name,
size_t *default_value,
size_t lower_bound)
7758 const char *ptr = getenv(name);
7761 if (ptr != NULL && *ptr) {
7764#if SIZEOF_SIZE_T == SIZEOF_LONG_LONG
7765 val = strtoll(ptr, &end, 0);
7767 val = strtol(ptr, &end, 0);
7779 unit = 1024*1024*1024;
7783 while (*end && isspace((
unsigned char)*end)) end++;
7785 if (
RTEST(
ruby_verbose)) fprintf(stderr,
"invalid string for %s: %s\n", name, ptr);
7789 if (val < -(ssize_t)(SIZE_MAX / 2 / unit) || (ssize_t)(SIZE_MAX / 2 / unit) < val) {
7790 if (
RTEST(
ruby_verbose)) fprintf(stderr,
"%s=%s is ignored because it overflows\n", name, ptr);
7795 if (val > 0 && (
size_t)val > lower_bound) {
7797 fprintf(stderr,
"%s=%"PRIdSIZE
" (default value: %"PRIuSIZE
")\n", name, val, *default_value);
7799 *default_value = (size_t)val;
7804 fprintf(stderr,
"%s=%"PRIdSIZE
" (default value: %"PRIuSIZE
") is ignored because it must be greater than %"PRIuSIZE
".\n",
7805 name, val, *default_value, lower_bound);
7814get_envparam_double(
const char *name,
double *default_value,
double lower_bound,
double upper_bound,
int accept_zero)
7816 const char *ptr = getenv(name);
7819 if (ptr != NULL && *ptr) {
7822 if (!*ptr || *end) {
7823 if (
RTEST(
ruby_verbose)) fprintf(stderr,
"invalid string for %s: %s\n", name, ptr);
7827 if (accept_zero && val == 0.0) {
7830 else if (val <= lower_bound) {
7832 fprintf(stderr,
"%s=%f (default value: %f) is ignored because it must be greater than %f.\n",
7833 name, val, *default_value, lower_bound);
7836 else if (upper_bound != 0.0 &&
7837 val > upper_bound) {
7839 fprintf(stderr,
"%s=%f (default value: %f) is ignored because it must be lower than %f.\n",
7840 name, val, *default_value, upper_bound);
7850 if (
RTEST(
ruby_verbose)) fprintf(stderr,
"%s=%f (default value: %f)\n", name, val, *default_value);
7851 *default_value = val;
7896rb_gc_impl_set_params(
void *objspace_ptr)
7900 if (get_envparam_size(
"RUBY_GC_HEAP_FREE_SLOTS", &gc_params.heap_free_slots, 0)) {
7904 for (
int i = 0; i < HEAP_COUNT; i++) {
7905 char env_key[
sizeof(
"RUBY_GC_HEAP_" "_INIT_SLOTS") +
DECIMAL_SIZE_OF_BITS(
sizeof(
int) * CHAR_BIT)];
7906 snprintf(env_key,
sizeof(env_key),
"RUBY_GC_HEAP_%d_INIT_SLOTS", i);
7908 get_envparam_size(env_key, &gc_params.heap_init_slots[i], 0);
7911 get_envparam_double(
"RUBY_GC_HEAP_GROWTH_FACTOR", &gc_params.growth_factor, 1.0, 0.0, FALSE);
7912 get_envparam_size (
"RUBY_GC_HEAP_GROWTH_MAX_SLOTS", &gc_params.growth_max_slots, 0);
7913 get_envparam_double(
"RUBY_GC_HEAP_FREE_SLOTS_MIN_RATIO", &gc_params.heap_free_slots_min_ratio,
7915 get_envparam_double(
"RUBY_GC_HEAP_FREE_SLOTS_MAX_RATIO", &gc_params.heap_free_slots_max_ratio,
7916 gc_params.heap_free_slots_min_ratio, 1.0, FALSE);
7917 get_envparam_double(
"RUBY_GC_HEAP_FREE_SLOTS_GOAL_RATIO", &gc_params.heap_free_slots_goal_ratio,
7918 gc_params.heap_free_slots_min_ratio, gc_params.heap_free_slots_max_ratio, TRUE);
7919 get_envparam_double(
"RUBY_GC_HEAP_OLDOBJECT_LIMIT_FACTOR", &gc_params.oldobject_limit_factor, 0.0, 0.0, TRUE);
7920 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);
7922 if (get_envparam_size(
"RUBY_GC_MALLOC_LIMIT", &gc_params.malloc_limit_min, 0)) {
7923 malloc_limit = gc_params.malloc_limit_min;
7925 get_envparam_size (
"RUBY_GC_MALLOC_LIMIT_MAX", &gc_params.malloc_limit_max, 0);
7926 if (!gc_params.malloc_limit_max) {
7927 gc_params.malloc_limit_max = SIZE_MAX;
7929 get_envparam_double(
"RUBY_GC_MALLOC_LIMIT_GROWTH_FACTOR", &gc_params.malloc_limit_growth_factor, 1.0, 0.0, FALSE);
7931#if RGENGC_ESTIMATE_OLDMALLOC
7932 if (get_envparam_size(
"RUBY_GC_OLDMALLOC_LIMIT", &gc_params.oldmalloc_limit_min, 0)) {
7933 objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_min;
7935 get_envparam_size (
"RUBY_GC_OLDMALLOC_LIMIT_MAX", &gc_params.oldmalloc_limit_max, 0);
7936 get_envparam_double(
"RUBY_GC_OLDMALLOC_LIMIT_GROWTH_FACTOR", &gc_params.oldmalloc_limit_growth_factor, 1.0, 0.0, FALSE);
7943#ifdef HAVE_MALLOC_USABLE_SIZE
7945 hint = malloc_usable_size(ptr);
7952 MEMOP_TYPE_MALLOC = 0,
7958atomic_sub_nounderflow(
size_t *var,
size_t sub)
7960 if (sub == 0)
return;
7964 if (val < sub) sub = val;
7969#define gc_stress_full_mark_after_malloc_p() \
7970 (FIXNUM_P(ruby_gc_stress_mode) && (FIX2LONG(ruby_gc_stress_mode) & (1<<gc_stress_full_mark_after_malloc)))
7976 unsigned int reason = (GPR_FLAG_IMMEDIATE_MARK | GPR_FLAG_IMMEDIATE_SWEEP |
7977 GPR_FLAG_STRESS | GPR_FLAG_MALLOC);
7979 if (gc_stress_full_mark_after_malloc_p()) {
7980 reason |= GPR_FLAG_FULL_MARK;
7982 garbage_collect_with_gvl(
objspace, reason);
7987objspace_malloc_increase_report(
rb_objspace_t *
objspace,
void *mem,
size_t new_size,
size_t old_size,
enum memop_type
type,
bool gc_allowed)
7989 if (0) fprintf(stderr,
"increase - ptr: %p, type: %s, new_size: %"PRIdSIZE
", old_size: %"PRIdSIZE
"\n",
7991 type == MEMOP_TYPE_MALLOC ?
"malloc" :
7992 type == MEMOP_TYPE_FREE ?
"free " :
7993 type == MEMOP_TYPE_REALLOC ?
"realloc":
"error",
7994 new_size, old_size);
7999objspace_malloc_increase_body(
rb_objspace_t *
objspace,
void *mem,
size_t new_size,
size_t old_size,
enum memop_type
type,
bool gc_allowed)
8001 if (new_size > old_size) {
8003#if RGENGC_ESTIMATE_OLDMALLOC
8008 atomic_sub_nounderflow(&malloc_increase, old_size - new_size);
8009#if RGENGC_ESTIMATE_OLDMALLOC
8010 atomic_sub_nounderflow(&
objspace->rgengc.oldmalloc_increase, old_size - new_size);
8014 if (
type == MEMOP_TYPE_MALLOC && gc_allowed) {
8017 if (ruby_thread_has_gvl_p() && is_lazy_sweeping(
objspace)) {
8021 garbage_collect_with_gvl(
objspace, GPR_FLAG_MALLOC);
8025#if MALLOC_ALLOCATED_SIZE
8026 if (new_size >= old_size) {
8030 size_t dec_size = old_size - new_size;
8032#if MALLOC_ALLOCATED_SIZE_CHECK
8033 size_t allocated_size =
objspace->malloc_params.allocated_size;
8034 if (allocated_size < dec_size) {
8035 rb_bug(
"objspace_malloc_increase: underflow malloc_params.allocated_size.");
8038 atomic_sub_nounderflow(&
objspace->malloc_params.allocated_size, dec_size);
8042 case MEMOP_TYPE_MALLOC:
8045 case MEMOP_TYPE_FREE:
8047 size_t allocations =
objspace->malloc_params.allocations;
8048 if (allocations > 0) {
8049 atomic_sub_nounderflow(&
objspace->malloc_params.allocations, 1);
8051#if MALLOC_ALLOCATED_SIZE_CHECK
8053 GC_ASSERT(
objspace->malloc_params.allocations > 0);
8058 case MEMOP_TYPE_REALLOC:
break;
8064#define objspace_malloc_increase(...) \
8065 for (bool malloc_increase_done = objspace_malloc_increase_report(__VA_ARGS__); \
8066 !malloc_increase_done; \
8067 malloc_increase_done = objspace_malloc_increase_body(__VA_ARGS__))
8076 if (size == 0) size = 1;
8078#if CALC_EXACT_MALLOC_SIZE
8092 return during_gc && !dont_gc_val() && !rb_gc_multi_ractor_p() && ruby_thread_has_gvl_p();
8098 size = objspace_malloc_size(
objspace, mem, size);
8099 objspace_malloc_increase(
objspace, mem, size, 0, MEMOP_TYPE_MALLOC, gc_allowed) {}
8101#if CALC_EXACT_MALLOC_SIZE
8112#if defined(__GNUC__) && RUBY_DEBUG
8113#define RB_BUG_INSTEAD_OF_RB_MEMERROR 1
8116#ifndef RB_BUG_INSTEAD_OF_RB_MEMERROR
8117# define RB_BUG_INSTEAD_OF_RB_MEMERROR 0
8120#define GC_MEMERROR(...) \
8121 ((RB_BUG_INSTEAD_OF_RB_MEMERROR+0) ? rb_bug("" __VA_ARGS__) : (void)0)
8123#define TRY_WITH_GC(siz, expr) do { \
8124 const gc_profile_record_flag gpr = \
8125 GPR_FLAG_FULL_MARK | \
8126 GPR_FLAG_IMMEDIATE_MARK | \
8127 GPR_FLAG_IMMEDIATE_SWEEP | \
8129 objspace_malloc_gc_stress(objspace); \
8131 if (RB_LIKELY((expr))) { \
8134 else if (gc_allowed && !garbage_collect_with_gvl(objspace, gpr)) { \
8136 GC_MEMERROR("TRY_WITH_GC: could not GC"); \
8138 else if ((expr)) { \
8142 GC_MEMERROR("TRY_WITH_GC: could not allocate:" \
8143 "%"PRIdSIZE" bytes for %s", \
8151 if (RB_UNLIKELY(malloc_during_gc_p(
objspace))) {
8154 rb_bug(
"Cannot %s during GC", msg);
8159rb_gc_impl_free(
void *objspace_ptr,
void *ptr,
size_t old_size)
8170#if CALC_EXACT_MALLOC_SIZE
8173 old_size = info->size;
8175 old_size = objspace_malloc_size(
objspace, ptr, old_size);
8177 objspace_malloc_increase(
objspace, ptr, 0, old_size, MEMOP_TYPE_FREE,
true) {
8180 RB_DEBUG_COUNTER_INC(heap_xfree);
8185rb_gc_impl_malloc(
void *objspace_ptr,
size_t size,
bool gc_allowed)
8188 check_malloc_not_in_gc(
objspace,
"malloc");
8192 size = objspace_malloc_prepare(
objspace, size);
8193 TRY_WITH_GC(size, mem = malloc(size));
8194 RB_DEBUG_COUNTER_INC(heap_xmalloc);
8195 if (!mem)
return mem;
8196 return objspace_malloc_fixup(
objspace, mem, size, gc_allowed);
8200rb_gc_impl_calloc(
void *objspace_ptr,
size_t size,
bool gc_allowed)
8204 if (RB_UNLIKELY(malloc_during_gc_p(
objspace))) {
8205 rb_warn(
"calloc during GC detected, this could cause crashes if it triggers another GC");
8206#if RGENGC_CHECK_MODE || RUBY_DEBUG
8207 rb_bug(
"Cannot calloc during GC");
8213 size = objspace_malloc_prepare(
objspace, size);
8214 TRY_WITH_GC(size, mem = calloc1(size));
8215 if (!mem)
return mem;
8216 return objspace_malloc_fixup(
objspace, mem, size, gc_allowed);
8220rb_gc_impl_realloc(
void *objspace_ptr,
void *ptr,
size_t new_size,
size_t old_size,
bool gc_allowed)
8224 check_malloc_not_in_gc(
objspace,
"realloc");
8228 if (!ptr)
return rb_gc_impl_malloc(
objspace, new_size, gc_allowed);
8235 if (new_size == 0) {
8236 if ((mem = rb_gc_impl_malloc(
objspace, 0, gc_allowed)) != NULL) {
8259 rb_gc_impl_free(
objspace, ptr, old_size);
8273#if CALC_EXACT_MALLOC_SIZE
8278 old_size = info->size;
8282 old_size = objspace_malloc_size(
objspace, ptr, old_size);
8284 if (!mem)
return mem;
8285 new_size = objspace_malloc_size(
objspace, mem, new_size);
8287#if CALC_EXACT_MALLOC_SIZE
8290 info->size = new_size;
8295 objspace_malloc_increase(
objspace, mem, new_size, old_size, MEMOP_TYPE_REALLOC, gc_allowed);
8297 RB_DEBUG_COUNTER_INC(heap_xrealloc);
8302rb_gc_impl_adjust_memory_usage(
void *objspace_ptr, ssize_t diff)
8307 objspace_malloc_increase(
objspace, 0, diff, 0, MEMOP_TYPE_REALLOC,
true);
8309 else if (diff < 0) {
8310 objspace_malloc_increase(
objspace, 0, 0, -diff, MEMOP_TYPE_REALLOC,
true);
8319#define GC_PROFILE_RECORD_DEFAULT_SIZE 100
8322current_process_time(
struct timespec *ts)
8324#if defined(HAVE_CLOCK_GETTIME) && defined(CLOCK_PROCESS_CPUTIME_ID)
8326 static int try_clock_gettime = 1;
8327 if (try_clock_gettime && clock_gettime(CLOCK_PROCESS_CPUTIME_ID, ts) == 0) {
8331 try_clock_gettime = 0;
8338 struct rusage usage;
8340 if (getrusage(RUSAGE_SELF, &usage) == 0) {
8341 time = usage.ru_utime;
8342 ts->tv_sec = time.tv_sec;
8343 ts->tv_nsec = (int32_t)time.tv_usec * 1000;
8351 FILETIME creation_time, exit_time, kernel_time, user_time;
8354 if (GetProcessTimes(GetCurrentProcess(),
8355 &creation_time, &exit_time, &kernel_time, &user_time) != 0) {
8356 memcpy(&ui, &user_time,
sizeof(FILETIME));
8357#define PER100NSEC (uint64_t)(1000 * 1000 * 10)
8358 ts->tv_nsec = (long)(ui.QuadPart % PER100NSEC);
8359 ts->tv_sec = (time_t)(ui.QuadPart / PER100NSEC);
8372 if (current_process_time(&ts)) {
8373 return ts.tv_sec + ts.tv_nsec * 1e-9;
8385 size_t index =
objspace->profile.next_index;
8392 objspace->profile.size = GC_PROFILE_RECORD_DEFAULT_SIZE;
8395 if (index >=
objspace->profile.size) {
8399 if (!ptr) rb_memerror();
8403 rb_bug(
"gc_profile malloc or realloc miss");
8409 record->flags = reason | (ruby_gc_stressful ? GPR_FLAG_STRESS : 0);
8410#if MALLOC_ALLOCATED_SIZE
8411 record->allocated_size = malloc_allocated_size;
8413#if GC_PROFILE_MORE_DETAIL && GC_PROFILE_DETAIL_MEMORY
8416 struct rusage usage;
8417 if (getrusage(RUSAGE_SELF, &usage) == 0) {
8418 record->maxrss = usage.ru_maxrss;
8419 record->minflt = usage.ru_minflt;
8420 record->majflt = usage.ru_majflt;
8433#if GC_PROFILE_MORE_DETAIL
8434 record->prepare_time =
objspace->profile.prepare_time;
8436 record->gc_time = 0;
8437 record->gc_invoke_time = getrusage_time();
8442elapsed_time_from(
double time)
8444 double now = getrusage_time();
8458 record->gc_time = elapsed_time_from(record->gc_invoke_time);
8459 record->gc_invoke_time -=
objspace->profile.invoke_time;
8463#ifdef BUILDING_MODULAR_GC
8464# define RUBY_DTRACE_GC_HOOK(name)
8466# define RUBY_DTRACE_GC_HOOK(name) \
8467 do {if (RUBY_DTRACE_GC_##name##_ENABLED()) RUBY_DTRACE_GC_##name();} while (0)
8473 RUBY_DTRACE_GC_HOOK(MARK_BEGIN);
8474#if GC_PROFILE_MORE_DETAIL
8476 gc_prof_record(
objspace)->gc_mark_time = getrusage_time();
8484 RUBY_DTRACE_GC_HOOK(MARK_END);
8485#if GC_PROFILE_MORE_DETAIL
8488 record->gc_mark_time = elapsed_time_from(record->gc_mark_time);
8496 RUBY_DTRACE_GC_HOOK(SWEEP_BEGIN);
8500 if (record->gc_time > 0 || GC_PROFILE_MORE_DETAIL) {
8501 objspace->profile.gc_sweep_start_time = getrusage_time();
8509 RUBY_DTRACE_GC_HOOK(SWEEP_END);
8515 if (record->gc_time > 0) {
8516 sweep_time = elapsed_time_from(
objspace->profile.gc_sweep_start_time);
8518 record->gc_time += sweep_time;
8520 else if (GC_PROFILE_MORE_DETAIL) {
8521 sweep_time = elapsed_time_from(
objspace->profile.gc_sweep_start_time);
8524#if GC_PROFILE_MORE_DETAIL
8525 record->gc_sweep_time += sweep_time;
8526 if (heap_pages_deferred_final) record->flags |= GPR_FLAG_HAVE_FINALIZE;
8528 if (heap_pages_deferred_final)
objspace->profile.latest_gc_info |= GPR_FLAG_HAVE_FINALIZE;
8535#if GC_PROFILE_MORE_DETAIL
8538 record->allocate_increase = malloc_increase;
8539 record->allocate_limit = malloc_limit;
8549 size_t live =
objspace->profile.total_allocated_objects_at_gc_start - total_freed_objects(
objspace);
8550 size_t total =
objspace->profile.heap_used_at_gc_start * HEAP_PAGE_OBJ_LIMIT;
8552#if GC_PROFILE_MORE_DETAIL
8553 record->heap_use_pages =
objspace->profile.heap_used_at_gc_start;
8554 record->heap_live_objects = live;
8555 record->heap_free_objects = total - live;
8558 record->heap_total_objects = total;
8559 record->heap_use_size = live * BASE_SLOT_SIZE;
8560 record->heap_total_size = total * BASE_SLOT_SIZE;
8576 void *p =
objspace->profile.records;
8580 objspace->profile.current_record = 0;
8636gc_profile_record_get(
VALUE _)
8647 for (i =0; i <
objspace->profile.next_index; i++) {
8650 prof = rb_hash_new();
8651 rb_hash_aset(prof,
ID2SYM(rb_intern(
"GC_FLAGS")), gc_info_decode(
objspace, rb_hash_new(), record->flags));
8652 rb_hash_aset(prof,
ID2SYM(rb_intern(
"GC_TIME")),
DBL2NUM(record->gc_time));
8653 rb_hash_aset(prof,
ID2SYM(rb_intern(
"GC_INVOKE_TIME")),
DBL2NUM(record->gc_invoke_time));
8654 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HEAP_USE_SIZE")),
SIZET2NUM(record->heap_use_size));
8655 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HEAP_TOTAL_SIZE")),
SIZET2NUM(record->heap_total_size));
8656 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HEAP_TOTAL_OBJECTS")),
SIZET2NUM(record->heap_total_objects));
8657 rb_hash_aset(prof,
ID2SYM(rb_intern(
"MOVED_OBJECTS")),
SIZET2NUM(record->moved_objects));
8658 rb_hash_aset(prof,
ID2SYM(rb_intern(
"GC_IS_MARKED")),
Qtrue);
8659#if GC_PROFILE_MORE_DETAIL
8660 rb_hash_aset(prof,
ID2SYM(rb_intern(
"GC_MARK_TIME")),
DBL2NUM(record->gc_mark_time));
8661 rb_hash_aset(prof,
ID2SYM(rb_intern(
"GC_SWEEP_TIME")),
DBL2NUM(record->gc_sweep_time));
8662 rb_hash_aset(prof,
ID2SYM(rb_intern(
"ALLOCATE_INCREASE")),
SIZET2NUM(record->allocate_increase));
8663 rb_hash_aset(prof,
ID2SYM(rb_intern(
"ALLOCATE_LIMIT")),
SIZET2NUM(record->allocate_limit));
8664 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HEAP_USE_PAGES")),
SIZET2NUM(record->heap_use_pages));
8665 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HEAP_LIVE_OBJECTS")),
SIZET2NUM(record->heap_live_objects));
8666 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HEAP_FREE_OBJECTS")),
SIZET2NUM(record->heap_free_objects));
8668 rb_hash_aset(prof,
ID2SYM(rb_intern(
"REMOVING_OBJECTS")),
SIZET2NUM(record->removing_objects));
8669 rb_hash_aset(prof,
ID2SYM(rb_intern(
"EMPTY_OBJECTS")),
SIZET2NUM(record->empty_objects));
8671 rb_hash_aset(prof,
ID2SYM(rb_intern(
"HAVE_FINALIZE")), (record->flags & GPR_FLAG_HAVE_FINALIZE) ?
Qtrue :
Qfalse);
8674#if RGENGC_PROFILE > 0
8675 rb_hash_aset(prof,
ID2SYM(rb_intern(
"OLD_OBJECTS")),
SIZET2NUM(record->old_objects));
8676 rb_hash_aset(prof,
ID2SYM(rb_intern(
"REMEMBERED_NORMAL_OBJECTS")),
SIZET2NUM(record->remembered_normal_objects));
8677 rb_hash_aset(prof,
ID2SYM(rb_intern(
"REMEMBERED_SHADY_OBJECTS")),
SIZET2NUM(record->remembered_shady_objects));
8685#if GC_PROFILE_MORE_DETAIL
8686#define MAJOR_REASON_MAX 0x10
8689gc_profile_dump_major_reason(
unsigned int flags,
char *buff)
8691 unsigned int reason = flags & GPR_FLAG_MAJOR_MASK;
8694 if (reason == GPR_FLAG_NONE) {
8700 if (reason & GPR_FLAG_MAJOR_BY_##x) { \
8701 buff[i++] = #x[0]; \
8702 if (i >= MAJOR_REASON_MAX) rb_bug("gc_profile_dump_major_reason: overflow"); \
8708#if RGENGC_ESTIMATE_OLDMALLOC
8723 size_t count =
objspace->profile.next_index;
8724#ifdef MAJOR_REASON_MAX
8725 char reason_str[MAJOR_REASON_MAX];
8728 if (
objspace->profile.run && count ) {
8732 append(out, rb_sprintf(
"GC %"PRIuSIZE
" invokes.\n",
objspace->profile.count));
8733 append(out,
rb_str_new_cstr(
"Index Invoke Time(sec) Use Size(byte) Total Size(byte) Total Object GC Time(ms)\n"));
8735 for (i = 0; i < count; i++) {
8736 record = &
objspace->profile.records[i];
8737 append(out, rb_sprintf(
"%5"PRIuSIZE
" %19.3f %20"PRIuSIZE
" %20"PRIuSIZE
" %20"PRIuSIZE
" %30.20f\n",
8738 i+1, record->gc_invoke_time, record->heap_use_size,
8739 record->heap_total_size, record->heap_total_objects, record->gc_time*1000));
8742#if GC_PROFILE_MORE_DETAIL
8743 const char *str =
"\n\n" \
8745 "Prepare Time = Previously GC's rest sweep time\n"
8746 "Index Flags Allocate Inc. Allocate Limit"
8747#if CALC_EXACT_MALLOC_SIZE
8750 " Use Page Mark Time(ms) Sweep Time(ms) Prepare Time(ms) LivingObj FreeObj RemovedObj EmptyObj"
8752 " OldgenObj RemNormObj RemShadObj"
8754#if GC_PROFILE_DETAIL_MEMORY
8755 " MaxRSS(KB) MinorFLT MajorFLT"
8760 for (i = 0; i < count; i++) {
8761 record = &
objspace->profile.records[i];
8762 append(out, rb_sprintf(
"%5"PRIuSIZE
" %4s/%c/%6s%c %13"PRIuSIZE
" %15"PRIuSIZE
8763#
if CALC_EXACT_MALLOC_SIZE
8766 " %9"PRIuSIZE
" %17.12f %17.12f %17.12f %10"PRIuSIZE
" %10"PRIuSIZE
" %10"PRIuSIZE
" %10"PRIuSIZE
8768 "%10"PRIuSIZE
" %10"PRIuSIZE
" %10"PRIuSIZE
8770#
if GC_PROFILE_DETAIL_MEMORY
8776 gc_profile_dump_major_reason(record->flags, reason_str),
8777 (record->flags & GPR_FLAG_HAVE_FINALIZE) ?
'F' :
'.',
8778 (record->flags & GPR_FLAG_NEWOBJ) ?
"NEWOBJ" :
8779 (record->flags & GPR_FLAG_MALLOC) ?
"MALLOC" :
8780 (record->flags & GPR_FLAG_METHOD) ?
"METHOD" :
8781 (record->flags & GPR_FLAG_CAPI) ?
"CAPI__" :
"??????",
8782 (record->flags & GPR_FLAG_STRESS) ?
'!' :
' ',
8783 record->allocate_increase, record->allocate_limit,
8784#if CALC_EXACT_MALLOC_SIZE
8785 record->allocated_size,
8787 record->heap_use_pages,
8788 record->gc_mark_time*1000,
8789 record->gc_sweep_time*1000,
8790 record->prepare_time*1000,
8792 record->heap_live_objects,
8793 record->heap_free_objects,
8794 record->removing_objects,
8795 record->empty_objects
8798 record->old_objects,
8799 record->remembered_normal_objects,
8800 record->remembered_shady_objects
8802#if GC_PROFILE_DETAIL_MEMORY
8804 record->maxrss / 1024,
8827gc_profile_result(
VALUE _)
8844gc_profile_report(
int argc,
VALUE *argv,
VALUE self)
8849 gc_profile_dump_on(out, rb_io_write);
8862gc_profile_total_time(
VALUE self)
8869 size_t count =
objspace->profile.next_index;
8871 for (i = 0; i < count; i++) {
8872 time +=
objspace->profile.records[i].gc_time;
8886gc_profile_enable_get(
VALUE self)
8901gc_profile_enable(
VALUE _)
8905 objspace->profile.current_record = 0;
8918gc_profile_disable(
VALUE _)
8923 objspace->profile.current_record = 0;
8938gc_verify_internal_consistency_m(
VALUE dummy)
8940 gc_verify_internal_consistency(rb_gc_get_objspace());
8944#if GC_CAN_COMPILE_COMPACTION
8958 GC_ASSERT(GC_COMPACTION_SUPPORTED);
8960 ruby_enable_autocompact =
RTEST(v);
8962#if RGENGC_CHECK_MODE
8963 ruby_autocompact_compare_func = NULL;
8967 if (
id == rb_intern(
"empty")) {
8968 ruby_autocompact_compare_func = compare_free_slots;
8976# define gc_set_auto_compact rb_f_notimplement
8979#if GC_CAN_COMPILE_COMPACTION
8987gc_get_auto_compact(
VALUE _)
8992# define gc_get_auto_compact rb_f_notimplement
8995#if GC_CAN_COMPILE_COMPACTION
9021gc_compact_stats(
VALUE self)
9024 VALUE h = rb_hash_new();
9025 VALUE considered = rb_hash_new();
9026 VALUE moved = rb_hash_new();
9027 VALUE moved_up = rb_hash_new();
9028 VALUE moved_down = rb_hash_new();
9030 for (
size_t i = 0; i <
T_MASK; i++) {
9031 if (
objspace->rcompactor.considered_count_table[i]) {
9032 rb_hash_aset(considered, type_sym(i),
SIZET2NUM(
objspace->rcompactor.considered_count_table[i]));
9035 if (
objspace->rcompactor.moved_count_table[i]) {
9036 rb_hash_aset(moved, type_sym(i),
SIZET2NUM(
objspace->rcompactor.moved_count_table[i]));
9039 if (
objspace->rcompactor.moved_up_count_table[i]) {
9040 rb_hash_aset(moved_up, type_sym(i),
SIZET2NUM(
objspace->rcompactor.moved_up_count_table[i]));
9043 if (
objspace->rcompactor.moved_down_count_table[i]) {
9044 rb_hash_aset(moved_down, type_sym(i),
SIZET2NUM(
objspace->rcompactor.moved_down_count_table[i]));
9048 rb_hash_aset(h,
ID2SYM(rb_intern(
"considered")), considered);
9049 rb_hash_aset(h,
ID2SYM(rb_intern(
"moved")), moved);
9050 rb_hash_aset(h,
ID2SYM(rb_intern(
"moved_up")), moved_up);
9051 rb_hash_aset(h,
ID2SYM(rb_intern(
"moved_down")), moved_down);
9056# define gc_compact_stats rb_f_notimplement
9059#if GC_CAN_COMPILE_COMPACTION
9078gc_compact(
VALUE self)
9081 int full_marking_p = gc_config_full_mark_val;
9082 gc_config_full_mark_set(TRUE);
9085 rb_gc_impl_start(rb_gc_get_objspace(),
true,
true,
true,
true);
9086 gc_config_full_mark_set(full_marking_p);
9088 return gc_compact_stats(self);
9091# define gc_compact rb_f_notimplement
9094#if GC_CAN_COMPILE_COMPACTION
9095struct desired_compaction_pages_i_data {
9097 size_t required_slots[HEAP_COUNT];
9101desired_compaction_pages_i(
struct heap_page *page,
void *data)
9103 struct desired_compaction_pages_i_data *tdata = data;
9106 VALUE vend = vstart + (
VALUE)(page->total_slots * page->heap->slot_size);
9109 for (
VALUE v = vstart; v != vend; v += page->heap->slot_size) {
9110 asan_unpoisoning_object(v) {
9114 size_t dest_pool_idx = dest_pool - heaps;
9115 tdata->required_slots[dest_pool_idx]++;
9139gc_verify_compaction_references(
int argc,
VALUE* argv,
VALUE self)
9141 static ID keywords[3] = {0};
9143 keywords[0] = rb_intern(
"toward");
9144 keywords[1] = rb_intern(
"double_heap");
9145 keywords[2] = rb_intern(
"expand_heap");
9152 int kwarg_count =
rb_get_kwargs(options, keywords, 0, 3, arguments);
9153 bool toward_empty = kwarg_count > 0 &&
SYMBOL_P(arguments[0]) &&
SYM2ID(arguments[0]) == rb_intern(
"empty");
9154 bool expand_heap = (kwarg_count > 1 &&
RTEST(arguments[1])) || (kwarg_count > 2 &&
RTEST(arguments[2]));
9159 rb_gc_impl_start(
objspace,
true,
true,
true,
false);
9161 unsigned int lev = RB_GC_VM_LOCK();
9167 struct desired_compaction_pages_i_data desired_compaction = {
9169 .required_slots = {0},
9172 objspace_each_pages(
objspace, desired_compaction_pages_i, &desired_compaction, TRUE);
9175 size_t max_existing_pages = 0;
9176 for (
int i = 0; i < HEAP_COUNT; i++) {
9178 max_existing_pages = MAX(max_existing_pages, heap->total_pages);
9182 for (
int i = 0; i < HEAP_COUNT; i++) {
9185 size_t pages_to_add = 0;
9192 pages_to_add += max_existing_pages - heap->total_pages;
9197 objspace->heap_pages.allocatable_slots = desired_compaction.required_slots[i];
9198 while (
objspace->heap_pages.allocatable_slots > 0) {
9199 heap_page_allocate_and_initialize(
objspace, heap);
9207 for (; pages_to_add > 0; pages_to_add--) {
9208 heap_page_allocate_and_initialize_force(
objspace, heap);
9214 objspace->rcompactor.compare_func = compare_free_slots;
9217 RB_GC_VM_UNLOCK(lev);
9219 rb_gc_impl_start(rb_gc_get_objspace(),
true,
true,
true,
true);
9221 rb_objspace_reachable_objects_from_root(root_obj_check_moved_i,
objspace);
9224 objspace->rcompactor.compare_func = NULL;
9226 return gc_compact_stats(self);
9229# define gc_verify_compaction_references rb_f_notimplement
9233rb_gc_impl_objspace_free(
void *objspace_ptr)
9238 rb_bug(
"lazy sweeping underway when freeing object space");
9243 for (
size_t i = 0; i < rb_darray_size(
objspace->heap_pages.sorted); i++) {
9246 rb_darray_free_without_gc(
objspace->heap_pages.sorted);
9247 heap_pages_lomem = 0;
9248 heap_pages_himem = 0;
9250 for (
int i = 0; i < HEAP_COUNT; i++) {
9252 heap->total_pages = 0;
9253 heap->total_slots = 0;
9256 free_stack_chunks(&
objspace->mark_stack);
9257 mark_stack_free_cache(&
objspace->mark_stack);
9259 rb_darray_free_without_gc(
objspace->weak_references);
9264#if MALLOC_ALLOCATED_SIZE
9275gc_malloc_allocated_size(
VALUE self)
9291gc_malloc_allocations(
VALUE self)
9298void rb_gc_impl_before_fork(
void *objspace_ptr) { }
9299void rb_gc_impl_after_fork(
void *objspace_ptr, rb_pid_t pid) {
9301 rb_gc_ractor_newobj_cache_foreach(gc_ractor_newobj_cache_clear, NULL);
9305VALUE rb_ident_hash_new_with_size(st_index_t size);
9315rb_gcdebug_add_stress_to_class(
int argc,
VALUE *argv,
VALUE self)
9319 if (!stress_to_class) {
9320 set_stress_to_class(rb_ident_hash_new_with_size(argc));
9323 for (
int i = 0; i < argc; i++) {
9324 VALUE klass = argv[i];
9325 rb_hash_aset(stress_to_class, klass,
Qtrue);
9340rb_gcdebug_remove_stress_to_class(
int argc,
VALUE *argv,
VALUE self)
9344 if (stress_to_class) {
9345 for (
int i = 0; i < argc; ++i) {
9346 rb_hash_delete(stress_to_class, argv[i]);
9349 if (rb_hash_size(stress_to_class) == 0) {
9350 stress_to_class = 0;
9358rb_gc_impl_objspace_alloc(
void)
9366rb_gc_impl_objspace_init(
void *objspace_ptr)
9370 gc_config_full_mark_set(TRUE);
9373 malloc_limit = gc_params.malloc_limit_min;
9375 if (
objspace->finalize_deferred_pjob == POSTPONED_JOB_HANDLE_INVALID) {
9376 rb_bug(
"Could not preregister postponed job for GC");
9379 for (
int i = 0; i < HEAP_COUNT; i++) {
9382 heap->slot_size = (1 << i) * BASE_SLOT_SIZE;
9384 ccan_list_head_init(&heap->pages);
9387 rb_darray_make_without_gc(&
objspace->heap_pages.sorted, 0);
9388 rb_darray_make_without_gc(&
objspace->weak_references, 0);
9395#if defined(INIT_HEAP_PAGE_ALLOC_USE_MMAP)
9397 heap_page_alloc_use_mmap = INIT_HEAP_PAGE_ALLOC_USE_MMAP;
9399#if RGENGC_ESTIMATE_OLDMALLOC
9400 objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_min;
9403 for (
int i = 0; i < HEAP_COUNT; i++) {
9405 gc_params.heap_init_slots[i] = GC_HEAP_INIT_SLOTS;
9408 init_mark_stack(&
objspace->mark_stack);
9410 objspace->profile.invoke_time = getrusage_time();
9411 finalizer_table = st_init_numtable();
9415rb_gc_impl_init(
void)
9417 VALUE gc_constants = rb_hash_new();
9418 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"DEBUG")), GC_DEBUG ?
Qtrue :
Qfalse);
9419 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"BASE_SLOT_SIZE")),
SIZET2NUM(BASE_SLOT_SIZE - RVALUE_OVERHEAD));
9421 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"RVALUE_OVERHEAD")),
SIZET2NUM(RVALUE_OVERHEAD));
9422 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"HEAP_PAGE_OBJ_LIMIT")),
SIZET2NUM(HEAP_PAGE_OBJ_LIMIT));
9423 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"HEAP_PAGE_BITMAP_SIZE")),
SIZET2NUM(HEAP_PAGE_BITMAP_SIZE));
9424 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"HEAP_PAGE_SIZE")),
SIZET2NUM(HEAP_PAGE_SIZE));
9425 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"HEAP_COUNT")),
LONG2FIX(HEAP_COUNT));
9426 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"RVARGC_MAX_ALLOCATE_SIZE")),
LONG2FIX(heap_slot_size(HEAP_COUNT - 1)));
9427 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"RVALUE_OLD_AGE")),
LONG2FIX(RVALUE_OLD_AGE));
9428 if (RB_BUG_INSTEAD_OF_RB_MEMERROR+0) {
9429 rb_hash_aset(gc_constants,
ID2SYM(rb_intern(
"RB_BUG_INSTEAD_OF_RB_MEMERROR")),
Qtrue);
9433 rb_define_const(
rb_mGC,
"INTERNAL_CONSTANTS", gc_constants);
9435 if (GC_COMPACTION_SUPPORTED) {
9450 if (GC_DEBUG_STRESS_TO_CLASS) {
9458#if MALLOC_ALLOCATED_SIZE
9477#define OPT(o) if (o) rb_ary_push(opts, rb_interned_str(#o, sizeof(#o) - 1))
9481 OPT(RGENGC_CHECK_MODE);
9482 OPT(RGENGC_PROFILE);
9483 OPT(RGENGC_ESTIMATE_OLDMALLOC);
9484 OPT(GC_PROFILE_MORE_DETAIL);
9485 OPT(GC_ENABLE_LAZY_SWEEP);
9486 OPT(CALC_EXACT_MALLOC_SIZE);
9487 OPT(MALLOC_ALLOCATED_SIZE);
9488 OPT(MALLOC_ALLOCATED_SIZE_CHECK);
9489 OPT(GC_PROFILE_DETAIL_MEMORY);
9490 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.)