generic.c 9.5 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0
2
/*
3
 * This file contains core generic KASAN code.
4 5
 *
 * Copyright (c) 2014 Samsung Electronics Co., Ltd.
6
 * Author: Andrey Ryabinin <ryabinin.a.a@gmail.com>
7
 *
8
 * Some code borrowed from https://github.com/xairy/kasan-prototype by
9
 *        Andrey Konovalov <andreyknvl@gmail.com>
10 11 12
 */

#include <linux/export.h>
13
#include <linux/interrupt.h>
14
#include <linux/init.h>
15
#include <linux/kasan.h>
16
#include <linux/kernel.h>
17
#include <linux/kmemleak.h>
18
#include <linux/linkage.h>
19
#include <linux/memblock.h>
A
Andrey Ryabinin 已提交
20
#include <linux/memory.h>
21
#include <linux/mm.h>
22
#include <linux/module.h>
23 24
#include <linux/printk.h>
#include <linux/sched.h>
25
#include <linux/sched/task_stack.h>
26 27 28 29
#include <linux/slab.h>
#include <linux/stacktrace.h>
#include <linux/string.h>
#include <linux/types.h>
30
#include <linux/vmalloc.h>
31
#include <linux/bug.h>
32 33

#include "kasan.h"
34
#include "../slab.h"
35 36 37 38 39 40 41 42 43 44 45 46

/*
 * All functions below always inlined so compiler could
 * perform better optimizations in each of __asan_loadX/__assn_storeX
 * depending on memory access size X.
 */

static __always_inline bool memory_is_poisoned_1(unsigned long addr)
{
	s8 shadow_value = *(s8 *)kasan_mem_to_shadow((void *)addr);

	if (unlikely(shadow_value)) {
47
		s8 last_accessible_byte = addr & KASAN_GRANULE_MASK;
48 49 50 51 52 53
		return unlikely(last_accessible_byte >= shadow_value);
	}

	return false;
}

54 55
static __always_inline bool memory_is_poisoned_2_4_8(unsigned long addr,
						unsigned long size)
56
{
57
	u8 *shadow_addr = (u8 *)kasan_mem_to_shadow((void *)addr);
58

59 60 61 62
	/*
	 * Access crosses 8(shadow size)-byte boundary. Such access maps
	 * into 2 shadow bytes, so we need to check them both.
	 */
63
	if (unlikely(((addr + size - 1) & KASAN_GRANULE_MASK) < size - 1))
64
		return *shadow_addr || memory_is_poisoned_1(addr + size - 1);
65

66
	return memory_is_poisoned_1(addr + size - 1);
67 68 69 70
}

static __always_inline bool memory_is_poisoned_16(unsigned long addr)
{
71
	u16 *shadow_addr = (u16 *)kasan_mem_to_shadow((void *)addr);
72

73
	/* Unaligned 16-bytes access maps into 3 shadow bytes. */
74
	if (unlikely(!IS_ALIGNED(addr, KASAN_GRANULE_SIZE)))
75
		return *shadow_addr || memory_is_poisoned_1(addr + 15);
76

77
	return *shadow_addr;
78 79
}

80
static __always_inline unsigned long bytes_is_nonzero(const u8 *start,
81 82 83 84 85 86 87 88 89 90 91 92
					size_t size)
{
	while (size) {
		if (unlikely(*start))
			return (unsigned long)start;
		start++;
		size--;
	}

	return 0;
}

93
static __always_inline unsigned long memory_is_nonzero(const void *start,
94 95 96 97 98 99 100
						const void *end)
{
	unsigned int words;
	unsigned long ret;
	unsigned int prefix = (unsigned long)start % 8;

	if (end - start <= 16)
101
		return bytes_is_nonzero(start, end - start);
102 103 104

	if (prefix) {
		prefix = 8 - prefix;
105
		ret = bytes_is_nonzero(start, prefix);
106 107 108 109 110 111 112 113
		if (unlikely(ret))
			return ret;
		start += prefix;
	}

	words = (end - start) / 8;
	while (words) {
		if (unlikely(*(u64 *)start))
114
			return bytes_is_nonzero(start, 8);
115 116 117 118
		start += 8;
		words--;
	}

119
	return bytes_is_nonzero(start, (end - start) % 8);
120 121 122 123 124 125 126
}

static __always_inline bool memory_is_poisoned_n(unsigned long addr,
						size_t size)
{
	unsigned long ret;

127
	ret = memory_is_nonzero(kasan_mem_to_shadow((void *)addr),
128 129 130 131 132 133 134
			kasan_mem_to_shadow((void *)addr + size - 1) + 1);

	if (unlikely(ret)) {
		unsigned long last_byte = addr + size - 1;
		s8 *last_shadow = (s8 *)kasan_mem_to_shadow((void *)last_byte);

		if (unlikely(ret != (unsigned long)last_shadow ||
135
			((long)(last_byte & KASAN_GRANULE_MASK) >= *last_shadow)))
136 137 138 139 140 141 142 143 144 145 146 147 148 149
			return true;
	}
	return false;
}

