Jason Evans 0ee0e0c155 Implement compact rtree leaf element representation.
If a single virtual adddress pointer has enough unused bits to pack
{szind_t, extent_t *, bool, bool}, use a single pointer-sized field in
each rtree leaf element, rather than using three separate fields.  This
has little impact on access speed (fewer loads/stores, but more bit
twiddling), except that denser representation increases TLB
effectiveness.
2017-03-22 18:33:32 -07:00
2016-12-12 18:36:06 -08:00
2016-12-12 18:36:06 -08:00
2017-01-20 21:43:07 -08:00
2017-03-22 18:33:32 -07:00
2017-03-22 18:33:32 -07:00
2014-09-02 17:49:29 -07:00
2016-12-12 18:36:06 -08:00
2017-03-01 15:31:30 -08:00
2016-02-28 15:20:40 -08:00
2013-12-06 18:50:51 -08:00
2016-09-12 11:56:24 -07:00
2016-09-12 11:56:24 -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%