[thirdparty/kernel/linux.git] / lib / stackdepot.c

/*
 * Generic stack depot for storing stack traces.
 *
 * Some debugging tools need to save stack traces of certain events which can
 * be later presented to the user. For example, KASAN needs to safe alloc and
 * free stacks for each object, but storing two stack traces per object
 * requires too much memory (e.g. SLUB_DEBUG needs 256 bytes per object for
 * that).
 *
 * Instead, stack depot maintains a hashtable of unique stacktraces. Since alloc
 * and free stacks repeat a lot, we save about 100x space.
 * Stacks are never removed from depot, so we store them contiguously one after
 * another in a contiguos memory allocation.
 *
 * Author: Alexander Potapenko <glider@google.com>
 * Copyright (C) 2016 Google, Inc.
 *
 * Based on code by Dmitry Chernenkov.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * version 2 as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 */

#include <linux/gfp.h>
#include <linux/jhash.h>
#include <linux/kernel.h>
#include <linux/mm.h>
#include <linux/percpu.h>
#include <linux/printk.h>
#include <linux/slab.h>
#include <linux/stacktrace.h>
#include <linux/stackdepot.h>
#include <linux/string.h>
#include <linux/types.h>

#define DEPOT_STACK_BITS (sizeof(depot_stack_handle_t) * 8)

#define STACK_ALLOC_NULL_PROTECTION_BITS 1
#define STACK_ALLOC_ORDER 2 /* 'Slab' size order for stack depot, 4 pages */
#define STACK_ALLOC_SIZE (1LL << (PAGE_SHIFT + STACK_ALLOC_ORDER))
#define STACK_ALLOC_ALIGN 4
#define STACK_ALLOC_OFFSET_BITS (STACK_ALLOC_ORDER + PAGE_SHIFT - \
					STACK_ALLOC_ALIGN)
#define STACK_ALLOC_INDEX_BITS (DEPOT_STACK_BITS - \
		STACK_ALLOC_NULL_PROTECTION_BITS - STACK_ALLOC_OFFSET_BITS)
#define STACK_ALLOC_SLABS_CAP 8192
#define STACK_ALLOC_MAX_SLABS \
	(((1LL << (STACK_ALLOC_INDEX_BITS)) < STACK_ALLOC_SLABS_CAP) ? \
	 (1LL << (STACK_ALLOC_INDEX_BITS)) : STACK_ALLOC_SLABS_CAP)

/* The compact structure to store the reference to stacks. */
union handle_parts {
	depot_stack_handle_t handle;
	struct {
		u32 slabindex : STACK_ALLOC_INDEX_BITS;
		u32 offset : STACK_ALLOC_OFFSET_BITS;
		u32 valid : STACK_ALLOC_NULL_PROTECTION_BITS;
	};
};

struct stack_record {
	struct stack_record *next;	/* Link in the hashtable */
	u32 hash;			/* Hash in the hastable */
	u32 size;			/* Number of frames in the stack */
	union handle_parts handle;
	unsigned long entries[1];	/* Variable-sized array of entries. */
};

static void *stack_slabs[STACK_ALLOC_MAX_SLABS];

static int depot_index;
static int next_slab_inited;
static size_t depot_offset;
static DEFINE_SPINLOCK(depot_lock);

static bool init_stack_slab(void **prealloc)
{
	if (!*prealloc)
		return false;
	/*
	 * This smp_load_acquire() pairs with smp_store_release() to
	 * |next_slab_inited| below and in depot_alloc_stack().
	 */
	if (smp_load_acquire(&next_slab_inited))
		return true;
	if (stack_slabs[depot_index] == NULL) {
		stack_slabs[depot_index] = *prealloc;
	} else {
		stack_slabs[depot_index + 1] = *prealloc;
		/*
		 * This smp_store_release pairs with smp_load_acquire() from
		 * |next_slab_inited| above and in depot_save_stack().
		 */
		smp_store_release(&next_slab_inited, 1);
	}
	*prealloc = NULL;
	return true;
}

