ksm_functional_tests.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * KSM functional tests
  4. *
  5. * Copyright 2022, Red Hat, Inc.
  6. *
  7. * Author(s): David Hildenbrand <david@redhat.com>
  8. */
  9. #define _GNU_SOURCE
  10. #include <stdlib.h>
  11. #include <string.h>
  12. #include <stdbool.h>
  13. #include <stdint.h>
  14. #include <unistd.h>
  15. #include <errno.h>
  16. #include <fcntl.h>
  17. #include <sys/mman.h>
  18. #include <sys/prctl.h>
  19. #include <sys/syscall.h>
  20. #include <sys/ioctl.h>
  21. #include <sys/wait.h>
  22. #include <linux/userfaultfd.h>
  23. #include "kselftest.h"
  24. #include "vm_util.h"
  25. #define KiB 1024u
  26. #define MiB (1024 * KiB)
  27. #define FORK_EXEC_CHILD_PRG_NAME "ksm_fork_exec_child"
  28. #define MAP_MERGE_FAIL ((void *)-1)
  29. #define MAP_MERGE_SKIP ((void *)-2)
  30. enum ksm_merge_mode {
  31. KSM_MERGE_PRCTL,
  32. KSM_MERGE_MADVISE,
  33. KSM_MERGE_NONE, /* PRCTL already set */
  34. };
  35. static int mem_fd;
  36. static int pages_to_scan_fd;
  37. static int sleep_millisecs_fd;
  38. static int pagemap_fd;
  39. static size_t pagesize;
  40. static void init_global_file_handles(void);
  41. static bool range_maps_duplicates(char *addr, unsigned long size)
  42. {
  43. unsigned long offs_a, offs_b, pfn_a, pfn_b;
  44. /*
  45. * There is no easy way to check if there are KSM pages mapped into
  46. * this range. We only check that the range does not map the same PFN
  47. * twice by comparing each pair of mapped pages.
  48. */
  49. for (offs_a = 0; offs_a < size; offs_a += pagesize) {
  50. pfn_a = pagemap_get_pfn(pagemap_fd, addr + offs_a);
  51. /* Page not present or PFN not exposed by the kernel. */
  52. if (pfn_a == -1ul || !pfn_a)
  53. continue;
  54. for (offs_b = offs_a + pagesize; offs_b < size;
  55. offs_b += pagesize) {
  56. pfn_b = pagemap_get_pfn(pagemap_fd, addr + offs_b);
  57. if (pfn_b == -1ul || !pfn_b)
  58. continue;
  59. if (pfn_a == pfn_b)
  60. return true;
  61. }
  62. }
  63. return false;
  64. }
  65. static char *__mmap_and_merge_range(char val, unsigned long size, int prot,
  66. enum ksm_merge_mode mode)
  67. {
  68. char *map;
  69. char *err_map = MAP_MERGE_FAIL;
  70. int ret;
  71. /* Stabilize accounting by disabling KSM completely. */
  72. if (ksm_stop() < 0) {
  73. ksft_print_msg("Disabling (unmerging) KSM failed\n");
  74. return err_map;
  75. }
  76. if (ksm_get_self_merging_pages() > 0) {
  77. ksft_print_msg("Still pages merged\n");
  78. return err_map;
  79. }
  80. map = mmap(NULL, size, PROT_READ|PROT_WRITE,
  81. MAP_PRIVATE|MAP_ANON, -1, 0);
  82. if (map == MAP_FAILED) {
  83. ksft_print_msg("mmap() failed\n");
  84. return err_map;
  85. }
  86. /* Don't use THP. Ignore if THP are not around on a kernel. */
  87. if (madvise(map, size, MADV_NOHUGEPAGE) && errno != EINVAL) {
  88. ksft_print_msg("MADV_NOHUGEPAGE failed\n");
  89. goto unmap;
  90. }
  91. /* Make sure each page contains the same values to merge them. */
  92. memset(map, val, size);
  93. if (mprotect(map, size, prot)) {
  94. ksft_print_msg("mprotect() failed\n");
  95. err_map = MAP_MERGE_SKIP;
  96. goto unmap;
  97. }
  98. switch (mode) {
  99. case KSM_MERGE_PRCTL:
  100. ret = prctl(PR_SET_MEMORY_MERGE, 1, 0, 0, 0);
  101. if (ret < 0 && errno == EINVAL) {
  102. ksft_print_msg("PR_SET_MEMORY_MERGE not supported\n");
  103. err_map = MAP_MERGE_SKIP;
  104. goto unmap;
  105. } else if (ret) {
  106. ksft_print_msg("PR_SET_MEMORY_MERGE=1 failed\n");
  107. goto unmap;
  108. }
  109. break;
  110. case KSM_MERGE_MADVISE:
  111. if (madvise(map, size, MADV_MERGEABLE)) {
  112. ksft_print_msg("MADV_MERGEABLE failed\n");
  113. goto unmap;
  114. }
  115. break;
  116. case KSM_MERGE_NONE:
  117. break;
  118. }
  119. /* Run KSM to trigger merging and wait. */
  120. if (ksm_start() < 0) {
  121. ksft_print_msg("Running KSM failed\n");
  122. goto unmap;
  123. }
  124. /*
  125. * Check if anything was merged at all. Ignore the zero page that is
  126. * accounted differently (depending on kernel support).
  127. */
  128. if (val && !ksm_get_self_merging_pages()) {
  129. ksft_print_msg("No pages got merged\n");
  130. goto unmap;
  131. }
  132. return map;
  133. unmap:
  134. munmap(map, size);
  135. return err_map;
  136. }
  137. static char *mmap_and_merge_range(char val, unsigned long size, int prot,
  138. enum ksm_merge_mode mode)
  139. {
  140. char *map;
  141. char *ret = MAP_FAILED;
  142. map = __mmap_and_merge_range(val, size, prot, mode);
  143. if (map == MAP_MERGE_FAIL)
  144. ksft_test_result_fail("Merging memory failed");
  145. else if (map == MAP_MERGE_SKIP)
  146. ksft_test_result_skip("Merging memory skipped");
  147. else
  148. ret = map;
  149. return ret;
  150. }
  151. static void test_unmerge(void)
  152. {
  153. const unsigned int size = 2 * MiB;
  154. char *map;
  155. ksft_print_msg("[RUN] %s\n", __func__);
  156. map = mmap_and_merge_range(0xcf, size, PROT_READ | PROT_WRITE, KSM_MERGE_MADVISE);
  157. if (map == MAP_FAILED)
  158. return;
  159. if (madvise(map, size, MADV_UNMERGEABLE)) {
  160. ksft_test_result_fail("MADV_UNMERGEABLE failed\n");
  161. goto unmap;
  162. }
  163. ksft_test_result(!range_maps_duplicates(map, size),
  164. "Pages were unmerged\n");
  165. unmap:
  166. ksm_stop();
  167. munmap(map, size);
  168. }
  169. static void test_unmerge_zero_pages(void)
  170. {
  171. const unsigned int size = 2 * MiB;
  172. char *map;
  173. unsigned int offs;
  174. unsigned long pages_expected;
  175. ksft_print_msg("[RUN] %s\n", __func__);
  176. if (ksm_get_self_zero_pages() < 0) {
  177. ksft_test_result_skip("accessing \"/proc/self/ksm_stat\" failed\n");
  178. return;
  179. }
  180. if (ksm_use_zero_pages() < 0) {
  181. ksft_test_result_skip("write \"/sys/kernel/mm/ksm/use_zero_pages\" failed\n");
  182. return;
  183. }
  184. /* Let KSM deduplicate zero pages. */
  185. map = mmap_and_merge_range(0x00, size, PROT_READ | PROT_WRITE, KSM_MERGE_MADVISE);
  186. if (map == MAP_FAILED)
  187. return;
  188. /* Check if ksm_zero_pages is updated correctly after KSM merging */
  189. pages_expected = size / pagesize;
  190. if (pages_expected != ksm_get_self_zero_pages()) {
  191. ksft_test_result_fail("'ksm_zero_pages' updated after merging\n");
  192. goto unmap;
  193. }
  194. /* Try to unmerge half of the region */
  195. if (madvise(map, size / 2, MADV_UNMERGEABLE)) {
  196. ksft_test_result_fail("MADV_UNMERGEABLE failed\n");
  197. goto unmap;
  198. }
  199. /* Check if ksm_zero_pages is updated correctly after unmerging */
  200. pages_expected /= 2;
  201. if (pages_expected != ksm_get_self_zero_pages()) {
  202. ksft_test_result_fail("'ksm_zero_pages' updated after unmerging\n");
  203. goto unmap;
  204. }
  205. /* Trigger unmerging of the other half by writing to the pages. */
  206. for (offs = size / 2; offs < size; offs += pagesize)
  207. *((unsigned int *)&map[offs]) = offs;
  208. /* Now we should have no zeropages remaining. */
  209. if (ksm_get_self_zero_pages()) {
  210. ksft_test_result_fail("'ksm_zero_pages' updated after write fault\n");
  211. goto unmap;
  212. }
  213. /* Check if ksm zero pages are really unmerged */
  214. ksft_test_result(!range_maps_duplicates(map, size),
  215. "KSM zero pages were unmerged\n");
  216. unmap:
  217. ksm_stop();
  218. munmap(map, size);
  219. }
  220. static void test_unmerge_discarded(void)
  221. {
  222. const unsigned int size = 2 * MiB;
  223. char *map;
  224. ksft_print_msg("[RUN] %s\n", __func__);
  225. map = mmap_and_merge_range(0xcf, size, PROT_READ | PROT_WRITE, KSM_MERGE_MADVISE);
  226. if (map == MAP_FAILED)
  227. return;
  228. /* Discard half of all mapped pages so we have pte_none() entries. */
  229. if (madvise(map, size / 2, MADV_DONTNEED)) {
  230. ksft_test_result_fail("MADV_DONTNEED failed\n");
  231. goto unmap;
  232. }
  233. if (madvise(map, size, MADV_UNMERGEABLE)) {
  234. ksft_test_result_fail("MADV_UNMERGEABLE failed\n");
  235. goto unmap;
  236. }
  237. ksft_test_result(!range_maps_duplicates(map, size),
  238. "Pages were unmerged\n");
  239. unmap:
  240. ksm_stop();
  241. munmap(map, size);
  242. }
  243. #ifdef __NR_userfaultfd
  244. static void test_unmerge_uffd_wp(void)
  245. {
  246. struct uffdio_writeprotect uffd_writeprotect;
  247. const unsigned int size = 2 * MiB;
  248. struct uffdio_api uffdio_api;
  249. char *map;
  250. int uffd;
  251. ksft_print_msg("[RUN] %s\n", __func__);
  252. map = mmap_and_merge_range(0xcf, size, PROT_READ | PROT_WRITE, KSM_MERGE_MADVISE);
  253. if (map == MAP_FAILED)
  254. return;
  255. /* See if UFFD is around. */
  256. uffd = syscall(__NR_userfaultfd, O_CLOEXEC | O_NONBLOCK);
  257. if (uffd < 0) {
  258. ksft_test_result_skip("__NR_userfaultfd failed\n");
  259. goto unmap;
  260. }
  261. /* See if UFFD-WP is around. */
  262. uffdio_api.api = UFFD_API;
  263. uffdio_api.features = 0;
  264. if (ioctl(uffd, UFFDIO_API, &uffdio_api) < 0) {
  265. if (errno == EINVAL)
  266. ksft_test_result_skip("The API version requested is not supported\n");
  267. else
  268. ksft_test_result_fail("UFFDIO_API failed: %s\n", strerror(errno));
  269. goto close_uffd;
  270. }
  271. if (!(uffdio_api.features & UFFD_FEATURE_PAGEFAULT_FLAG_WP)) {
  272. ksft_test_result_skip("UFFD_FEATURE_PAGEFAULT_FLAG_WP not available\n");
  273. goto close_uffd;
  274. }
  275. /*
  276. * UFFDIO_API must only be called once to enable features.
  277. * So we close the old userfaultfd and create a new one to
  278. * actually enable UFFD_FEATURE_PAGEFAULT_FLAG_WP.
  279. */
  280. close(uffd);
  281. uffd = syscall(__NR_userfaultfd, O_CLOEXEC | O_NONBLOCK);
  282. if (uffd < 0) {
  283. ksft_test_result_fail("__NR_userfaultfd failed\n");
  284. goto unmap;
  285. }
  286. /* Now, enable it ("two-step handshake") */
  287. uffdio_api.api = UFFD_API;
  288. uffdio_api.features = UFFD_FEATURE_PAGEFAULT_FLAG_WP;
  289. if (ioctl(uffd, UFFDIO_API, &uffdio_api) < 0) {
  290. ksft_test_result_fail("UFFDIO_API failed: %s\n", strerror(errno));
  291. goto close_uffd;
  292. }
  293. /* Register UFFD-WP, no need for an actual handler. */
  294. if (uffd_register(uffd, map, size, false, true, false)) {
  295. ksft_test_result_fail("UFFDIO_REGISTER_MODE_WP failed\n");
  296. goto close_uffd;
  297. }
  298. /* Write-protect the range using UFFD-WP. */
  299. uffd_writeprotect.range.start = (unsigned long) map;
  300. uffd_writeprotect.range.len = size;
  301. uffd_writeprotect.mode = UFFDIO_WRITEPROTECT_MODE_WP;
  302. if (ioctl(uffd, UFFDIO_WRITEPROTECT, &uffd_writeprotect)) {
  303. ksft_test_result_fail("UFFDIO_WRITEPROTECT failed\n");
  304. goto close_uffd;
  305. }
  306. if (madvise(map, size, MADV_UNMERGEABLE)) {
  307. ksft_test_result_fail("MADV_UNMERGEABLE failed\n");
  308. goto close_uffd;
  309. }
  310. ksft_test_result(!range_maps_duplicates(map, size),
  311. "Pages were unmerged\n");
  312. close_uffd:
  313. close(uffd);
  314. unmap:
  315. ksm_stop();
  316. munmap(map, size);
  317. }
  318. #endif
  319. /* Verify that KSM can be enabled / queried with prctl. */
  320. static void test_prctl(void)
  321. {
  322. int ret;
  323. ksft_print_msg("[RUN] %s\n", __func__);
  324. ret = prctl(PR_SET_MEMORY_MERGE, 1, 0, 0, 0);
  325. if (ret < 0 && errno == EINVAL) {
  326. ksft_test_result_skip("PR_SET_MEMORY_MERGE not supported\n");
  327. return;
  328. } else if (ret) {
  329. ksft_test_result_fail("PR_SET_MEMORY_MERGE=1 failed\n");
  330. return;
  331. }
  332. ret = prctl(PR_GET_MEMORY_MERGE, 0, 0, 0, 0);
  333. if (ret < 0) {
  334. ksft_test_result_fail("PR_GET_MEMORY_MERGE failed\n");
  335. return;
  336. } else if (ret != 1) {
  337. ksft_test_result_fail("PR_SET_MEMORY_MERGE=1 not effective\n");
  338. return;
  339. }
  340. ret = prctl(PR_SET_MEMORY_MERGE, 0, 0, 0, 0);
  341. if (ret) {
  342. ksft_test_result_fail("PR_SET_MEMORY_MERGE=0 failed\n");
  343. return;
  344. }
  345. ret = prctl(PR_GET_MEMORY_MERGE, 0, 0, 0, 0);
  346. if (ret < 0) {
  347. ksft_test_result_fail("PR_GET_MEMORY_MERGE failed\n");
  348. return;
  349. } else if (ret != 0) {
  350. ksft_test_result_fail("PR_SET_MEMORY_MERGE=0 not effective\n");
  351. return;
  352. }
  353. ksft_test_result_pass("Setting/clearing PR_SET_MEMORY_MERGE works\n");
  354. }
  355. static int test_child_ksm(void)
  356. {
  357. const unsigned int size = 2 * MiB;
  358. char *map;
  359. /* Test if KSM is enabled for the process. */
  360. if (prctl(PR_GET_MEMORY_MERGE, 0, 0, 0, 0) != 1)
  361. return 1;
  362. /* Test if merge could really happen. */
  363. map = __mmap_and_merge_range(0xcf, size, PROT_READ | PROT_WRITE, KSM_MERGE_NONE);
  364. if (map == MAP_MERGE_FAIL)
  365. return 2;
  366. else if (map == MAP_MERGE_SKIP)
  367. return 3;
  368. ksm_stop();
  369. munmap(map, size);
  370. return 0;
  371. }
  372. static void test_child_ksm_err(int status)
  373. {
  374. if (status == 1)
  375. ksft_test_result_fail("unexpected PR_GET_MEMORY_MERGE result in child\n");
  376. else if (status == 2)
  377. ksft_test_result_fail("Merge in child failed\n");
  378. else if (status == 3)
  379. ksft_test_result_skip("Merge in child skipped\n");
  380. else if (status == 4)
  381. ksft_test_result_fail("Binary not found\n");
  382. }
  383. /* Verify that prctl ksm flag is inherited. */
  384. static void test_prctl_fork(void)
  385. {
  386. int ret, status;
  387. pid_t child_pid;
  388. ksft_print_msg("[RUN] %s\n", __func__);
  389. ret = prctl(PR_SET_MEMORY_MERGE, 1, 0, 0, 0);
  390. if (ret < 0 && errno == EINVAL) {
  391. ksft_test_result_skip("PR_SET_MEMORY_MERGE not supported\n");
  392. return;
  393. } else if (ret) {
  394. ksft_test_result_fail("PR_SET_MEMORY_MERGE=1 failed\n");
  395. return;
  396. }
  397. child_pid = fork();
  398. if (!child_pid) {
  399. init_global_file_handles();
  400. exit(test_child_ksm());
  401. } else if (child_pid < 0) {
  402. ksft_test_result_fail("fork() failed\n");
  403. return;
  404. }
  405. if (waitpid(child_pid, &status, 0) < 0) {
  406. ksft_test_result_fail("waitpid() failed\n");
  407. return;
  408. }
  409. status = WEXITSTATUS(status);
  410. if (status) {
  411. test_child_ksm_err(status);
  412. return;
  413. }
  414. if (prctl(PR_SET_MEMORY_MERGE, 0, 0, 0, 0)) {
  415. ksft_test_result_fail("PR_SET_MEMORY_MERGE=0 failed\n");
  416. return;
  417. }
  418. ksft_test_result_pass("PR_SET_MEMORY_MERGE value is inherited\n");
  419. }
  420. static int start_ksmd_and_set_frequency(char *pages_to_scan, char *sleep_ms)
  421. {
  422. int ksm_fd;
  423. ksm_fd = open("/sys/kernel/mm/ksm/run", O_RDWR);
  424. if (ksm_fd < 0)
  425. return -errno;
  426. if (write(ksm_fd, "1", 1) != 1)
  427. return -errno;
  428. if (write(pages_to_scan_fd, pages_to_scan, strlen(pages_to_scan)) <= 0)
  429. return -errno;
  430. if (write(sleep_millisecs_fd, sleep_ms, strlen(sleep_ms)) <= 0)
  431. return -errno;
  432. return 0;
  433. }
  434. static int stop_ksmd_and_restore_frequency(void)
  435. {
  436. int ksm_fd;
  437. ksm_fd = open("/sys/kernel/mm/ksm/run", O_RDWR);
  438. if (ksm_fd < 0)
  439. return -errno;
  440. if (write(ksm_fd, "2", 1) != 1)
  441. return -errno;
  442. if (write(pages_to_scan_fd, "100", 3) <= 0)
  443. return -errno;
  444. if (write(sleep_millisecs_fd, "20", 2) <= 0)
  445. return -errno;
  446. return 0;
  447. }
  448. static void test_prctl_fork_exec(void)
  449. {
  450. int ret, status;
  451. pid_t child_pid;
  452. ksft_print_msg("[RUN] %s\n", __func__);
  453. if (start_ksmd_and_set_frequency("2000", "0"))
  454. ksft_test_result_fail("set ksmd's scanning frequency failed\n");
  455. ret = prctl(PR_SET_MEMORY_MERGE, 1, 0, 0, 0);
  456. if (ret < 0 && errno == EINVAL) {
  457. ksft_test_result_skip("PR_SET_MEMORY_MERGE not supported\n");
  458. return;
  459. } else if (ret) {
  460. ksft_test_result_fail("PR_SET_MEMORY_MERGE=1 failed\n");
  461. return;
  462. }
  463. child_pid = fork();
  464. if (child_pid == -1) {
  465. ksft_test_result_skip("fork() failed\n");
  466. return;
  467. } else if (child_pid == 0) {
  468. char *prg_name = "./ksm_functional_tests";
  469. char *argv_for_program[] = { prg_name, FORK_EXEC_CHILD_PRG_NAME, NULL };
  470. execv(prg_name, argv_for_program);
  471. exit(4);
  472. }
  473. if (waitpid(child_pid, &status, 0) > 0) {
  474. if (WIFEXITED(status)) {
  475. status = WEXITSTATUS(status);
  476. if (status) {
  477. test_child_ksm_err(status);
  478. return;
  479. }
  480. } else {
  481. ksft_test_result_fail("program didn't terminate normally\n");
  482. return;
  483. }
  484. } else {
  485. ksft_test_result_fail("waitpid() failed\n");
  486. return;
  487. }
  488. if (prctl(PR_SET_MEMORY_MERGE, 0, 0, 0, 0)) {
  489. ksft_test_result_fail("PR_SET_MEMORY_MERGE=0 failed\n");
  490. return;
  491. }
  492. if (stop_ksmd_and_restore_frequency()) {
  493. ksft_test_result_fail("restore ksmd frequency failed\n");
  494. return;
  495. }
  496. ksft_test_result_pass("PR_SET_MEMORY_MERGE value is inherited\n");
  497. }
  498. static void test_prctl_unmerge(void)
  499. {
  500. const unsigned int size = 2 * MiB;
  501. char *map;
  502. ksft_print_msg("[RUN] %s\n", __func__);
  503. map = mmap_and_merge_range(0xcf, size, PROT_READ | PROT_WRITE, KSM_MERGE_PRCTL);
  504. if (map == MAP_FAILED)
  505. return;
  506. if (prctl(PR_SET_MEMORY_MERGE, 0, 0, 0, 0)) {
  507. ksft_test_result_fail("PR_SET_MEMORY_MERGE=0 failed\n");
  508. goto unmap;
  509. }
  510. ksft_test_result(!range_maps_duplicates(map, size),
  511. "Pages were unmerged\n");
  512. unmap:
  513. ksm_stop();
  514. munmap(map, size);
  515. }
  516. static void test_prot_none(void)
  517. {
  518. const unsigned int size = 2 * MiB;
  519. char *map;
  520. int i;
  521. ksft_print_msg("[RUN] %s\n", __func__);
  522. map = mmap_and_merge_range(0x11, size, PROT_NONE, KSM_MERGE_MADVISE);
  523. if (map == MAP_FAILED)
  524. goto unmap;
  525. /* Store a unique value in each page on one half using ptrace */
  526. for (i = 0; i < size / 2; i += pagesize) {
  527. lseek(mem_fd, (uintptr_t) map + i, SEEK_SET);
  528. if (write(mem_fd, &i, sizeof(i)) != sizeof(i)) {
  529. ksft_test_result_fail("ptrace write failed\n");
  530. goto unmap;
  531. }
  532. }
  533. /* Trigger unsharing on the other half. */
  534. if (madvise(map + size / 2, size / 2, MADV_UNMERGEABLE)) {
  535. ksft_test_result_fail("MADV_UNMERGEABLE failed\n");
  536. goto unmap;
  537. }
  538. ksft_test_result(!range_maps_duplicates(map, size),
  539. "Pages were unmerged\n");
  540. unmap:
  541. ksm_stop();
  542. munmap(map, size);
  543. }
  544. static void test_fork_ksm_merging_page_count(void)
  545. {
  546. const unsigned int size = 2 * MiB;
  547. char *map;
  548. pid_t child_pid;
  549. int status;
  550. ksft_print_msg("[RUN] %s\n", __func__);
  551. map = mmap_and_merge_range(0xcf, size, PROT_READ | PROT_WRITE, KSM_MERGE_MADVISE);
  552. if (map == MAP_FAILED)
  553. return;
  554. child_pid = fork();
  555. if (!child_pid) {
  556. init_global_file_handles();
  557. exit(ksm_get_self_merging_pages());
  558. } else if (child_pid < 0) {
  559. ksft_test_result_fail("fork() failed\n");
  560. goto unmap;
  561. }
  562. if (waitpid(child_pid, &status, 0) < 0) {
  563. ksft_test_result_fail("waitpid() failed\n");
  564. goto unmap;
  565. }
  566. status = WEXITSTATUS(status);
  567. if (status) {
  568. ksft_test_result_fail("ksm_merging_page in child: %d\n", status);
  569. goto unmap;
  570. }
  571. ksft_test_result_pass("ksm_merging_pages is not inherited after fork\n");
  572. unmap:
  573. ksm_stop();
  574. munmap(map, size);
  575. }
  576. static void init_global_file_handles(void)
  577. {
  578. mem_fd = open("/proc/self/mem", O_RDWR);
  579. if (mem_fd < 0)
  580. ksft_exit_fail_msg("opening /proc/self/mem failed\n");
  581. if (ksm_stop() < 0)
  582. ksft_exit_skip("accessing \"/sys/kernel/mm/ksm/run\") failed\n");
  583. if (ksm_get_full_scans() < 0)
  584. ksft_exit_skip("accessing \"/sys/kernel/mm/ksm/full_scans\") failed\n");
  585. pagemap_fd = open("/proc/self/pagemap", O_RDONLY);
  586. if (pagemap_fd < 0)
  587. ksft_exit_skip("open(\"/proc/self/pagemap\") failed\n");
  588. if (ksm_get_self_merging_pages() < 0)
  589. ksft_exit_skip("accessing \"/proc/self/ksm_merging_pages\") failed\n");
  590. pages_to_scan_fd = open("/sys/kernel/mm/ksm/pages_to_scan", O_RDWR);
  591. if (pages_to_scan_fd < 0)
  592. ksft_exit_fail_msg("opening /sys/kernel/mm/ksm/pages_to_scan failed\n");
  593. sleep_millisecs_fd = open("/sys/kernel/mm/ksm/sleep_millisecs", O_RDWR);
  594. if (sleep_millisecs_fd < 0)
  595. ksft_exit_fail_msg("opening /sys/kernel/mm/ksm/sleep_millisecs failed\n");
  596. }
  597. int main(int argc, char **argv)
  598. {
  599. unsigned int tests = 9;
  600. int err;
  601. if (argc > 1 && !strcmp(argv[1], FORK_EXEC_CHILD_PRG_NAME)) {
  602. init_global_file_handles();
  603. exit(test_child_ksm());
  604. }
  605. #ifdef __NR_userfaultfd
  606. tests++;
  607. #endif
  608. ksft_print_header();
  609. ksft_set_plan(tests);
  610. pagesize = getpagesize();
  611. init_global_file_handles();
  612. test_unmerge();
  613. test_unmerge_zero_pages();
  614. test_unmerge_discarded();
  615. #ifdef __NR_userfaultfd
  616. test_unmerge_uffd_wp();
  617. #endif
  618. test_prot_none();
  619. test_prctl();
  620. test_prctl_fork();
  621. test_prctl_fork_exec();
  622. test_prctl_unmerge();
  623. test_fork_ksm_merging_page_count();
  624. err = ksft_get_fail_cnt();
  625. if (err)
  626. ksft_exit_fail_msg("%d out of %d tests failed\n",
  627. err, ksft_test_num());
  628. ksft_exit_pass();
  629. }