mirror of
https://github.com/microsoft/mimalloc.git
synced 2025-05-19 13:39:31 +03:00
update readme
This commit is contained in:
parent
bb3558100b
commit
c8eeb8cc25
1 changed files with 2 additions and 0 deletions
|
@ -39,6 +39,8 @@ Notable aspects of the design include:
|
||||||
randomized allocation, encrypted free lists, etc. to protect against various
|
randomized allocation, encrypted free lists, etc. to protect against various
|
||||||
heap vulnerabilities. The performance penalty is only around 3% on average
|
heap vulnerabilities. The performance penalty is only around 3% on average
|
||||||
over our benchmarks.
|
over our benchmarks.
|
||||||
|
- __user function for clean up memory__: _mimalloc_ can be built with MI_USER_CLEANUP=ON flag. This mode
|
||||||
|
allows setup user function for memory clean up before it returned to system.
|
||||||
- __first-class heaps__: efficiently create and use multiple heaps to allocate across different regions.
|
- __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.
|
A heap can be destroyed at once instead of deallocating each object separately.
|
||||||
- __bounded__: it does not suffer from _blowup_ \[1\], has bounded worst-case allocation
|
- __bounded__: it does not suffer from _blowup_ \[1\], has bounded worst-case allocation
|
||||||
|
|
Loading…
Add table
Reference in a new issue