/* Allocation of a new stack in raw storage */
static struct stack_record *depot_alloc_stack(unsigned long *entries, int size,
		u32 hash, void **prealloc, gfp_t alloc_flags)
{
	int required_size = offsetof(struct stack_record, entries) +
		sizeof(unsigned long) * size;
	struct stack_record *stack;

	required_size = ALIGN(required_size, 1 << STACK_ALLOC_ALIGN);

	if (unlikely(depot_offset + required_size > STACK_ALLOC_SIZE)) {
		if (unlikely(depot_index + 1 >= STACK_ALLOC_MAX_SLABS)) {
			WARN_ONCE(1, "Stack depot reached limit capacity");
			return NULL;
		}
		depot_index++;
		depot_offset = 0;
		/*
		 * smp_store_release() here pairs with smp_load_acquire() from
		 * |next_slab_inited| in depot_save_stack() and
		 * init_stack_slab().
		 */
		if (depot_index + 1 < STACK_ALLOC_MAX_SLABS)
			smp_store_release(&next_slab_inited, 0);
	}
	init_stack_slab(prealloc);
	if (stack_slabs[depot_index] == NULL)
		return NULL;

	stack = stack_slabs[depot_index] + depot_offset;

	stack->hash = hash;
	stack->size = size;
	stack->handle.slabindex = depot_index;
	stack->handle.offset = depot_offset >> STACK_ALLOC_ALIGN;
	stack->handle.valid = 1;
	memcpy(stack->entries, entries, size * sizeof(unsigned long));
	depot_offset += required_size;

	return stack;
}

#define STACK_HASH_ORDER 20
#define STACK_HASH_SIZE (1L << STACK_HASH_ORDER)
#define STACK_HASH_MASK (STACK_HASH_SIZE - 1)
#define STACK_HASH_SEED 0x9747b28c

static struct stack_record *stack_table[STACK_HASH_SIZE] = {
	[0 ...	STACK_HASH_SIZE - 1] = NULL
};

/* Calculate hash for a stack */
static inline u32 hash_stack(unsigned long *entries, unsigned int size)
{
	return jhash2((u32 *)entries,
			       size * sizeof(unsigned long) / sizeof(u32),
			       STACK_HASH_SEED);
}

/* Use our own, non-instrumented version of memcmp().
 *
 * We actually don't care about the order, just the equality.
 */
static inline
int stackdepot_memcmp(const unsigned long *u1, const unsigned long *u2,
			unsigned int n)
{
	for ( ; n-- ; u1++, u2++) {
		if (*u1 != *u2)
			return 1;
	}
	return 0;
}

/* Find a stack that is equal to the one stored in entries in the hash */
static inline struct stack_record *find_stack(struct stack_record *bucket,
					     unsigned long *entries, int size,
					     u32 hash)
{
	struct stack_record *found;

	for (found = bucket; found; found = found->next) {
		if (found->hash == hash &&
		    found->size == size &&
		    !stackdepot_memcmp(entries, found->entries, size))
			return found;
	}
	return NULL;
}

/**
 * stack_depot_fetch - Fetch stack entries from a depot
 *
 * @handle:		Stack depot handle which was returned from
 *			stack_depot_save().
 * @entries:		Pointer to store the entries address
 *
 * Return: The number of trace entries for this depot.
 */
unsigned int stack_depot_fetch(depot_stack_handle_t handle,
			       unsigned long **entries)
{
	union handle_parts parts = { .handle = handle };
	void *slab = stack_slabs[parts.slabindex];
	size_t offset = parts.offset << STACK_ALLOC_ALIGN;
	struct stack_record *stack = slab + offset;

	*entries = stack->entries;
	return stack->size;
}
EXPORT_SYMBOL_GPL(stack_depot_fetch);

/**
 * stack_depot_save - Save a stack trace from an array
 *
 * @entries:		Pointer to storage array
 * @nr_entries:		Size of the storage array
 * @alloc_flags:	Allocation gfp flags
 *
 * Return: The handle of the stack struct stored in depot
 */
