[deliverable/linux.git] / mm / kasan / report.c

/*
 * This file contains error reporting code.
 *
 * Copyright (c) 2014 Samsung Electronics Co., Ltd.
 * Author: Andrey Ryabinin <ryabinin.a.a@gmail.com>
 *
 * Some code borrowed from https://github.com/xairy/kasan-prototype by
 *        Andrey Konovalov <adech.fo@gmail.com>
 *
 * 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.
 *
 */

#include <linux/kernel.h>
#include <linux/mm.h>
#include <linux/printk.h>
#include <linux/sched.h>
#include <linux/slab.h>
#include <linux/stackdepot.h>
#include <linux/stacktrace.h>
#include <linux/string.h>
#include <linux/types.h>
#include <linux/kasan.h>
#include <linux/module.h>

#include <asm/sections.h>

#include "kasan.h"
#include "../slab.h"

/* Shadow layout customization. */
#define SHADOW_BYTES_PER_BLOCK 1
#define SHADOW_BLOCKS_PER_ROW 16
#define SHADOW_BYTES_PER_ROW (SHADOW_BLOCKS_PER_ROW * SHADOW_BYTES_PER_BLOCK)
#define SHADOW_ROWS_AROUND_ADDR 2

static const void *find_first_bad_addr(const void *addr, size_t size)
{
	u8 shadow_val = *(u8 *)kasan_mem_to_shadow(addr);
	const void *first_bad_addr = addr;

	while (!shadow_val && first_bad_addr < addr + size) {
		first_bad_addr += KASAN_SHADOW_SCALE_SIZE;
		shadow_val = *(u8 *)kasan_mem_to_shadow(first_bad_addr);
	}
	return first_bad_addr;
}

static void print_error_description(struct kasan_access_info *info)
{
	const char *bug_type = "unknown-crash";
	u8 *shadow_addr;

	info->first_bad_addr = find_first_bad_addr(info->access_addr,
						info->access_size);

	shadow_addr = (u8 *)kasan_mem_to_shadow(info->first_bad_addr);

	/*
	 * If shadow byte value is in [0, KASAN_SHADOW_SCALE_SIZE) we can look
	 * at the next shadow byte to determine the type of the bad access.
	 */
	if (*shadow_addr > 0 && *shadow_addr <= KASAN_SHADOW_SCALE_SIZE - 1)
		shadow_addr++;

	switch (*shadow_addr) {
	case 0 ... KASAN_SHADOW_SCALE_SIZE - 1:
		/*
		 * In theory it's still possible to see these shadow values
		 * due to a data race in the kernel code.
		 */
		bug_type = "out-of-bounds";
		break;
	case KASAN_PAGE_REDZONE:
	case KASAN_KMALLOC_REDZONE:
		bug_type = "slab-out-of-bounds";
		break;
	case KASAN_GLOBAL_REDZONE:
		bug_type = "global-out-of-bounds";
		break;
	case KASAN_STACK_LEFT:
	case KASAN_STACK_MID:
	case KASAN_STACK_RIGHT:
	case KASAN_STACK_PARTIAL:
		bug_type = "stack-out-of-bounds";
		break;
	case KASAN_FREE_PAGE:
	case KASAN_KMALLOC_FREE:
		bug_type = "use-after-free";
		break;
	}

	pr_err("BUG: KASAN: %s in %pS at addr %p\n",
		bug_type, (void *)info->ip,
		info->access_addr);
	pr_err("%s of size %zu by task %s/%d\n",
		info->is_write ? "Write" : "Read",
		info->access_size, current->comm, task_pid_nr(current));
}

static inline bool kernel_or_module_addr(const void *addr)
{
	if (addr >= (void *)_stext && addr < (void *)_end)
		return true;
	if (is_module_address((unsigned long)addr))
		return true;
	return false;
}

static inline bool init_task_stack_addr(const void *addr)
{
	return addr >= (void *)&init_thread_union.stack &&
		(addr <= (void *)&init_thread_union.stack +
			sizeof(init_thread_union.stack));
}

static DEFINE_SPINLOCK(report_lock);

static void kasan_start_report(unsigned long *flags)
{
	/*
	 * Make sure we don't end up in loop.
	 */
	kasan_disable_current();
	spin_lock_irqsave(&report_lock, *flags);
	pr_err("==================================================================\n");
}

static void kasan_end_report(unsigned long *flags)
{
	pr_err("==================================================================\n");
	add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
	spin_unlock_irqrestore(&report_lock, *flags);
	kasan_enable_current();
}

