pagemap_ioctl.c 52 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666
  1. // SPDX-License-Identifier: GPL-2.0
  2. #define _GNU_SOURCE
  3. #include <stdio.h>
  4. #include <fcntl.h>
  5. #include <string.h>
  6. #include <sys/mman.h>
  7. #include <errno.h>
  8. #include <malloc.h>
  9. #include "vm_util.h"
  10. #include "../kselftest.h"
  11. #include <linux/types.h>
  12. #include <linux/memfd.h>
  13. #include <linux/userfaultfd.h>
  14. #include <linux/fs.h>
  15. #include <sys/ioctl.h>
  16. #include <sys/stat.h>
  17. #include <math.h>
  18. #include <asm/unistd.h>
  19. #include <pthread.h>
  20. #include <sys/resource.h>
  21. #include <assert.h>
  22. #include <sys/ipc.h>
  23. #include <sys/shm.h>
  24. #define PAGEMAP_BITS_ALL (PAGE_IS_WPALLOWED | PAGE_IS_WRITTEN | \
  25. PAGE_IS_FILE | PAGE_IS_PRESENT | \
  26. PAGE_IS_SWAPPED | PAGE_IS_PFNZERO | \
  27. PAGE_IS_HUGE)
  28. #define PAGEMAP_NON_WRITTEN_BITS (PAGE_IS_WPALLOWED | PAGE_IS_FILE | \
  29. PAGE_IS_PRESENT | PAGE_IS_SWAPPED | \
  30. PAGE_IS_PFNZERO | PAGE_IS_HUGE)
  31. #define TEST_ITERATIONS 100
  32. #define PAGEMAP "/proc/self/pagemap"
  33. int pagemap_fd;
  34. int uffd;
  35. int page_size;
  36. int hpage_size;
  37. const char *progname;
  38. #define LEN(region) ((region.end - region.start)/page_size)
  39. static long pagemap_ioctl(void *start, int len, void *vec, int vec_len, int flag,
  40. int max_pages, long required_mask, long anyof_mask, long excluded_mask,
  41. long return_mask)
  42. {
  43. struct pm_scan_arg arg;
  44. arg.start = (uintptr_t)start;
  45. arg.end = (uintptr_t)(start + len);
  46. arg.vec = (uintptr_t)vec;
  47. arg.vec_len = vec_len;
  48. arg.flags = flag;
  49. arg.size = sizeof(struct pm_scan_arg);
  50. arg.max_pages = max_pages;
  51. arg.category_mask = required_mask;
  52. arg.category_anyof_mask = anyof_mask;
  53. arg.category_inverted = excluded_mask;
  54. arg.return_mask = return_mask;
  55. return ioctl(pagemap_fd, PAGEMAP_SCAN, &arg);
  56. }
  57. static long pagemap_ioc(void *start, int len, void *vec, int vec_len, int flag,
  58. int max_pages, long required_mask, long anyof_mask, long excluded_mask,
  59. long return_mask, long *walk_end)
  60. {
  61. struct pm_scan_arg arg;
  62. int ret;
  63. arg.start = (uintptr_t)start;
  64. arg.end = (uintptr_t)(start + len);
  65. arg.vec = (uintptr_t)vec;
  66. arg.vec_len = vec_len;
  67. arg.flags = flag;
  68. arg.size = sizeof(struct pm_scan_arg);
  69. arg.max_pages = max_pages;
  70. arg.category_mask = required_mask;
  71. arg.category_anyof_mask = anyof_mask;
  72. arg.category_inverted = excluded_mask;
  73. arg.return_mask = return_mask;
  74. ret = ioctl(pagemap_fd, PAGEMAP_SCAN, &arg);
  75. if (walk_end)
  76. *walk_end = arg.walk_end;
  77. return ret;
  78. }
  79. int init_uffd(void)
  80. {
  81. struct uffdio_api uffdio_api;
  82. uffd = syscall(__NR_userfaultfd, O_CLOEXEC | O_NONBLOCK | UFFD_USER_MODE_ONLY);
  83. if (uffd == -1)
  84. return uffd;
  85. uffdio_api.api = UFFD_API;
  86. uffdio_api.features = UFFD_FEATURE_WP_UNPOPULATED | UFFD_FEATURE_WP_ASYNC |
  87. UFFD_FEATURE_WP_HUGETLBFS_SHMEM;
  88. if (ioctl(uffd, UFFDIO_API, &uffdio_api))
  89. return -1;
  90. if (!(uffdio_api.api & UFFDIO_REGISTER_MODE_WP) ||
  91. !(uffdio_api.features & UFFD_FEATURE_WP_UNPOPULATED) ||
  92. !(uffdio_api.features & UFFD_FEATURE_WP_ASYNC) ||
  93. !(uffdio_api.features & UFFD_FEATURE_WP_HUGETLBFS_SHMEM))
  94. return -1;
  95. return 0;
  96. }
  97. int wp_init(void *lpBaseAddress, int dwRegionSize)
  98. {
  99. struct uffdio_register uffdio_register;
  100. struct uffdio_writeprotect wp;
  101. uffdio_register.range.start = (unsigned long)lpBaseAddress;
  102. uffdio_register.range.len = dwRegionSize;
  103. uffdio_register.mode = UFFDIO_REGISTER_MODE_WP;
  104. if (ioctl(uffd, UFFDIO_REGISTER, &uffdio_register))
  105. ksft_exit_fail_msg("ioctl(UFFDIO_REGISTER) %d %s\n", errno, strerror(errno));
  106. if (!(uffdio_register.ioctls & UFFDIO_WRITEPROTECT))
  107. ksft_exit_fail_msg("ioctl set is incorrect\n");
  108. wp.range.start = (unsigned long)lpBaseAddress;
  109. wp.range.len = dwRegionSize;
  110. wp.mode = UFFDIO_WRITEPROTECT_MODE_WP;
  111. if (ioctl(uffd, UFFDIO_WRITEPROTECT, &wp))
  112. ksft_exit_fail_msg("ioctl(UFFDIO_WRITEPROTECT)\n");
  113. return 0;
  114. }
  115. int wp_free(void *lpBaseAddress, int dwRegionSize)
  116. {
  117. struct uffdio_register uffdio_register;
  118. uffdio_register.range.start = (unsigned long)lpBaseAddress;
  119. uffdio_register.range.len = dwRegionSize;
  120. uffdio_register.mode = UFFDIO_REGISTER_MODE_WP;
  121. if (ioctl(uffd, UFFDIO_UNREGISTER, &uffdio_register.range))
  122. ksft_exit_fail_msg("ioctl unregister failure\n");
  123. return 0;
  124. }
  125. int wp_addr_range(void *lpBaseAddress, int dwRegionSize)
  126. {
  127. if (pagemap_ioctl(lpBaseAddress, dwRegionSize, NULL, 0,
  128. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  129. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN) < 0)
  130. ksft_exit_fail_msg("error %d %d %s\n", 1, errno, strerror(errno));
  131. return 0;
  132. }
  133. void *gethugetlb_mem(int size, int *shmid)
  134. {
  135. char *mem;
  136. if (shmid) {
  137. *shmid = shmget(2, size, SHM_HUGETLB | IPC_CREAT | SHM_R | SHM_W);
  138. if (*shmid < 0)
  139. return NULL;
  140. mem = shmat(*shmid, 0, 0);
  141. if (mem == (char *)-1) {
  142. shmctl(*shmid, IPC_RMID, NULL);
  143. ksft_exit_fail_msg("Shared memory attach failure\n");
  144. }
  145. } else {
  146. mem = mmap(NULL, size, PROT_READ | PROT_WRITE,
  147. MAP_ANONYMOUS | MAP_HUGETLB | MAP_PRIVATE, -1, 0);
  148. if (mem == MAP_FAILED)
  149. return NULL;
  150. }
  151. return mem;
  152. }
  153. int userfaultfd_tests(void)
  154. {
  155. int mem_size, vec_size, written, num_pages = 16;
  156. char *mem, *vec;
  157. mem_size = num_pages * page_size;
  158. mem = mmap(NULL, mem_size, PROT_NONE, MAP_PRIVATE | MAP_ANON, -1, 0);
  159. if (mem == MAP_FAILED)
  160. ksft_exit_fail_msg("error nomem\n");
  161. wp_init(mem, mem_size);
  162. /* Change protection of pages differently */
  163. mprotect(mem, mem_size/8, PROT_READ|PROT_WRITE);
  164. mprotect(mem + 1 * mem_size/8, mem_size/8, PROT_READ);
  165. mprotect(mem + 2 * mem_size/8, mem_size/8, PROT_READ|PROT_WRITE);
  166. mprotect(mem + 3 * mem_size/8, mem_size/8, PROT_READ);
  167. mprotect(mem + 4 * mem_size/8, mem_size/8, PROT_READ|PROT_WRITE);
  168. mprotect(mem + 5 * mem_size/8, mem_size/8, PROT_NONE);
  169. mprotect(mem + 6 * mem_size/8, mem_size/8, PROT_READ|PROT_WRITE);
  170. mprotect(mem + 7 * mem_size/8, mem_size/8, PROT_READ);
  171. wp_addr_range(mem + (mem_size/16), mem_size - 2 * (mem_size/8));
  172. wp_addr_range(mem, mem_size);
  173. vec_size = mem_size/page_size;
  174. vec = malloc(sizeof(struct page_region) * vec_size);
  175. written = pagemap_ioctl(mem, mem_size, vec, 1, PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  176. vec_size - 2, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  177. if (written < 0)
  178. ksft_exit_fail_msg("error %d %d %s\n", written, errno, strerror(errno));
  179. ksft_test_result(written == 0, "%s all new pages must not be written (dirty)\n", __func__);
  180. wp_free(mem, mem_size);
  181. munmap(mem, mem_size);
  182. free(vec);
  183. return 0;
  184. }
  185. int get_reads(struct page_region *vec, int vec_size)
  186. {
  187. int i, sum = 0;
  188. for (i = 0; i < vec_size; i++)
  189. sum += LEN(vec[i]);
  190. return sum;
  191. }
  192. int sanity_tests_sd(void)
  193. {
  194. int mem_size, vec_size, ret, ret2, ret3, i, num_pages = 1000, total_pages = 0;
  195. int total_writes, total_reads, reads, count;
  196. struct page_region *vec, *vec2;
  197. char *mem, *m[2];
  198. long walk_end;
  199. vec_size = num_pages/2;
  200. mem_size = num_pages * page_size;
  201. vec = malloc(sizeof(struct page_region) * vec_size);
  202. if (!vec)
  203. ksft_exit_fail_msg("error nomem\n");
  204. vec2 = malloc(sizeof(struct page_region) * vec_size);
  205. if (!vec2)
  206. ksft_exit_fail_msg("error nomem\n");
  207. mem = mmap(NULL, mem_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
  208. if (mem == MAP_FAILED)
  209. ksft_exit_fail_msg("error nomem\n");
  210. wp_init(mem, mem_size);
  211. wp_addr_range(mem, mem_size);
  212. /* 1. wrong operation */
  213. ksft_test_result(pagemap_ioctl(mem, 0, vec, vec_size, 0,
  214. 0, PAGEMAP_BITS_ALL, 0, 0, PAGEMAP_BITS_ALL) == 0,
  215. "%s Zero range size is valid\n", __func__);
  216. ksft_test_result(pagemap_ioctl(mem, mem_size, NULL, vec_size, 0,
  217. 0, PAGEMAP_BITS_ALL, 0, 0, PAGEMAP_BITS_ALL) < 0,
  218. "%s output buffer must be specified with size\n", __func__);
  219. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, 0, 0,
  220. 0, PAGEMAP_BITS_ALL, 0, 0, PAGEMAP_BITS_ALL) == 0,
  221. "%s output buffer can be 0\n", __func__);
  222. ksft_test_result(pagemap_ioctl(mem, mem_size, 0, 0, 0,
  223. 0, PAGEMAP_BITS_ALL, 0, 0, PAGEMAP_BITS_ALL) == 0,
  224. "%s output buffer can be 0\n", __func__);
  225. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, -1,
  226. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN) < 0,
  227. "%s wrong flag specified\n", __func__);
  228. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size,
  229. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC | 0xFF,
  230. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN) < 0,
  231. "%s flag has extra bits specified\n", __func__);
  232. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0,
  233. 0, 0, 0, 0, PAGE_IS_WRITTEN) >= 0,
  234. "%s no selection mask is specified\n", __func__);
  235. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0,
  236. 0, PAGE_IS_WRITTEN, PAGE_IS_WRITTEN, 0, 0) == 0,
  237. "%s no return mask is specified\n", __func__);
  238. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0,
  239. 0, PAGE_IS_WRITTEN, 0, 0, 0x1000) < 0,
  240. "%s wrong return mask specified\n", __func__);
  241. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size,
  242. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  243. 0, 0xFFF, PAGE_IS_WRITTEN, 0, PAGE_IS_WRITTEN) < 0,
  244. "%s mixture of correct and wrong flag\n", __func__);
  245. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size,
  246. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  247. 0, 0, 0, PAGEMAP_BITS_ALL, PAGE_IS_WRITTEN) >= 0,
  248. "%s PAGEMAP_BITS_ALL can be specified with PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC\n",
  249. __func__);
  250. /* 2. Clear area with larger vec size */
  251. ret = pagemap_ioctl(mem, mem_size, vec, vec_size,
  252. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC, 0,
  253. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  254. ksft_test_result(ret >= 0, "%s Clear area with larger vec size\n", __func__);
  255. /* 3. Repeated pattern of written and non-written pages */
  256. for (i = 0; i < mem_size; i += 2 * page_size)
  257. mem[i]++;
  258. ret = pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0, PAGE_IS_WRITTEN, 0,
  259. 0, PAGE_IS_WRITTEN);
  260. if (ret < 0)
  261. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  262. ksft_test_result(ret == mem_size/(page_size * 2),
  263. "%s Repeated pattern of written and non-written pages\n", __func__);
  264. /* 4. Repeated pattern of written and non-written pages in parts */
  265. ret = pagemap_ioctl(mem, mem_size, vec, vec_size,
  266. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  267. num_pages/2 - 2, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  268. if (ret < 0)
  269. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  270. ret2 = pagemap_ioctl(mem, mem_size, vec, 2, 0, 0, PAGE_IS_WRITTEN, 0, 0,
  271. PAGE_IS_WRITTEN);
  272. if (ret2 < 0)
  273. ksft_exit_fail_msg("error %d %d %s\n", ret2, errno, strerror(errno));
  274. ret3 = pagemap_ioctl(mem, mem_size, vec, vec_size,
  275. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  276. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  277. if (ret3 < 0)
  278. ksft_exit_fail_msg("error %d %d %s\n", ret3, errno, strerror(errno));
  279. ksft_test_result((ret + ret3) == num_pages/2 && ret2 == 2,
  280. "%s Repeated pattern of written and non-written pages in parts %d %d %d\n",
  281. __func__, ret, ret3, ret2);
  282. /* 5. Repeated pattern of written and non-written pages max_pages */
  283. for (i = 0; i < mem_size; i += 2 * page_size)
  284. mem[i]++;
  285. mem[(mem_size/page_size - 1) * page_size]++;
  286. ret = pagemap_ioctl(mem, mem_size, vec, vec_size,
  287. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  288. num_pages/2, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  289. if (ret < 0)
  290. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  291. ret2 = pagemap_ioctl(mem, mem_size, vec, vec_size,
  292. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  293. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  294. if (ret2 < 0)
  295. ksft_exit_fail_msg("error %d %d %s\n", ret2, errno, strerror(errno));
  296. ksft_test_result(ret == num_pages/2 && ret2 == 1,
  297. "%s Repeated pattern of written and non-written pages max_pages\n",
  298. __func__);
  299. /* 6. only get 2 dirty pages and clear them as well */
  300. vec_size = mem_size/page_size;
  301. memset(mem, -1, mem_size);
  302. /* get and clear second and third pages */
  303. ret = pagemap_ioctl(mem + page_size, 2 * page_size, vec, 1,
  304. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  305. 2, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  306. if (ret < 0)
  307. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  308. ret2 = pagemap_ioctl(mem, mem_size, vec2, vec_size, 0, 0,
  309. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  310. if (ret2 < 0)
  311. ksft_exit_fail_msg("error %d %d %s\n", ret2, errno, strerror(errno));
  312. ksft_test_result(ret == 1 && LEN(vec[0]) == 2 &&
  313. vec[0].start == (uintptr_t)(mem + page_size) &&
  314. ret2 == 2 && LEN(vec2[0]) == 1 && vec2[0].start == (uintptr_t)mem &&
  315. LEN(vec2[1]) == vec_size - 3 &&
  316. vec2[1].start == (uintptr_t)(mem + 3 * page_size),
  317. "%s only get 2 written pages and clear them as well\n", __func__);
  318. wp_free(mem, mem_size);
  319. munmap(mem, mem_size);
  320. /* 7. Two regions */
  321. m[0] = mmap(NULL, mem_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
  322. if (m[0] == MAP_FAILED)
  323. ksft_exit_fail_msg("error nomem\n");
  324. m[1] = mmap(NULL, mem_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
  325. if (m[1] == MAP_FAILED)
  326. ksft_exit_fail_msg("error nomem\n");
  327. wp_init(m[0], mem_size);
  328. wp_init(m[1], mem_size);
  329. wp_addr_range(m[0], mem_size);
  330. wp_addr_range(m[1], mem_size);
  331. memset(m[0], 'a', mem_size);
  332. memset(m[1], 'b', mem_size);
  333. wp_addr_range(m[0], mem_size);
  334. ret = pagemap_ioctl(m[1], mem_size, vec, 1, 0, 0, PAGE_IS_WRITTEN, 0, 0,
  335. PAGE_IS_WRITTEN);
  336. if (ret < 0)
  337. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  338. ksft_test_result(ret == 1 && LEN(vec[0]) == mem_size/page_size,
  339. "%s Two regions\n", __func__);
  340. wp_free(m[0], mem_size);
  341. wp_free(m[1], mem_size);
  342. munmap(m[0], mem_size);
  343. munmap(m[1], mem_size);
  344. free(vec);
  345. free(vec2);
  346. /* 8. Smaller vec */
  347. mem_size = 1050 * page_size;
  348. vec_size = mem_size/(page_size*2);
  349. vec = malloc(sizeof(struct page_region) * vec_size);
  350. if (!vec)
  351. ksft_exit_fail_msg("error nomem\n");
  352. mem = mmap(NULL, mem_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
  353. if (mem == MAP_FAILED)
  354. ksft_exit_fail_msg("error nomem\n");
  355. wp_init(mem, mem_size);
  356. wp_addr_range(mem, mem_size);
  357. ret = pagemap_ioctl(mem, mem_size, vec, vec_size,
  358. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC, 0,
  359. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  360. if (ret < 0)
  361. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  362. for (i = 0; i < mem_size/page_size; i += 2)
  363. mem[i * page_size]++;
  364. ret = pagemap_ioctl(mem, mem_size, vec, vec_size,
  365. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  366. mem_size/(page_size*5), PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  367. if (ret < 0)
  368. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  369. total_pages += ret;
  370. ret = pagemap_ioctl(mem, mem_size, vec, vec_size,
  371. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  372. mem_size/(page_size*5), PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  373. if (ret < 0)
  374. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  375. total_pages += ret;
  376. ret = pagemap_ioctl(mem, mem_size, vec, vec_size,
  377. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  378. mem_size/(page_size*5), PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  379. if (ret < 0)
  380. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  381. total_pages += ret;
  382. ksft_test_result(total_pages == mem_size/(page_size*2), "%s Smaller max_pages\n", __func__);
  383. free(vec);
  384. wp_free(mem, mem_size);
  385. munmap(mem, mem_size);
  386. total_pages = 0;
  387. /* 9. Smaller vec */
  388. mem_size = 10000 * page_size;
  389. vec_size = 50;
  390. vec = malloc(sizeof(struct page_region) * vec_size);
  391. if (!vec)
  392. ksft_exit_fail_msg("error nomem\n");
  393. mem = mmap(NULL, mem_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
  394. if (mem == MAP_FAILED)
  395. ksft_exit_fail_msg("error nomem\n");
  396. wp_init(mem, mem_size);
  397. wp_addr_range(mem, mem_size);
  398. for (count = 0; count < TEST_ITERATIONS; count++) {
  399. total_writes = total_reads = 0;
  400. walk_end = (long)mem;
  401. for (i = 0; i < mem_size; i += page_size) {
  402. if (rand() % 2) {
  403. mem[i]++;
  404. total_writes++;
  405. }
  406. }
  407. while (total_reads < total_writes) {
  408. ret = pagemap_ioc((void *)walk_end, mem_size-(walk_end - (long)mem), vec,
  409. vec_size, PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  410. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  411. if (ret < 0)
  412. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  413. if (ret > vec_size)
  414. break;
  415. reads = get_reads(vec, ret);
  416. total_reads += reads;
  417. }
  418. if (total_reads != total_writes)
  419. break;
  420. }
  421. ksft_test_result(count == TEST_ITERATIONS, "Smaller vec\n");
  422. free(vec);
  423. wp_free(mem, mem_size);
  424. munmap(mem, mem_size);
  425. /* 10. Walk_end tester */
  426. vec_size = 1000;
  427. mem_size = vec_size * page_size;
  428. vec = malloc(sizeof(struct page_region) * vec_size);
  429. if (!vec)
  430. ksft_exit_fail_msg("error nomem\n");
  431. mem = mmap(NULL, mem_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
  432. if (mem == MAP_FAILED)
  433. ksft_exit_fail_msg("error nomem\n");
  434. wp_init(mem, mem_size);
  435. wp_addr_range(mem, mem_size);
  436. memset(mem, 0, mem_size);
  437. ret = pagemap_ioc(mem, 0, vec, vec_size, 0,
  438. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  439. if (ret < 0)
  440. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  441. ksft_test_result(ret == 0 && walk_end == (long)mem,
  442. "Walk_end: Same start and end address\n");
  443. ret = pagemap_ioc(mem, 0, vec, vec_size, PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  444. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  445. if (ret < 0)
  446. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  447. ksft_test_result(ret == 0 && walk_end == (long)mem,
  448. "Walk_end: Same start and end with WP\n");
  449. ret = pagemap_ioc(mem, 0, vec, 0, PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  450. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  451. if (ret < 0)
  452. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  453. ksft_test_result(ret == 0 && walk_end == (long)mem,
  454. "Walk_end: Same start and end with 0 output buffer\n");
  455. ret = pagemap_ioc(mem, mem_size, vec, vec_size, 0,
  456. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  457. if (ret < 0)
  458. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  459. ksft_test_result(ret == 1 && walk_end == (long)(mem + mem_size),
  460. "Walk_end: Big vec\n");
  461. ret = pagemap_ioc(mem, mem_size, vec, 1, 0,
  462. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  463. if (ret < 0)
  464. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  465. ksft_test_result(ret == 1 && walk_end == (long)(mem + mem_size),
  466. "Walk_end: vec of minimum length\n");
  467. ret = pagemap_ioc(mem, mem_size, vec, 1, 0,
  468. vec_size, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  469. if (ret < 0)
  470. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  471. ksft_test_result(ret == 1 && walk_end == (long)(mem + mem_size),
  472. "Walk_end: Max pages specified\n");
  473. ret = pagemap_ioc(mem, mem_size, vec, vec_size, 0,
  474. vec_size/2, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  475. if (ret < 0)
  476. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  477. ksft_test_result(ret == 1 && walk_end == (long)(mem + mem_size/2),
  478. "Walk_end: Half max pages\n");
  479. ret = pagemap_ioc(mem, mem_size, vec, vec_size, 0,
  480. 1, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  481. if (ret < 0)
  482. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  483. ksft_test_result(ret == 1 && walk_end == (long)(mem + page_size),
  484. "Walk_end: 1 max page\n");
  485. ret = pagemap_ioc(mem, mem_size, vec, vec_size, 0,
  486. -1, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  487. if (ret < 0)
  488. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  489. ksft_test_result(ret == 1 && walk_end == (long)(mem + mem_size),
  490. "Walk_end: max pages\n");
  491. wp_addr_range(mem, mem_size);
  492. for (i = 0; i < mem_size; i += 2 * page_size)
  493. mem[i]++;
  494. ret = pagemap_ioc(mem, mem_size, vec, vec_size, 0,
  495. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  496. if (ret < 0)
  497. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  498. ksft_test_result(ret == vec_size/2 && walk_end == (long)(mem + mem_size),
  499. "Walk_end sparse: Big vec\n");
  500. ret = pagemap_ioc(mem, mem_size, vec, 1, 0,
  501. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  502. if (ret < 0)
  503. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  504. ksft_test_result(ret == 1 && walk_end == (long)(mem + page_size * 2),
  505. "Walk_end sparse: vec of minimum length\n");
  506. ret = pagemap_ioc(mem, mem_size, vec, 1, 0,
  507. vec_size, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  508. if (ret < 0)
  509. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  510. ksft_test_result(ret == 1 && walk_end == (long)(mem + page_size * 2),
  511. "Walk_end sparse: Max pages specified\n");
  512. ret = pagemap_ioc(mem, mem_size, vec, vec_size/2, 0,
  513. vec_size, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  514. if (ret < 0)
  515. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  516. ksft_test_result(ret == vec_size/2 && walk_end == (long)(mem + mem_size),
  517. "Walk_end sparse: Max pages specified\n");
  518. ret = pagemap_ioc(mem, mem_size, vec, vec_size, 0,
  519. vec_size, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  520. if (ret < 0)
  521. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  522. ksft_test_result(ret == vec_size/2 && walk_end == (long)(mem + mem_size),
  523. "Walk_end sparse: Max pages specified\n");
  524. ret = pagemap_ioc(mem, mem_size, vec, vec_size, 0,
  525. vec_size/2, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  526. if (ret < 0)
  527. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  528. ksft_test_result(ret == vec_size/2 && walk_end == (long)(mem + mem_size),
  529. "Walk_endsparse : Half max pages\n");
  530. ret = pagemap_ioc(mem, mem_size, vec, vec_size, 0,
  531. 1, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN, &walk_end);
  532. if (ret < 0)
  533. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  534. ksft_test_result(ret == 1 && walk_end == (long)(mem + page_size * 2),
  535. "Walk_end: 1 max page\n");
  536. free(vec);
  537. wp_free(mem, mem_size);
  538. munmap(mem, mem_size);
  539. return 0;
  540. }
  541. int base_tests(char *prefix, char *mem, int mem_size, int skip)
  542. {
  543. int vec_size, written;
  544. struct page_region *vec, *vec2;
  545. if (skip) {
  546. ksft_test_result_skip("%s all new pages must not be written (dirty)\n", prefix);
  547. ksft_test_result_skip("%s all pages must be written (dirty)\n", prefix);
  548. ksft_test_result_skip("%s all pages dirty other than first and the last one\n",
  549. prefix);
  550. ksft_test_result_skip("%s PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC\n", prefix);
  551. ksft_test_result_skip("%s only middle page dirty\n", prefix);
  552. ksft_test_result_skip("%s only two middle pages dirty\n", prefix);
  553. return 0;
  554. }
  555. vec_size = mem_size/page_size;
  556. vec = malloc(sizeof(struct page_region) * vec_size);
  557. vec2 = malloc(sizeof(struct page_region) * vec_size);
  558. /* 1. all new pages must be not be written (dirty) */
  559. written = pagemap_ioctl(mem, mem_size, vec, 1, PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  560. vec_size - 2, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  561. if (written < 0)
  562. ksft_exit_fail_msg("error %d %d %s\n", written, errno, strerror(errno));
  563. ksft_test_result(written == 0, "%s all new pages must not be written (dirty)\n", prefix);
  564. /* 2. all pages must be written */
  565. memset(mem, -1, mem_size);
  566. written = pagemap_ioctl(mem, mem_size, vec, 1, 0, 0, PAGE_IS_WRITTEN, 0, 0,
  567. PAGE_IS_WRITTEN);
  568. if (written < 0)
  569. ksft_exit_fail_msg("error %d %d %s\n", written, errno, strerror(errno));
  570. ksft_test_result(written == 1 && LEN(vec[0]) == mem_size/page_size,
  571. "%s all pages must be written (dirty)\n", prefix);
  572. /* 3. all pages dirty other than first and the last one */
  573. written = pagemap_ioctl(mem, mem_size, vec, 1, PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  574. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  575. if (written < 0)
  576. ksft_exit_fail_msg("error %d %d %s\n", written, errno, strerror(errno));
  577. memset(mem + page_size, 0, mem_size - (2 * page_size));
  578. written = pagemap_ioctl(mem, mem_size, vec, 1, PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  579. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  580. if (written < 0)
  581. ksft_exit_fail_msg("error %d %d %s\n", written, errno, strerror(errno));
  582. ksft_test_result(written == 1 && LEN(vec[0]) >= vec_size - 2 && LEN(vec[0]) <= vec_size,
  583. "%s all pages dirty other than first and the last one\n", prefix);
  584. written = pagemap_ioctl(mem, mem_size, vec, 1, 0, 0,
  585. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  586. if (written < 0)
  587. ksft_exit_fail_msg("error %d %d %s\n", written, errno, strerror(errno));
  588. ksft_test_result(written == 0,
  589. "%s PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC\n", prefix);
  590. /* 4. only middle page dirty */
  591. written = pagemap_ioctl(mem, mem_size, vec, 1, PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  592. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  593. if (written < 0)
  594. ksft_exit_fail_msg("error %d %d %s\n", written, errno, strerror(errno));
  595. mem[vec_size/2 * page_size]++;
  596. written = pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0, PAGE_IS_WRITTEN,
  597. 0, 0, PAGE_IS_WRITTEN);
  598. if (written < 0)
  599. ksft_exit_fail_msg("error %d %d %s\n", written, errno, strerror(errno));
  600. ksft_test_result(written == 1 && LEN(vec[0]) >= 1,
  601. "%s only middle page dirty\n", prefix);
  602. /* 5. only two middle pages dirty and walk over only middle pages */
  603. written = pagemap_ioctl(mem, mem_size, vec, 1, PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  604. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN | PAGE_IS_HUGE);
  605. if (written < 0)
  606. ksft_exit_fail_msg("error %d %d %s\n", written, errno, strerror(errno));
  607. mem[vec_size/2 * page_size]++;
  608. mem[(vec_size/2 + 1) * page_size]++;
  609. written = pagemap_ioctl(&mem[vec_size/2 * page_size], 2 * page_size, vec, 1, 0,
  610. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN | PAGE_IS_HUGE);
  611. if (written < 0)
  612. ksft_exit_fail_msg("error %d %d %s\n", written, errno, strerror(errno));
  613. ksft_test_result(written == 1 && vec[0].start == (uintptr_t)(&mem[vec_size/2 * page_size])
  614. && LEN(vec[0]) == 2,
  615. "%s only two middle pages dirty\n", prefix);
  616. free(vec);
  617. free(vec2);
  618. return 0;
  619. }
  620. void *gethugepage(int map_size)
  621. {
  622. int ret;
  623. char *map;
  624. map = memalign(hpage_size, map_size);
  625. if (!map)
  626. ksft_exit_fail_msg("memalign failed %d %s\n", errno, strerror(errno));
  627. ret = madvise(map, map_size, MADV_HUGEPAGE);
  628. if (ret)
  629. return NULL;
  630. memset(map, 0, map_size);
  631. return map;
  632. }
  633. int hpage_unit_tests(void)
  634. {
  635. char *map;
  636. int ret, ret2;
  637. size_t num_pages = 10;
  638. int map_size = hpage_size * num_pages;
  639. int vec_size = map_size/page_size;
  640. struct page_region *vec, *vec2;
  641. vec = malloc(sizeof(struct page_region) * vec_size);
  642. vec2 = malloc(sizeof(struct page_region) * vec_size);
  643. if (!vec || !vec2)
  644. ksft_exit_fail_msg("malloc failed\n");
  645. map = gethugepage(map_size);
  646. if (map) {
  647. wp_init(map, map_size);
  648. wp_addr_range(map, map_size);
  649. /* 1. all new huge page must not be written (dirty) */
  650. ret = pagemap_ioctl(map, map_size, vec, vec_size,
  651. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC, 0,
  652. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  653. if (ret < 0)
  654. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  655. ksft_test_result(ret == 0, "%s all new huge page must not be written (dirty)\n",
  656. __func__);
  657. /* 2. all the huge page must not be written */
  658. ret = pagemap_ioctl(map, map_size, vec, vec_size, 0, 0,
  659. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  660. if (ret < 0)
  661. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  662. ksft_test_result(ret == 0, "%s all the huge page must not be written\n", __func__);
  663. /* 3. all the huge page must be written and clear dirty as well */
  664. memset(map, -1, map_size);
  665. ret = pagemap_ioctl(map, map_size, vec, vec_size,
  666. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  667. 0, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  668. if (ret < 0)
  669. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  670. ksft_test_result(ret == 1 && vec[0].start == (uintptr_t)map &&
  671. LEN(vec[0]) == vec_size && vec[0].categories == PAGE_IS_WRITTEN,
  672. "%s all the huge page must be written and clear\n", __func__);
  673. /* 4. only middle page written */
  674. wp_free(map, map_size);
  675. free(map);
  676. map = gethugepage(map_size);
  677. wp_init(map, map_size);
  678. wp_addr_range(map, map_size);
  679. map[vec_size/2 * page_size]++;
  680. ret = pagemap_ioctl(map, map_size, vec, vec_size, 0, 0,
  681. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  682. if (ret < 0)
  683. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  684. ksft_test_result(ret == 1 && LEN(vec[0]) > 0,
  685. "%s only middle page written\n", __func__);
  686. wp_free(map, map_size);
  687. free(map);
  688. } else {
  689. ksft_test_result_skip("%s all new huge page must be written\n", __func__);
  690. ksft_test_result_skip("%s all the huge page must not be written\n", __func__);
  691. ksft_test_result_skip("%s all the huge page must be written and clear\n", __func__);
  692. ksft_test_result_skip("%s only middle page written\n", __func__);
  693. }
  694. /* 5. clear first half of huge page */
  695. map = gethugepage(map_size);
  696. if (map) {
  697. wp_init(map, map_size);
  698. wp_addr_range(map, map_size);
  699. memset(map, 0, map_size);
  700. wp_addr_range(map, map_size/2);
  701. ret = pagemap_ioctl(map, map_size, vec, vec_size, 0, 0,
  702. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  703. if (ret < 0)
  704. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  705. ksft_test_result(ret == 1 && LEN(vec[0]) == vec_size/2 &&
  706. vec[0].start == (uintptr_t)(map + map_size/2),
  707. "%s clear first half of huge page\n", __func__);
  708. wp_free(map, map_size);
  709. free(map);
  710. } else {
  711. ksft_test_result_skip("%s clear first half of huge page\n", __func__);
  712. }
  713. /* 6. clear first half of huge page with limited buffer */
  714. map = gethugepage(map_size);
  715. if (map) {
  716. wp_init(map, map_size);
  717. wp_addr_range(map, map_size);
  718. memset(map, 0, map_size);
  719. ret = pagemap_ioctl(map, map_size, vec, vec_size,
  720. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  721. vec_size/2, PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  722. if (ret < 0)
  723. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  724. ret = pagemap_ioctl(map, map_size, vec, vec_size, 0, 0,
  725. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  726. if (ret < 0)
  727. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  728. ksft_test_result(ret == 1 && LEN(vec[0]) == vec_size/2 &&
  729. vec[0].start == (uintptr_t)(map + map_size/2),
  730. "%s clear first half of huge page with limited buffer\n",
  731. __func__);
  732. wp_free(map, map_size);
  733. free(map);
  734. } else {
  735. ksft_test_result_skip("%s clear first half of huge page with limited buffer\n",
  736. __func__);
  737. }
  738. /* 7. clear second half of huge page */
  739. map = gethugepage(map_size);
  740. if (map) {
  741. wp_init(map, map_size);
  742. wp_addr_range(map, map_size);
  743. memset(map, -1, map_size);
  744. ret = pagemap_ioctl(map + map_size/2, map_size/2, vec, vec_size,
  745. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC, vec_size/2,
  746. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  747. if (ret < 0)
  748. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  749. ret = pagemap_ioctl(map, map_size, vec, vec_size, 0, 0,
  750. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  751. if (ret < 0)
  752. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  753. ksft_test_result(ret == 1 && LEN(vec[0]) == vec_size/2,
  754. "%s clear second half huge page\n", __func__);
  755. wp_free(map, map_size);
  756. free(map);
  757. } else {
  758. ksft_test_result_skip("%s clear second half huge page\n", __func__);
  759. }
  760. /* 8. get half huge page */
  761. map = gethugepage(map_size);
  762. if (map) {
  763. wp_init(map, map_size);
  764. wp_addr_range(map, map_size);
  765. memset(map, -1, map_size);
  766. usleep(100);
  767. ret = pagemap_ioctl(map, map_size, vec, 1,
  768. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  769. hpage_size/(2*page_size), PAGE_IS_WRITTEN, 0, 0,
  770. PAGE_IS_WRITTEN);
  771. if (ret < 0)
  772. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  773. ksft_test_result(ret == 1 && LEN(vec[0]) == hpage_size/(2*page_size),
  774. "%s get half huge page\n", __func__);
  775. ret2 = pagemap_ioctl(map, map_size, vec, vec_size, 0, 0,
  776. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN);
  777. if (ret2 < 0)
  778. ksft_exit_fail_msg("error %d %d %s\n", ret2, errno, strerror(errno));
  779. ksft_test_result(ret2 == 1 && LEN(vec[0]) == (map_size - hpage_size/2)/page_size,
  780. "%s get half huge page\n", __func__);
  781. wp_free(map, map_size);
  782. free(map);
  783. } else {
  784. ksft_test_result_skip("%s get half huge page\n", __func__);
  785. ksft_test_result_skip("%s get half huge page\n", __func__);
  786. }
  787. free(vec);
  788. free(vec2);
  789. return 0;
  790. }
  791. int unmapped_region_tests(void)
  792. {
  793. void *start = (void *)0x10000000;
  794. int written, len = 0x00040000;
  795. int vec_size = len / page_size;
  796. struct page_region *vec = malloc(sizeof(struct page_region) * vec_size);
  797. /* 1. Get written pages */
  798. written = pagemap_ioctl(start, len, vec, vec_size, 0, 0,
  799. PAGEMAP_NON_WRITTEN_BITS, 0, 0, PAGEMAP_NON_WRITTEN_BITS);
  800. if (written < 0)
  801. ksft_exit_fail_msg("error %d %d %s\n", written, errno, strerror(errno));
  802. ksft_test_result(written >= 0, "%s Get status of pages\n", __func__);
  803. free(vec);
  804. return 0;
  805. }
  806. static void test_simple(void)
  807. {
  808. int i;
  809. char *map;
  810. struct page_region vec;
  811. map = aligned_alloc(page_size, page_size);
  812. if (!map)
  813. ksft_exit_fail_msg("aligned_alloc failed\n");
  814. wp_init(map, page_size);
  815. wp_addr_range(map, page_size);
  816. for (i = 0 ; i < TEST_ITERATIONS; i++) {
  817. if (pagemap_ioctl(map, page_size, &vec, 1, 0, 0,
  818. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN) == 1) {
  819. ksft_print_msg("written bit was 1, but should be 0 (i=%d)\n", i);
  820. break;
  821. }
  822. wp_addr_range(map, page_size);
  823. /* Write something to the page to get the written bit enabled on the page */
  824. map[0]++;
  825. if (pagemap_ioctl(map, page_size, &vec, 1, 0, 0,
  826. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN) == 0) {
  827. ksft_print_msg("written bit was 0, but should be 1 (i=%d)\n", i);
  828. break;
  829. }
  830. wp_addr_range(map, page_size);
  831. }
  832. wp_free(map, page_size);
  833. free(map);
  834. ksft_test_result(i == TEST_ITERATIONS, "Test %s\n", __func__);
  835. }
  836. int sanity_tests(void)
  837. {
  838. int mem_size, vec_size, ret, fd, i, buf_size;
  839. struct page_region *vec;
  840. char *mem, *fmem;
  841. struct stat sbuf;
  842. char *tmp_buf;
  843. /* 1. wrong operation */
  844. mem_size = 10 * page_size;
  845. vec_size = mem_size / page_size;
  846. vec = malloc(sizeof(struct page_region) * vec_size);
  847. mem = mmap(NULL, mem_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
  848. if (mem == MAP_FAILED || vec == MAP_FAILED)
  849. ksft_exit_fail_msg("error nomem\n");
  850. wp_init(mem, mem_size);
  851. wp_addr_range(mem, mem_size);
  852. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size,
  853. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC,
  854. 0, PAGEMAP_BITS_ALL, 0, 0, PAGEMAP_BITS_ALL) >= 0,
  855. "%s WP op can be specified with !PAGE_IS_WRITTEN\n", __func__);
  856. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
  857. PAGEMAP_BITS_ALL, 0, 0, PAGEMAP_BITS_ALL) >= 0,
  858. "%s required_mask specified\n", __func__);
  859. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
  860. 0, PAGEMAP_BITS_ALL, 0, PAGEMAP_BITS_ALL) >= 0,
  861. "%s anyof_mask specified\n", __func__);
  862. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
  863. 0, 0, PAGEMAP_BITS_ALL, PAGEMAP_BITS_ALL) >= 0,
  864. "%s excluded_mask specified\n", __func__);
  865. ksft_test_result(pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
  866. PAGEMAP_BITS_ALL, PAGEMAP_BITS_ALL, 0,
  867. PAGEMAP_BITS_ALL) >= 0,
  868. "%s required_mask and anyof_mask specified\n", __func__);
  869. wp_free(mem, mem_size);
  870. munmap(mem, mem_size);
  871. /* 2. Get sd and present pages with anyof_mask */
  872. mem = mmap(NULL, mem_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
  873. if (mem == MAP_FAILED)
  874. ksft_exit_fail_msg("error nomem\n");
  875. wp_init(mem, mem_size);
  876. wp_addr_range(mem, mem_size);
  877. memset(mem, 0, mem_size);
  878. ret = pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
  879. 0, PAGEMAP_BITS_ALL, 0, PAGEMAP_BITS_ALL);
  880. ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
  881. (vec[0].categories & (PAGE_IS_WRITTEN | PAGE_IS_PRESENT)) ==
  882. (PAGE_IS_WRITTEN | PAGE_IS_PRESENT),
  883. "%s Get sd and present pages with anyof_mask\n", __func__);
  884. /* 3. Get sd and present pages with required_mask */
  885. ret = pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
  886. PAGEMAP_BITS_ALL, 0, 0, PAGEMAP_BITS_ALL);
  887. ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
  888. (vec[0].categories & (PAGE_IS_WRITTEN | PAGE_IS_PRESENT)) ==
  889. (PAGE_IS_WRITTEN | PAGE_IS_PRESENT),
  890. "%s Get all the pages with required_mask\n", __func__);
  891. /* 4. Get sd and present pages with required_mask and anyof_mask */
  892. ret = pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
  893. PAGE_IS_WRITTEN, PAGE_IS_PRESENT, 0, PAGEMAP_BITS_ALL);
  894. ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
  895. (vec[0].categories & (PAGE_IS_WRITTEN | PAGE_IS_PRESENT)) ==
  896. (PAGE_IS_WRITTEN | PAGE_IS_PRESENT),
  897. "%s Get sd and present pages with required_mask and anyof_mask\n",
  898. __func__);
  899. /* 5. Don't get sd pages */
  900. ret = pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
  901. PAGE_IS_WRITTEN, 0, PAGE_IS_WRITTEN, PAGEMAP_BITS_ALL);
  902. ksft_test_result(ret == 0, "%s Don't get sd pages\n", __func__);
  903. /* 6. Don't get present pages */
  904. ret = pagemap_ioctl(mem, mem_size, vec, vec_size, 0, 0,
  905. PAGE_IS_PRESENT, 0, PAGE_IS_PRESENT, PAGEMAP_BITS_ALL);
  906. ksft_test_result(ret == 0, "%s Don't get present pages\n", __func__);
  907. wp_free(mem, mem_size);
  908. munmap(mem, mem_size);
  909. /* 8. Find written present pages with return mask */
  910. mem = mmap(NULL, mem_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
  911. if (mem == MAP_FAILED)
  912. ksft_exit_fail_msg("error nomem\n");
  913. wp_init(mem, mem_size);
  914. wp_addr_range(mem, mem_size);
  915. memset(mem, 0, mem_size);
  916. ret = pagemap_ioctl(mem, mem_size, vec, vec_size,
  917. PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC, 0,
  918. 0, PAGEMAP_BITS_ALL, 0, PAGE_IS_WRITTEN);
  919. ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)mem && LEN(vec[0]) == vec_size &&
  920. vec[0].categories == PAGE_IS_WRITTEN,
  921. "%s Find written present pages with return mask\n", __func__);
  922. wp_free(mem, mem_size);
  923. munmap(mem, mem_size);
  924. /* 9. Memory mapped file */
  925. fd = open(progname, O_RDONLY);
  926. if (fd < 0)
  927. ksft_exit_fail_msg("%s Memory mapped file\n", __func__);
  928. ret = stat(progname, &sbuf);
  929. if (ret < 0)
  930. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  931. fmem = mmap(NULL, sbuf.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
  932. if (fmem == MAP_FAILED)
  933. ksft_exit_fail_msg("error nomem %d %s\n", errno, strerror(errno));
  934. tmp_buf = malloc(sbuf.st_size);
  935. memcpy(tmp_buf, fmem, sbuf.st_size);
  936. ret = pagemap_ioctl(fmem, sbuf.st_size, vec, vec_size, 0, 0,
  937. 0, PAGEMAP_NON_WRITTEN_BITS, 0, PAGEMAP_NON_WRITTEN_BITS);
  938. ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)fmem &&
  939. LEN(vec[0]) == ceilf((float)sbuf.st_size/page_size) &&
  940. (vec[0].categories & PAGE_IS_FILE),
  941. "%s Memory mapped file\n", __func__);
  942. munmap(fmem, sbuf.st_size);
  943. close(fd);
  944. /* 10. Create and read/write to a memory mapped file */
  945. buf_size = page_size * 10;
  946. fd = open(__FILE__".tmp2", O_RDWR | O_CREAT, 0666);
  947. if (fd < 0)
  948. ksft_exit_fail_msg("Read/write to memory: %s\n",
  949. strerror(errno));
  950. for (i = 0; i < buf_size; i++)
  951. if (write(fd, "c", 1) < 0)
  952. ksft_exit_fail_msg("Create and read/write to a memory mapped file\n");
  953. fmem = mmap(NULL, buf_size, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0);
  954. if (fmem == MAP_FAILED)
  955. ksft_exit_fail_msg("error nomem %d %s\n", errno, strerror(errno));
  956. wp_init(fmem, buf_size);
  957. wp_addr_range(fmem, buf_size);
  958. for (i = 0; i < buf_size; i++)
  959. fmem[i] = 'z';
  960. msync(fmem, buf_size, MS_SYNC);
  961. ret = pagemap_ioctl(fmem, buf_size, vec, vec_size, 0, 0,
  962. PAGE_IS_WRITTEN, PAGE_IS_PRESENT | PAGE_IS_SWAPPED | PAGE_IS_FILE, 0,
  963. PAGEMAP_BITS_ALL);
  964. ksft_test_result(ret >= 0 && vec[0].start == (uintptr_t)fmem &&
  965. LEN(vec[0]) == (buf_size/page_size) &&
  966. (vec[0].categories & PAGE_IS_WRITTEN),
  967. "%s Read/write to memory\n", __func__);
  968. wp_free(fmem, buf_size);
  969. munmap(fmem, buf_size);
  970. close(fd);
  971. free(vec);
  972. return 0;
  973. }
  974. int mprotect_tests(void)
  975. {
  976. int ret;
  977. char *mem, *mem2;
  978. struct page_region vec;
  979. int pagemap_fd = open("/proc/self/pagemap", O_RDONLY);
  980. if (pagemap_fd < 0) {
  981. fprintf(stderr, "open() failed\n");
  982. exit(1);
  983. }
  984. /* 1. Map two pages */
  985. mem = mmap(0, 2 * page_size, PROT_READ|PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
  986. if (mem == MAP_FAILED)
  987. ksft_exit_fail_msg("error nomem\n");
  988. wp_init(mem, 2 * page_size);
  989. wp_addr_range(mem, 2 * page_size);
  990. /* Populate both pages. */
  991. memset(mem, 1, 2 * page_size);
  992. ret = pagemap_ioctl(mem, 2 * page_size, &vec, 1, 0, 0, PAGE_IS_WRITTEN,
  993. 0, 0, PAGE_IS_WRITTEN);
  994. if (ret < 0)
  995. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  996. ksft_test_result(ret == 1 && LEN(vec) == 2, "%s Both pages written\n", __func__);
  997. /* 2. Start tracking */
  998. wp_addr_range(mem, 2 * page_size);
  999. ksft_test_result(pagemap_ioctl(mem, 2 * page_size, &vec, 1, 0, 0,
  1000. PAGE_IS_WRITTEN, 0, 0, PAGE_IS_WRITTEN) == 0,
  1001. "%s Both pages are not written (dirty)\n", __func__);
  1002. /* 3. Remap the second page */
  1003. mem2 = mmap(mem + page_size, page_size, PROT_READ|PROT_WRITE,
  1004. MAP_PRIVATE|MAP_ANON|MAP_FIXED, -1, 0);
  1005. if (mem2 == MAP_FAILED)
  1006. ksft_exit_fail_msg("error nomem\n");
  1007. wp_init(mem2, page_size);
  1008. wp_addr_range(mem2, page_size);
  1009. /* Protect + unprotect. */
  1010. mprotect(mem, page_size, PROT_NONE);
  1011. mprotect(mem, 2 * page_size, PROT_READ);
  1012. mprotect(mem, 2 * page_size, PROT_READ|PROT_WRITE);
  1013. /* Modify both pages. */
  1014. memset(mem, 2, 2 * page_size);
  1015. /* Protect + unprotect. */
  1016. mprotect(mem, page_size, PROT_NONE);
  1017. mprotect(mem, page_size, PROT_READ);
  1018. mprotect(mem, page_size, PROT_READ|PROT_WRITE);
  1019. ret = pagemap_ioctl(mem, 2 * page_size, &vec, 1, 0, 0, PAGE_IS_WRITTEN,
  1020. 0, 0, PAGE_IS_WRITTEN);
  1021. if (ret < 0)
  1022. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  1023. ksft_test_result(ret == 1 && LEN(vec) == 2,
  1024. "%s Both pages written after remap and mprotect\n", __func__);
  1025. /* 4. Clear and make the pages written */
  1026. wp_addr_range(mem, 2 * page_size);
  1027. memset(mem, 'A', 2 * page_size);
  1028. ret = pagemap_ioctl(mem, 2 * page_size, &vec, 1, 0, 0, PAGE_IS_WRITTEN,
  1029. 0, 0, PAGE_IS_WRITTEN);
  1030. if (ret < 0)
  1031. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  1032. ksft_test_result(ret == 1 && LEN(vec) == 2,
  1033. "%s Clear and make the pages written\n", __func__);
  1034. wp_free(mem, 2 * page_size);
  1035. munmap(mem, 2 * page_size);
  1036. return 0;
  1037. }
  1038. /* transact test */
  1039. static const unsigned int nthreads = 6, pages_per_thread = 32, access_per_thread = 8;
  1040. static pthread_barrier_t start_barrier, end_barrier;
  1041. static unsigned int extra_thread_faults;
  1042. static unsigned int iter_count = 1000;
  1043. static volatile int finish;
  1044. static ssize_t get_dirty_pages_reset(char *mem, unsigned int count,
  1045. int reset, int page_size)
  1046. {
  1047. struct pm_scan_arg arg = {0};
  1048. struct page_region rgns[256];
  1049. int i, j, cnt, ret;
  1050. arg.size = sizeof(struct pm_scan_arg);
  1051. arg.start = (uintptr_t)mem;
  1052. arg.max_pages = count;
  1053. arg.end = (uintptr_t)(mem + count * page_size);
  1054. arg.vec = (uintptr_t)rgns;
  1055. arg.vec_len = sizeof(rgns) / sizeof(*rgns);
  1056. if (reset)
  1057. arg.flags |= PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC;
  1058. arg.category_mask = PAGE_IS_WRITTEN;
  1059. arg.return_mask = PAGE_IS_WRITTEN;
  1060. ret = ioctl(pagemap_fd, PAGEMAP_SCAN, &arg);
  1061. if (ret < 0)
  1062. ksft_exit_fail_msg("ioctl failed\n");
  1063. cnt = 0;
  1064. for (i = 0; i < ret; ++i) {
  1065. if (rgns[i].categories != PAGE_IS_WRITTEN)
  1066. ksft_exit_fail_msg("wrong flags\n");
  1067. for (j = 0; j < LEN(rgns[i]); ++j)
  1068. cnt++;
  1069. }
  1070. return cnt;
  1071. }
  1072. void *thread_proc(void *mem)
  1073. {
  1074. int *m = mem;
  1075. long curr_faults, faults;
  1076. struct rusage r;
  1077. unsigned int i;
  1078. int ret;
  1079. if (getrusage(RUSAGE_THREAD, &r))
  1080. ksft_exit_fail_msg("getrusage\n");
  1081. curr_faults = r.ru_minflt;
  1082. while (!finish) {
  1083. ret = pthread_barrier_wait(&start_barrier);
  1084. if (ret && ret != PTHREAD_BARRIER_SERIAL_THREAD)
  1085. ksft_exit_fail_msg("pthread_barrier_wait\n");
  1086. for (i = 0; i < access_per_thread; ++i)
  1087. __atomic_add_fetch(m + i * (0x1000 / sizeof(*m)), 1, __ATOMIC_SEQ_CST);
  1088. ret = pthread_barrier_wait(&end_barrier);
  1089. if (ret && ret != PTHREAD_BARRIER_SERIAL_THREAD)
  1090. ksft_exit_fail_msg("pthread_barrier_wait\n");
  1091. if (getrusage(RUSAGE_THREAD, &r))
  1092. ksft_exit_fail_msg("getrusage\n");
  1093. faults = r.ru_minflt - curr_faults;
  1094. if (faults < access_per_thread)
  1095. ksft_exit_fail_msg("faults < access_per_thread");
  1096. __atomic_add_fetch(&extra_thread_faults, faults - access_per_thread,
  1097. __ATOMIC_SEQ_CST);
  1098. curr_faults = r.ru_minflt;
  1099. }
  1100. return NULL;
  1101. }
  1102. static void transact_test(int page_size)
  1103. {
  1104. unsigned int i, count, extra_pages;
  1105. pthread_t th;
  1106. char *mem;
  1107. int ret, c;
  1108. if (pthread_barrier_init(&start_barrier, NULL, nthreads + 1))
  1109. ksft_exit_fail_msg("pthread_barrier_init\n");
  1110. if (pthread_barrier_init(&end_barrier, NULL, nthreads + 1))
  1111. ksft_exit_fail_msg("pthread_barrier_init\n");
  1112. mem = mmap(NULL, 0x1000 * nthreads * pages_per_thread, PROT_READ | PROT_WRITE,
  1113. MAP_ANONYMOUS | MAP_PRIVATE, -1, 0);
  1114. if (mem == MAP_FAILED)
  1115. ksft_exit_fail_msg("Error mmap %s.\n", strerror(errno));
  1116. wp_init(mem, 0x1000 * nthreads * pages_per_thread);
  1117. wp_addr_range(mem, 0x1000 * nthreads * pages_per_thread);
  1118. memset(mem, 0, 0x1000 * nthreads * pages_per_thread);
  1119. count = get_dirty_pages_reset(mem, nthreads * pages_per_thread, 1, page_size);
  1120. ksft_test_result(count > 0, "%s count %d\n", __func__, count);
  1121. count = get_dirty_pages_reset(mem, nthreads * pages_per_thread, 1, page_size);
  1122. ksft_test_result(count == 0, "%s count %d\n", __func__, count);
  1123. finish = 0;
  1124. for (i = 0; i < nthreads; ++i)
  1125. pthread_create(&th, NULL, thread_proc, mem + 0x1000 * i * pages_per_thread);
  1126. extra_pages = 0;
  1127. for (i = 0; i < iter_count; ++i) {
  1128. count = 0;
  1129. ret = pthread_barrier_wait(&start_barrier);
  1130. if (ret && ret != PTHREAD_BARRIER_SERIAL_THREAD)
  1131. ksft_exit_fail_msg("pthread_barrier_wait\n");
  1132. count = get_dirty_pages_reset(mem, nthreads * pages_per_thread, 1,
  1133. page_size);
  1134. ret = pthread_barrier_wait(&end_barrier);
  1135. if (ret && ret != PTHREAD_BARRIER_SERIAL_THREAD)
  1136. ksft_exit_fail_msg("pthread_barrier_wait\n");
  1137. if (count > nthreads * access_per_thread)
  1138. ksft_exit_fail_msg("Too big count %d expected %d, iter %d\n",
  1139. count, nthreads * access_per_thread, i);
  1140. c = get_dirty_pages_reset(mem, nthreads * pages_per_thread, 1, page_size);
  1141. count += c;
  1142. if (c > nthreads * access_per_thread) {
  1143. ksft_test_result_fail(" %s count > nthreads\n", __func__);
  1144. return;
  1145. }
  1146. if (count != nthreads * access_per_thread) {
  1147. /*
  1148. * The purpose of the test is to make sure that no page updates are lost
  1149. * when the page updates and read-resetting soft dirty flags are performed
  1150. * in parallel. However, it is possible that the application will get the
  1151. * soft dirty flags twice on the two consecutive read-resets. This seems
  1152. * unavoidable as soft dirty flag is handled in software through page faults
  1153. * in kernel. While the updating the flags is supposed to be synchronized
  1154. * between page fault handling and read-reset, it is possible that
  1155. * read-reset happens after page fault PTE update but before the application
  1156. * re-executes write instruction. So read-reset gets the flag, clears write
  1157. * access and application gets page fault again for the same write.
  1158. */
  1159. if (count < nthreads * access_per_thread) {
  1160. ksft_test_result_fail("Lost update, iter %d, %d vs %d.\n", i, count,
  1161. nthreads * access_per_thread);
  1162. return;
  1163. }
  1164. extra_pages += count - nthreads * access_per_thread;
  1165. }
  1166. }
  1167. pthread_barrier_wait(&start_barrier);
  1168. finish = 1;
  1169. pthread_barrier_wait(&end_barrier);
  1170. ksft_test_result_pass("%s Extra pages %u (%.1lf%%), extra thread faults %d.\n", __func__,
  1171. extra_pages,
  1172. 100.0 * extra_pages / (iter_count * nthreads * access_per_thread),
  1173. extra_thread_faults);
  1174. }
  1175. int main(int argc, char *argv[])
  1176. {
  1177. int mem_size, shmid, buf_size, fd, i, ret;
  1178. char *mem, *map, *fmem;
  1179. struct stat sbuf;
  1180. progname = argv[0];
  1181. ksft_print_header();
  1182. if (init_uffd())
  1183. ksft_exit_pass();
  1184. ksft_set_plan(115);
  1185. page_size = getpagesize();
  1186. hpage_size = read_pmd_pagesize();
  1187. pagemap_fd = open(PAGEMAP, O_RDONLY);
  1188. if (pagemap_fd < 0)
  1189. return -EINVAL;
  1190. /* 1. Sanity testing */
  1191. sanity_tests_sd();
  1192. /* 2. Normal page testing */
  1193. mem_size = 10 * page_size;
  1194. mem = mmap(NULL, mem_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
  1195. if (mem == MAP_FAILED)
  1196. ksft_exit_fail_msg("error nomem\n");
  1197. wp_init(mem, mem_size);
  1198. wp_addr_range(mem, mem_size);
  1199. base_tests("Page testing:", mem, mem_size, 0);
  1200. wp_free(mem, mem_size);
  1201. munmap(mem, mem_size);
  1202. /* 3. Large page testing */
  1203. mem_size = 512 * 10 * page_size;
  1204. mem = mmap(NULL, mem_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
  1205. if (mem == MAP_FAILED)
  1206. ksft_exit_fail_msg("error nomem\n");
  1207. wp_init(mem, mem_size);
  1208. wp_addr_range(mem, mem_size);
  1209. base_tests("Large Page testing:", mem, mem_size, 0);
  1210. wp_free(mem, mem_size);
  1211. munmap(mem, mem_size);
  1212. /* 4. Huge page testing */
  1213. map = gethugepage(hpage_size);
  1214. if (map) {
  1215. wp_init(map, hpage_size);
  1216. wp_addr_range(map, hpage_size);
  1217. base_tests("Huge page testing:", map, hpage_size, 0);
  1218. wp_free(map, hpage_size);
  1219. free(map);
  1220. } else {
  1221. base_tests("Huge page testing:", NULL, 0, 1);
  1222. }
  1223. /* 5. SHM Hugetlb page testing */
  1224. mem_size = 2*1024*1024;
  1225. mem = gethugetlb_mem(mem_size, &shmid);
  1226. if (mem) {
  1227. wp_init(mem, mem_size);
  1228. wp_addr_range(mem, mem_size);
  1229. base_tests("Hugetlb shmem testing:", mem, mem_size, 0);
  1230. wp_free(mem, mem_size);
  1231. shmctl(shmid, IPC_RMID, NULL);
  1232. } else {
  1233. base_tests("Hugetlb shmem testing:", NULL, 0, 1);
  1234. }
  1235. /* 6. Hugetlb page testing */
  1236. mem = gethugetlb_mem(mem_size, NULL);
  1237. if (mem) {
  1238. wp_init(mem, mem_size);
  1239. wp_addr_range(mem, mem_size);
  1240. base_tests("Hugetlb mem testing:", mem, mem_size, 0);
  1241. wp_free(mem, mem_size);
  1242. } else {
  1243. base_tests("Hugetlb mem testing:", NULL, 0, 1);
  1244. }
  1245. /* 7. File Hugetlb testing */
  1246. mem_size = 2*1024*1024;
  1247. fd = memfd_create("uffd-test", MFD_HUGETLB | MFD_NOEXEC_SEAL);
  1248. if (fd < 0)
  1249. ksft_exit_fail_msg("uffd-test creation failed %d %s\n", errno, strerror(errno));
  1250. mem = mmap(NULL, mem_size, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
  1251. if (mem != MAP_FAILED) {
  1252. wp_init(mem, mem_size);
  1253. wp_addr_range(mem, mem_size);
  1254. base_tests("Hugetlb shmem testing:", mem, mem_size, 0);
  1255. wp_free(mem, mem_size);
  1256. shmctl(shmid, IPC_RMID, NULL);
  1257. } else {
  1258. base_tests("Hugetlb shmem testing:", NULL, 0, 1);
  1259. }
  1260. close(fd);
  1261. /* 8. File memory testing */
  1262. buf_size = page_size * 10;
  1263. fd = open(__FILE__".tmp0", O_RDWR | O_CREAT, 0777);
  1264. if (fd < 0)
  1265. ksft_exit_fail_msg("Create and read/write to a memory mapped file: %s\n",
  1266. strerror(errno));
  1267. for (i = 0; i < buf_size; i++)
  1268. if (write(fd, "c", 1) < 0)
  1269. ksft_exit_fail_msg("Create and read/write to a memory mapped file\n");
  1270. ret = stat(__FILE__".tmp0", &sbuf);
  1271. if (ret < 0)
  1272. ksft_exit_fail_msg("error %d %d %s\n", ret, errno, strerror(errno));
  1273. fmem = mmap(NULL, sbuf.st_size, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0);
  1274. if (fmem == MAP_FAILED)
  1275. ksft_exit_fail_msg("error nomem %d %s\n", errno, strerror(errno));
  1276. wp_init(fmem, sbuf.st_size);
  1277. wp_addr_range(fmem, sbuf.st_size);
  1278. base_tests("File memory testing:", fmem, sbuf.st_size, 0);
  1279. wp_free(fmem, sbuf.st_size);
  1280. munmap(fmem, sbuf.st_size);
  1281. close(fd);
  1282. /* 9. File memory testing */
  1283. buf_size = page_size * 10;
  1284. fd = memfd_create(__FILE__".tmp00", MFD_NOEXEC_SEAL);
  1285. if (fd < 0)
  1286. ksft_exit_fail_msg("Create and read/write to a memory mapped file: %s\n",
  1287. strerror(errno));
  1288. if (ftruncate(fd, buf_size))
  1289. ksft_exit_fail_msg("Error ftruncate\n");
  1290. for (i = 0; i < buf_size; i++)
  1291. if (write(fd, "c", 1) < 0)
  1292. ksft_exit_fail_msg("Create and read/write to a memory mapped file\n");
  1293. fmem = mmap(NULL, buf_size, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0);
  1294. if (fmem == MAP_FAILED)
  1295. ksft_exit_fail_msg("error nomem %d %s\n", errno, strerror(errno));
  1296. wp_init(fmem, buf_size);
  1297. wp_addr_range(fmem, buf_size);
  1298. base_tests("File anonymous memory testing:", fmem, buf_size, 0);
  1299. wp_free(fmem, buf_size);
  1300. munmap(fmem, buf_size);
  1301. close(fd);
  1302. /* 10. Huge page tests */
  1303. hpage_unit_tests();
  1304. /* 11. Iterative test */
  1305. test_simple();
  1306. /* 12. Mprotect test */
  1307. mprotect_tests();
  1308. /* 13. Transact test */
  1309. transact_test(page_size);
  1310. /* 14. Sanity testing */
  1311. sanity_tests();
  1312. /*15. Unmapped address test */
  1313. unmapped_region_tests();
  1314. /* 16. Userfaultfd tests */
  1315. userfaultfd_tests();
  1316. close(pagemap_fd);
  1317. ksft_exit_pass();
  1318. }