depot_stack_handle_t stack_depot_save(unsigned long *entries,
				      unsigned int nr_entries,
				      gfp_t alloc_flags)
{
	struct stack_record *found = NULL, **bucket;
	depot_stack_handle_t retval = 0;
	struct page *page = NULL;
	void *prealloc = NULL;
	unsigned long flags;
	u32 hash;

	if (unlikely(nr_entries == 0))
		goto fast_exit;

	hash = hash_stack(entries, nr_entries);
	bucket = &stack_table[hash & STACK_HASH_MASK];

	/*
	 * Fast path: look the stack trace up without locking.
	 * The smp_load_acquire() here pairs with smp_store_release() to
	 * |bucket| below.
	 */
	found = find_stack(smp_load_acquire(bucket), entries,
			   nr_entries, hash);
	if (found)
		goto exit;

	/*
	 * Check if the current or the next stack slab need to be initialized.
	 * If so, allocate the memory - we won't be able to do that under the
	 * lock.
	 *
	 * The smp_load_acquire() here pairs with smp_store_release() to
	 * |next_slab_inited| in depot_alloc_stack() and init_stack_slab().
	 */
	if (unlikely(!smp_load_acquire(&next_slab_inited))) {
		/*
		 * Zero out zone modifiers, as we don't have specific zone
		 * requirements. Keep the flags related to allocation in atomic
		 * contexts and I/O.
		 */
		alloc_flags &= ~GFP_ZONEMASK;
		alloc_flags &= (GFP_ATOMIC | GFP_KERNEL);
		alloc_flags |= __GFP_NOWARN;
		page = alloc_pages(alloc_flags, STACK_ALLOC_ORDER);
		if (page)
			prealloc = page_address(page);
	}

	spin_lock_irqsave(&depot_lock, flags);

	found = find_stack(*bucket, entries, nr_entries, hash);
	if (!found) {
		struct stack_record *new =
			depot_alloc_stack(entries, nr_entries,
					  hash, &prealloc, alloc_flags);
		if (new) {
			new->next = *bucket;
			/*
			 * This smp_store_release() pairs with
			 * smp_load_acquire() from |bucket| above.
			 */
			smp_store_release(bucket, new);
			found = new;
		}
	} else if (prealloc) {
		/*
		 * We didn't need to store this stack trace, but let's keep
		 * the preallocated memory for the future.
		 */
		WARN_ON(!init_stack_slab(&prealloc));
	}

	spin_unlock_irqrestore(&depot_lock, flags);
exit:
	if (prealloc) {
		/* Nobody used this memory, ok to free it. */
		free_pages((unsigned long)prealloc, STACK_ALLOC_ORDER);
	}
	if (found)
		retval = found->handle.handle;
fast_exit:
	return retval;
}
EXPORT_SYMBOL_GPL(stack_depot_save);
Commit	Line	Data
cd11016e AP	1	/*
	2	* Generic stack depot for storing stack traces.
	3	*
	4	* Some debugging tools need to save stack traces of certain events which can
	5	* be later presented to the user. For example, KASAN needs to safe alloc and
	6	* free stacks for each object, but storing two stack traces per object
	7	* requires too much memory (e.g. SLUB_DEBUG needs 256 bytes per object for
	8	* that).
	9	*
	10	* Instead, stack depot maintains a hashtable of unique stacktraces. Since alloc
	11	* and free stacks repeat a lot, we save about 100x space.
	12	* Stacks are never removed from depot, so we store them contiguously one after
	13	* another in a contiguos memory allocation.
	14	*
	15	* Author: Alexander Potapenko <glider@google.com>
	16	* Copyright (C) 2016 Google, Inc.
	17	*
	18	* Based on code by Dmitry Chernenkov.
	19	*
	20	* This program is free software; you can redistribute it and/or
	21	* modify it under the terms of the GNU General Public License
	22	* version 2 as published by the Free Software Foundation.
	23	*
	24	* This program is distributed in the hope that it will be useful, but
	25	* WITHOUT ANY WARRANTY; without even the implied warranty of
	26	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	27	* General Public License for more details.
	28	*
	29	*/
	30
	31	#include <linux/gfp.h>
	32	#include <linux/jhash.h>
	33	#include <linux/kernel.h>
	34	#include <linux/mm.h>
	35	#include <linux/percpu.h>
	36	#include <linux/printk.h>
	37	#include <linux/slab.h>
	38	#include <linux/stacktrace.h>
	39	#include <linux/stackdepot.h>
	40	#include <linux/string.h>
	41	#include <linux/types.h>
	42
	43	#define DEPOT_STACK_BITS (sizeof(depot_stack_handle_t) * 8)
	44
