Jason Evans 6f29a83924 Add rtree lookup path caching.
rtree-based extent lookups remain more expensive than chunk-based run
lookups, but with this optimization the fast path slowdown is ~3 CPU
cycles per metadata lookup (on Intel Core i7-4980HQ), versus ~11 cycles
prior.  The path caching speedup tends to degrade gracefully unless
allocated memory is spread far apart (as is the case when using a
mixture of sbrk() and mmap()).
2016-06-05 20:59:57 -07:00
2016-06-05 20:59:57 -07:00
2016-06-05 20:59:57 -07:00
2016-06-05 20:59:57 -07:00
2014-09-02 17:49:29 -07:00
2016-02-20 10:55:23 -08:00
2016-05-12 15:06:50 -07:00
2016-05-13 10:27:33 -07:00
2016-02-28 15:20:40 -08:00
2013-12-06 18:50:51 -08:00
2016-06-05 20:42:24 -07:00
2016-05-13 09:56:18 -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://www.canonware.com/jemalloc/
Description
No description provided
Readme 13 MiB
Languages
C 87.4%
Perl 6.1%
M4 3.6%
Shell 1%
Makefile 0.9%
Other 1%