static void print_track(struct kasan_track *track)
{
	pr_err("PID = %u\n", track->pid);
	if (track->stack) {
		struct stack_trace trace;

		depot_fetch_stack(track->stack, &trace);
		print_stack_trace(&trace, 0);
	} else {
		pr_err("(stack is not available)\n");
	}
}

static void kasan_object_err(struct kmem_cache *cache, void *object)
{
	struct kasan_alloc_meta *alloc_info = get_alloc_info(cache, object);

	dump_stack();
	pr_err("Object at %p, in cache %s size: %d\n", object, cache->name,
		cache->object_size);

	if (!(cache->flags & SLAB_KASAN))
		return;

	pr_err("Allocated:\n");
	print_track(&alloc_info->alloc_track);
	pr_err("Freed:\n");
	print_track(&alloc_info->free_track);
}

void kasan_report_double_free(struct kmem_cache *cache, void *object,
			s8 shadow)
{
	unsigned long flags;

	kasan_start_report(&flags);
	pr_err("BUG: Double free or freeing an invalid pointer\n");
	pr_err("Unexpected shadow byte: 0x%hhX\n", shadow);
	kasan_object_err(cache, object);
	kasan_end_report(&flags);
}

static void print_address_description(struct kasan_access_info *info)
{
	const void *addr = info->access_addr;

	if ((addr >= (void *)PAGE_OFFSET) &&
		(addr < high_memory)) {
		struct page *page = virt_to_head_page(addr);

		if (PageSlab(page)) {
			void *object;
			struct kmem_cache *cache = page->slab_cache;
			object = nearest_obj(cache, page,
						(void *)info->access_addr);
			kasan_object_err(cache, object);
			return;
		}
		dump_page(page, "kasan: bad access detected");
	}

	if (kernel_or_module_addr(addr)) {
		if (!init_task_stack_addr(addr))
			pr_err("Address belongs to variable %pS\n", addr);
	}
	dump_stack();
}

static bool row_is_guilty(const void *row, const void *guilty)
{
	return (row <= guilty) && (guilty < row + SHADOW_BYTES_PER_ROW);
}

static int shadow_pointer_offset(const void *row, const void *shadow)
{
	/* The length of ">ff00ff00ff00ff00: " is
	 *    3 + (BITS_PER_LONG/8)*2 chars.
	 */
	return 3 + (BITS_PER_LONG/8)*2 + (shadow - row)*2 +
		(shadow - row) / SHADOW_BYTES_PER_BLOCK + 1;
}

static void print_shadow_for_address(const void *addr)
{
	int i;
	const void *shadow = kasan_mem_to_shadow(addr);
	const void *shadow_row;

	shadow_row = (void *)round_down((unsigned long)shadow,
					SHADOW_BYTES_PER_ROW)
		- SHADOW_ROWS_AROUND_ADDR * SHADOW_BYTES_PER_ROW;

	pr_err("Memory state around the buggy address:\n");

	for (i = -SHADOW_ROWS_AROUND_ADDR; i <= SHADOW_ROWS_AROUND_ADDR; i++) {
		const void *kaddr = kasan_shadow_to_mem(shadow_row);
		char buffer[4 + (BITS_PER_LONG/8)*2];
		char shadow_buf[SHADOW_BYTES_PER_ROW];

		snprintf(buffer, sizeof(buffer),
			(i == 0) ? ">%p: " : " %p: ", kaddr);
		/*
		 * We should not pass a shadow pointer to generic
		 * function, because generic functions may try to
		 * access kasan mapping for the passed address.
		 */
		memcpy(shadow_buf, shadow_row, SHADOW_BYTES_PER_ROW);
		print_hex_dump(KERN_ERR, buffer,
			DUMP_PREFIX_NONE, SHADOW_BYTES_PER_ROW, 1,
			shadow_buf, SHADOW_BYTES_PER_ROW, 0);

		if (row_is_guilty(shadow_row, shadow))
			pr_err("%*c\n",
				shadow_pointer_offset(shadow_row, shadow),
				'^');

		shadow_row += SHADOW_BYTES_PER_ROW;
	}
}

