Qi Wang 1784939688 Use rtree tracked states to protect edata outside of ecache locks.
This avoids the addr-based mutexes (i.e. the mutex_pool), and instead relies on
the metadata tracked in rtree leaf: the head state and extent_state.  Before
trying to access the neighbor edata (e.g. for coalescing), the states will be
verified first -- only neighbor edatas from the same arena and with the same
state will be accessed.
2021-03-29 17:19:53 -07:00
2021-03-26 13:34:49 -07:00
2020-10-19 15:32:51 -07:00
2019-11-22 10:14:16 -08:00
2020-10-27 15:28:20 -07:00
2014-09-02 17:49:29 -07:00
2021-03-19 13:42:30 -07:00
2020-10-02 14:49:56 -07:00
2020-09-10 15:56:59 -07:00
2019-08-05 12:52:43 -07:00
2019-01-25 13:25:20 -08:00
2016-09-12 11:56:24 -07:00
2018-05-03 12:52:52 -07:00

jemalloc is a general purpose malloc(3) implementation that emphasizes
fragmentation avoidance and scalable concurrency support.  jemalloc first came
into use as the FreeBSD libc allocator in 2005, and since then it has found its
way into numerous applications that rely on its predictable behavior.  In 2010
jemalloc development efforts broadened to include developer support features
such as heap profiling and extensive monitoring/tuning hooks.  Modern jemalloc
releases continue to be integrated back into FreeBSD, and therefore versatility
remains critical.  Ongoing development efforts trend toward making jemalloc
among the best allocators for a broad range of demanding applications, and
eliminating/mitigating weaknesses that have practical repercussions for real
world applications.

The COPYING file contains copyright and licensing information.

The INSTALL file contains information on how to configure, build, and install
jemalloc.

The ChangeLog file contains a brief summary of changes for each release.

URL: http://jemalloc.net/
Description
No description provided
Readme 13 MiB
Languages
C 87.4%
Perl 6.1%
M4 3.6%
Shell 1%
Makefile 0.9%
Other 1%