7c31190b	45	#define STACK_ALLOC_NULL_PROTECTION_BITS 1
cd11016e AP	46	#define STACK_ALLOC_ORDER 2 /* 'Slab' size order for stack depot, 4 pages */
	47	#define STACK_ALLOC_SIZE (1LL << (PAGE_SHIFT + STACK_ALLOC_ORDER))
	48	#define STACK_ALLOC_ALIGN 4
	49	#define STACK_ALLOC_OFFSET_BITS (STACK_ALLOC_ORDER + PAGE_SHIFT - \
	50	STACK_ALLOC_ALIGN)
7c31190b JK	51	#define STACK_ALLOC_INDEX_BITS (DEPOT_STACK_BITS - \
7c31190b JK	52	STACK_ALLOC_NULL_PROTECTION_BITS - STACK_ALLOC_OFFSET_BITS)
02754e0a	53	#define STACK_ALLOC_SLABS_CAP 8192
cd11016e AP	54	#define STACK_ALLOC_MAX_SLABS \
	55	(((1LL << (STACK_ALLOC_INDEX_BITS)) < STACK_ALLOC_SLABS_CAP) ? \
	56	(1LL << (STACK_ALLOC_INDEX_BITS)) : STACK_ALLOC_SLABS_CAP)
	57
	58	/* The compact structure to store the reference to stacks. */
	59	union handle_parts {
	60	depot_stack_handle_t handle;
	61	struct {
	62	u32 slabindex : STACK_ALLOC_INDEX_BITS;
	63	u32 offset : STACK_ALLOC_OFFSET_BITS;
7c31190b	64	u32 valid : STACK_ALLOC_NULL_PROTECTION_BITS;
cd11016e AP	65	};
	66	};
	67
	68	struct stack_record {
	69	struct stack_record next; / Link in the hashtable */
	70	u32 hash; /* Hash in the hastable */
	71	u32 size; /* Number of frames in the stack */
	72	union handle_parts handle;
	73	unsigned long entries[1]; /* Variable-sized array of entries. */
	74	};
	75
	76	static void *stack_slabs[STACK_ALLOC_MAX_SLABS];
	77
	78	static int depot_index;
	79	static int next_slab_inited;
	80	static size_t depot_offset;
	81	static DEFINE_SPINLOCK(depot_lock);
	82
	83	static bool init_stack_slab(void **prealloc)
	84	{
	85	if (!*prealloc)
	86	return false;
	87	/*
	88	* This smp_load_acquire() pairs with smp_store_release() to
	89	* \|next_slab_inited\| below and in depot_alloc_stack().
	90	*/
	91	if (smp_load_acquire(&next_slab_inited))
	92	return true;
	93	if (stack_slabs[depot_index] == NULL) {
	94	stack_slabs[depot_index] = *prealloc;
	95	} else {
	96	stack_slabs[depot_index + 1] = *prealloc;
	97	/*
	98	* This smp_store_release pairs with smp_load_acquire() from
	99	* \|next_slab_inited\| above and in depot_save_stack().
	100	*/
	101	smp_store_release(&next_slab_inited, 1);
	102	}
	103	*prealloc = NULL;
	104	return true;
	105	}
	106
	107	/* Allocation of a new stack in raw storage */
	108	static struct stack_record depot_alloc_stack(unsigned long entries, int size,
	109	u32 hash, void **prealloc, gfp_t alloc_flags)
	110	{
	111	int required_size = offsetof(struct stack_record, entries) +
	112	sizeof(unsigned long) * size;
	113	struct stack_record *stack;
	114
	115	required_size = ALIGN(required_size, 1 << STACK_ALLOC_ALIGN);
	116
	117	if (unlikely(depot_offset + required_size > STACK_ALLOC_SIZE)) {
	118	if (unlikely(depot_index + 1 >= STACK_ALLOC_MAX_SLABS)) {
	119	WARN_ONCE(1, "Stack depot reached limit capacity");
	120	return NULL;
	121	}
	122	depot_index++;
	123	depot_offset = 0;
	124	/*
	125	* smp_store_release() here pairs with smp_load_acquire() from
	126	* \|next_slab_inited\| in depot_save_stack() and
	127	* init_stack_slab().
	128	*/
129	if (depot_index + 1 < STACK_ALLOC_MAX_SLABS)
130	smp_store_release(&next_slab_inited, 0);
131	}
132	init_stack_slab(prealloc);
133	if (stack_slabs[depot_index] == NULL)
134	return NULL;
135
136	stack = stack_slabs[depot_index] + depot_offset;
137
138	stack->hash = hash;
139	stack->size = size;
140	stack->handle.slabindex = depot_index;
141	stack->handle.offset = depot_offset >> STACK_ALLOC_ALIGN;
7c31190b	142	stack->handle.valid = 1;
cd11016e AP	143	memcpy(stack->entries, entries, size * sizeof(unsigned long));
	144	depot_offset += required_size;
	145
	146	return stack;
	147	}
	148
	149	#define STACK_HASH_ORDER 20
	150	#define STACK_HASH_SIZE (1L << STACK_HASH_ORDER)
	151	#define STACK_HASH_MASK (STACK_HASH_SIZE - 1)
	152	#define STACK_HASH_SEED 0x9747b28c
	153
	154	static struct stack_record *stack_table[STACK_HASH_SIZE] = {
	155	[0 ... STACK_HASH_SIZE - 1] = NULL
	156	};
	157
	158	/* Calculate hash for a stack */
	159	static inline u32 hash_stack(unsigned long *entries, unsigned int size)
	160	{
	161	return jhash2((u32 *)entries,
	162	size * sizeof(unsigned long) / sizeof(u32),
	163	STACK_HASH_SEED);
	164	}
	165