static void kasan_report_error(struct kasan_access_info *info)
{
	unsigned long flags;
	const char *bug_type;

	kasan_start_report(&flags);

	if (info->access_addr <
			kasan_shadow_to_mem((void *)KASAN_SHADOW_START)) {
		if ((unsigned long)info->access_addr < PAGE_SIZE)
			bug_type = "null-ptr-deref";
		else if ((unsigned long)info->access_addr < TASK_SIZE)
			bug_type = "user-memory-access";
		else
			bug_type = "wild-memory-access";
		pr_err("BUG: KASAN: %s on address %p\n",
			bug_type, info->access_addr);
		pr_err("%s of size %zu by task %s/%d\n",
			info->is_write ? "Write" : "Read",
			info->access_size, current->comm,
			task_pid_nr(current));
		dump_stack();
	} else {
		print_error_description(info);
		print_address_description(info);
		print_shadow_for_address(info->first_bad_addr);
	}

	kasan_end_report(&flags);
}

void kasan_report(unsigned long addr, size_t size,
		bool is_write, unsigned long ip)
{
	struct kasan_access_info info;

	if (likely(!kasan_report_enabled()))
		return;

	info.access_addr = (void *)addr;
	info.access_size = size;
	info.is_write = is_write;
	info.ip = ip;

	kasan_report_error(&info);
}