static __always_inline bool memory_is_poisoned(unsigned long addr, size_t size)
{
	if (__builtin_constant_p(size)) {
		switch (size) {
		case 1:
			return memory_is_poisoned_1(addr);
		case 2:
		case 4:
		case 8:
150
			return memory_is_poisoned_2_4_8(addr, size);
151 152 153 154 155 156 157 158 159 160
		case 16:
			return memory_is_poisoned_16(addr);
		default:
			BUILD_BUG();
		}
	}

	return memory_is_poisoned_n(addr, size);
}

161
static __always_inline bool check_memory_region_inline(unsigned long addr,
162 163
						size_t size, bool write,
						unsigned long ret_ip)
164 165
{
	if (unlikely(size == 0))
166
		return true;
167

168 169 170
	if (unlikely(addr + size < addr))
		return !kasan_report(addr, size, write, ret_ip);

171 172
	if (unlikely((void *)addr <
		kasan_shadow_to_mem((void *)KASAN_SHADOW_START))) {
173
		return !kasan_report(addr, size, write, ret_ip);
174 175 176
	}

	if (likely(!memory_is_poisoned(addr, size)))
177
		return true;
178

179
	return !kasan_report(addr, size, write, ret_ip);
180 181
}

182
bool check_memory_region(unsigned long addr, size_t size, bool write,
183 184
				unsigned long ret_ip)
{
185
	return check_memory_region_inline(addr, size, write, ret_ip);
186
}
187

188 189 190 191 192 193 194
bool check_invalid_free(void *addr)
{
	s8 shadow_byte = READ_ONCE(*(s8 *)kasan_mem_to_shadow(addr));

	return shadow_byte < 0 || shadow_byte >= KASAN_GRANULE_SIZE;
}

195 196 197 198 199
void kasan_cache_shrink(struct kmem_cache *cache)
{
	quarantine_remove_cache(cache);
}

200
void kasan_cache_shutdown(struct kmem_cache *cache)
201
{
202 203
	if (!__kmem_cache_empty(cache))
		quarantine_remove_cache(cache);
204 205
}

206 207
static void register_global(struct kasan_global *global)
{
208
	size_t aligned_size = round_up(global->size, KASAN_GRANULE_SIZE);
209

210
	unpoison_range(global->beg, global->size);
211

212 213 214
	poison_range(global->beg + aligned_size,
		     global->size_with_redzone - aligned_size,
		     KASAN_GLOBAL_REDZONE);
215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230
}

void __asan_register_globals(struct kasan_global *globals, size_t size)
{
	int i;

	for (i = 0; i < size; i++)
		register_global(&globals[i]);
}
EXPORT_SYMBOL(__asan_register_globals);

void __asan_unregister_globals(struct kasan_global *globals, size_t size)
{
}
EXPORT_SYMBOL(__asan_unregister_globals);

