madv_populate.c 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * MADV_POPULATE_READ and MADV_POPULATE_WRITE tests
  4. *
  5. * Copyright 2021, Red Hat, Inc.
  6. *
  7. * Author(s): David Hildenbrand <[email protected]>
  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 <linux/mman.h>
  18. #include <sys/mman.h>
  19. #include "../kselftest.h"
  20. #include "vm_util.h"
  21. /*
  22. * For now, we're using 2 MiB of private anonymous memory for all tests.
  23. */
  24. #define SIZE (2 * 1024 * 1024)
  25. static size_t pagesize;
  26. static bool pagemap_is_populated(int fd, char *start)
  27. {
  28. uint64_t entry = pagemap_get_entry(fd, start);
  29. /* Present or swapped. */
  30. return entry & 0xc000000000000000ull;
  31. }
  32. static void sense_support(void)
  33. {
  34. char *addr;
  35. int ret;
  36. addr = mmap(0, pagesize, PROT_READ | PROT_WRITE,
  37. MAP_ANONYMOUS | MAP_PRIVATE, 0, 0);
  38. if (!addr)
  39. ksft_exit_fail_msg("mmap failed\n");
  40. ret = madvise(addr, pagesize, MADV_POPULATE_READ);
  41. if (ret)
  42. ksft_exit_skip("MADV_POPULATE_READ is not available\n");
  43. ret = madvise(addr, pagesize, MADV_POPULATE_WRITE);
  44. if (ret)
  45. ksft_exit_skip("MADV_POPULATE_WRITE is not available\n");
  46. munmap(addr, pagesize);
  47. }
  48. static void test_prot_read(void)
  49. {
  50. char *addr;
  51. int ret;
  52. ksft_print_msg("[RUN] %s\n", __func__);
  53. addr = mmap(0, SIZE, PROT_READ, MAP_ANONYMOUS | MAP_PRIVATE, 0, 0);
  54. if (addr == MAP_FAILED)
  55. ksft_exit_fail_msg("mmap failed\n");
  56. ret = madvise(addr, SIZE, MADV_POPULATE_READ);
  57. ksft_test_result(!ret, "MADV_POPULATE_READ with PROT_READ\n");
  58. ret = madvise(addr, SIZE, MADV_POPULATE_WRITE);
  59. ksft_test_result(ret == -1 && errno == EINVAL,
  60. "MADV_POPULATE_WRITE with PROT_READ\n");
  61. munmap(addr, SIZE);
  62. }
  63. static void test_prot_write(void)
  64. {
  65. char *addr;
  66. int ret;
  67. ksft_print_msg("[RUN] %s\n", __func__);
  68. addr = mmap(0, SIZE, PROT_WRITE, MAP_ANONYMOUS | MAP_PRIVATE, 0, 0);
  69. if (addr == MAP_FAILED)
  70. ksft_exit_fail_msg("mmap failed\n");
  71. ret = madvise(addr, SIZE, MADV_POPULATE_READ);
  72. ksft_test_result(ret == -1 && errno == EINVAL,
  73. "MADV_POPULATE_READ with PROT_WRITE\n");
  74. ret = madvise(addr, SIZE, MADV_POPULATE_WRITE);
  75. ksft_test_result(!ret, "MADV_POPULATE_WRITE with PROT_WRITE\n");
  76. munmap(addr, SIZE);
  77. }
  78. static void test_holes(void)
  79. {
  80. char *addr;
  81. int ret;
  82. ksft_print_msg("[RUN] %s\n", __func__);
  83. addr = mmap(0, SIZE, PROT_READ | PROT_WRITE,
  84. MAP_ANONYMOUS | MAP_PRIVATE, 0, 0);
  85. if (addr == MAP_FAILED)
  86. ksft_exit_fail_msg("mmap failed\n");
  87. ret = munmap(addr + pagesize, pagesize);
  88. if (ret)
  89. ksft_exit_fail_msg("munmap failed\n");
  90. /* Hole in the middle */
  91. ret = madvise(addr, SIZE, MADV_POPULATE_READ);
  92. ksft_test_result(ret == -1 && errno == ENOMEM,
  93. "MADV_POPULATE_READ with holes in the middle\n");
  94. ret = madvise(addr, SIZE, MADV_POPULATE_WRITE);
  95. ksft_test_result(ret == -1 && errno == ENOMEM,
  96. "MADV_POPULATE_WRITE with holes in the middle\n");
  97. /* Hole at end */
  98. ret = madvise(addr, 2 * pagesize, MADV_POPULATE_READ);
  99. ksft_test_result(ret == -1 && errno == ENOMEM,
  100. "MADV_POPULATE_READ with holes at the end\n");
  101. ret = madvise(addr, 2 * pagesize, MADV_POPULATE_WRITE);
  102. ksft_test_result(ret == -1 && errno == ENOMEM,
  103. "MADV_POPULATE_WRITE with holes at the end\n");
  104. /* Hole at beginning */
  105. ret = madvise(addr + pagesize, pagesize, MADV_POPULATE_READ);
  106. ksft_test_result(ret == -1 && errno == ENOMEM,
  107. "MADV_POPULATE_READ with holes at the beginning\n");
  108. ret = madvise(addr + pagesize, pagesize, MADV_POPULATE_WRITE);
  109. ksft_test_result(ret == -1 && errno == ENOMEM,
  110. "MADV_POPULATE_WRITE with holes at the beginning\n");
  111. munmap(addr, SIZE);
  112. }
  113. static bool range_is_populated(char *start, ssize_t size)
  114. {
  115. int fd = open("/proc/self/pagemap", O_RDONLY);
  116. bool ret = true;
  117. if (fd < 0)
  118. ksft_exit_fail_msg("opening pagemap failed\n");
  119. for (; size > 0 && ret; size -= pagesize, start += pagesize)
  120. if (!pagemap_is_populated(fd, start))
  121. ret = false;
  122. close(fd);
  123. return ret;
  124. }
  125. static bool range_is_not_populated(char *start, ssize_t size)
  126. {
  127. int fd = open("/proc/self/pagemap", O_RDONLY);
  128. bool ret = true;
  129. if (fd < 0)
  130. ksft_exit_fail_msg("opening pagemap failed\n");
  131. for (; size > 0 && ret; size -= pagesize, start += pagesize)
  132. if (pagemap_is_populated(fd, start))
  133. ret = false;
  134. close(fd);
  135. return ret;
  136. }
  137. static void test_populate_read(void)
  138. {
  139. char *addr;
  140. int ret;
  141. ksft_print_msg("[RUN] %s\n", __func__);
  142. addr = mmap(0, SIZE, PROT_READ | PROT_WRITE,
  143. MAP_ANONYMOUS | MAP_PRIVATE, 0, 0);
  144. if (addr == MAP_FAILED)
  145. ksft_exit_fail_msg("mmap failed\n");
  146. ksft_test_result(range_is_not_populated(addr, SIZE),
  147. "range initially not populated\n");
  148. ret = madvise(addr, SIZE, MADV_POPULATE_READ);
  149. ksft_test_result(!ret, "MADV_POPULATE_READ\n");
  150. ksft_test_result(range_is_populated(addr, SIZE),
  151. "range is populated\n");
  152. munmap(addr, SIZE);
  153. }
  154. static void test_populate_write(void)
  155. {
  156. char *addr;
  157. int ret;
  158. ksft_print_msg("[RUN] %s\n", __func__);
  159. addr = mmap(0, SIZE, PROT_READ | PROT_WRITE,
  160. MAP_ANONYMOUS | MAP_PRIVATE, 0, 0);
  161. if (addr == MAP_FAILED)
  162. ksft_exit_fail_msg("mmap failed\n");
  163. ksft_test_result(range_is_not_populated(addr, SIZE),
  164. "range initially not populated\n");
  165. ret = madvise(addr, SIZE, MADV_POPULATE_WRITE);
  166. ksft_test_result(!ret, "MADV_POPULATE_WRITE\n");
  167. ksft_test_result(range_is_populated(addr, SIZE),
  168. "range is populated\n");
  169. munmap(addr, SIZE);
  170. }
  171. static bool range_is_softdirty(char *start, ssize_t size)
  172. {
  173. int fd = open("/proc/self/pagemap", O_RDONLY);
  174. bool ret = true;
  175. if (fd < 0)
  176. ksft_exit_fail_msg("opening pagemap failed\n");
  177. for (; size > 0 && ret; size -= pagesize, start += pagesize)
  178. if (!pagemap_is_softdirty(fd, start))
  179. ret = false;
  180. close(fd);
  181. return ret;
  182. }
  183. static bool range_is_not_softdirty(char *start, ssize_t size)
  184. {
  185. int fd = open("/proc/self/pagemap", O_RDONLY);
  186. bool ret = true;
  187. if (fd < 0)
  188. ksft_exit_fail_msg("opening pagemap failed\n");
  189. for (; size > 0 && ret; size -= pagesize, start += pagesize)
  190. if (pagemap_is_softdirty(fd, start))
  191. ret = false;
  192. close(fd);
  193. return ret;
  194. }
  195. static void test_softdirty(void)
  196. {
  197. char *addr;
  198. int ret;
  199. ksft_print_msg("[RUN] %s\n", __func__);
  200. addr = mmap(0, SIZE, PROT_READ | PROT_WRITE,
  201. MAP_ANONYMOUS | MAP_PRIVATE, 0, 0);
  202. if (addr == MAP_FAILED)
  203. ksft_exit_fail_msg("mmap failed\n");
  204. /* Clear any softdirty bits. */
  205. clear_softdirty();
  206. ksft_test_result(range_is_not_softdirty(addr, SIZE),
  207. "range is not softdirty\n");
  208. /* Populating READ should set softdirty. */
  209. ret = madvise(addr, SIZE, MADV_POPULATE_READ);
  210. ksft_test_result(!ret, "MADV_POPULATE_READ\n");
  211. ksft_test_result(range_is_not_softdirty(addr, SIZE),
  212. "range is not softdirty\n");
  213. /* Populating WRITE should set softdirty. */
  214. ret = madvise(addr, SIZE, MADV_POPULATE_WRITE);
  215. ksft_test_result(!ret, "MADV_POPULATE_WRITE\n");
  216. ksft_test_result(range_is_softdirty(addr, SIZE),
  217. "range is softdirty\n");
  218. munmap(addr, SIZE);
  219. }
  220. int main(int argc, char **argv)
  221. {
  222. int err;
  223. pagesize = getpagesize();
  224. ksft_print_header();
  225. ksft_set_plan(21);
  226. sense_support();
  227. test_prot_read();
  228. test_prot_write();
  229. test_holes();
  230. test_populate_read();
  231. test_populate_write();
  232. test_softdirty();
  233. err = ksft_get_fail_cnt();
  234. if (err)
  235. ksft_exit_fail_msg("%d out of %d tests failed\n",
  236. err, ksft_test_num());
  237. return ksft_exit_pass();
  238. }