blob: 6e15fa4e823607059582aed7d8512ba8a4a65a97 [file] [log] [blame]
xjb04a4022021-11-25 15:01:52 +08001// SPDX-License-Identifier: GPL-2.0
2/*
3 * This file contains common generic and tag-based KASAN error reporting 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 * This program is free software; you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License version 2 as
13 * published by the Free Software Foundation.
14 *
15 */
16
17#include <linux/bitops.h>
18#include <linux/ftrace.h>
19#include <linux/init.h>
20#include <linux/kernel.h>
21#include <linux/mm.h>
22#include <linux/printk.h>
23#include <linux/sched.h>
24#include <linux/slab.h>
25#include <linux/stackdepot.h>
26#include <linux/stacktrace.h>
27#include <linux/string.h>
28#include <linux/types.h>
29#include <linux/kasan.h>
30#include <linux/module.h>
31
32#include <asm/sections.h>
33
34#include "kasan.h"
35#include "../slab.h"
36
37/* Shadow layout customization. */
38#define SHADOW_BYTES_PER_BLOCK 1
39#define SHADOW_BLOCKS_PER_ROW 16
40#define SHADOW_BYTES_PER_ROW (SHADOW_BLOCKS_PER_ROW * SHADOW_BYTES_PER_BLOCK)
41#define SHADOW_ROWS_AROUND_ADDR 2
42
43static unsigned long kasan_flags;
44
45#define KASAN_BIT_REPORTED 0
46#define KASAN_BIT_MULTI_SHOT 1
47
48bool kasan_save_enable_multi_shot(void)
49{
50 return test_and_set_bit(KASAN_BIT_MULTI_SHOT, &kasan_flags);
51}
52EXPORT_SYMBOL_GPL(kasan_save_enable_multi_shot);
53
54void kasan_restore_multi_shot(bool enabled)
55{
56 if (!enabled)
57 clear_bit(KASAN_BIT_MULTI_SHOT, &kasan_flags);
58}
59EXPORT_SYMBOL_GPL(kasan_restore_multi_shot);
60
61static int __init kasan_set_multi_shot(char *str)
62{
63 set_bit(KASAN_BIT_MULTI_SHOT, &kasan_flags);
64 return 1;
65}
66__setup("kasan_multi_shot", kasan_set_multi_shot);
67
68static void print_error_description(struct kasan_access_info *info)
69{
70 pr_err("BUG: KASAN: %s in %pS\n",
71 get_bug_type(info), (void *)info->ip);
72 pr_err("%s of size %zu at addr %px by task %s/%d\n",
73 info->is_write ? "Write" : "Read", info->access_size,
74 info->access_addr, current->comm, task_pid_nr(current));
75}
76
77static DEFINE_SPINLOCK(report_lock);
78
79static void start_report(unsigned long *flags)
80{
81 /*
82 * Make sure we don't end up in loop.
83 */
84 kasan_disable_current();
85 spin_lock_irqsave(&report_lock, *flags);
86 pr_err("==================================================================\n");
87}
88
89static void end_report(unsigned long *flags)
90{
91 pr_err("==================================================================\n");
92 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
93 spin_unlock_irqrestore(&report_lock, *flags);
94 if (panic_on_warn)
95 panic("panic_on_warn set ...\n");
96 kasan_enable_current();
97}
98
99static void print_track(struct kasan_track *track, const char *prefix)
100{
101 pr_err("%s by task %u:\n", prefix, track->pid);
102 if (track->stack) {
103 struct stack_trace trace;
104
105 depot_fetch_stack(track->stack, &trace);
106 print_stack_trace(&trace, 0);
107 } else {
108 pr_err("(stack is not available)\n");
109 }
110}
111
112struct page *kasan_addr_to_page(const void *addr)
113{
114 if ((addr >= (void *)PAGE_OFFSET) &&
115 (addr < high_memory))
116 return virt_to_head_page(addr);
117 return NULL;
118}
119
120static void describe_object_addr(struct kmem_cache *cache, void *object,
121 const void *addr)
122{
123 unsigned long access_addr = (unsigned long)addr;
124 unsigned long object_addr = (unsigned long)object;
125 const char *rel_type;
126 int rel_bytes;
127
128 pr_err("The buggy address belongs to the object at %px\n"
129 " which belongs to the cache %s of size %d\n",
130 object, cache->name, cache->object_size);
131
132 if (!addr)
133 return;
134
135 if (access_addr < object_addr) {
136 rel_type = "to the left";
137 rel_bytes = object_addr - access_addr;
138 } else if (access_addr >= object_addr + cache->object_size) {
139 rel_type = "to the right";
140 rel_bytes = access_addr - (object_addr + cache->object_size);
141 } else {
142 rel_type = "inside";
143 rel_bytes = access_addr - object_addr;
144 }
145
146 pr_err("The buggy address is located %d bytes %s of\n"
147 " %d-byte region [%px, %px)\n",
148 rel_bytes, rel_type, cache->object_size, (void *)object_addr,
149 (void *)(object_addr + cache->object_size));
150}
151
152static struct kasan_track *kasan_get_free_track(struct kmem_cache *cache,
153 void *object, u8 tag)
154{
155 struct kasan_alloc_meta *alloc_meta;
156 int i = 0;
157
158 alloc_meta = get_alloc_info(cache, object);
159
160#ifdef CONFIG_KASAN_SW_TAGS_IDENTIFY
161 for (i = 0; i < KASAN_NR_FREE_STACKS; i++) {
162 if (alloc_meta->free_pointer_tag[i] == tag)
163 break;
164 }
165 if (i == KASAN_NR_FREE_STACKS)
166 i = alloc_meta->free_track_idx;
167#endif
168
169 return &alloc_meta->free_track[i];
170}
171
172static void describe_object(struct kmem_cache *cache, void *object,
173 const void *addr, u8 tag)
174{
175 struct kasan_alloc_meta *alloc_info = get_alloc_info(cache, object);
176
177 if (cache->flags & SLAB_KASAN) {
178 struct kasan_track *free_track;
179
180 print_track(&alloc_info->alloc_track, "Allocated");
181 pr_err("\n");
182 free_track = kasan_get_free_track(cache, object, tag);
183 print_track(free_track, "Freed");
184 pr_err("\n");
185 }
186
187 describe_object_addr(cache, object, addr);
188}
189
190static inline bool kernel_or_module_addr(const void *addr)
191{
192 if (addr >= (void *)_stext && addr < (void *)_end)
193 return true;
194 if (is_module_address((unsigned long)addr))
195 return true;
196 return false;
197}
198
199static inline bool init_task_stack_addr(const void *addr)
200{
201 return addr >= (void *)&init_thread_union.stack &&
202 (addr <= (void *)&init_thread_union.stack +
203 sizeof(init_thread_union.stack));
204}
205
206static void print_address_description(void *addr, u8 tag)
207{
208 struct page *page = kasan_addr_to_page(addr);
209
210 dump_stack();
211 pr_err("\n");
212
213 if (page && PageSlab(page)) {
214 struct kmem_cache *cache = page->slab_cache;
215 void *object = nearest_obj(cache, page, addr);
216
217 describe_object(cache, object, addr, tag);
218 }
219
220 if (kernel_or_module_addr(addr) && !init_task_stack_addr(addr)) {
221 pr_err("The buggy address belongs to the variable:\n");
222 pr_err(" %pS\n", addr);
223 }
224
225 if (page) {
226 pr_err("The buggy address belongs to the page:\n");
227 dump_page(page, "kasan: bad access detected");
228 }
229}
230
231static bool row_is_guilty(const void *row, const void *guilty)
232{
233 return (row <= guilty) && (guilty < row + SHADOW_BYTES_PER_ROW);
234}
235
236static int shadow_pointer_offset(const void *row, const void *shadow)
237{
238 /* The length of ">ff00ff00ff00ff00: " is
239 * 3 + (BITS_PER_LONG/8)*2 chars.
240 */
241 return 3 + (BITS_PER_LONG/8)*2 + (shadow - row)*2 +
242 (shadow - row) / SHADOW_BYTES_PER_BLOCK + 1;
243}
244
245static void print_shadow_for_address(const void *addr)
246{
247 int i;
248 const void *shadow = kasan_mem_to_shadow(addr);
249 const void *shadow_row;
250
251 shadow_row = (void *)round_down((unsigned long)shadow,
252 SHADOW_BYTES_PER_ROW)
253 - SHADOW_ROWS_AROUND_ADDR * SHADOW_BYTES_PER_ROW;
254
255 pr_err("Memory state around the buggy address:\n");
256
257 for (i = -SHADOW_ROWS_AROUND_ADDR; i <= SHADOW_ROWS_AROUND_ADDR; i++) {
258 const void *kaddr = kasan_shadow_to_mem(shadow_row);
259 char buffer[4 + (BITS_PER_LONG/8)*2];
260 char shadow_buf[SHADOW_BYTES_PER_ROW];
261
262 snprintf(buffer, sizeof(buffer),
263 (i == 0) ? ">%px: " : " %px: ", kaddr);
264 /*
265 * We should not pass a shadow pointer to generic
266 * function, because generic functions may try to
267 * access kasan mapping for the passed address.
268 */
269 memcpy(shadow_buf, shadow_row, SHADOW_BYTES_PER_ROW);
270 print_hex_dump(KERN_ERR, buffer,
271 DUMP_PREFIX_NONE, SHADOW_BYTES_PER_ROW, 1,
272 shadow_buf, SHADOW_BYTES_PER_ROW, 0);
273
274 if (row_is_guilty(shadow_row, shadow))
275 pr_err("%*c\n",
276 shadow_pointer_offset(shadow_row, shadow),
277 '^');
278
279 shadow_row += SHADOW_BYTES_PER_ROW;
280 }
281}
282
283static bool report_enabled(void)
284{
285 if (current->kasan_depth)
286 return false;
287 if (test_bit(KASAN_BIT_MULTI_SHOT, &kasan_flags))
288 return true;
289 return !test_and_set_bit(KASAN_BIT_REPORTED, &kasan_flags);
290}
291
292void kasan_report_invalid_free(void *object, unsigned long ip)
293{
294 unsigned long flags;
295 u8 tag = get_tag(object);
296
297 object = reset_tag(object);
298 start_report(&flags);
299 pr_err("BUG: KASAN: double-free or invalid-free in %pS\n", (void *)ip);
300 print_tags(tag, object);
301 pr_err("\n");
302 print_address_description(object, tag);
303 pr_err("\n");
304 print_shadow_for_address(object);
305 end_report(&flags);
306 /* trigger KE to get the KAsan corruption message */
307 BUG();
308}
309
310void __kasan_report(unsigned long addr, size_t size, bool is_write, unsigned long ip)
311{
312 struct kasan_access_info info;
313 void *tagged_addr;
314 void *untagged_addr;
315 unsigned long flags;
316
317 if (likely(!report_enabled()))
318 return;
319
320 disable_trace_on_warning();
321
322 tagged_addr = (void *)addr;
323 untagged_addr = reset_tag(tagged_addr);
324
325 info.access_addr = tagged_addr;
326 if (addr_has_shadow(untagged_addr))
327 info.first_bad_addr = find_first_bad_addr(tagged_addr, size);
328 else
329 info.first_bad_addr = untagged_addr;
330 info.access_size = size;
331 info.is_write = is_write;
332 info.ip = ip;
333
334 start_report(&flags);
335
336 print_error_description(&info);
337 if (addr_has_shadow(untagged_addr))
338 print_tags(get_tag(tagged_addr), info.first_bad_addr);
339 pr_err("\n");
340
341 if (addr_has_shadow(untagged_addr)) {
342 print_address_description(untagged_addr, get_tag(tagged_addr));
343 pr_err("\n");
344 print_shadow_for_address(info.first_bad_addr);
345 } else {
346 dump_stack();
347 }
348
349 end_report(&flags);
350 /* trigger KE to get the KAsan corruption message */
351 BUG();
352}