• Home
  • History
  • Annotate
Name Date Size #Lines LOC

..--

include/memunreachable/23-Mar-2024-9450

tests/23-Mar-2024-1,8121,250

.clang-formatD01-Jan-19700

.clang-format-4D01-Jan-19700

Allocator.cppD23-Mar-202412.1 KiB469336

Allocator.hD23-Mar-20246.1 KiB219132

Android.bpD23-Mar-20242.9 KiB131119

Binder.cppD23-Mar-20242.2 KiB8144

Binder.hD23-Mar-2024863 297

HeapWalker.cppD23-Mar-20247 KiB231178

HeapWalker.hD23-Mar-20244.5 KiB149104

Leak.hD23-Mar-20241.6 KiB6131

LeakFolding.cppD23-Mar-20244.2 KiB13995

LeakFolding.hD23-Mar-20242.4 KiB10162

LeakPipe.cppD23-Mar-20242.3 KiB9460

LeakPipe.hD23-Mar-20244.7 KiB195136

LinkedList.hD23-Mar-20241.6 KiB6440

MemUnreachable.cppD23-Mar-202418.2 KiB566406

OWNERSD23-Mar-202437 32

ProcessMappings.cppD23-Mar-20241.8 KiB6035

ProcessMappings.hD23-Mar-20241.3 KiB4821

PtracerThread.cppD23-Mar-20243.8 KiB156112

PtracerThread.hD23-Mar-20241.5 KiB5626

README.mdD23-Mar-20245.8 KiB9369

ScopedAlarm.hD23-Mar-20241.6 KiB5833

ScopedDisableMalloc.hD23-Mar-20242.7 KiB10964

ScopedPipe.hD23-Mar-20241.8 KiB8148

ScopedSignalHandler.hD23-Mar-20242.7 KiB9661

Semaphore.hD23-Mar-20241.4 KiB6135

Tarjan.hD23-Mar-20243.5 KiB13999

ThreadCapture.cppD23-Mar-20249.6 KiB368278

ThreadCapture.hD23-Mar-20241.5 KiB5930

bionic.hD23-Mar-20241.1 KiB3613

libmemunreachable.mapD23-Mar-2024261 1413

log.hD23-Mar-20241.7 KiB5829

README.md

