test_kho.c 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. /*
  3. * Test module for KHO
  4. * Copyright (c) 2025 Microsoft Corporation.
  5. *
  6. * Authors:
  7. * Saurabh Sengar <ssengar@microsoft.com>
  8. * Mike Rapoport <rppt@kernel.org>
  9. */
  10. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  11. #include <linux/mm.h>
  12. #include <linux/gfp.h>
  13. #include <linux/slab.h>
  14. #include <linux/kexec.h>
  15. #include <linux/libfdt.h>
  16. #include <linux/module.h>
  17. #include <linux/printk.h>
  18. #include <linux/vmalloc.h>
  19. #include <linux/kexec_handover.h>
  20. #include <linux/kho/abi/kexec_handover.h>
  21. #include <net/checksum.h>
  22. #define KHO_TEST_MAGIC 0x4b484f21 /* KHO! */
  23. #define KHO_TEST_FDT "kho_test"
  24. #define KHO_TEST_COMPAT "kho-test-v1"
  25. static long max_mem = (PAGE_SIZE << MAX_PAGE_ORDER) * 2;
  26. module_param(max_mem, long, 0644);
  27. struct kho_test_state {
  28. unsigned int nr_folios;
  29. struct folio **folios;
  30. phys_addr_t *folios_info;
  31. struct kho_vmalloc folios_info_phys;
  32. int nr_folios_preserved;
  33. struct folio *fdt;
  34. __wsum csum;
  35. };
  36. static struct kho_test_state kho_test_state;
  37. static void kho_test_unpreserve_data(struct kho_test_state *state)
  38. {
  39. for (int i = 0; i < state->nr_folios_preserved; i++)
  40. kho_unpreserve_folio(state->folios[i]);
  41. kho_unpreserve_vmalloc(&state->folios_info_phys);
  42. vfree(state->folios_info);
  43. }
  44. static int kho_test_preserve_data(struct kho_test_state *state)
  45. {
  46. struct kho_vmalloc folios_info_phys;
  47. phys_addr_t *folios_info;
  48. int err;
  49. folios_info = vmalloc_array(state->nr_folios, sizeof(*folios_info));
  50. if (!folios_info)
  51. return -ENOMEM;
  52. err = kho_preserve_vmalloc(folios_info, &folios_info_phys);
  53. if (err)
  54. goto err_free_info;
  55. state->folios_info_phys = folios_info_phys;
  56. state->folios_info = folios_info;
  57. for (int i = 0; i < state->nr_folios; i++) {
  58. struct folio *folio = state->folios[i];
  59. unsigned int order = folio_order(folio);
  60. folios_info[i] = virt_to_phys(folio_address(folio)) | order;
  61. err = kho_preserve_folio(folio);
  62. if (err)
  63. goto err_unpreserve;
  64. state->nr_folios_preserved++;
  65. }
  66. return 0;
  67. err_unpreserve:
  68. /*
  69. * kho_test_unpreserve_data frees folio_info, bail out immediately to
  70. * avoid double free
  71. */
  72. kho_test_unpreserve_data(state);
  73. return err;
  74. err_free_info:
  75. vfree(folios_info);
  76. return err;
  77. }
  78. static int kho_test_prepare_fdt(struct kho_test_state *state, ssize_t fdt_size)
  79. {
  80. const char compatible[] = KHO_TEST_COMPAT;
  81. unsigned int magic = KHO_TEST_MAGIC;
  82. void *fdt = folio_address(state->fdt);
  83. int err;
  84. err = fdt_create(fdt, fdt_size);
  85. err |= fdt_finish_reservemap(fdt);
  86. err |= fdt_begin_node(fdt, "");
  87. err |= fdt_property(fdt, "compatible", compatible, sizeof(compatible));
  88. err |= fdt_property(fdt, "magic", &magic, sizeof(magic));
  89. err |= fdt_begin_node(fdt, "data");
  90. err |= fdt_property(fdt, "nr_folios", &state->nr_folios,
  91. sizeof(state->nr_folios));
  92. err |= fdt_property(fdt, "folios_info", &state->folios_info_phys,
  93. sizeof(state->folios_info_phys));
  94. err |= fdt_property(fdt, "csum", &state->csum, sizeof(state->csum));
  95. err |= fdt_end_node(fdt);
  96. err |= fdt_end_node(fdt);
  97. err |= fdt_finish(fdt);
  98. return err;
  99. }
  100. static int kho_test_preserve(struct kho_test_state *state)
  101. {
  102. ssize_t fdt_size;
  103. int err;
  104. fdt_size = state->nr_folios * sizeof(phys_addr_t) + PAGE_SIZE;
  105. state->fdt = folio_alloc(GFP_KERNEL, get_order(fdt_size));
  106. if (!state->fdt)
  107. return -ENOMEM;
  108. err = kho_preserve_folio(state->fdt);
  109. if (err)
  110. goto err_free_fdt;
  111. err = kho_test_preserve_data(state);
  112. if (err)
  113. goto err_unpreserve_fdt;
  114. err = kho_test_prepare_fdt(state, fdt_size);
  115. if (err)
  116. goto err_unpreserve_data;
  117. err = kho_add_subtree(KHO_TEST_FDT, folio_address(state->fdt));
  118. if (err)
  119. goto err_unpreserve_data;
  120. return 0;
  121. err_unpreserve_data:
  122. kho_test_unpreserve_data(state);
  123. err_unpreserve_fdt:
  124. kho_unpreserve_folio(state->fdt);
  125. err_free_fdt:
  126. folio_put(state->fdt);
  127. return err;
  128. }
  129. static int kho_test_generate_data(struct kho_test_state *state)
  130. {
  131. size_t alloc_size = 0;
  132. __wsum csum = 0;
  133. while (alloc_size < max_mem) {
  134. int order = get_random_u32() % NR_PAGE_ORDERS;
  135. struct folio *folio;
  136. unsigned int size;
  137. void *addr;
  138. /*
  139. * Since get_order() rounds up, make sure that actual
  140. * allocation is smaller so that we won't exceed max_mem
  141. */
  142. if (alloc_size + (PAGE_SIZE << order) > max_mem) {
  143. order = get_order(max_mem - alloc_size);
  144. if (order)
  145. order--;
  146. }
  147. size = PAGE_SIZE << order;
  148. folio = folio_alloc(GFP_KERNEL | __GFP_NORETRY, order);
  149. if (!folio)
  150. goto err_free_folios;
  151. state->folios[state->nr_folios++] = folio;
  152. addr = folio_address(folio);
  153. get_random_bytes(addr, size);
  154. csum = csum_partial(addr, size, csum);
  155. alloc_size += size;
  156. }
  157. state->csum = csum;
  158. return 0;
  159. err_free_folios:
  160. for (int i = 0; i < state->nr_folios; i++)
  161. folio_put(state->folios[i]);
  162. state->nr_folios = 0;
  163. return -ENOMEM;
  164. }
  165. static int kho_test_save(void)
  166. {
  167. struct kho_test_state *state = &kho_test_state;
  168. struct folio **folios;
  169. unsigned long max_nr;
  170. int err;
  171. max_mem = PAGE_ALIGN(max_mem);
  172. max_nr = max_mem >> PAGE_SHIFT;
  173. folios = kvmalloc_objs(*state->folios, max_nr);
  174. if (!folios)
  175. return -ENOMEM;
  176. state->folios = folios;
  177. err = kho_test_generate_data(state);
  178. if (err)
  179. goto err_free_folios;
  180. err = kho_test_preserve(state);
  181. if (err)
  182. goto err_free_folios;
  183. return 0;
  184. err_free_folios:
  185. kvfree(folios);
  186. return err;
  187. }
  188. static int kho_test_restore_data(const void *fdt, int node)
  189. {
  190. const struct kho_vmalloc *folios_info_phys;
  191. const unsigned int *nr_folios;
  192. phys_addr_t *folios_info;
  193. const __wsum *old_csum;
  194. __wsum csum = 0;
  195. int len;
  196. node = fdt_path_offset(fdt, "/data");
  197. nr_folios = fdt_getprop(fdt, node, "nr_folios", &len);
  198. if (!nr_folios || len != sizeof(*nr_folios))
  199. return -EINVAL;
  200. old_csum = fdt_getprop(fdt, node, "csum", &len);
  201. if (!old_csum || len != sizeof(*old_csum))
  202. return -EINVAL;
  203. folios_info_phys = fdt_getprop(fdt, node, "folios_info", &len);
  204. if (!folios_info_phys || len != sizeof(*folios_info_phys))
  205. return -EINVAL;
  206. folios_info = kho_restore_vmalloc(folios_info_phys);
  207. if (!folios_info)
  208. return -EINVAL;
  209. for (int i = 0; i < *nr_folios; i++) {
  210. unsigned int order = folios_info[i] & ~PAGE_MASK;
  211. phys_addr_t phys = folios_info[i] & PAGE_MASK;
  212. unsigned int size = PAGE_SIZE << order;
  213. struct folio *folio;
  214. folio = kho_restore_folio(phys);
  215. if (!folio)
  216. break;
  217. if (folio_order(folio) != order)
  218. break;
  219. csum = csum_partial(folio_address(folio), size, csum);
  220. folio_put(folio);
  221. }
  222. vfree(folios_info);
  223. if (csum != *old_csum)
  224. return -EINVAL;
  225. return 0;
  226. }
  227. static int kho_test_restore(phys_addr_t fdt_phys)
  228. {
  229. void *fdt = phys_to_virt(fdt_phys);
  230. const unsigned int *magic;
  231. int node, len, err;
  232. node = fdt_path_offset(fdt, "/");
  233. if (node < 0)
  234. return -EINVAL;
  235. if (fdt_node_check_compatible(fdt, node, KHO_TEST_COMPAT))
  236. return -EINVAL;
  237. magic = fdt_getprop(fdt, node, "magic", &len);
  238. if (!magic || len != sizeof(*magic))
  239. return -EINVAL;
  240. if (*magic != KHO_TEST_MAGIC)
  241. return -EINVAL;
  242. err = kho_test_restore_data(fdt, node);
  243. if (err)
  244. return err;
  245. return 0;
  246. }
  247. static int __init kho_test_init(void)
  248. {
  249. phys_addr_t fdt_phys;
  250. int err;
  251. if (!kho_is_enabled())
  252. return 0;
  253. err = kho_retrieve_subtree(KHO_TEST_FDT, &fdt_phys);
  254. if (!err) {
  255. err = kho_test_restore(fdt_phys);
  256. if (err)
  257. pr_err("KHO restore failed\n");
  258. else
  259. pr_info("KHO restore succeeded\n");
  260. return err;
  261. }
  262. if (err != -ENOENT) {
  263. pr_warn("failed to retrieve %s FDT: %d\n", KHO_TEST_FDT, err);
  264. return err;
  265. }
  266. return kho_test_save();
  267. }
  268. module_init(kho_test_init);
  269. static void kho_test_cleanup(void)
  270. {
  271. /* unpreserve and free the data stored in folios */
  272. kho_test_unpreserve_data(&kho_test_state);
  273. for (int i = 0; i < kho_test_state.nr_folios; i++)
  274. folio_put(kho_test_state.folios[i]);
  275. kvfree(kho_test_state.folios);
  276. /* Unpreserve and release the FDT folio */
  277. kho_unpreserve_folio(kho_test_state.fdt);
  278. folio_put(kho_test_state.fdt);
  279. }
  280. static void __exit kho_test_exit(void)
  281. {
  282. kho_remove_subtree(folio_address(kho_test_state.fdt));
  283. kho_test_cleanup();
  284. }
  285. module_exit(kho_test_exit);
  286. MODULE_AUTHOR("Mike Rapoport <rppt@kernel.org>");
  287. MODULE_DESCRIPTION("KHO test module");
  288. MODULE_LICENSE("GPL");