#memory-allocator #binding #mi-malloc #free #allocation #page

sys mimalloc2-rust-sys

fork of the mimalloc_rust hand writted sys binding

3 releases

2.1.7-source Jun 4, 2024
2.1.4-source Apr 24, 2024
2.1.2-source Feb 26, 2024

#378 in Memory management

Download history 277/week @ 2024-02-22 500/week @ 2024-02-29 381/week @ 2024-03-07 98/week @ 2024-03-14 32/week @ 2024-03-21 40/week @ 2024-03-28 77/week @ 2024-04-04 174/week @ 2024-04-11 220/week @ 2024-04-18 228/week @ 2024-04-25 429/week @ 2024-05-02 76/week @ 2024-05-09 81/week @ 2024-05-16 122/week @ 2024-05-23 252/week @ 2024-05-30

650 downloads per month
Used in mimalloc2-rust

MIT license

520KB
10K SLoC

C 9K SLoC // 0.2% comments Rust 685 SLoC // 0.0% comments

mi-malloc

documentation

  • small and consistent: the library is about 8k LOC using simple and consistent data structures. This makes it very suitable to integrate and adapt in other projects. For runtime systems it provides hooks for a monotonic heartbeat and deferred freeing (for bounded worst-case times with reference counting).
  • free list sharding: instead of one big free list (per size class) we have many smaller lists per "mimalloc page" which reduces fragmentation and increases locality – things that are allocated close in time get allocated close in memory. (A mimalloc page contains blocks of one size class and is usually 64KiB on a 64-bit system).
  • free list multi-sharding: the big idea! Not only do we shard the free list per mimalloc page, but for each page we have multiple free lists. In particular, there is one list for thread-local free operations, and another one for concurrent free operations. Free-ing from another thread can now be a single CAS without needing sophisticated coordination between threads. Since there will be thousands of separate free lists, contention is naturally distributed over the heap, and the chance of contending on a single location will be low – this is quite similar to randomized algorithms like skip lists where adding a random oracle removes the need for a more complex algorithm.
  • eager page reset: when a "page" becomes empty (with increased chance due to free list sharding) the memory is marked to the OS as unused ("reset" or "purged") reducing (real) memory pressure and fragmentation, especially in long running programs.
  • secure: mimalloc can be build in secure mode, adding guard pages, randomized allocation, encrypted free lists, etc. to protect against various heap vulnerabilities. The performance penalty is only around 3% on average over our benchmarks.
  • first-class heaps: efficiently create and use multiple heaps to allocate across different regions. A heap can be destroyed at once instead of deallocating each object separately.
  • bounded: it does not suffer from blowup, has bounded worst-case allocation times (wcat), bounded space overhead (~0.2% meta-data, with at most 12.5% waste in allocation sizes), and has no internal points of contention using only atomic operations.
  • fast: In our benchmarks (see below), mimalloc outperforms all other leading allocators (jemalloc, tcmalloc, Hoard, etc), and usually uses less memory (up to 25% more in the worst case). A nice property is that it does consistently well over a wide range of benchmarks.

Dependencies