#define DEFINE_ASAN_REPORT_LOAD(size)                     \
void __asan_report_load##size##_noabort(unsigned long addr) \
{                                                         \
	kasan_report(addr, size, false, _RET_IP_);	  \
}                                                         \
EXPORT_SYMBOL(__asan_report_load##size##_noabort)

#define DEFINE_ASAN_REPORT_STORE(size)                     \
void __asan_report_store##size##_noabort(unsigned long addr) \
{                                                          \
	kasan_report(addr, size, true, _RET_IP_);	   \
}                                                          \
EXPORT_SYMBOL(__asan_report_store##size##_noabort)

DEFINE_ASAN_REPORT_LOAD(1);
DEFINE_ASAN_REPORT_LOAD(2);
DEFINE_ASAN_REPORT_LOAD(4);
DEFINE_ASAN_REPORT_LOAD(8);
DEFINE_ASAN_REPORT_LOAD(16);
DEFINE_ASAN_REPORT_STORE(1);
DEFINE_ASAN_REPORT_STORE(2);
DEFINE_ASAN_REPORT_STORE(4);
DEFINE_ASAN_REPORT_STORE(8);
DEFINE_ASAN_REPORT_STORE(16);

void __asan_report_load_n_noabort(unsigned long addr, size_t size)
{
	kasan_report(addr, size, false, _RET_IP_);
}
EXPORT_SYMBOL(__asan_report_load_n_noabort);

void __asan_report_store_n_noabort(unsigned long addr, size_t size)
{
	kasan_report(addr, size, true, _RET_IP_);
}
EXPORT_SYMBOL(__asan_report_store_n_noabort);
Commit	Line	Data
0b24becc AR	1	/*
	2	* This file contains error reporting code.
	3	*
	4	* Copyright (c) 2014 Samsung Electronics Co., Ltd.
2baf9e89	5	* Author: Andrey Ryabinin <ryabinin.a.a@gmail.com>
0b24becc	6	*
5d0926ef	7	* Some code borrowed from https://github.com/xairy/kasan-prototype by
0b24becc AR	8	* Andrey Konovalov <adech.fo@gmail.com>
	9	*
	10	* This program is free software; you can redistribute it and/or modify
	11	* it under the terms of the GNU General Public License version 2 as
	12	* published by the Free Software Foundation.
	13	*
	14	*/
	15
	16	#include <linux/kernel.h>
	17	#include <linux/mm.h>
	18	#include <linux/printk.h>
	19	#include <linux/sched.h>
	20	#include <linux/slab.h>
cd11016e	21	#include <linux/stackdepot.h>
0b24becc AR	22	#include <linux/stacktrace.h>
	23	#include <linux/string.h>
	24	#include <linux/types.h>
	25	#include <linux/kasan.h>
527f215b	26	#include <linux/module.h>
0b24becc	27
bebf56a1 AR	28	#include <asm/sections.h>
bebf56a1 AR	29
0b24becc	30	#include "kasan.h"
0316bec2	31	#include "../slab.h"
0b24becc AR	32
	33	/* Shadow layout customization. */
	34	#define SHADOW_BYTES_PER_BLOCK 1
	35	#define SHADOW_BLOCKS_PER_ROW 16
	36	#define SHADOW_BYTES_PER_ROW (SHADOW_BLOCKS_PER_ROW * SHADOW_BYTES_PER_BLOCK)
	37	#define SHADOW_ROWS_AROUND_ADDR 2
	38
	39	static const void find_first_bad_addr(const void addr, size_t size)
	40	{
	41	u8 shadow_val = (u8 )kasan_mem_to_shadow(addr);
	42	const void *first_bad_addr = addr;
	43
	44	while (!shadow_val && first_bad_addr < addr + size) {
	45	first_bad_addr += KASAN_SHADOW_SCALE_SIZE;
	46	shadow_val = (u8 )kasan_mem_to_shadow(first_bad_addr);
	47	}
	48	return first_bad_addr;
	49	}
	50
	51	static void print_error_description(struct kasan_access_info *info)
	52	{
0952d87f	53	const char *bug_type = "unknown-crash";
cdf6a273	54	u8 *shadow_addr;
0b24becc AR	55
	56	info->first_bad_addr = find_first_bad_addr(info->access_addr,
	57	info->access_size);
	58
cdf6a273	59	shadow_addr = (u8 *)kasan_mem_to_shadow(info->first_bad_addr);
0b24becc	60
cdf6a273 AK	61	/*
	62	* If shadow byte value is in [0, KASAN_SHADOW_SCALE_SIZE) we can look
	63	* at the next shadow byte to determine the type of the bad access.
	64	*/
	65	if (shadow_addr > 0 && shadow_addr <= KASAN_SHADOW_SCALE_SIZE - 1)
	66	shadow_addr++;
	67
	68	switch (*shadow_addr) {
0952d87f	69	case 0 ... KASAN_SHADOW_SCALE_SIZE - 1:
cdf6a273 AK	70	/*
	71	* In theory it's still possible to see these shadow values
	72	* due to a data race in the kernel code.
	73	*/
0952d87f	74	bug_type = "out-of-bounds";
b8c73fc2	75	break;
0316bec2 AR	76	case KASAN_PAGE_REDZONE:
0316bec2 AR	77	case KASAN_KMALLOC_REDZONE:
0952d87f AK	78	bug_type = "slab-out-of-bounds";
0952d87f AK	79	break;
bebf56a1	80	case KASAN_GLOBAL_REDZONE:
0952d87f	81	bug_type = "global-out-of-bounds";
0b24becc	82	break;
c420f167 AR	83	case KASAN_STACK_LEFT:
	84	case KASAN_STACK_MID:
	85	case KASAN_STACK_RIGHT:
	86	case KASAN_STACK_PARTIAL:
0952d87f AK	87	bug_type = "stack-out-of-bounds";
	88	break;
	89	case KASAN_FREE_PAGE:
	90	case KASAN_KMALLOC_FREE:
	91	bug_type = "use-after-free";
c420f167	92	break;
0b24becc AR	93	}
0b24becc AR	94
25add7ec	95	pr_err("BUG: KASAN: %s in %pS at addr %p\n",
0b24becc AR	96	bug_type, (void *)info->ip,
	97	info->access_addr);
	98	pr_err("%s of size %zu by task %s/%d\n",
	99	info->is_write ? "Write" : "Read",
	100	info->access_size, current->comm, task_pid_nr(current));
	101	}
	102
bebf56a1 AR	103	static inline bool kernel_or_module_addr(const void *addr)
bebf56a1 AR	104	{
527f215b AK	105	if (addr >= (void )_stext && addr < (void )_end)
	106	return true;
	107	if (is_module_address((unsigned long)addr))
	108	return true;
	109	return false;
bebf56a1 AR	110	}
	111
	112	static inline bool init_task_stack_addr(const void *addr)
	113	{
	114	return addr >= (void *)&init_thread_union.stack &&
	115	(addr <= (void *)&init_thread_union.stack +
	116	sizeof(init_thread_union.stack));
	117	}
	118
7e088978 AR	119	static DEFINE_SPINLOCK(report_lock);
	120
	121	static void kasan_start_report(unsigned long *flags)
	122	{
	123	/*
	124	* Make sure we don't end up in loop.
	125	*/
	126	kasan_disable_current();
	127	spin_lock_irqsave(&report_lock, *flags);
	128	pr_err("==================================================================\n");
	129	}
	130
	131	static void kasan_end_report(unsigned long *flags)
	132	{
	133	pr_err("==================================================================\n");
	134	add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
	135	spin_unlock_irqrestore(&report_lock, *flags);
	136	kasan_enable_current();
	137	}
	138
7ed2f9e6 AP	139	static void print_track(struct kasan_track *track)
7ed2f9e6 AP	140	{
cd11016e AP	141	pr_err("PID = %u\n", track->pid);
	142	if (track->stack) {
	143	struct stack_trace trace;
	144
	145	depot_fetch_stack(track->stack, &trace);
	146	print_stack_trace(&trace, 0);
	147	} else {
	148	pr_err("(stack is not available)\n");
	149	}
7ed2f9e6 AP	150	}
7ed2f9e6 AP	151
7e088978	152	static void kasan_object_err(struct kmem_cache cache, void object)
7ed2f9e6 AP	153	{
7ed2f9e6 AP	154	struct kasan_alloc_meta *alloc_info = get_alloc_info(cache, object);
7ed2f9e6 AP	155
7ed2f9e6 AP	156	dump_stack();
47b5c2a0 AR	157	pr_err("Object at %p, in cache %s size: %d\n", object, cache->name,
	158	cache->object_size);
	159
7ed2f9e6 AP	160	if (!(cache->flags & SLAB_KASAN))
7ed2f9e6 AP	161	return;
b3cbd9bf AR	162
	163	pr_err("Allocated:\n");
	164	print_track(&alloc_info->alloc_track);
	165	pr_err("Freed:\n");
	166	print_track(&alloc_info->free_track);
7ed2f9e6	167	}
7ed2f9e6	168
7e088978 AR	169	void kasan_report_double_free(struct kmem_cache cache, void object,
	170	s8 shadow)
	171	{
	172	unsigned long flags;
	173
	174	kasan_start_report(&flags);
	175	pr_err("BUG: Double free or freeing an invalid pointer\n");
	176	pr_err("Unexpected shadow byte: 0x%hhX\n", shadow);
	177	kasan_object_err(cache, object);
	178	kasan_end_report(&flags);
	179	}
	180
0b24becc AR	181	static void print_address_description(struct kasan_access_info *info)
0b24becc AR	182	{
b8c73fc2 AR	183	const void *addr = info->access_addr;
	184
	185	if ((addr >= (void *)PAGE_OFFSET) &&
	186	(addr < high_memory)) {
	187	struct page *page = virt_to_head_page(addr);
0316bec2 AR	188
	189	if (PageSlab(page)) {
	190	void *object;
	191	struct kmem_cache *cache = page->slab_cache;
7ed2f9e6 AP	192	object = nearest_obj(cache, page,
7ed2f9e6 AP	193	(void *)info->access_addr);
7e088978	194	kasan_object_err(cache, object);
0316bec2 AR	195	return;
0316bec2 AR	196	}
b8c73fc2 AR	197	dump_page(page, "kasan: bad access detected");
	198	}
	199
bebf56a1 AR	200	if (kernel_or_module_addr(addr)) {
	201	if (!init_task_stack_addr(addr))
	202	pr_err("Address belongs to variable %pS\n", addr);
	203	}
0b24becc AR	204	dump_stack();
	205	}
	206
	207	static bool row_is_guilty(const void row, const void guilty)
	208	{
	209	return (row <= guilty) && (guilty < row + SHADOW_BYTES_PER_ROW);
	210	}
	211
	212	static int shadow_pointer_offset(const void row, const void shadow)
	213	{
	214	/* The length of ">ff00ff00ff00ff00: " is
	215	* 3 + (BITS_PER_LONG/8)*2 chars.
	216	*/
	217	return 3 + (BITS_PER_LONG/8)2 + (shadow - row)2 +
	218	(shadow - row) / SHADOW_BYTES_PER_BLOCK + 1;
	219	}
	220
	221	static void print_shadow_for_address(const void *addr)
	222	{
	223	int i;
	224	const void *shadow = kasan_mem_to_shadow(addr);
	225	const void *shadow_row;
	226
	227	shadow_row = (void *)round_down((unsigned long)shadow,
	228	SHADOW_BYTES_PER_ROW)
	229	- SHADOW_ROWS_AROUND_ADDR * SHADOW_BYTES_PER_ROW;
	230
	231	pr_err("Memory state around the buggy address:\n");
	232
	233	for (i = -SHADOW_ROWS_AROUND_ADDR; i <= SHADOW_ROWS_AROUND_ADDR; i++) {
	234	const void *kaddr = kasan_shadow_to_mem(shadow_row);
	235	char buffer[4 + (BITS_PER_LONG/8)*2];
f2377d4e	236	char shadow_buf[SHADOW_BYTES_PER_ROW];
0b24becc AR	237
	238	snprintf(buffer, sizeof(buffer),
	239	(i == 0) ? ">%p: " : " %p: ", kaddr);
f2377d4e AK	240	/*
	241	* We should not pass a shadow pointer to generic
	242	* function, because generic functions may try to
	243	* access kasan mapping for the passed address.
	244	*/
f2377d4e	245	memcpy(shadow_buf, shadow_row, SHADOW_BYTES_PER_ROW);
0b24becc AR	246	print_hex_dump(KERN_ERR, buffer,
0b24becc AR	247	DUMP_PREFIX_NONE, SHADOW_BYTES_PER_ROW, 1,
f2377d4e	248	shadow_buf, SHADOW_BYTES_PER_ROW, 0);
0b24becc AR	249
	250	if (row_is_guilty(shadow_row, shadow))
	251	pr_err("%*c\n",
	252	shadow_pointer_offset(shadow_row, shadow),
	253	'^');
	254
	255	shadow_row += SHADOW_BYTES_PER_ROW;
	256	}
	257	}
	258
e9121076	259	static void kasan_report_error(struct kasan_access_info *info)
0b24becc AR	260	{
0b24becc AR	261	unsigned long flags;
e9121076	262	const char *bug_type;
0b24becc	263
7e088978 AR	264	kasan_start_report(&flags);
7e088978 AR	265
e9121076 AK	266	if (info->access_addr <
	267	kasan_shadow_to_mem((void *)KASAN_SHADOW_START)) {
	268	if ((unsigned long)info->access_addr < PAGE_SIZE)
	269	bug_type = "null-ptr-deref";
	270	else if ((unsigned long)info->access_addr < TASK_SIZE)
	271	bug_type = "user-memory-access";
	272	else
	273	bug_type = "wild-memory-access";
25add7ec	274	pr_err("BUG: KASAN: %s on address %p\n",
e9121076 AK	275	bug_type, info->access_addr);
	276	pr_err("%s of size %zu by task %s/%d\n",
	277	info->is_write ? "Write" : "Read",
	278	info->access_size, current->comm,
	279	task_pid_nr(current));
	280	dump_stack();
	281	} else {
	282	print_error_description(info);
	283	print_address_description(info);
	284	print_shadow_for_address(info->first_bad_addr);
	285	}
7e088978 AR	286
7e088978 AR	287	kasan_end_report(&flags);
0b24becc AR	288	}
	289
	290	void kasan_report(unsigned long addr, size_t size,
	291	bool is_write, unsigned long ip)
	292	{
	293	struct kasan_access_info info;
	294
0ba8663c	295	if (likely(!kasan_report_enabled()))
0b24becc AR	296	return;
	297
	298	info.access_addr = (void *)addr;
	299	info.access_size = size;
	300	info.is_write = is_write;
	301	info.ip = ip;
e9121076	302
0b24becc AR	303	kasan_report_error(&info);
	304	}
	305
	306
	307	#define DEFINE_ASAN_REPORT_LOAD(size) \
	308	void __asan_report_load##size##_noabort(unsigned long addr) \
	309	{ \
	310	kasan_report(addr, size, false, _RET_IP_); \
	311	} \
	312	EXPORT_SYMBOL(__asan_report_load##size##_noabort)
	313
	314	#define DEFINE_ASAN_REPORT_STORE(size) \
	315	void __asan_report_store##size##_noabort(unsigned long addr) \
	316	{ \
	317	kasan_report(addr, size, true, _RET_IP_); \
	318	} \
	319	EXPORT_SYMBOL(__asan_report_store##size##_noabort)
	320
	321	DEFINE_ASAN_REPORT_LOAD(1);
	322	DEFINE_ASAN_REPORT_LOAD(2);
	323	DEFINE_ASAN_REPORT_LOAD(4);
	324	DEFINE_ASAN_REPORT_LOAD(8);
	325	DEFINE_ASAN_REPORT_LOAD(16);
	326	DEFINE_ASAN_REPORT_STORE(1);
	327	DEFINE_ASAN_REPORT_STORE(2);
	328	DEFINE_ASAN_REPORT_STORE(4);
	329	DEFINE_ASAN_REPORT_STORE(8);
	330	DEFINE_ASAN_REPORT_STORE(16);
	331
	332	void __asan_report_load_n_noabort(unsigned long addr, size_t size)
	333	{
	334	kasan_report(addr, size, false, _RET_IP_);
	335	}
	336	EXPORT_SYMBOL(__asan_report_load_n_noabort);
	337
	338	void __asan_report_store_n_noabort(unsigned long addr, size_t size)
	339	{
	340	kasan_report(addr, size, true, _RET_IP_);
	341	}
	342	EXPORT_SYMBOL(__asan_report_store_n_noabort);