As preparation for https://bugs.ruby-lang.org/issues/20205 making sure the test suite is compatible with frozen string literals is making things easier.
456 lines
13 KiB
Ruby
456 lines
13 KiB
Ruby
# frozen_string_literal: true
|
|
require 'test/unit'
|
|
|
|
if RUBY_PLATFORM =~ /s390x/
|
|
warn "Currently, it is known that the compaction does not work well on s390x; contribution is welcome https://github.com/ruby/ruby/pull/5077"
|
|
return
|
|
end
|
|
|
|
class TestGCCompact < Test::Unit::TestCase
|
|
module CompactionSupportInspector
|
|
def supports_auto_compact?
|
|
GC::OPTS.include?("GC_COMPACTION_SUPPORTED")
|
|
end
|
|
end
|
|
|
|
module OmitUnlessCompactSupported
|
|
include CompactionSupportInspector
|
|
|
|
def setup
|
|
omit "autocompact not supported on this platform" unless supports_auto_compact?
|
|
super
|
|
end
|
|
end
|
|
|
|
include OmitUnlessCompactSupported
|
|
|
|
class AutoCompact < Test::Unit::TestCase
|
|
include OmitUnlessCompactSupported
|
|
|
|
def test_enable_autocompact
|
|
before = GC.auto_compact
|
|
GC.auto_compact = true
|
|
assert GC.auto_compact
|
|
ensure
|
|
GC.auto_compact = before
|
|
end
|
|
|
|
def test_disable_autocompact
|
|
before = GC.auto_compact
|
|
GC.auto_compact = false
|
|
refute GC.auto_compact
|
|
ensure
|
|
GC.auto_compact = before
|
|
end
|
|
|
|
def test_major_compacts
|
|
before = GC.auto_compact
|
|
GC.auto_compact = true
|
|
compact = GC.stat :compact_count
|
|
GC.start
|
|
assert_operator GC.stat(:compact_count), :>, compact
|
|
ensure
|
|
GC.auto_compact = before
|
|
end
|
|
|
|
def test_implicit_compaction_does_something
|
|
before = GC.auto_compact
|
|
list = []
|
|
list2 = []
|
|
|
|
# Try to make some fragmentation
|
|
500.times {
|
|
list << Object.new
|
|
Object.new
|
|
Object.new
|
|
}
|
|
count = GC.stat :compact_count
|
|
GC.auto_compact = true
|
|
n = 1_000_000
|
|
n.times do
|
|
break if count < GC.stat(:compact_count)
|
|
list2 << Object.new
|
|
end and omit "implicit compaction didn't happen within #{n} objects"
|
|
compact_stats = GC.latest_compact_info
|
|
refute_predicate compact_stats[:considered], :empty?
|
|
refute_predicate compact_stats[:moved], :empty?
|
|
ensure
|
|
GC.auto_compact = before
|
|
end
|
|
end
|
|
|
|
class CompactMethodsNotImplemented < Test::Unit::TestCase
|
|
include CompactionSupportInspector
|
|
|
|
def assert_not_implemented(method, *args)
|
|
omit "autocompact is supported on this platform" if supports_auto_compact?
|
|
|
|
assert_raise(NotImplementedError) { GC.send(method, *args) }
|
|
refute(GC.respond_to?(method), "GC.#{method} should be defined as rb_f_notimplement")
|
|
end
|
|
|
|
def test_gc_compact_not_implemented
|
|
assert_not_implemented(:compact)
|
|
end
|
|
|
|
def test_gc_auto_compact_get_not_implemented
|
|
assert_not_implemented(:auto_compact)
|
|
end
|
|
|
|
def test_gc_auto_compact_set_not_implemented
|
|
assert_not_implemented(:auto_compact=, true)
|
|
end
|
|
|
|
def test_gc_latest_compact_info_not_implemented
|
|
assert_not_implemented(:latest_compact_info)
|
|
end
|
|
|
|
def test_gc_verify_compaction_references_not_implemented
|
|
assert_not_implemented(:verify_compaction_references)
|
|
end
|
|
end
|
|
|
|
def test_gc_compact_stats
|
|
list = []
|
|
|
|
# Try to make some fragmentation
|
|
500.times {
|
|
list << Object.new
|
|
Object.new
|
|
Object.new
|
|
}
|
|
compact_stats = GC.compact
|
|
refute_predicate compact_stats[:considered], :empty?
|
|
refute_predicate compact_stats[:moved], :empty?
|
|
end
|
|
|
|
def big_list(level = 10)
|
|
if level > 0
|
|
big_list(level - 1)
|
|
else
|
|
1000.times.map {
|
|
# try to make some empty slots by allocating an object and discarding
|
|
Object.new
|
|
Object.new
|
|
} # likely next to each other
|
|
end
|
|
end
|
|
|
|
def test_complex_hash_keys
|
|
list_of_objects = big_list
|
|
hash = list_of_objects.hash
|
|
GC.verify_compaction_references(toward: :empty)
|
|
assert_equal hash, list_of_objects.hash
|
|
GC.verify_compaction_references(expand_heap: false)
|
|
assert_equal hash, list_of_objects.hash
|
|
end
|
|
|
|
def test_ast_compacts
|
|
assert_separately([], "#{<<~"begin;"}\n#{<<~"end;"}", timeout: 10, signal: :SEGV)
|
|
begin;
|
|
def walk_ast ast
|
|
children = ast.children.grep(RubyVM::AbstractSyntaxTree::Node)
|
|
children.each do |child|
|
|
assert child.type
|
|
walk_ast child
|
|
end
|
|
end
|
|
ast = RubyVM::AbstractSyntaxTree.parse_file #{__FILE__.dump}
|
|
assert GC.compact
|
|
walk_ast ast
|
|
end;
|
|
end
|
|
|
|
def test_compact_count
|
|
count = GC.stat(:compact_count)
|
|
GC.compact
|
|
assert_equal count + 1, GC.stat(:compact_count)
|
|
end
|
|
|
|
def test_compacting_from_trace_point
|
|
obj = Object.new
|
|
def obj.tracee
|
|
:ret # expected to emit both line and call event from one instruction
|
|
end
|
|
|
|
results = []
|
|
TracePoint.new(:call, :line) do |tp|
|
|
results << tp.event
|
|
GC.verify_compaction_references
|
|
end.enable(target: obj.method(:tracee)) do
|
|
obj.tracee
|
|
end
|
|
|
|
assert_equal([:call, :line], results)
|
|
end
|
|
|
|
def test_updating_references_for_heap_allocated_shared_arrays
|
|
assert_separately(%w[-robjspace], "#{<<~"begin;"}\n#{<<~"end;"}", timeout: 10, signal: :SEGV)
|
|
begin;
|
|
ary = []
|
|
50.times { |i| ary << i }
|
|
|
|
# Pointer in slice should point to buffer of ary
|
|
slice = ary[10..40]
|
|
|
|
# Check that slice is pointing to buffer of ary
|
|
assert_include(ObjectSpace.dump(slice), '"shared":true')
|
|
|
|
# Run compaction to re-embed ary
|
|
GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
# Assert that slice is pointer to updated buffer in ary
|
|
assert_equal(10, slice[0])
|
|
# Check that slice is still pointing to buffer of ary
|
|
assert_include(ObjectSpace.dump(slice), '"shared":true')
|
|
end;
|
|
end
|
|
|
|
def test_updating_references_for_embed_shared_arrays
|
|
omit if GC::INTERNAL_CONSTANTS[:SIZE_POOL_COUNT] == 1
|
|
|
|
assert_separately(%w[-robjspace], "#{<<~"begin;"}\n#{<<~"end;"}", timeout: 10, signal: :SEGV)
|
|
begin;
|
|
ary = Array.new(50)
|
|
50.times { |i| ary[i] = i }
|
|
|
|
# Ensure ary is embedded
|
|
assert_include(ObjectSpace.dump(ary), '"embedded":true')
|
|
|
|
slice = ary[10..40]
|
|
|
|
# Check that slice is pointing to buffer of ary
|
|
assert_include(ObjectSpace.dump(slice), '"shared":true')
|
|
|
|
# Run compaction to re-embed ary
|
|
GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
# Assert that slice is pointer to updated buffer in ary
|
|
assert_equal(10, slice[0])
|
|
# Check that slice is still pointing to buffer of ary
|
|
assert_include(ObjectSpace.dump(slice), '"shared":true')
|
|
end;
|
|
end
|
|
|
|
def test_updating_references_for_heap_allocated_frozen_shared_arrays
|
|
assert_separately(%w[-robjspace], "#{<<~"begin;"}\n#{<<~"end;"}", timeout: 10, signal: :SEGV)
|
|
begin;
|
|
ary = []
|
|
50.times { |i| ary << i }
|
|
# Frozen arrays can become shared root without RARRAY_SHARED_ROOT_FLAG
|
|
ary.freeze
|
|
|
|
slice = ary[10..40]
|
|
|
|
# Check that slice is pointing to buffer of ary
|
|
assert_include(ObjectSpace.dump(slice), '"shared":true')
|
|
|
|
# Run compaction to re-embed ary
|
|
GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
# Assert that slice is pointer to updated buffer in ary
|
|
assert_equal(10, slice[0])
|
|
# Check that slice is still pointing to buffer of ary
|
|
assert_include(ObjectSpace.dump(slice), '"shared":true')
|
|
end;
|
|
end
|
|
|
|
def test_updating_references_for_embed_frozen_shared_arrays
|
|
omit if GC::INTERNAL_CONSTANTS[:SIZE_POOL_COUNT] == 1
|
|
|
|
assert_separately(%w[-robjspace], "#{<<~"begin;"}\n#{<<~"end;"}", timeout: 10, signal: :SEGV)
|
|
begin;
|
|
ary = Array.new(50)
|
|
50.times { |i| ary[i] = i }
|
|
# Frozen arrays can become shared root without RARRAY_SHARED_ROOT_FLAG
|
|
ary.freeze
|
|
|
|
# Ensure ary is embedded
|
|
assert_include(ObjectSpace.dump(ary), '"embedded":true')
|
|
|
|
slice = ary[10..40]
|
|
|
|
# Check that slice is pointing to buffer of ary
|
|
assert_include(ObjectSpace.dump(slice), '"shared":true')
|
|
|
|
# Run compaction to re-embed ary
|
|
GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
# Assert that slice is pointer to updated buffer in ary
|
|
assert_equal(10, slice[0])
|
|
# Check that slice is still pointing to buffer of ary
|
|
assert_include(ObjectSpace.dump(slice), '"shared":true')
|
|
end;
|
|
end
|
|
|
|
def test_moving_arrays_down_size_pools
|
|
omit if GC::INTERNAL_CONSTANTS[:SIZE_POOL_COUNT] == 1
|
|
|
|
assert_separately(%w[-robjspace], "#{<<~"begin;"}\n#{<<~"end;"}", timeout: 10, signal: :SEGV)
|
|
begin;
|
|
ARY_COUNT = 50000
|
|
|
|
GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
Fiber.new {
|
|
$arys = ARY_COUNT.times.map do
|
|
ary = "abbbbbbbbbb".chars
|
|
ary.uniq!
|
|
end
|
|
}.resume
|
|
|
|
stats = GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
assert_operator(stats.dig(:moved_down, :T_ARRAY) || 0, :>=, ARY_COUNT - 10)
|
|
refute_empty($arys.keep_if { |o| ObjectSpace.dump(o).include?('"embedded":true') })
|
|
end;
|
|
end
|
|
|
|
def test_moving_arrays_up_size_pools
|
|
omit if GC::INTERNAL_CONSTANTS[:SIZE_POOL_COUNT] == 1
|
|
|
|
assert_separately(%w[-robjspace], "#{<<~"begin;"}\n#{<<~"end;"}", timeout: 10, signal: :SEGV)
|
|
begin;
|
|
ARY_COUNT = 50000
|
|
|
|
GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
Fiber.new {
|
|
ary = "hello".chars
|
|
$arys = ARY_COUNT.times.map do
|
|
x = []
|
|
ary.each { |e| x << e }
|
|
x
|
|
end
|
|
}.resume
|
|
|
|
stats = GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
assert_operator(stats.dig(:moved_up, :T_ARRAY) || 0, :>=, ARY_COUNT - 10)
|
|
refute_empty($arys.keep_if { |o| ObjectSpace.dump(o).include?('"embedded":true') })
|
|
end;
|
|
end
|
|
|
|
def test_moving_objects_between_size_pools
|
|
omit if GC::INTERNAL_CONSTANTS[:SIZE_POOL_COUNT] == 1
|
|
|
|
assert_separately(%w[-robjspace], "#{<<~"begin;"}\n#{<<~"end;"}", timeout: 10, signal: :SEGV)
|
|
begin;
|
|
class Foo
|
|
def add_ivars
|
|
10.times do |i|
|
|
instance_variable_set("@foo" + i.to_s, 0)
|
|
end
|
|
end
|
|
end
|
|
|
|
OBJ_COUNT = 50000
|
|
|
|
GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
Fiber.new {
|
|
$ary = OBJ_COUNT.times.map { Foo.new }
|
|
$ary.each(&:add_ivars)
|
|
|
|
GC.start
|
|
Foo.new.add_ivars
|
|
}.resume
|
|
|
|
stats = GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
assert_operator(stats.dig(:moved_up, :T_OBJECT) || 0, :>=, OBJ_COUNT - 10)
|
|
refute_empty($ary.keep_if { |o| ObjectSpace.dump(o).include?('"embedded":true') })
|
|
end;
|
|
end
|
|
|
|
def test_moving_strings_up_size_pools
|
|
omit if GC::INTERNAL_CONSTANTS[:SIZE_POOL_COUNT] == 1
|
|
|
|
assert_separately(%w[-robjspace], "#{<<~"begin;"}\n#{<<~"end;"}", timeout: 30, signal: :SEGV)
|
|
begin;
|
|
STR_COUNT = 50000
|
|
|
|
GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
Fiber.new {
|
|
str = "a" * GC::INTERNAL_CONSTANTS[:BASE_SLOT_SIZE] * 4
|
|
$ary = STR_COUNT.times.map { +"" << str }
|
|
}.resume
|
|
|
|
stats = GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
assert_operator(stats[:moved_up][:T_STRING], :>=, STR_COUNT - 10)
|
|
refute_empty($ary.keep_if { |o| ObjectSpace.dump(o).include?('"embedded":true') })
|
|
end;
|
|
end
|
|
|
|
def test_moving_strings_down_size_pools
|
|
omit if GC::INTERNAL_CONSTANTS[:SIZE_POOL_COUNT] == 1
|
|
|
|
assert_separately(%w[-robjspace], "#{<<~"begin;"}\n#{<<~"end;"}", timeout: 30, signal: :SEGV)
|
|
begin;
|
|
STR_COUNT = 50000
|
|
|
|
GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
Fiber.new {
|
|
$ary = STR_COUNT.times.map { ("a" * GC::INTERNAL_CONSTANTS[:BASE_SLOT_SIZE] * 4).squeeze! }
|
|
}.resume
|
|
|
|
stats = GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
assert_operator(stats[:moved_down][:T_STRING], :>=, STR_COUNT - 10)
|
|
refute_empty($ary.keep_if { |o| ObjectSpace.dump(o).include?('"embedded":true') })
|
|
end;
|
|
end
|
|
|
|
def test_moving_hashes_down_size_pools
|
|
omit if GC::INTERNAL_CONSTANTS[:SIZE_POOL_COUNT] == 1
|
|
# AR and ST hashes are in the same size pool on 32 bit
|
|
omit unless RbConfig::SIZEOF["uint64_t"] <= RbConfig::SIZEOF["void*"]
|
|
|
|
assert_separately(%w[-robjspace], "#{<<~"begin;"}\n#{<<~"end;"}", timeout: 30, signal: :SEGV)
|
|
begin;
|
|
HASH_COUNT = 50000
|
|
|
|
GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
Fiber.new {
|
|
base_hash = { a: 1, b: 2, c: 3, d: 4, e: 5, f: 6, g: 7, h: 8 }
|
|
$ary = HASH_COUNT.times.map { base_hash.dup }
|
|
$ary.each_with_index { |h, i| h[:i] = 9 }
|
|
}.resume
|
|
|
|
stats = GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
assert_operator(stats[:moved_down][:T_HASH], :>=, HASH_COUNT - 10)
|
|
end;
|
|
end
|
|
|
|
def test_moving_objects_between_size_pools_keeps_shape_frozen_status
|
|
# [Bug #19536]
|
|
assert_separately([], "#{<<~"begin;"}\n#{<<~"end;"}")
|
|
begin;
|
|
class A
|
|
def add_ivars
|
|
@a = @b = @c = @d = 1
|
|
end
|
|
|
|
def set_a
|
|
@a = 10
|
|
end
|
|
end
|
|
|
|
a = A.new
|
|
a.add_ivars
|
|
a.freeze
|
|
|
|
b = A.new
|
|
b.add_ivars
|
|
b.set_a # Set the inline cache in set_a
|
|
|
|
GC.verify_compaction_references(expand_heap: true, toward: :empty)
|
|
|
|
assert_raise(FrozenError) { a.set_a }
|
|
end;
|
|
end
|
|
end
|