<feed xmlns='http://www.w3.org/2005/Atom'>
<title>ruby.git/gc/mmtk/cbindgen.toml, branch v4.0.2</title>
<subtitle>The Ruby Programming Language</subtitle>
<link rel='alternate' type='text/html' href='https://git.ruby-lang.org/ruby.git/'/>
<entry>
<title>[ruby/mmtk] Implement fast path for bump pointer allocator</title>
<updated>2025-12-21T02:55:12+00:00</updated>
<author>
<name>Peter Zhu</name>
<email>peter@peterzhu.ca</email>
</author>
<published>2025-12-20T21:08:01+00:00</published>
<link rel='alternate' type='text/html' href='https://git.ruby-lang.org/ruby.git/commit/?id=038b158fa30d1b1cda153aeb10dac5f59f966036'/>
<id>038b158fa30d1b1cda153aeb10dac5f59f966036</id>
<content type='text'>
Adding a fast path for bump pointer allocator can improve allocation
performance.

For the following microbenchmark with MMTK_HEAP_MIN=100MiB:

    10_000_000.times { String.new }

Before:

    810.7 ms ±   8.3 ms    [User: 790.9 ms, System: 40.3 ms]

After:

    777.9 ms ±  10.4 ms    [User: 759.0 ms, System: 37.9 ms]

https://github.com/ruby/mmtk/commit/0ff5c9f579
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Adding a fast path for bump pointer allocator can improve allocation
performance.

For the following microbenchmark with MMTK_HEAP_MIN=100MiB:

    10_000_000.times { String.new }

Before:

    810.7 ms ±   8.3 ms    [User: 790.9 ms, System: 40.3 ms]

After:

    777.9 ms ±  10.4 ms    [User: 759.0 ms, System: 37.9 ms]

https://github.com/ruby/mmtk/commit/0ff5c9f579
</pre>
</div>
</content>
</entry>
<entry>
<title>[ruby/mmtk] [Feature #20860] Implement Mark-Sweep with MMTK</title>
<updated>2024-11-22T09:55:24+00:00</updated>
<author>
<name>Peter Zhu</name>
<email>peter@peterzhu.ca</email>
</author>
<published>2024-11-21T20:34:07+00:00</published>
<link rel='alternate' type='text/html' href='https://git.ruby-lang.org/ruby.git/commit/?id=19840dfd718465e3bd7a6cf4cf981944443b2985'/>
<id>19840dfd718465e3bd7a6cf4cf981944443b2985</id>
<content type='text'>
This commit implements the mark-sweep algorithm using MMTk and allows
customizing the plan using MMTK_PLAN.

https://github.com/ruby/mmtk/commit/6fea5e5ffc

Co-Authored-By: Matt Valentine-House &lt;matt@eightbitraptor.com&gt;
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
This commit implements the mark-sweep algorithm using MMTk and allows
customizing the plan using MMTK_PLAN.

https://github.com/ruby/mmtk/commit/6fea5e5ffc

Co-Authored-By: Matt Valentine-House &lt;matt@eightbitraptor.com&gt;
</pre>
</div>
</content>
</entry>
<entry>
<title>[ruby/mmtk] [Feature #20860] Implement NoGC with MMTk</title>
<updated>2024-11-22T09:55:23+00:00</updated>
<author>
<name>Peter Zhu</name>
<email>peter@peterzhu.ca</email>
</author>
<published>2024-11-21T20:33:15+00:00</published>
<link rel='alternate' type='text/html' href='https://git.ruby-lang.org/ruby.git/commit/?id=211aef1bc0f42545897892122da44ed01e066186'/>
<id>211aef1bc0f42545897892122da44ed01e066186</id>
<content type='text'>
This commit only supports initializing MMTk with NoGC and object
allocation.

https://github.com/ruby/mmtk/commit/39aa10e537

Co-Authored-By: Kunshan Wang &lt;wks1986@gmail.com&gt;
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
This commit only supports initializing MMTk with NoGC and object
allocation.

https://github.com/ruby/mmtk/commit/39aa10e537

Co-Authored-By: Kunshan Wang &lt;wks1986@gmail.com&gt;
</pre>
</div>
</content>
</entry>
</feed>