a571b272 AP	166	/* Use our own, non-instrumented version of memcmp().
	167	*
	168	* We actually don't care about the order, just the equality.
	169	*/
	170	static inline
	171	int stackdepot_memcmp(const unsigned long u1, const unsigned long u2,
	172	unsigned int n)
	173	{
	174	for ( ; n-- ; u1++, u2++) {
	175	if (u1 != u2)
	176	return 1;
	177	}
	178	return 0;
	179	}
	180
cd11016e AP	181	/* Find a stack that is equal to the one stored in entries in the hash */
	182	static inline struct stack_record find_stack(struct stack_record bucket,
	183	unsigned long *entries, int size,
	184	u32 hash)
	185	{
	186	struct stack_record *found;
	187
	188	for (found = bucket; found; found = found->next) {
	189	if (found->hash == hash &&
	190	found->size == size &&
a571b272	191	!stackdepot_memcmp(entries, found->entries, size))
cd11016e	192	return found;
cd11016e AP	193	}
	194	return NULL;
	195	}
	196
c0cfc337 TG	197	/**
	198	* stack_depot_fetch - Fetch stack entries from a depot
	199	*
	200	* @handle: Stack depot handle which was returned from
	201	* stack_depot_save().
	202	* @entries: Pointer to store the entries address
	203	*
	204	* Return: The number of trace entries for this depot.
	205	*/
	206	unsigned int stack_depot_fetch(depot_stack_handle_t handle,
	207	unsigned long **entries)
cd11016e AP	208	{
	209	union handle_parts parts = { .handle = handle };
	210	void *slab = stack_slabs[parts.slabindex];
	211	size_t offset = parts.offset << STACK_ALLOC_ALIGN;
	212	struct stack_record *stack = slab + offset;
	213
c0cfc337 TG	214	*entries = stack->entries;
	215	return stack->size;
	216	}
	217	EXPORT_SYMBOL_GPL(stack_depot_fetch);
	218
