report.c 9.2 KB

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