rmap.c 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * RMAP functional tests
  4. *
  5. * Author(s): Wei Yang <richard.weiyang@gmail.com>
  6. */
  7. #include "kselftest_harness.h"
  8. #include <strings.h>
  9. #include <pthread.h>
  10. #include <numa.h>
  11. #include <numaif.h>
  12. #include <sys/mman.h>
  13. #include <sys/prctl.h>
  14. #include <sys/types.h>
  15. #include <signal.h>
  16. #include <time.h>
  17. #include <sys/sem.h>
  18. #include <unistd.h>
  19. #include <fcntl.h>
  20. #include "vm_util.h"
  21. #define TOTAL_LEVEL 5
  22. #define MAX_CHILDREN 3
  23. #define FAIL_ON_CHECK (1 << 0)
  24. #define FAIL_ON_WORK (1 << 1)
  25. struct sembuf sem_wait = {0, -1, 0};
  26. struct sembuf sem_signal = {0, 1, 0};
  27. enum backend_type {
  28. ANON,
  29. SHM,
  30. NORM_FILE,
  31. };
  32. #define PREFIX "kst_rmap"
  33. #define MAX_FILENAME_LEN 256
  34. const char *suffixes[] = {
  35. "",
  36. "_shm",
  37. "_file",
  38. };
  39. struct global_data;
  40. typedef int (*work_fn)(struct global_data *data);
  41. typedef int (*check_fn)(struct global_data *data);
  42. typedef void (*prepare_fn)(struct global_data *data);
  43. struct global_data {
  44. int worker_level;
  45. int semid;
  46. int pipefd[2];
  47. unsigned int mapsize;
  48. unsigned int rand_seed;
  49. char *region;
  50. prepare_fn do_prepare;
  51. work_fn do_work;
  52. check_fn do_check;
  53. enum backend_type backend;
  54. char filename[MAX_FILENAME_LEN];
  55. unsigned long *expected_pfn;
  56. };
  57. /*
  58. * Create a process tree with TOTAL_LEVEL height and at most MAX_CHILDREN
  59. * children for each.
  60. *
  61. * It will randomly select one process as 'worker' process which will
  62. * 'do_work' until all processes are created. And all other processes will
  63. * wait until 'worker' finish its work.
  64. */
  65. void propagate_children(struct __test_metadata *_metadata, struct global_data *data)
  66. {
  67. pid_t root_pid, pid;
  68. unsigned int num_child;
  69. int status;
  70. int ret = 0;
  71. int curr_child, worker_child;
  72. int curr_level = 1;
  73. bool is_worker = true;
  74. root_pid = getpid();
  75. repeat:
  76. num_child = rand_r(&data->rand_seed) % MAX_CHILDREN + 1;
  77. worker_child = is_worker ? rand_r(&data->rand_seed) % num_child : -1;
  78. for (curr_child = 0; curr_child < num_child; curr_child++) {
  79. pid = fork();
  80. if (pid < 0) {
  81. perror("Error: fork\n");
  82. } else if (pid == 0) {
  83. curr_level++;
  84. if (curr_child != worker_child)
  85. is_worker = false;
  86. if (curr_level == TOTAL_LEVEL)
  87. break;
  88. data->rand_seed += curr_child;
  89. goto repeat;
  90. }
  91. }
  92. if (data->do_prepare)
  93. data->do_prepare(data);
  94. close(data->pipefd[1]);
  95. if (is_worker && curr_level == data->worker_level) {
  96. /* This is the worker process, first wait last process created */
  97. char buf;
  98. while (read(data->pipefd[0], &buf, 1) > 0)
  99. ;
  100. if (data->do_work)
  101. ret = data->do_work(data);
  102. /* Kick others */
  103. semctl(data->semid, 0, IPC_RMID);
  104. } else {
  105. /* Wait worker finish */
  106. semop(data->semid, &sem_wait, 1);
  107. if (data->do_check)
  108. ret = data->do_check(data);
  109. }
  110. /* Wait all child to quit */
  111. while (wait(&status) > 0) {
  112. if (WIFEXITED(status))
  113. ret |= WEXITSTATUS(status);
  114. }
  115. if (getpid() == root_pid) {
  116. if (ret & FAIL_ON_WORK)
  117. SKIP(return, "Failed in worker");
  118. ASSERT_EQ(ret, 0);
  119. } else {
  120. exit(ret);
  121. }
  122. }
  123. FIXTURE(migrate)
  124. {
  125. struct global_data data;
  126. };
  127. FIXTURE_SETUP(migrate)
  128. {
  129. struct global_data *data = &self->data;
  130. if (numa_available() < 0)
  131. SKIP(return, "NUMA not available");
  132. if (numa_bitmask_weight(numa_all_nodes_ptr) <= 1)
  133. SKIP(return, "Not enough NUMA nodes available");
  134. data->mapsize = getpagesize();
  135. data->expected_pfn = mmap(0, sizeof(unsigned long),
  136. PROT_READ | PROT_WRITE,
  137. MAP_SHARED | MAP_ANONYMOUS, -1, 0);
  138. ASSERT_NE(data->expected_pfn, MAP_FAILED);
  139. /* Prepare semaphore */
  140. data->semid = semget(IPC_PRIVATE, 1, 0666 | IPC_CREAT);
  141. ASSERT_NE(data->semid, -1);
  142. ASSERT_NE(semctl(data->semid, 0, SETVAL, 0), -1);
  143. /* Prepare pipe */
  144. ASSERT_NE(pipe(data->pipefd), -1);
  145. data->rand_seed = time(NULL);
  146. srand(data->rand_seed);
  147. data->worker_level = rand() % TOTAL_LEVEL + 1;
  148. data->do_prepare = NULL;
  149. data->do_work = NULL;
  150. data->do_check = NULL;
  151. data->backend = ANON;
  152. };
  153. FIXTURE_TEARDOWN(migrate)
  154. {
  155. struct global_data *data = &self->data;
  156. if (data->region != MAP_FAILED)
  157. munmap(data->region, data->mapsize);
  158. data->region = MAP_FAILED;
  159. if (data->expected_pfn != MAP_FAILED)
  160. munmap(data->expected_pfn, sizeof(unsigned long));
  161. data->expected_pfn = MAP_FAILED;
  162. semctl(data->semid, 0, IPC_RMID);
  163. data->semid = -1;
  164. close(data->pipefd[0]);
  165. switch (data->backend) {
  166. case ANON:
  167. break;
  168. case SHM:
  169. shm_unlink(data->filename);
  170. break;
  171. case NORM_FILE:
  172. unlink(data->filename);
  173. break;
  174. }
  175. }
  176. void access_region(struct global_data *data)
  177. {
  178. /*
  179. * Force read "region" to make sure page fault in.
  180. */
  181. FORCE_READ(*data->region);
  182. }
  183. int try_to_move_page(char *region)
  184. {
  185. int ret;
  186. int node;
  187. int status = 0;
  188. int failures = 0;
  189. ret = move_pages(0, 1, (void **)&region, NULL, &status, MPOL_MF_MOVE_ALL);
  190. if (ret != 0) {
  191. perror("Failed to get original numa");
  192. return FAIL_ON_WORK;
  193. }
  194. /* Pick up a different target node */
  195. for (node = 0; node <= numa_max_node(); node++) {
  196. if (numa_bitmask_isbitset(numa_all_nodes_ptr, node) && node != status)
  197. break;
  198. }
  199. if (node > numa_max_node()) {
  200. ksft_print_msg("Couldn't find available numa node for testing\n");
  201. return FAIL_ON_WORK;
  202. }
  203. while (1) {
  204. ret = move_pages(0, 1, (void **)&region, &node, &status, MPOL_MF_MOVE_ALL);
  205. /* migrate successfully */
  206. if (!ret)
  207. break;
  208. /* error happened */
  209. if (ret < 0) {
  210. ksft_perror("Failed to move pages");
  211. return FAIL_ON_WORK;
  212. }
  213. /* migration is best effort; try again */
  214. if (++failures >= 100)
  215. return FAIL_ON_WORK;
  216. }
  217. return 0;
  218. }
  219. int move_region(struct global_data *data)
  220. {
  221. int ret;
  222. int pagemap_fd;
  223. ret = try_to_move_page(data->region);
  224. if (ret != 0)
  225. return ret;
  226. pagemap_fd = open("/proc/self/pagemap", O_RDONLY);
  227. if (pagemap_fd == -1)
  228. return FAIL_ON_WORK;
  229. *data->expected_pfn = pagemap_get_pfn(pagemap_fd, data->region);
  230. return 0;
  231. }
  232. int has_same_pfn(struct global_data *data)
  233. {
  234. unsigned long pfn;
  235. int pagemap_fd;
  236. if (data->region == MAP_FAILED)
  237. return 0;
  238. pagemap_fd = open("/proc/self/pagemap", O_RDONLY);
  239. if (pagemap_fd == -1)
  240. return FAIL_ON_CHECK;
  241. pfn = pagemap_get_pfn(pagemap_fd, data->region);
  242. if (pfn != *data->expected_pfn)
  243. return FAIL_ON_CHECK;
  244. return 0;
  245. }
  246. TEST_F(migrate, anon)
  247. {
  248. struct global_data *data = &self->data;
  249. /* Map an area and fault in */
  250. data->region = mmap(0, data->mapsize, PROT_READ | PROT_WRITE,
  251. MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
  252. ASSERT_NE(data->region, MAP_FAILED);
  253. memset(data->region, 0xcf, data->mapsize);
  254. data->do_prepare = access_region;
  255. data->do_work = move_region;
  256. data->do_check = has_same_pfn;
  257. propagate_children(_metadata, data);
  258. }
  259. TEST_F(migrate, shm)
  260. {
  261. int shm_fd;
  262. struct global_data *data = &self->data;
  263. snprintf(data->filename, MAX_FILENAME_LEN, "%s%s", PREFIX, suffixes[SHM]);
  264. shm_fd = shm_open(data->filename, O_CREAT | O_RDWR, 0666);
  265. ASSERT_NE(shm_fd, -1);
  266. ftruncate(shm_fd, data->mapsize);
  267. data->backend = SHM;
  268. /* Map a shared area and fault in */
  269. data->region = mmap(0, data->mapsize, PROT_READ | PROT_WRITE,
  270. MAP_SHARED, shm_fd, 0);
  271. ASSERT_NE(data->region, MAP_FAILED);
  272. memset(data->region, 0xcf, data->mapsize);
  273. close(shm_fd);
  274. data->do_prepare = access_region;
  275. data->do_work = move_region;
  276. data->do_check = has_same_pfn;
  277. propagate_children(_metadata, data);
  278. }
  279. TEST_F(migrate, file)
  280. {
  281. int fd;
  282. struct global_data *data = &self->data;
  283. snprintf(data->filename, MAX_FILENAME_LEN, "%s%s", PREFIX, suffixes[NORM_FILE]);
  284. fd = open(data->filename, O_CREAT | O_RDWR | O_EXCL, 0666);
  285. ASSERT_NE(fd, -1);
  286. ftruncate(fd, data->mapsize);
  287. data->backend = NORM_FILE;
  288. /* Map a shared area and fault in */
  289. data->region = mmap(0, data->mapsize, PROT_READ | PROT_WRITE,
  290. MAP_SHARED, fd, 0);
  291. ASSERT_NE(data->region, MAP_FAILED);
  292. memset(data->region, 0xcf, data->mapsize);
  293. close(fd);
  294. data->do_prepare = access_region;
  295. data->do_work = move_region;
  296. data->do_check = has_same_pfn;
  297. propagate_children(_metadata, data);
  298. }
  299. void prepare_local_region(struct global_data *data)
  300. {
  301. /* Allocate range and set the same data */
  302. data->region = mmap(NULL, data->mapsize, PROT_READ|PROT_WRITE,
  303. MAP_PRIVATE|MAP_ANON, -1, 0);
  304. if (data->region == MAP_FAILED)
  305. return;
  306. memset(data->region, 0xcf, data->mapsize);
  307. }
  308. int merge_and_migrate(struct global_data *data)
  309. {
  310. int pagemap_fd;
  311. int ret = 0;
  312. if (data->region == MAP_FAILED)
  313. return FAIL_ON_WORK;
  314. if (ksm_start() < 0)
  315. return FAIL_ON_WORK;
  316. ret = try_to_move_page(data->region);
  317. pagemap_fd = open("/proc/self/pagemap", O_RDONLY);
  318. if (pagemap_fd == -1)
  319. return FAIL_ON_WORK;
  320. *data->expected_pfn = pagemap_get_pfn(pagemap_fd, data->region);
  321. return ret;
  322. }
  323. TEST_F(migrate, ksm)
  324. {
  325. int ret;
  326. struct global_data *data = &self->data;
  327. if (ksm_stop() < 0)
  328. SKIP(return, "accessing \"/sys/kernel/mm/ksm/run\") failed");
  329. if (ksm_get_full_scans() < 0)
  330. SKIP(return, "accessing \"/sys/kernel/mm/ksm/full_scan\") failed");
  331. ret = prctl(PR_SET_MEMORY_MERGE, 1, 0, 0, 0);
  332. if (ret < 0 && errno == EINVAL)
  333. SKIP(return, "PR_SET_MEMORY_MERGE not supported");
  334. else if (ret)
  335. ksft_exit_fail_perror("PR_SET_MEMORY_MERGE=1 failed");
  336. data->do_prepare = prepare_local_region;
  337. data->do_work = merge_and_migrate;
  338. data->do_check = has_same_pfn;
  339. propagate_children(_metadata, data);
  340. }
  341. TEST_HARNESS_MAIN