init.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * This file contains KASAN shadow initialization code.
  4. *
  5. * Copyright (c) 2015 Samsung Electronics Co., Ltd.
  6. * Author: Andrey Ryabinin <ryabinin.a.a@gmail.com>
  7. */
  8. #include <linux/memblock.h>
  9. #include <linux/init.h>
  10. #include <linux/kasan.h>
  11. #include <linux/kernel.h>
  12. #include <linux/mm.h>
  13. #include <linux/pfn.h>
  14. #include <linux/slab.h>
  15. #include <linux/pgalloc.h>
  16. #include <asm/page.h>
  17. #include "kasan.h"
  18. /*
  19. * This page serves two purposes:
  20. * - It used as early shadow memory. The entire shadow region populated
  21. * with this page, before we will be able to setup normal shadow memory.
  22. * - Latter it reused it as zero shadow to cover large ranges of memory
  23. * that allowed to access, but not handled by kasan (vmalloc/vmemmap ...).
  24. */
  25. unsigned char kasan_early_shadow_page[PAGE_SIZE] __page_aligned_bss;
  26. #if CONFIG_PGTABLE_LEVELS > 4
  27. p4d_t kasan_early_shadow_p4d[MAX_PTRS_PER_P4D] __page_aligned_bss;
  28. static inline bool kasan_p4d_table(pgd_t pgd)
  29. {
  30. return pgd_page(pgd) == virt_to_page(lm_alias(kasan_early_shadow_p4d));
  31. }
  32. #else
  33. static inline bool kasan_p4d_table(pgd_t pgd)
  34. {
  35. return false;
  36. }
  37. #endif
  38. #if CONFIG_PGTABLE_LEVELS > 3
  39. pud_t kasan_early_shadow_pud[MAX_PTRS_PER_PUD] __page_aligned_bss;
  40. static inline bool kasan_pud_table(p4d_t p4d)
  41. {
  42. return p4d_page(p4d) == virt_to_page(lm_alias(kasan_early_shadow_pud));
  43. }
  44. #else
  45. static inline bool kasan_pud_table(p4d_t p4d)
  46. {
  47. return false;
  48. }
  49. #endif
  50. #if CONFIG_PGTABLE_LEVELS > 2
  51. pmd_t kasan_early_shadow_pmd[MAX_PTRS_PER_PMD] __page_aligned_bss;
  52. static inline bool kasan_pmd_table(pud_t pud)
  53. {
  54. return pud_page(pud) == virt_to_page(lm_alias(kasan_early_shadow_pmd));
  55. }
  56. #else
  57. static inline bool kasan_pmd_table(pud_t pud)
  58. {
  59. return false;
  60. }
  61. #endif
  62. pte_t kasan_early_shadow_pte[MAX_PTRS_PER_PTE + PTE_HWTABLE_PTRS]
  63. __page_aligned_bss;
  64. static inline bool kasan_pte_table(pmd_t pmd)
  65. {
  66. return pmd_page(pmd) == virt_to_page(lm_alias(kasan_early_shadow_pte));
  67. }
  68. static inline bool kasan_early_shadow_page_entry(pte_t pte)
  69. {
  70. return pte_page(pte) == virt_to_page(lm_alias(kasan_early_shadow_page));
  71. }
  72. static __init void *early_alloc(size_t size, int node)
  73. {
  74. void *ptr = memblock_alloc_try_nid(size, size, __pa(MAX_DMA_ADDRESS),
  75. MEMBLOCK_ALLOC_ACCESSIBLE, node);
  76. if (!ptr)
  77. panic("%s: Failed to allocate %zu bytes align=%zx nid=%d from=%llx\n",
  78. __func__, size, size, node, (u64)__pa(MAX_DMA_ADDRESS));
  79. return ptr;
  80. }
  81. static void __ref zero_pte_populate(pmd_t *pmd, unsigned long addr,
  82. unsigned long end)
  83. {
  84. pte_t *pte = pte_offset_kernel(pmd, addr);
  85. pte_t zero_pte;
  86. zero_pte = pfn_pte(PFN_DOWN(__pa_symbol(kasan_early_shadow_page)),
  87. PAGE_KERNEL);
  88. zero_pte = pte_wrprotect(zero_pte);
  89. while (addr + PAGE_SIZE <= end) {
  90. set_pte_at(&init_mm, addr, pte, zero_pte);
  91. addr += PAGE_SIZE;
  92. pte = pte_offset_kernel(pmd, addr);
  93. }
  94. }
  95. static int __ref zero_pmd_populate(pud_t *pud, unsigned long addr,
  96. unsigned long end)
  97. {
  98. pmd_t *pmd = pmd_offset(pud, addr);
  99. unsigned long next;
  100. do {
  101. next = pmd_addr_end(addr, end);
  102. if (IS_ALIGNED(addr, PMD_SIZE) && end - addr >= PMD_SIZE) {
  103. pmd_populate_kernel(&init_mm, pmd,
  104. lm_alias(kasan_early_shadow_pte));
  105. continue;
  106. }
  107. if (pmd_none(*pmd)) {
  108. pte_t *p;
  109. if (slab_is_available())
  110. p = pte_alloc_one_kernel(&init_mm);
  111. else {
  112. p = early_alloc(PAGE_SIZE, NUMA_NO_NODE);
  113. kernel_pte_init(p);
  114. }
  115. if (!p)
  116. return -ENOMEM;
  117. pmd_populate_kernel(&init_mm, pmd, p);
  118. }
  119. zero_pte_populate(pmd, addr, next);
  120. } while (pmd++, addr = next, addr != end);
  121. return 0;
  122. }
  123. static int __ref zero_pud_populate(p4d_t *p4d, unsigned long addr,
  124. unsigned long end)
  125. {
  126. pud_t *pud = pud_offset(p4d, addr);
  127. unsigned long next;
  128. do {
  129. next = pud_addr_end(addr, end);
  130. if (IS_ALIGNED(addr, PUD_SIZE) && end - addr >= PUD_SIZE) {
  131. pmd_t *pmd;
  132. pud_populate(&init_mm, pud,
  133. lm_alias(kasan_early_shadow_pmd));
  134. pmd = pmd_offset(pud, addr);
  135. pmd_populate_kernel(&init_mm, pmd,
  136. lm_alias(kasan_early_shadow_pte));
  137. continue;
  138. }
  139. if (pud_none(*pud)) {
  140. pmd_t *p;
  141. if (slab_is_available()) {
  142. p = pmd_alloc(&init_mm, pud, addr);
  143. if (!p)
  144. return -ENOMEM;
  145. } else {
  146. p = early_alloc(PAGE_SIZE, NUMA_NO_NODE);
  147. pmd_init(p);
  148. pud_populate(&init_mm, pud, p);
  149. }
  150. }
  151. zero_pmd_populate(pud, addr, next);
  152. } while (pud++, addr = next, addr != end);
  153. return 0;
  154. }
  155. static int __ref zero_p4d_populate(pgd_t *pgd, unsigned long addr,
  156. unsigned long end)
  157. {
  158. p4d_t *p4d = p4d_offset(pgd, addr);
  159. unsigned long next;
  160. do {
  161. next = p4d_addr_end(addr, end);
  162. if (IS_ALIGNED(addr, P4D_SIZE) && end - addr >= P4D_SIZE) {
  163. pud_t *pud;
  164. pmd_t *pmd;
  165. p4d_populate_kernel(addr, p4d,
  166. lm_alias(kasan_early_shadow_pud));
  167. pud = pud_offset(p4d, addr);
  168. pud_populate(&init_mm, pud,
  169. lm_alias(kasan_early_shadow_pmd));
  170. pmd = pmd_offset(pud, addr);
  171. pmd_populate_kernel(&init_mm, pmd,
  172. lm_alias(kasan_early_shadow_pte));
  173. continue;
  174. }
  175. if (p4d_none(*p4d)) {
  176. pud_t *p;
  177. if (slab_is_available()) {
  178. p = pud_alloc(&init_mm, p4d, addr);
  179. if (!p)
  180. return -ENOMEM;
  181. } else {
  182. p = early_alloc(PAGE_SIZE, NUMA_NO_NODE);
  183. pud_init(p);
  184. p4d_populate_kernel(addr, p4d, p);
  185. }
  186. }
  187. zero_pud_populate(p4d, addr, next);
  188. } while (p4d++, addr = next, addr != end);
  189. return 0;
  190. }
  191. /**
  192. * kasan_populate_early_shadow - populate shadow memory region with
  193. * kasan_early_shadow_page
  194. * @shadow_start: start of the memory range to populate
  195. * @shadow_end: end of the memory range to populate
  196. */
  197. int __ref kasan_populate_early_shadow(const void *shadow_start,
  198. const void *shadow_end)
  199. {
  200. unsigned long addr = (unsigned long)shadow_start;
  201. unsigned long end = (unsigned long)shadow_end;
  202. pgd_t *pgd = pgd_offset_k(addr);
  203. unsigned long next;
  204. do {
  205. next = pgd_addr_end(addr, end);
  206. if (IS_ALIGNED(addr, PGDIR_SIZE) && end - addr >= PGDIR_SIZE) {
  207. p4d_t *p4d;
  208. pud_t *pud;
  209. pmd_t *pmd;
  210. /*
  211. * kasan_early_shadow_pud should be populated with pmds
  212. * at this moment.
  213. * [pud,pmd]_populate*() below needed only for
  214. * 3,2 - level page tables where we don't have
  215. * puds,pmds, so pgd_populate(), pud_populate()
  216. * is noops.
  217. */
  218. pgd_populate_kernel(addr, pgd,
  219. lm_alias(kasan_early_shadow_p4d));
  220. p4d = p4d_offset(pgd, addr);
  221. p4d_populate_kernel(addr, p4d,
  222. lm_alias(kasan_early_shadow_pud));
  223. pud = pud_offset(p4d, addr);
  224. pud_populate(&init_mm, pud,
  225. lm_alias(kasan_early_shadow_pmd));
  226. pmd = pmd_offset(pud, addr);
  227. pmd_populate_kernel(&init_mm, pmd,
  228. lm_alias(kasan_early_shadow_pte));
  229. continue;
  230. }
  231. if (pgd_none(*pgd)) {
  232. if (slab_is_available()) {
  233. if (!p4d_alloc(&init_mm, pgd, addr))
  234. return -ENOMEM;
  235. } else {
  236. pgd_populate_kernel(addr, pgd,
  237. early_alloc(PAGE_SIZE, NUMA_NO_NODE));
  238. }
  239. }
  240. zero_p4d_populate(pgd, addr, next);
  241. } while (pgd++, addr = next, addr != end);
  242. return 0;
  243. }
  244. static void kasan_free_pte(pte_t *pte_start, pmd_t *pmd)
  245. {
  246. pte_t *pte;
  247. int i;
  248. for (i = 0; i < PTRS_PER_PTE; i++) {
  249. pte = pte_start + i;
  250. if (!pte_none(ptep_get(pte)))
  251. return;
  252. }
  253. pte_free_kernel(&init_mm, (pte_t *)page_to_virt(pmd_page(*pmd)));
  254. pmd_clear(pmd);
  255. }
  256. static void kasan_free_pmd(pmd_t *pmd_start, pud_t *pud)
  257. {
  258. pmd_t *pmd;
  259. int i;
  260. for (i = 0; i < PTRS_PER_PMD; i++) {
  261. pmd = pmd_start + i;
  262. if (!pmd_none(*pmd))
  263. return;
  264. }
  265. pmd_free(&init_mm, (pmd_t *)page_to_virt(pud_page(*pud)));
  266. pud_clear(pud);
  267. }
  268. static void kasan_free_pud(pud_t *pud_start, p4d_t *p4d)
  269. {
  270. pud_t *pud;
  271. int i;
  272. for (i = 0; i < PTRS_PER_PUD; i++) {
  273. pud = pud_start + i;
  274. if (!pud_none(*pud))
  275. return;
  276. }
  277. pud_free(&init_mm, (pud_t *)page_to_virt(p4d_page(*p4d)));
  278. p4d_clear(p4d);
  279. }
  280. static void kasan_free_p4d(p4d_t *p4d_start, pgd_t *pgd)
  281. {
  282. p4d_t *p4d;
  283. int i;
  284. for (i = 0; i < PTRS_PER_P4D; i++) {
  285. p4d = p4d_start + i;
  286. if (!p4d_none(*p4d))
  287. return;
  288. }
  289. p4d_free(&init_mm, (p4d_t *)page_to_virt(pgd_page(*pgd)));
  290. pgd_clear(pgd);
  291. }
  292. static void kasan_remove_pte_table(pte_t *pte, unsigned long addr,
  293. unsigned long end)
  294. {
  295. unsigned long next;
  296. pte_t ptent;
  297. for (; addr < end; addr = next, pte++) {
  298. next = (addr + PAGE_SIZE) & PAGE_MASK;
  299. if (next > end)
  300. next = end;
  301. ptent = ptep_get(pte);
  302. if (!pte_present(ptent))
  303. continue;
  304. if (WARN_ON(!kasan_early_shadow_page_entry(ptent)))
  305. continue;
  306. pte_clear(&init_mm, addr, pte);
  307. }
  308. }
  309. static void kasan_remove_pmd_table(pmd_t *pmd, unsigned long addr,
  310. unsigned long end)
  311. {
  312. unsigned long next;
  313. for (; addr < end; addr = next, pmd++) {
  314. pte_t *pte;
  315. next = pmd_addr_end(addr, end);
  316. if (!pmd_present(*pmd))
  317. continue;
  318. if (kasan_pte_table(*pmd)) {
  319. if (IS_ALIGNED(addr, PMD_SIZE) &&
  320. IS_ALIGNED(next, PMD_SIZE)) {
  321. pmd_clear(pmd);
  322. continue;
  323. }
  324. }
  325. pte = pte_offset_kernel(pmd, addr);
  326. kasan_remove_pte_table(pte, addr, next);
  327. kasan_free_pte(pte_offset_kernel(pmd, 0), pmd);
  328. }
  329. }
  330. static void kasan_remove_pud_table(pud_t *pud, unsigned long addr,
  331. unsigned long end)
  332. {
  333. unsigned long next;
  334. for (; addr < end; addr = next, pud++) {
  335. pmd_t *pmd, *pmd_base;
  336. next = pud_addr_end(addr, end);
  337. if (!pud_present(*pud))
  338. continue;
  339. if (kasan_pmd_table(*pud)) {
  340. if (IS_ALIGNED(addr, PUD_SIZE) &&
  341. IS_ALIGNED(next, PUD_SIZE)) {
  342. pud_clear(pud);
  343. continue;
  344. }
  345. }
  346. pmd = pmd_offset(pud, addr);
  347. pmd_base = pmd_offset(pud, 0);
  348. kasan_remove_pmd_table(pmd, addr, next);
  349. kasan_free_pmd(pmd_base, pud);
  350. }
  351. }
  352. static void kasan_remove_p4d_table(p4d_t *p4d, unsigned long addr,
  353. unsigned long end)
  354. {
  355. unsigned long next;
  356. for (; addr < end; addr = next, p4d++) {
  357. pud_t *pud;
  358. next = p4d_addr_end(addr, end);
  359. if (!p4d_present(*p4d))
  360. continue;
  361. if (kasan_pud_table(*p4d)) {
  362. if (IS_ALIGNED(addr, P4D_SIZE) &&
  363. IS_ALIGNED(next, P4D_SIZE)) {
  364. p4d_clear(p4d);
  365. continue;
  366. }
  367. }
  368. pud = pud_offset(p4d, addr);
  369. kasan_remove_pud_table(pud, addr, next);
  370. kasan_free_pud(pud_offset(p4d, 0), p4d);
  371. }
  372. }
  373. void kasan_remove_zero_shadow(void *start, unsigned long size)
  374. {
  375. unsigned long addr, end, next;
  376. pgd_t *pgd;
  377. addr = (unsigned long)kasan_mem_to_shadow(start);
  378. end = addr + (size >> KASAN_SHADOW_SCALE_SHIFT);
  379. if (WARN_ON((unsigned long)start % KASAN_MEMORY_PER_SHADOW_PAGE) ||
  380. WARN_ON(size % KASAN_MEMORY_PER_SHADOW_PAGE))
  381. return;
  382. for (; addr < end; addr = next) {
  383. p4d_t *p4d;
  384. next = pgd_addr_end(addr, end);
  385. pgd = pgd_offset_k(addr);
  386. if (!pgd_present(*pgd))
  387. continue;
  388. if (kasan_p4d_table(*pgd)) {
  389. if (IS_ALIGNED(addr, PGDIR_SIZE) &&
  390. IS_ALIGNED(next, PGDIR_SIZE)) {
  391. pgd_clear(pgd);
  392. continue;
  393. }
  394. }
  395. p4d = p4d_offset(pgd, addr);
  396. kasan_remove_p4d_table(p4d, addr, next);
  397. kasan_free_p4d(p4d_offset(pgd, 0), pgd);
  398. }
  399. }
  400. int kasan_add_zero_shadow(void *start, unsigned long size)
  401. {
  402. int ret;
  403. void *shadow_start, *shadow_end;
  404. shadow_start = kasan_mem_to_shadow(start);
  405. shadow_end = shadow_start + (size >> KASAN_SHADOW_SCALE_SHIFT);
  406. if (WARN_ON((unsigned long)start % KASAN_MEMORY_PER_SHADOW_PAGE) ||
  407. WARN_ON(size % KASAN_MEMORY_PER_SHADOW_PAGE))
  408. return -EINVAL;
  409. ret = kasan_populate_early_shadow(shadow_start, shadow_end);
  410. if (ret)
  411. kasan_remove_zero_shadow(start, size);
  412. return ret;
  413. }