Chi-Kuan Chiu

> The doc can be separated, that's not a problem. There are still many things that could be documented. Like the BTYPE_MAP: it's introduced to help with the small allocation,...

### Allocator The custom memory allocation system in Box64 comprises four distinct allocators, all utilizing shared underlying data structures. These allocators function similarly to segregated free lists by maintaining arrays...

Besides, I conducted an experiment to measure the memory usage of the 3D game “Petseting” running on a Raspberry Pi 5, and found that the RSS remains high throughout execution...

I've noticed that the functions `rb_get` and `rb_get_end` are frequently used in Box64, for example in SDL2 functions, as demonstrated in projects like [mado](https://github.com/sysprog21/mado) : | Window Event | rb_set...

Thanks for your explanation. Yes, the size of an rb-tree node is indeed 48 bytes, which does not include the additional memory required for two `blockmark_t` structures. But I don't...

Thanks for the explanation! If you have a moment, could you share a bit more about your experiment to reclaim unused blocks and how you measured it—especially: - Counting entries...

Hi @ptitSeb, I've been experimenting with tracking dynarec block usage by adding an atomic `usage_count` field to `dynablock_t` and instrumenting each block to increment it at runtime. I also implemented...

Thank you for providing so many details that I wasn’t aware of. I’ll do more experiments and update here. Yes, just as you suggested, the code cache system should be...

Great to hear that you’re already working on an initial implementation. I can help on complementary areas — for example, evaluating different cache-replacement policies, validating the heuristics with profiling data,...

Sounds good! I can help by testing this approach and providing profiling data.(or if there are something i can do) BTW, I’m currently experimenting with an LFU-based approach in my...