1libmemunreachable
2================
3
4Introduction
5--------------
6libmemunreachable is a zero-overhead native memory leak detector.  It uses an imprecise mark-and-sweep garbage collector pass over all native memory, reporting any unreachable blocks as leaks.  It is similar to the [Heap Checker from tcmalloc](http://htmlpreview.github.io/?https://github.com/gperftools/gperftools/blob/master/doc/heap_checker.html), but with a few key differences to remove the overhead.  Instead of instrumenting every call to malloc and free, it queries the allocator (jemalloc) for active allocations when leak detection is requested.  In addition, it performs a very short stop-the-world data collection on the main process, and then forks a copy of the process to perform the mark-and-sweep, minimizing disruption to the original process.
7
8In the default (zero-overhead) mode, the returned data on leaks is limited to the address, approximate (upper bound) size, and the the first 32 bytes of the contents of the leaked allocation.  If malloc_debug backtraces are enabled they will be included in the leak information, but backtracing allocations requires significant overhead.
9
10----------
11
12Usage
13-------
14
15### In Android apps ###
16
17libmemunreachble is loaded by zygote and can be triggered with `dumpsys -t 600 meminfo --unreachable [process]`.
18
19To enable malloc\_debug backtraces on allocations for a single app process on a userdebug device, use:
20```
21adb root
22adb shell setprop libc.debug.malloc.program app_process
23adb shell setprop wrap.[process] "\$\@"
24adb shell setprop libc.debug.malloc.options backtrace=4
25```
26
27Kill and restart the app, trigger the leak, and then run `dumpsys -t 600 meminfo --unreachable [process]`.
28
29To disable malloc\_debug:
30```
31adb shell setprop libc.debug.malloc.options "''"
32adb shell setprop libc.debug.malloc.program "''"
33adb shell setprop wrap.[process]  "''"
34```
35
36### C interface ###
37
38#### `bool LogUnreachableMemory(bool log_contents, size_t limit)` ####
39Writes a description of leaked memory to the log.  A summary is always written, followed by details of up to `limit` leaks.  If `log_contents` is `true`, details include up to 32 bytes of the contents of each leaked allocation.
40Returns true if leak detection succeeded.
41
42#### `bool NoLeaks()` ####
43Returns `true` if no unreachable memory was found.
44
45### C++ interface ###
46
47#### `bool GetUnreachableMemory(UnreachableMemoryInfo& info, size_t limit = 100)` ####
48Updates an `UnreachableMemoryInfo` object with information on leaks, including details on up to `limit` leaks.  Returns true if leak detection succeeded.
49
50#### `std::string GetUnreachableMemoryString(bool log_contents = false, size_t limit = 100)` ####
51Returns a description of leaked memory.  A summary is always written, followed by details of up to `limit` leaks.  If `log_contents` is `true`, details include up to 32 bytes of the contents of each leaked allocation.
52Returns true if leak detection succeeded.
53
54Implementation
55-------------------
56The sequence of steps required to perform a leak detection pass is divided into three processes - the original process, the collection process, and the sweeper process.
57
58 1. *Original process*: Leak detection is requested by calling `GetUnreachableMemory()`
59 2. Allocations are disabled using `malloc_disable()`
60 3. The collection process is spawned.  The collection process, created using clone, is similar to a normal `fork()` child process, except that it shares the address space of the parent - any writes by the original process are visible to the collection process, and vice-versa. If we forked instead of using clone, the address space might get out of sync with observed post-ptrace thread state, since it takes some time to pause the parent.
61 4. *Collection process*: All threads in the original process are paused with `ptrace()`.
62 5. Registers contents, active stack areas, and memory mapping information are collected.
63 6. *Original process*: Allocations are re-enabled using `malloc_enable()`, but all threads are still paused with `ptrace()`.
64 7. *Collection process*: The sweeper process is spawned using a normal `fork()`.  The sweeper process has a copy of all memory from the original process, including all the data collected by the collection process.
65 8. Collection process releases all threads from `ptrace` and exits
66 9. *Original process*: All threads continue, the thread that called `GetUnreachableMemory()` blocks waiting for leak data over a pipe.
67 10. *Sweeper process*: A list of all active allocations is produced by examining the memory mappings and calling `malloc_iterate()` on any heap mappings.
68 11. A list of all roots is produced from globals (.data and .bss sections of binaries), and registers and stacks from each thread.
69 12. The mark-and-sweep pass is performed starting from roots.
70 13. Unmarked allocations are sent over the pipe back to the original process.
71
72----------
73
74
75Components
76---------------
77- `MemUnreachable.cpp`: Entry points, implements the sequencing described above.
78- `PtracerThread.cpp`: Used to clone the collection process with shared address space.
79- `ThreadCapture.cpp`: Pauses threads in the main process and collects register contents.
80- `ProcessMappings.cpp`: Collects snapshots of `/proc/pid/maps`.
81- `HeapWalker.cpp`: Performs the mark-and-sweep pass over active allocations.
82- `LeakPipe.cpp`: transfers data describing leaks from the sweeper process to the original process.
83
84
85Heap allocator requirements
86----------------------------------
87libmemunreachable requires a small interface to the allocator in order to collect information about active allocations.
88
89 - `malloc_disable()`: prevent any thread from mutating internal allocator state.
90 - `malloc enable()`: re-enable allocations in all threads.
91 - `malloc_iterate()`: call a callback on each active allocation in a given heap region.
92 - `malloc_backtrace()`: return the backtrace from when the allocation at the given address was allocated, if it was collected.
93