Skip to content
A memory allocator that automatically reduces the memory footprint of C/C++ applications.
C++ Python C CMake Starlark Makefile Other
Branch: master
Clone or download

Latest commit

Files

Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.github/workflows build: work on diagnosing flakey macOS tests Mar 12, 2020
src build: refactor to support building on older amd64 processors Apr 19, 2020
support build: fix install_all_configs to work with bazel Mar 8, 2020
theory Typo fixes. Feb 18, 2019
tools build: don't require bazel to be installed on the host Mar 8, 2020
.bazelrc build: refactor to support building on older amd64 processors Apr 19, 2020
.bazelversion build: don't require bazel to be installed on the host Mar 8, 2020
.clang-format clang-format: don't sort includes Mar 4, 2020
.dockerignore build: update dockerignore to ignore local build products Mar 10, 2019
.editorconfig build: update .editorconfig Oct 21, 2018
.gitattributes build: exclude theory and support directories from linguist Jan 2, 2020
.gitignore build: move to Bazel build system Mar 8, 2020
AUTHORS update copyright header on individual files + add AUTHORS Feb 17, 2019
CMakeLists.txt build: working cmake again Mar 12, 2020
CODE_OF_CONDUCT.md add code of conduct Sep 16, 2019
Dockerfile build: fix dockerfile Mar 8, 2020
LICENSE LICENSE: add Apache 2 license Feb 17, 2019
Makefile build: also use BAZEL_CONFIG for benchmark Apr 19, 2020
README.md README: add section on getting a summary from Mesh Mar 12, 2020
WORKSPACE build: use upstream Heap-Layers Mar 17, 2020
bazel build: don't require bazel to be installed on the host Mar 8, 2020
mesh-pldi19-powers.pdf Added. Sep 19, 2019

README.md

Mesh: Compacting Memory Management for C/C++

Mesh is a drop in replacement for malloc(3) that can transparently recover from memory fragmentation without any changes to application code.

Mesh is described in detail in a paper (PDF) that appeared at PLDI 2019.

Or watch this talk by Bobby Powers at Strange Loop:

Compacting the Uncompactable

Mesh runs on Linux and macOS. Windows is a work in progress.

Mesh uses bazel as a build system, but wraps it in a Makefile, and has no runtime dependencies other than libc:

$ git clone https://github.com/plasma-umass/mesh
$ cd mesh
$ make; sudo make install
# example: run git with mesh as its allocator:
$ LD_PRELOAD=libmesh.so git status

Please open an issue if you have questions (or issues)!

But will it blend?

If you run a program linked against mesh (or with Mesh LD_PRELOADed), setting the variable MALLOCSTATS=1 will instruct mesh to print a summary at exit:

$ MALLOCSTATS=1 ./bin/redis-server-mesh ./redis.conf
25216:C 11 Mar 20:27:12.050 # oO0OoO0OoO0Oo Redis is starting oO0OoO0OoO0Oo
25216:C 11 Mar 20:27:12.050 # Redis version=4.0.2, bits=64, commit=dfe0d212, modified=0, pid=25216, just started
25216:C 11 Mar 20:27:12.050 # Configuration loaded
[...]
^C25216:signal-handler (1583983641) Received SIGINT scheduling shutdown...
25216:M 11 Mar 20:27:21.945 # User requested shutdown...
25216:M 11 Mar 20:27:21.945 * Removing the pid file.
25216:M 11 Mar 20:27:21.945 * Removing the unix socket file.
25216:M 11 Mar 20:27:21.945 # Redis is now ready to exit, bye bye...
MESH COUNT:         25918
Meshed MB (total):  101.2
Meshed pages HWM:   25918
Meshed MB HWM:      101.2
MH Alloc Count:     56775
MH Free  Count:     17
MH High Water Mark: 82687

Not all workloads experience fragmentation, so its possible that Mesh will have a small 'Meshed MB (total' number!

Implementation Overview

Mesh is built on Heap Layers, an infrastructure for building high performance memory allocators in C++ (see the paper for details.)

The entry point of the library is libmesh.cc. This file is where malloc, free and the instantiations of the Heap used for allocating program memory lives.

DEFINITIONS

  • Page: The smallest block of memory managed by the operating system, 4Kb on most architectures. Memory given to the allocator by the operating system is always in multiples of the page size, and aligned to the page size.
  • Span: A contiguous run of 1 or more pages. It is often larger than the page size to account for large allocations and amortize the cost of heap metadata.
  • Arena: A contiguous range of virtual address space we allocate out of. All allocations returned by malloc(3) reside within the arena.
  • GlobalHeap: The global heap carves out the Arena into Spans and performs meshing.
  • MiniHeap: Metadata for a Span -- at any time a live Span has a single MiniHeap owner. For small objects, MiniHeaps have a bitmap to track whether an allocation is live or freed.
  • ThreadLocalHeap: A collections of MiniHeaps and a ShuffleVector so that most allocations and free(3)s can be fast and lock-free.
  • ShuffleVector: A novel data structure that enables randomized allocation with bump-pointer-like speed.
You can’t perform that action at this time.