cd11016e	219	/**
c0cfc337 TG	220	* stack_depot_save - Save a stack trace from an array
	221	*
	222	* @entries: Pointer to storage array
	223	* @nr_entries: Size of the storage array
	224	* @alloc_flags: Allocation gfp flags
cd11016e	225	*
c0cfc337	226	* Return: The handle of the stack struct stored in depot
cd11016e	227	*/
c0cfc337 TG	228	depot_stack_handle_t stack_depot_save(unsigned long *entries,
	229	unsigned int nr_entries,
	230	gfp_t alloc_flags)
cd11016e	231	{
cd11016e	232	struct stack_record found = NULL, *bucket;
c0cfc337	233	depot_stack_handle_t retval = 0;
cd11016e AP	234	struct page *page = NULL;
cd11016e AP	235	void *prealloc = NULL;
c0cfc337 TG	236	unsigned long flags;
c0cfc337 TG	237	u32 hash;
cd11016e	238
c0cfc337	239	if (unlikely(nr_entries == 0))
cd11016e AP	240	goto fast_exit;
cd11016e AP	241
c0cfc337	242	hash = hash_stack(entries, nr_entries);
cd11016e AP	243	bucket = &stack_table[hash & STACK_HASH_MASK];
	244
	245	/*
	246	* Fast path: look the stack trace up without locking.
	247	* The smp_load_acquire() here pairs with smp_store_release() to
	248	* \|bucket\| below.
	249	*/
c0cfc337 TG	250	found = find_stack(smp_load_acquire(bucket), entries,
c0cfc337 TG	251	nr_entries, hash);
cd11016e AP	252	if (found)
	253	goto exit;
	254
	255	/*
	256	* Check if the current or the next stack slab need to be initialized.
	257	* If so, allocate the memory - we won't be able to do that under the
	258	* lock.
	259	*
	260	* The smp_load_acquire() here pairs with smp_store_release() to
	261	* \|next_slab_inited\| in depot_alloc_stack() and init_stack_slab().
	262	*/
	263	if (unlikely(!smp_load_acquire(&next_slab_inited))) {
	264	/*
	265	* Zero out zone modifiers, as we don't have specific zone
	266	* requirements. Keep the flags related to allocation in atomic
	267	* contexts and I/O.
	268	*/
	269	alloc_flags &= ~GFP_ZONEMASK;
	270	alloc_flags &= (GFP_ATOMIC \| GFP_KERNEL);
87cc271d	271	alloc_flags \|= __GFP_NOWARN;
cd11016e AP	272	page = alloc_pages(alloc_flags, STACK_ALLOC_ORDER);
	273	if (page)
	274	prealloc = page_address(page);
	275	}
	276
	277	spin_lock_irqsave(&depot_lock, flags);
	278
c0cfc337	279	found = find_stack(*bucket, entries, nr_entries, hash);
cd11016e AP	280	if (!found) {
cd11016e AP	281	struct stack_record *new =
c0cfc337	282	depot_alloc_stack(entries, nr_entries,
cd11016e AP	283	hash, &prealloc, alloc_flags);
	284	if (new) {
	285	new->next = *bucket;
	286	/*
	287	* This smp_store_release() pairs with
	288	* smp_load_acquire() from \|bucket\| above.
	289	*/
	290	smp_store_release(bucket, new);
	291	found = new;
	292	}
	293	} else if (prealloc) {
	294	/*
	295	* We didn't need to store this stack trace, but let's keep
	296	* the preallocated memory for the future.
	297	*/
	298	WARN_ON(!init_stack_slab(&prealloc));
	299	}
	300
	301	spin_unlock_irqrestore(&depot_lock, flags);
	302	exit:
	303	if (prealloc) {
	304	/* Nobody used this memory, ok to free it. */
	305	free_pages((unsigned long)prealloc, STACK_ALLOC_ORDER);
	306	}
	307	if (found)
	308	retval = found->handle.handle;
	309	fast_exit:
	310	return retval;
	311	}
c0cfc337	312	EXPORT_SYMBOL_GPL(stack_depot_save);