mirror of
https://github.com/ElementsProject/lightning.git
synced 2024-11-19 01:43:36 +01:00
c5d36c4ba9
We show where the pointer was allocated, but it can be confusing if it was later stolen onto another context. Save and report those too. Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
438 lines
11 KiB
C
438 lines
11 KiB
C
/* Hello friends!
|
|
*
|
|
* You found me! This is the inner, deep magic. Right here.
|
|
*
|
|
* To help development, we have a complete set of routines to scan for
|
|
* tal-memory leaks (valgrind will detect non-tal memory leaks at exit,
|
|
* but tal hierarchies tends to get freed at exit, so we need something
|
|
* more sophisticated).
|
|
*
|
|
* Memleak detection is only active if $LIGHTNINGD_DEV_MEMLEAK is set. It does several
|
|
* things:
|
|
* 1. attaches a backtrace list to every allocation, so we can tell
|
|
* where it came from.
|
|
* 2. also attaches a backtrace list to evert tal_steal, so we can track
|
|
* tricky cases where ownership is changed.
|
|
* 3. when memleak_start() is called, walks the entire tal
|
|
* tree and saves a pointer to all the objects it finds, with
|
|
* a few internal exceptions (including everything under 'tmpctx').
|
|
* It then calls registered helpers, which can remove opaque things
|
|
* and handles notleak() objects.
|
|
* 4. provides a routine to access any remaining pointers in the
|
|
* table: these are the leaks.
|
|
*/
|
|
#include "config.h"
|
|
#include <backtrace.h>
|
|
#include <ccan/array_size/array_size.h>
|
|
#include <ccan/cast/cast.h>
|
|
#include <ccan/crypto/siphash24/siphash24.h>
|
|
#include <ccan/htable/htable.h>
|
|
#include <ccan/intmap/intmap.h>
|
|
#include <ccan/list/list.h>
|
|
#include <ccan/tal/str/str.h>
|
|
#include <common/memleak.h>
|
|
#include <common/utils.h>
|
|
|
|
struct backtrace_state *backtrace_state;
|
|
|
|
static bool memleak_track;
|
|
|
|
struct memleak_helper {
|
|
void (*cb)(struct htable *memtable, const tal_t *);
|
|
};
|
|
|
|
/* For allocation efficiency, we use a fixed-size backtrace represtentation */
|
|
struct bt_compact {
|
|
size_t n;
|
|
uintptr_t bt[23];
|
|
};
|
|
|
|
struct tal_backtrace {
|
|
/* Backtrace for allocation */
|
|
struct bt_compact alloc;
|
|
|
|
/* Backtrace for any steals that occurred */
|
|
struct bt_compact *steals;
|
|
};
|
|
|
|
void *notleak_(void *ptr, bool plus_children)
|
|
{
|
|
const char *name;
|
|
/* If we're not tracking, don't do anything. */
|
|
if (!memleak_track)
|
|
return cast_const(void *, ptr);
|
|
|
|
/* We use special tal names to mark notleak */
|
|
name = tal_name(ptr);
|
|
if (!name)
|
|
name = "";
|
|
|
|
/* Don't mark more than once! */
|
|
if (!strstr(name, "**NOTLEAK")) {
|
|
if (plus_children)
|
|
name = tal_fmt(tmpctx, "%s **NOTLEAK_IGNORE_CHILDREN**",
|
|
name);
|
|
else
|
|
name = tal_fmt(tmpctx, "%s **NOTLEAK**", name);
|
|
tal_set_name(ptr, name);
|
|
}
|
|
|
|
return cast_const(void *, ptr);
|
|
}
|
|
|
|
static size_t hash_ptr(const void *elem, void *unused UNNEEDED)
|
|
{
|
|
static struct siphash_seed seed;
|
|
return siphash24(&seed, &elem, sizeof(elem));
|
|
}
|
|
|
|
bool memleak_ptr(struct htable *memtable, const void *p)
|
|
{
|
|
return htable_del(memtable, hash_ptr(p, NULL), p);
|
|
}
|
|
|
|
static void children_into_htable(struct htable *memtable, const tal_t *p)
|
|
{
|
|
const tal_t *i;
|
|
|
|
for (i = tal_first(p); i; i = tal_next(i)) {
|
|
const char *name = tal_name(i);
|
|
|
|
if (name) {
|
|
/* Don't add backtrace objects. */
|
|
if (streq(name, "tal_backtrace"))
|
|
continue;
|
|
|
|
/* Don't add our own memleak_helpers */
|
|
if (strends(name, "struct memleak_helper"))
|
|
continue;
|
|
|
|
/* Don't add tal_link objects */
|
|
if (strends(name, "struct link")
|
|
|| strends(name, "struct linkable"))
|
|
continue;
|
|
|
|
/* ccan/io allocates pollfd array, always array. */
|
|
if (strends(name, "struct pollfd[]") && !tal_parent(i))
|
|
continue;
|
|
|
|
if (strends(name, "struct io_plan *[]") && !tal_parent(i))
|
|
continue;
|
|
|
|
/* Don't add tmpctx. */
|
|
if (streq(name, "tmpctx"))
|
|
continue;
|
|
}
|
|
/* Don't add (resizing!) memtable table! */
|
|
if (i == memtable->table)
|
|
continue;
|
|
|
|
htable_add(memtable, hash_ptr(i, NULL), i);
|
|
children_into_htable(memtable, i);
|
|
}
|
|
}
|
|
|
|
static void scan_for_pointers(struct htable *memtable,
|
|
const tal_t *p, size_t bytelen)
|
|
{
|
|
size_t i, n;
|
|
|
|
/* Search for (aligned) pointers. */
|
|
n = bytelen / sizeof(void *);
|
|
for (i = 0; i < n; i++) {
|
|
void *ptr;
|
|
|
|
memcpy(&ptr, (char *)p + i * sizeof(void *), sizeof(ptr));
|
|
if (memleak_ptr(memtable, ptr))
|
|
scan_for_pointers(memtable, ptr, tal_bytelen(ptr));
|
|
}
|
|
}
|
|
|
|
void memleak_scan_region(struct htable *memtable, const void *ptr, size_t len)
|
|
{
|
|
scan_for_pointers(memtable, ptr, len);
|
|
}
|
|
|
|
void memleak_scan_obj(struct htable *memtable, const void *ptr)
|
|
{
|
|
memleak_ptr(memtable, ptr);
|
|
scan_for_pointers(memtable, ptr, tal_bytelen(ptr));
|
|
}
|
|
|
|
void memleak_scan_list_head(struct htable *memtable, const struct list_head *l)
|
|
{
|
|
scan_for_pointers(memtable, l, sizeof(*l));
|
|
}
|
|
|
|
static void remove_with_children(struct htable *memtable, const tal_t *p)
|
|
{
|
|
const tal_t *i;
|
|
|
|
memleak_ptr(memtable, p);
|
|
for (i = tal_first(p); i; i = tal_next(i))
|
|
remove_with_children(memtable, i);
|
|
}
|
|
|
|
/* memleak can't see inside hash tables, so do them manually */
|
|
void memleak_scan_htable(struct htable *memtable, const struct htable *ht)
|
|
{
|
|
struct htable_iter i;
|
|
const void *p;
|
|
|
|
for (p = htable_first(ht, &i); p; p = htable_next(ht, &i))
|
|
memleak_scan_obj(memtable, p);
|
|
}
|
|
|
|
/* FIXME: If uintmap used tal, this wouldn't be necessary! */
|
|
void memleak_scan_intmap_(struct htable *memtable, const struct intmap *m)
|
|
{
|
|
void *p;
|
|
intmap_index_t i;
|
|
|
|
for (p = intmap_first_(m, &i); p; p = intmap_after_(m, &i))
|
|
memleak_scan_obj(memtable, p);
|
|
}
|
|
|
|
static bool handle_strmap(const char *member, void *p, void *memtable_)
|
|
{
|
|
struct htable *memtable = memtable_;
|
|
|
|
/* membername may *not* be a tal ptr, but it can be! */
|
|
memleak_ptr(memtable, member);
|
|
memleak_scan_obj(memtable, p);
|
|
|
|
/* Keep going */
|
|
return true;
|
|
}
|
|
|
|
/* FIXME: If strmap used tal, this wouldn't be necessary! */
|
|
void memleak_scan_strmap_(struct htable *memtable, const struct strmap *m)
|
|
{
|
|
strmap_iterate_(m, handle_strmap, memtable);
|
|
}
|
|
|
|
static bool ptr_match(const void *candidate, void *ptr)
|
|
{
|
|
return candidate == ptr;
|
|
}
|
|
|
|
static struct tal_backtrace *find_backtrace(const tal_t *p)
|
|
{
|
|
struct tal_backtrace *tbt;
|
|
|
|
/* Does it have a child called "tal_backtrace"? */
|
|
for (tbt = tal_first(p); tbt; tbt = tal_next(tbt)) {
|
|
if (tal_name(tbt)
|
|
&& streq(tal_name(tbt), "tal_backtrace"))
|
|
return tbt;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
static const void *memleak_get(struct htable *memtable, const struct tal_backtrace **backtrace)
|
|
{
|
|
struct htable_iter it;
|
|
const tal_t *i, *p;
|
|
|
|
/* Remove memtable itself */
|
|
memleak_ptr(memtable, memtable);
|
|
|
|
i = htable_first(memtable, &it);
|
|
if (!i)
|
|
return NULL;
|
|
|
|
/* Delete from table (avoids parenting loops) */
|
|
htable_delval(memtable, &it);
|
|
|
|
/* Find ancestor, which is probably source of leak. */
|
|
for (p = tal_parent(i);
|
|
htable_get(memtable, hash_ptr(p, NULL), ptr_match, p);
|
|
i = p, p = tal_parent(i));
|
|
|
|
/* Delete all children */
|
|
remove_with_children(memtable, i);
|
|
|
|
/* Does it have a child called "tal_backtrace"? */
|
|
*backtrace = find_backtrace(i);
|
|
|
|
return i;
|
|
}
|
|
|
|
static int record_compact_bt(void *data, uintptr_t pc)
|
|
{
|
|
struct bt_compact *bt = data;
|
|
|
|
if (bt->n == ARRAY_SIZE(bt->bt))
|
|
return 1;
|
|
|
|
bt->bt[bt->n++] = pc;
|
|
return 0;
|
|
}
|
|
|
|
static void add_steal(tal_t *child, enum tal_notify_type type UNNEEDED,
|
|
void *new_parent)
|
|
{
|
|
struct tal_backtrace *tbt = find_backtrace(child);
|
|
struct bt_compact bt;
|
|
|
|
if (!tbt)
|
|
return;
|
|
|
|
bt.n = 0;
|
|
backtrace_simple(backtrace_state, 2, record_compact_bt, NULL, &bt);
|
|
if (tbt->steals == NULL)
|
|
tbt->steals = tal_arr(tbt, struct bt_compact, 0);
|
|
tal_arr_expand(&tbt->steals, bt);
|
|
}
|
|
|
|
static void add_backtrace(tal_t *parent UNUSED, enum tal_notify_type type UNNEEDED,
|
|
void *child)
|
|
{
|
|
struct tal_backtrace *tbt = tal_label(child, struct tal_backtrace, "tal_backtrace");
|
|
|
|
tbt->steals = NULL;
|
|
tbt->alloc.n = 0;
|
|
backtrace_simple(backtrace_state, 2, record_compact_bt, NULL, &tbt->alloc);
|
|
tal_add_notifier(child, TAL_NOTIFY_ADD_CHILD, add_backtrace);
|
|
tal_add_notifier(child, TAL_NOTIFY_STEAL, add_steal);
|
|
}
|
|
|
|
static void add_backtrace_notifiers(const tal_t *root)
|
|
{
|
|
tal_add_notifier(root, TAL_NOTIFY_ADD_CHILD, add_backtrace);
|
|
tal_add_notifier(root, TAL_NOTIFY_STEAL, add_steal);
|
|
|
|
for (tal_t *i = tal_first(root); i; i = tal_next(i))
|
|
add_backtrace_notifiers(i);
|
|
}
|
|
|
|
void memleak_add_helper_(const tal_t *p,
|
|
void (*cb)(struct htable *memtable, const tal_t *))
|
|
{
|
|
struct memleak_helper *mh = tal(p, struct memleak_helper);
|
|
mh->cb = cb;
|
|
}
|
|
|
|
void memleak_ignore_children(struct htable *memtable, const void *p)
|
|
{
|
|
for (const tal_t *i = tal_first(p); i; i = tal_next(i))
|
|
remove_with_children(memtable, i);
|
|
}
|
|
|
|
/* Handle allocations marked with helpers or notleak() */
|
|
static void call_memleak_helpers(struct htable *memtable, const tal_t *p)
|
|
{
|
|
const tal_t *i;
|
|
|
|
for (i = tal_first(p); i; i = tal_next(i)) {
|
|
const char *name = tal_name(i);
|
|
|
|
if (name) {
|
|
if (strends(name, "struct memleak_helper")) {
|
|
const struct memleak_helper *mh = i;
|
|
mh->cb(memtable, p);
|
|
} else if (strends(name, " **NOTLEAK**")
|
|
|| strends(name, "_notleak")) {
|
|
memleak_ptr(memtable, i);
|
|
memleak_scan_obj(memtable, i);
|
|
} else if (strends(name,
|
|
" **NOTLEAK_IGNORE_CHILDREN**")) {
|
|
remove_with_children(memtable, i);
|
|
memleak_scan_obj(memtable, i);
|
|
}
|
|
}
|
|
|
|
/* Recurse down looking for "notleak" children */
|
|
call_memleak_helpers(memtable, i);
|
|
}
|
|
}
|
|
|
|
struct htable *memleak_start(const tal_t *ctx)
|
|
{
|
|
struct htable *memtable = tal(ctx, struct htable);
|
|
htable_init(memtable, hash_ptr, NULL);
|
|
|
|
if (memleak_track) {
|
|
/* First, add all pointers off NULL to table. */
|
|
children_into_htable(memtable, NULL);
|
|
|
|
/* Iterate and call helpers to eliminate hard-to-get references. */
|
|
call_memleak_helpers(memtable, NULL);
|
|
}
|
|
|
|
return memtable;
|
|
}
|
|
|
|
void memleak_init(void)
|
|
{
|
|
if (getenv("LIGHTNINGD_DEV_MEMLEAK")) {
|
|
memleak_track = true;
|
|
if (backtrace_state)
|
|
add_backtrace_notifiers(NULL);
|
|
}
|
|
}
|
|
|
|
struct print_and_arg {
|
|
void PRINTF_FMT(2,3) (*print)(void *arg, const char *fmt, ...);
|
|
void *arg;
|
|
};
|
|
|
|
static int dump_syminfo(void *data, uintptr_t pc UNUSED,
|
|
const char *filename, int lineno,
|
|
const char *function)
|
|
{
|
|
struct print_and_arg *pag = data;
|
|
/* This can happen in backtraces. */
|
|
if (!filename || !function)
|
|
return 0;
|
|
|
|
pag->print(pag->arg, " %s:%u (%s)", filename, lineno, function);
|
|
return 0;
|
|
}
|
|
|
|
static void dump_leak_backtrace(const char *name,
|
|
const struct bt_compact *bt,
|
|
void (*print)(void *arg, const char *fmt, ...),
|
|
void *arg)
|
|
{
|
|
struct print_and_arg pag;
|
|
|
|
pag.print = print;
|
|
pag.arg = arg;
|
|
print(arg, " %s:", name);
|
|
for (size_t i = 0; i < bt->n; i++) {
|
|
backtrace_pcinfo(backtrace_state,
|
|
bt->bt[i], dump_syminfo,
|
|
NULL, &pag);
|
|
}
|
|
}
|
|
|
|
bool dump_memleak_(struct htable *memtable,
|
|
void PRINTF_FMT(2,3) (*print)(void *arg, const char *fmt, ...),
|
|
void *arg)
|
|
{
|
|
const tal_t *i;
|
|
const struct tal_backtrace *backtrace;
|
|
bool found_leak = false;
|
|
|
|
while ((i = memleak_get(memtable, &backtrace)) != NULL) {
|
|
print(arg, "MEMLEAK: %p", i);
|
|
if (tal_name(i))
|
|
print(arg, " label=%s", tal_name(i));
|
|
|
|
if (backtrace) {
|
|
dump_leak_backtrace("alloc", &backtrace->alloc, print, arg);
|
|
for (size_t j = 0; j < tal_count(backtrace->steals); j++)
|
|
dump_leak_backtrace("steal", &backtrace->steals[j], print, arg);
|
|
}
|
|
print(arg, " parents:");
|
|
for (tal_t *p = tal_parent(i); p; p = tal_parent(p)) {
|
|
print(arg, " %s", tal_name(p));
|
|
p = tal_parent(p);
|
|
}
|
|
found_leak = true;
|
|
}
|
|
|
|
return found_leak;
|
|
}
|