pfnmap.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Basic VM_PFNMAP tests relying on mmap() of input file provided.
  4. * Use '/dev/mem' as default.
  5. *
  6. * Copyright 2025, Red Hat, Inc.
  7. *
  8. * Author(s): David Hildenbrand <david@redhat.com>
  9. */
  10. #define _GNU_SOURCE
  11. #include <stdlib.h>
  12. #include <string.h>
  13. #include <stdint.h>
  14. #include <unistd.h>
  15. #include <errno.h>
  16. #include <stdio.h>
  17. #include <ctype.h>
  18. #include <fcntl.h>
  19. #include <signal.h>
  20. #include <setjmp.h>
  21. #include <linux/mman.h>
  22. #include <sys/mman.h>
  23. #include <sys/wait.h>
  24. #include "kselftest_harness.h"
  25. #include "vm_util.h"
  26. #define DEV_MEM_NPAGES 2
  27. static sigjmp_buf sigjmp_buf_env;
  28. static char *file = "/dev/mem";
  29. static off_t file_offset;
  30. static int fd;
  31. static void signal_handler(int sig)
  32. {
  33. siglongjmp(sigjmp_buf_env, -EFAULT);
  34. }
  35. static int test_read_access(char *addr, size_t size, size_t pagesize)
  36. {
  37. int ret;
  38. if (signal(SIGSEGV, signal_handler) == SIG_ERR)
  39. return -EINVAL;
  40. ret = sigsetjmp(sigjmp_buf_env, 1);
  41. if (!ret)
  42. force_read_pages(addr, size/pagesize, pagesize);
  43. if (signal(SIGSEGV, SIG_DFL) == SIG_ERR)
  44. return -EINVAL;
  45. return ret;
  46. }
  47. static int find_ram_target(off_t *offset,
  48. unsigned long long pagesize)
  49. {
  50. unsigned long long start, end;
  51. char line[80], *end_ptr;
  52. FILE *file;
  53. /* Search /proc/iomem for the first suitable "System RAM" range. */
  54. file = fopen("/proc/iomem", "r");
  55. if (!file)
  56. return -errno;
  57. while (fgets(line, sizeof(line), file)) {
  58. /* Ignore any child nodes. */
  59. if (!isalnum(line[0]))
  60. continue;
  61. if (!strstr(line, "System RAM\n"))
  62. continue;
  63. start = strtoull(line, &end_ptr, 16);
  64. /* Skip over the "-" */
  65. end_ptr++;
  66. /* Make end "exclusive". */
  67. end = strtoull(end_ptr, NULL, 16) + 1;
  68. /* Actual addresses are not exported */
  69. if (!start && !end)
  70. break;
  71. /* We need full pages. */
  72. start = (start + pagesize - 1) & ~(pagesize - 1);
  73. end &= ~(pagesize - 1);
  74. if (start != (off_t)start)
  75. break;
  76. /* We need two pages. */
  77. if (end > start + DEV_MEM_NPAGES * pagesize) {
  78. fclose(file);
  79. *offset = start;
  80. return 0;
  81. }
  82. }
  83. return -ENOENT;
  84. }
  85. static void pfnmap_init(void)
  86. {
  87. size_t pagesize = getpagesize();
  88. size_t size = DEV_MEM_NPAGES * pagesize;
  89. void *addr;
  90. if (strncmp(file, "/dev/mem", strlen("/dev/mem")) == 0) {
  91. int err = find_ram_target(&file_offset, pagesize);
  92. if (err)
  93. ksft_exit_skip("Cannot find ram target in '/proc/iomem': %s\n",
  94. strerror(-err));
  95. } else {
  96. file_offset = 0;
  97. }
  98. fd = open(file, O_RDONLY);
  99. if (fd < 0)
  100. ksft_exit_skip("Cannot open '%s': %s\n", file, strerror(errno));
  101. /*
  102. * Make sure we can map the file, and perform some basic checks; skip
  103. * the whole suite if anything goes wrong.
  104. * A fresh mapping is then created for every test case by
  105. * FIXTURE_SETUP(pfnmap).
  106. */
  107. addr = mmap(NULL, size, PROT_READ, MAP_SHARED, fd, file_offset);
  108. if (addr == MAP_FAILED)
  109. ksft_exit_skip("Cannot mmap '%s': %s\n", file, strerror(errno));
  110. if (!check_vmflag_pfnmap(addr))
  111. ksft_exit_skip("Invalid file: '%s'. Not pfnmap'ed\n", file);
  112. if (test_read_access(addr, size, pagesize))
  113. ksft_exit_skip("Cannot read-access mmap'ed '%s'\n", file);
  114. munmap(addr, size);
  115. }
  116. FIXTURE(pfnmap)
  117. {
  118. size_t pagesize;
  119. char *addr1;
  120. size_t size1;
  121. char *addr2;
  122. size_t size2;
  123. };
  124. FIXTURE_SETUP(pfnmap)
  125. {
  126. self->pagesize = getpagesize();
  127. self->size1 = DEV_MEM_NPAGES * self->pagesize;
  128. self->addr1 = mmap(NULL, self->size1, PROT_READ, MAP_SHARED,
  129. fd, file_offset);
  130. ASSERT_NE(self->addr1, MAP_FAILED);
  131. self->size2 = 0;
  132. self->addr2 = MAP_FAILED;
  133. }
  134. FIXTURE_TEARDOWN(pfnmap)
  135. {
  136. if (self->addr2 != MAP_FAILED)
  137. munmap(self->addr2, self->size2);
  138. if (self->addr1 != MAP_FAILED)
  139. munmap(self->addr1, self->size1);
  140. }
  141. TEST_F(pfnmap, madvise_disallowed)
  142. {
  143. int advices[] = {
  144. MADV_DONTNEED,
  145. MADV_DONTNEED_LOCKED,
  146. MADV_FREE,
  147. MADV_WIPEONFORK,
  148. MADV_COLD,
  149. MADV_PAGEOUT,
  150. MADV_POPULATE_READ,
  151. MADV_POPULATE_WRITE,
  152. };
  153. int i;
  154. /* All these advices must be rejected. */
  155. for (i = 0; i < ARRAY_SIZE(advices); i++) {
  156. EXPECT_LT(madvise(self->addr1, self->pagesize, advices[i]), 0);
  157. EXPECT_EQ(errno, EINVAL);
  158. }
  159. }
  160. TEST_F(pfnmap, munmap_split)
  161. {
  162. /*
  163. * Unmap the first page. This munmap() call is not really expected to
  164. * fail, but we might be able to trigger other internal issues.
  165. */
  166. ASSERT_EQ(munmap(self->addr1, self->pagesize), 0);
  167. /*
  168. * Remap the first page while the second page is still mapped. This
  169. * makes sure that any PAT tracking on x86 will allow for mmap()'ing
  170. * a page again while some parts of the first mmap() are still
  171. * around.
  172. */
  173. self->size2 = self->pagesize;
  174. self->addr2 = mmap(NULL, self->pagesize, PROT_READ, MAP_SHARED,
  175. fd, file_offset);
  176. ASSERT_NE(self->addr2, MAP_FAILED);
  177. }
  178. TEST_F(pfnmap, mremap_fixed)
  179. {
  180. char *ret;
  181. /* Reserve a destination area. */
  182. self->size2 = self->size1;
  183. self->addr2 = mmap(NULL, self->size2, PROT_READ, MAP_ANON | MAP_PRIVATE,
  184. -1, 0);
  185. ASSERT_NE(self->addr2, MAP_FAILED);
  186. /* mremap() over our destination. */
  187. ret = mremap(self->addr1, self->size1, self->size2,
  188. MREMAP_FIXED | MREMAP_MAYMOVE, self->addr2);
  189. ASSERT_NE(ret, MAP_FAILED);
  190. }
  191. TEST_F(pfnmap, mremap_shrink)
  192. {
  193. char *ret;
  194. /* Shrinking is expected to work. */
  195. ret = mremap(self->addr1, self->size1, self->size1 - self->pagesize, 0);
  196. ASSERT_NE(ret, MAP_FAILED);
  197. }
  198. TEST_F(pfnmap, mremap_expand)
  199. {
  200. /*
  201. * Growing is not expected to work, and getting it right would
  202. * be challenging. So this test primarily serves as an early warning
  203. * that something that probably should never work suddenly works.
  204. */
  205. self->size2 = self->size1 + self->pagesize;
  206. self->addr2 = mremap(self->addr1, self->size1, self->size2, MREMAP_MAYMOVE);
  207. ASSERT_EQ(self->addr2, MAP_FAILED);
  208. }
  209. TEST_F(pfnmap, fork)
  210. {
  211. pid_t pid;
  212. int ret;
  213. /* fork() a child and test if the child can access the pages. */
  214. pid = fork();
  215. ASSERT_GE(pid, 0);
  216. if (!pid) {
  217. EXPECT_EQ(test_read_access(self->addr1, self->size1,
  218. self->pagesize), 0);
  219. exit(0);
  220. }
  221. wait(&ret);
  222. if (WIFEXITED(ret))
  223. ret = WEXITSTATUS(ret);
  224. else
  225. ret = -EINVAL;
  226. ASSERT_EQ(ret, 0);
  227. }
  228. int main(int argc, char **argv)
  229. {
  230. for (int i = 1; i < argc; i++) {
  231. if (strcmp(argv[i], "--") == 0) {
  232. if (i + 1 < argc && strlen(argv[i + 1]) > 0)
  233. file = argv[i + 1];
  234. argc = i;
  235. break;
  236. }
  237. }
  238. pfnmap_init();
  239. return test_harness_run(argc, argv);
  240. }