231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246
#define DEFINE_ASAN_LOAD_STORE(size)					\
	void __asan_load##size(unsigned long addr)			\
	{								\
		check_memory_region_inline(addr, size, false, _RET_IP_);\
	}								\
	EXPORT_SYMBOL(__asan_load##size);				\
	__alias(__asan_load##size)					\
	void __asan_load##size##_noabort(unsigned long);		\
	EXPORT_SYMBOL(__asan_load##size##_noabort);			\
	void __asan_store##size(unsigned long addr)			\
	{								\
		check_memory_region_inline(addr, size, true, _RET_IP_);	\
	}								\
	EXPORT_SYMBOL(__asan_store##size);				\
	__alias(__asan_store##size)					\
	void __asan_store##size##_noabort(unsigned long);		\
247 248 249 250 251 252 253 254 255 256
	EXPORT_SYMBOL(__asan_store##size##_noabort)

DEFINE_ASAN_LOAD_STORE(1);
DEFINE_ASAN_LOAD_STORE(2);
DEFINE_ASAN_LOAD_STORE(4);
DEFINE_ASAN_LOAD_STORE(8);
DEFINE_ASAN_LOAD_STORE(16);

void __asan_loadN(unsigned long addr, size_t size)
{
257
	check_memory_region(addr, size, false, _RET_IP_);
258 259 260 261 262 263 264 265 266
}
EXPORT_SYMBOL(__asan_loadN);

__alias(__asan_loadN)
void __asan_loadN_noabort(unsigned long, size_t);
EXPORT_SYMBOL(__asan_loadN_noabort);

void __asan_storeN(unsigned long addr, size_t size)
{
267
	check_memory_region(addr, size, true, _RET_IP_);
268 269 270 271 272 273 274 275 276 277
}
EXPORT_SYMBOL(__asan_storeN);

__alias(__asan_storeN)
void __asan_storeN_noabort(unsigned long, size_t);
EXPORT_SYMBOL(__asan_storeN_noabort);

/* to shut up compiler complaints */
void __asan_handle_no_return(void) {}
EXPORT_SYMBOL(__asan_handle_no_return);
A
Andrey Ryabinin 已提交
278

279 280 281
/* Emitted by compiler to poison alloca()ed objects. */
void __asan_alloca_poison(unsigned long addr, size_t size)
{
282
	size_t rounded_up_size = round_up(size, KASAN_GRANULE_SIZE);
283 284
	size_t padding_size = round_up(size, KASAN_ALLOCA_REDZONE_SIZE) -
			rounded_up_size;
285
	size_t rounded_down_size = round_down(size, KASAN_GRANULE_SIZE);
286 287 288 289 290 291 292

	const void *left_redzone = (const void *)(addr -
			KASAN_ALLOCA_REDZONE_SIZE);
	const void *right_redzone = (const void *)(addr + rounded_up_size);

	WARN_ON(!IS_ALIGNED(addr, KASAN_ALLOCA_REDZONE_SIZE));

293 294 295 296 297 298
	unpoison_range((const void *)(addr + rounded_down_size),
		       size - rounded_down_size);
	poison_range(left_redzone, KASAN_ALLOCA_REDZONE_SIZE,
		     KASAN_ALLOCA_LEFT);
	poison_range(right_redzone, padding_size + KASAN_ALLOCA_REDZONE_SIZE,
		     KASAN_ALLOCA_RIGHT);
299 300 301 302 303 304 305 306 307
}
EXPORT_SYMBOL(__asan_alloca_poison);

/* Emitted by compiler to unpoison alloca()ed areas when the stack unwinds. */
void __asan_allocas_unpoison(const void *stack_top, const void *stack_bottom)
{
	if (unlikely(!stack_top || stack_top > stack_bottom))
		return;

308
	unpoison_range(stack_top, stack_bottom - stack_top);
309 310 311
}
EXPORT_SYMBOL(__asan_allocas_unpoison);

312 313 314 315 316 317 318 319 320 321 322 323 324 325
/* Emitted by the compiler to [un]poison local variables. */
#define DEFINE_ASAN_SET_SHADOW(byte) \
	void __asan_set_shadow_##byte(const void *addr, size_t size)	\
	{								\
		__memset((void *)addr, 0x##byte, size);			\
	}								\
	EXPORT_SYMBOL(__asan_set_shadow_##byte)

DEFINE_ASAN_SET_SHADOW(00);
DEFINE_ASAN_SET_SHADOW(f1);
DEFINE_ASAN_SET_SHADOW(f2);
DEFINE_ASAN_SET_SHADOW(f3);
DEFINE_ASAN_SET_SHADOW(f5);
DEFINE_ASAN_SET_SHADOW(f8);
326 327 328 329 330

void kasan_record_aux_stack(void *addr)
{
	struct page *page = kasan_addr_to_page(addr);
	struct kmem_cache *cache;
331
	struct kasan_alloc_meta *alloc_meta;
332 333 334 335 336 337 338
	void *object;

	if (!(page && PageSlab(page)))
		return;

	cache = page->slab_cache;
	object = nearest_obj(cache, page, addr);
339
	alloc_meta = kasan_get_alloc_meta(cache, object);
340

341 342
	alloc_meta->aux_stack[1] = alloc_meta->aux_stack[0];
	alloc_meta->aux_stack[0] = kasan_save_stack(GFP_NOWAIT);
343
}
344 345 346 347 348 349

void kasan_set_free_info(struct kmem_cache *cache,
				void *object, u8 tag)
{
	struct kasan_free_meta *free_meta;

350
	free_meta = kasan_get_free_meta(cache, object);
351 352
	if (!free_meta)
		return;
353

354 355
	kasan_set_track(&free_meta->free_track, GFP_NOWAIT);
	/* The object was freed and has free track set. */
356 357 358 359 360 361 362 363
	*(u8 *)kasan_mem_to_shadow(object) = KASAN_KMALLOC_FREETRACK;
}

struct kasan_track *kasan_get_free_track(struct kmem_cache *cache,
				void *object, u8 tag)
{
	if (*(u8 *)kasan_mem_to_shadow(object) != KASAN_KMALLOC_FREETRACK)
		return NULL;
364
	/* Free meta must be present with KASAN_KMALLOC_FREETRACK. */
365
	return &kasan_get_free_meta(cache, object)->free_track;
366
}