kvm_util.c 61 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * tools/testing/selftests/kvm/lib/kvm_util.c
  4. *
  5. * Copyright (C) 2018, Google LLC.
  6. */
  7. #include "test_util.h"
  8. #include "kvm_util.h"
  9. #include "processor.h"
  10. #include "ucall_common.h"
  11. #include <assert.h>
  12. #include <sched.h>
  13. #include <sys/mman.h>
  14. #include <sys/types.h>
  15. #include <sys/stat.h>
  16. #include <unistd.h>
  17. #include <linux/kernel.h>
  18. #define KVM_UTIL_MIN_PFN 2
  19. uint32_t guest_random_seed;
  20. struct guest_random_state guest_rng;
  21. static uint32_t last_guest_seed;
  22. static int vcpu_mmap_sz(void);
  23. int open_path_or_exit(const char *path, int flags)
  24. {
  25. int fd;
  26. fd = open(path, flags);
  27. __TEST_REQUIRE(fd >= 0 || errno != ENOENT, "Cannot open %s: %s", path, strerror(errno));
  28. TEST_ASSERT(fd >= 0, "Failed to open '%s'", path);
  29. return fd;
  30. }
  31. /*
  32. * Open KVM_DEV_PATH if available, otherwise exit the entire program.
  33. *
  34. * Input Args:
  35. * flags - The flags to pass when opening KVM_DEV_PATH.
  36. *
  37. * Return:
  38. * The opened file descriptor of /dev/kvm.
  39. */
  40. static int _open_kvm_dev_path_or_exit(int flags)
  41. {
  42. return open_path_or_exit(KVM_DEV_PATH, flags);
  43. }
  44. int open_kvm_dev_path_or_exit(void)
  45. {
  46. return _open_kvm_dev_path_or_exit(O_RDONLY);
  47. }
  48. static ssize_t get_module_param(const char *module_name, const char *param,
  49. void *buffer, size_t buffer_size)
  50. {
  51. const int path_size = 128;
  52. char path[path_size];
  53. ssize_t bytes_read;
  54. int fd, r;
  55. r = snprintf(path, path_size, "/sys/module/%s/parameters/%s",
  56. module_name, param);
  57. TEST_ASSERT(r < path_size,
  58. "Failed to construct sysfs path in %d bytes.", path_size);
  59. fd = open_path_or_exit(path, O_RDONLY);
  60. bytes_read = read(fd, buffer, buffer_size);
  61. TEST_ASSERT(bytes_read > 0, "read(%s) returned %ld, wanted %ld bytes",
  62. path, bytes_read, buffer_size);
  63. r = close(fd);
  64. TEST_ASSERT(!r, "close(%s) failed", path);
  65. return bytes_read;
  66. }
  67. static int get_module_param_integer(const char *module_name, const char *param)
  68. {
  69. /*
  70. * 16 bytes to hold a 64-bit value (1 byte per char), 1 byte for the
  71. * NUL char, and 1 byte because the kernel sucks and inserts a newline
  72. * at the end.
  73. */
  74. char value[16 + 1 + 1];
  75. ssize_t r;
  76. memset(value, '\0', sizeof(value));
  77. r = get_module_param(module_name, param, value, sizeof(value));
  78. TEST_ASSERT(value[r - 1] == '\n',
  79. "Expected trailing newline, got char '%c'", value[r - 1]);
  80. /*
  81. * Squash the newline, otherwise atoi_paranoid() will complain about
  82. * trailing non-NUL characters in the string.
  83. */
  84. value[r - 1] = '\0';
  85. return atoi_paranoid(value);
  86. }
  87. static bool get_module_param_bool(const char *module_name, const char *param)
  88. {
  89. char value;
  90. ssize_t r;
  91. r = get_module_param(module_name, param, &value, sizeof(value));
  92. TEST_ASSERT_EQ(r, 1);
  93. if (value == 'Y')
  94. return true;
  95. else if (value == 'N')
  96. return false;
  97. TEST_FAIL("Unrecognized value '%c' for boolean module param", value);
  98. }
  99. bool get_kvm_param_bool(const char *param)
  100. {
  101. return get_module_param_bool("kvm", param);
  102. }
  103. bool get_kvm_intel_param_bool(const char *param)
  104. {
  105. return get_module_param_bool("kvm_intel", param);
  106. }
  107. bool get_kvm_amd_param_bool(const char *param)
  108. {
  109. return get_module_param_bool("kvm_amd", param);
  110. }
  111. int get_kvm_param_integer(const char *param)
  112. {
  113. return get_module_param_integer("kvm", param);
  114. }
  115. int get_kvm_intel_param_integer(const char *param)
  116. {
  117. return get_module_param_integer("kvm_intel", param);
  118. }
  119. int get_kvm_amd_param_integer(const char *param)
  120. {
  121. return get_module_param_integer("kvm_amd", param);
  122. }
  123. /*
  124. * Capability
  125. *
  126. * Input Args:
  127. * cap - Capability
  128. *
  129. * Output Args: None
  130. *
  131. * Return:
  132. * On success, the Value corresponding to the capability (KVM_CAP_*)
  133. * specified by the value of cap. On failure a TEST_ASSERT failure
  134. * is produced.
  135. *
  136. * Looks up and returns the value corresponding to the capability
  137. * (KVM_CAP_*) given by cap.
  138. */
  139. unsigned int kvm_check_cap(long cap)
  140. {
  141. int ret;
  142. int kvm_fd;
  143. kvm_fd = open_kvm_dev_path_or_exit();
  144. ret = __kvm_ioctl(kvm_fd, KVM_CHECK_EXTENSION, (void *)cap);
  145. TEST_ASSERT(ret >= 0, KVM_IOCTL_ERROR(KVM_CHECK_EXTENSION, ret));
  146. close(kvm_fd);
  147. return (unsigned int)ret;
  148. }
  149. void vm_enable_dirty_ring(struct kvm_vm *vm, uint32_t ring_size)
  150. {
  151. if (vm_check_cap(vm, KVM_CAP_DIRTY_LOG_RING_ACQ_REL))
  152. vm_enable_cap(vm, KVM_CAP_DIRTY_LOG_RING_ACQ_REL, ring_size);
  153. else
  154. vm_enable_cap(vm, KVM_CAP_DIRTY_LOG_RING, ring_size);
  155. vm->dirty_ring_size = ring_size;
  156. }
  157. static void vm_open(struct kvm_vm *vm)
  158. {
  159. vm->kvm_fd = _open_kvm_dev_path_or_exit(O_RDWR);
  160. TEST_REQUIRE(kvm_has_cap(KVM_CAP_IMMEDIATE_EXIT));
  161. vm->fd = __kvm_ioctl(vm->kvm_fd, KVM_CREATE_VM, (void *)vm->type);
  162. TEST_ASSERT(vm->fd >= 0, KVM_IOCTL_ERROR(KVM_CREATE_VM, vm->fd));
  163. }
  164. const char *vm_guest_mode_string(uint32_t i)
  165. {
  166. static const char * const strings[] = {
  167. [VM_MODE_P52V48_4K] = "PA-bits:52, VA-bits:48, 4K pages",
  168. [VM_MODE_P52V48_16K] = "PA-bits:52, VA-bits:48, 16K pages",
  169. [VM_MODE_P52V48_64K] = "PA-bits:52, VA-bits:48, 64K pages",
  170. [VM_MODE_P48V48_4K] = "PA-bits:48, VA-bits:48, 4K pages",
  171. [VM_MODE_P48V48_16K] = "PA-bits:48, VA-bits:48, 16K pages",
  172. [VM_MODE_P48V48_64K] = "PA-bits:48, VA-bits:48, 64K pages",
  173. [VM_MODE_P40V48_4K] = "PA-bits:40, VA-bits:48, 4K pages",
  174. [VM_MODE_P40V48_16K] = "PA-bits:40, VA-bits:48, 16K pages",
  175. [VM_MODE_P40V48_64K] = "PA-bits:40, VA-bits:48, 64K pages",
  176. [VM_MODE_PXXV48_4K] = "PA-bits:ANY, VA-bits:48, 4K pages",
  177. [VM_MODE_P47V64_4K] = "PA-bits:47, VA-bits:64, 4K pages",
  178. [VM_MODE_P44V64_4K] = "PA-bits:44, VA-bits:64, 4K pages",
  179. [VM_MODE_P36V48_4K] = "PA-bits:36, VA-bits:48, 4K pages",
  180. [VM_MODE_P36V48_16K] = "PA-bits:36, VA-bits:48, 16K pages",
  181. [VM_MODE_P36V48_64K] = "PA-bits:36, VA-bits:48, 64K pages",
  182. [VM_MODE_P36V47_16K] = "PA-bits:36, VA-bits:47, 16K pages",
  183. };
  184. _Static_assert(sizeof(strings)/sizeof(char *) == NUM_VM_MODES,
  185. "Missing new mode strings?");
  186. TEST_ASSERT(i < NUM_VM_MODES, "Guest mode ID %d too big", i);
  187. return strings[i];
  188. }
  189. const struct vm_guest_mode_params vm_guest_mode_params[] = {
  190. [VM_MODE_P52V48_4K] = { 52, 48, 0x1000, 12 },
  191. [VM_MODE_P52V48_16K] = { 52, 48, 0x4000, 14 },
  192. [VM_MODE_P52V48_64K] = { 52, 48, 0x10000, 16 },
  193. [VM_MODE_P48V48_4K] = { 48, 48, 0x1000, 12 },
  194. [VM_MODE_P48V48_16K] = { 48, 48, 0x4000, 14 },
  195. [VM_MODE_P48V48_64K] = { 48, 48, 0x10000, 16 },
  196. [VM_MODE_P40V48_4K] = { 40, 48, 0x1000, 12 },
  197. [VM_MODE_P40V48_16K] = { 40, 48, 0x4000, 14 },
  198. [VM_MODE_P40V48_64K] = { 40, 48, 0x10000, 16 },
  199. [VM_MODE_PXXV48_4K] = { 0, 0, 0x1000, 12 },
  200. [VM_MODE_P47V64_4K] = { 47, 64, 0x1000, 12 },
  201. [VM_MODE_P44V64_4K] = { 44, 64, 0x1000, 12 },
  202. [VM_MODE_P36V48_4K] = { 36, 48, 0x1000, 12 },
  203. [VM_MODE_P36V48_16K] = { 36, 48, 0x4000, 14 },
  204. [VM_MODE_P36V48_64K] = { 36, 48, 0x10000, 16 },
  205. [VM_MODE_P36V47_16K] = { 36, 47, 0x4000, 14 },
  206. };
  207. _Static_assert(sizeof(vm_guest_mode_params)/sizeof(struct vm_guest_mode_params) == NUM_VM_MODES,
  208. "Missing new mode params?");
  209. /*
  210. * Initializes vm->vpages_valid to match the canonical VA space of the
  211. * architecture.
  212. *
  213. * The default implementation is valid for architectures which split the
  214. * range addressed by a single page table into a low and high region
  215. * based on the MSB of the VA. On architectures with this behavior
  216. * the VA region spans [0, 2^(va_bits - 1)), [-(2^(va_bits - 1), -1].
  217. */
  218. __weak void vm_vaddr_populate_bitmap(struct kvm_vm *vm)
  219. {
  220. sparsebit_set_num(vm->vpages_valid,
  221. 0, (1ULL << (vm->va_bits - 1)) >> vm->page_shift);
  222. sparsebit_set_num(vm->vpages_valid,
  223. (~((1ULL << (vm->va_bits - 1)) - 1)) >> vm->page_shift,
  224. (1ULL << (vm->va_bits - 1)) >> vm->page_shift);
  225. }
  226. struct kvm_vm *____vm_create(struct vm_shape shape)
  227. {
  228. struct kvm_vm *vm;
  229. vm = calloc(1, sizeof(*vm));
  230. TEST_ASSERT(vm != NULL, "Insufficient Memory");
  231. INIT_LIST_HEAD(&vm->vcpus);
  232. vm->regions.gpa_tree = RB_ROOT;
  233. vm->regions.hva_tree = RB_ROOT;
  234. hash_init(vm->regions.slot_hash);
  235. vm->mode = shape.mode;
  236. vm->type = shape.type;
  237. vm->pa_bits = vm_guest_mode_params[vm->mode].pa_bits;
  238. vm->va_bits = vm_guest_mode_params[vm->mode].va_bits;
  239. vm->page_size = vm_guest_mode_params[vm->mode].page_size;
  240. vm->page_shift = vm_guest_mode_params[vm->mode].page_shift;
  241. /* Setup mode specific traits. */
  242. switch (vm->mode) {
  243. case VM_MODE_P52V48_4K:
  244. vm->pgtable_levels = 4;
  245. break;
  246. case VM_MODE_P52V48_64K:
  247. vm->pgtable_levels = 3;
  248. break;
  249. case VM_MODE_P48V48_4K:
  250. vm->pgtable_levels = 4;
  251. break;
  252. case VM_MODE_P48V48_64K:
  253. vm->pgtable_levels = 3;
  254. break;
  255. case VM_MODE_P40V48_4K:
  256. case VM_MODE_P36V48_4K:
  257. vm->pgtable_levels = 4;
  258. break;
  259. case VM_MODE_P40V48_64K:
  260. case VM_MODE_P36V48_64K:
  261. vm->pgtable_levels = 3;
  262. break;
  263. case VM_MODE_P52V48_16K:
  264. case VM_MODE_P48V48_16K:
  265. case VM_MODE_P40V48_16K:
  266. case VM_MODE_P36V48_16K:
  267. vm->pgtable_levels = 4;
  268. break;
  269. case VM_MODE_P36V47_16K:
  270. vm->pgtable_levels = 3;
  271. break;
  272. case VM_MODE_PXXV48_4K:
  273. #ifdef __x86_64__
  274. kvm_get_cpu_address_width(&vm->pa_bits, &vm->va_bits);
  275. kvm_init_vm_address_properties(vm);
  276. /*
  277. * Ignore KVM support for 5-level paging (vm->va_bits == 57),
  278. * it doesn't take effect unless a CR4.LA57 is set, which it
  279. * isn't for this mode (48-bit virtual address space).
  280. */
  281. TEST_ASSERT(vm->va_bits == 48 || vm->va_bits == 57,
  282. "Linear address width (%d bits) not supported",
  283. vm->va_bits);
  284. pr_debug("Guest physical address width detected: %d\n",
  285. vm->pa_bits);
  286. vm->pgtable_levels = 4;
  287. vm->va_bits = 48;
  288. #else
  289. TEST_FAIL("VM_MODE_PXXV48_4K not supported on non-x86 platforms");
  290. #endif
  291. break;
  292. case VM_MODE_P47V64_4K:
  293. vm->pgtable_levels = 5;
  294. break;
  295. case VM_MODE_P44V64_4K:
  296. vm->pgtable_levels = 5;
  297. break;
  298. default:
  299. TEST_FAIL("Unknown guest mode: 0x%x", vm->mode);
  300. }
  301. #ifdef __aarch64__
  302. TEST_ASSERT(!vm->type, "ARM doesn't support test-provided types");
  303. if (vm->pa_bits != 40)
  304. vm->type = KVM_VM_TYPE_ARM_IPA_SIZE(vm->pa_bits);
  305. #endif
  306. vm_open(vm);
  307. /* Limit to VA-bit canonical virtual addresses. */
  308. vm->vpages_valid = sparsebit_alloc();
  309. vm_vaddr_populate_bitmap(vm);
  310. /* Limit physical addresses to PA-bits. */
  311. vm->max_gfn = vm_compute_max_gfn(vm);
  312. /* Allocate and setup memory for guest. */
  313. vm->vpages_mapped = sparsebit_alloc();
  314. return vm;
  315. }
  316. static uint64_t vm_nr_pages_required(enum vm_guest_mode mode,
  317. uint32_t nr_runnable_vcpus,
  318. uint64_t extra_mem_pages)
  319. {
  320. uint64_t page_size = vm_guest_mode_params[mode].page_size;
  321. uint64_t nr_pages;
  322. TEST_ASSERT(nr_runnable_vcpus,
  323. "Use vm_create_barebones() for VMs that _never_ have vCPUs");
  324. TEST_ASSERT(nr_runnable_vcpus <= kvm_check_cap(KVM_CAP_MAX_VCPUS),
  325. "nr_vcpus = %d too large for host, max-vcpus = %d",
  326. nr_runnable_vcpus, kvm_check_cap(KVM_CAP_MAX_VCPUS));
  327. /*
  328. * Arbitrarily allocate 512 pages (2mb when page size is 4kb) for the
  329. * test code and other per-VM assets that will be loaded into memslot0.
  330. */
  331. nr_pages = 512;
  332. /* Account for the per-vCPU stacks on behalf of the test. */
  333. nr_pages += nr_runnable_vcpus * DEFAULT_STACK_PGS;
  334. /*
  335. * Account for the number of pages needed for the page tables. The
  336. * maximum page table size for a memory region will be when the
  337. * smallest page size is used. Considering each page contains x page
  338. * table descriptors, the total extra size for page tables (for extra
  339. * N pages) will be: N/x+N/x^2+N/x^3+... which is definitely smaller
  340. * than N/x*2.
  341. */
  342. nr_pages += (nr_pages + extra_mem_pages) / PTES_PER_MIN_PAGE * 2;
  343. /* Account for the number of pages needed by ucall. */
  344. nr_pages += ucall_nr_pages_required(page_size);
  345. return vm_adjust_num_guest_pages(mode, nr_pages);
  346. }
  347. struct kvm_vm *__vm_create(struct vm_shape shape, uint32_t nr_runnable_vcpus,
  348. uint64_t nr_extra_pages)
  349. {
  350. uint64_t nr_pages = vm_nr_pages_required(shape.mode, nr_runnable_vcpus,
  351. nr_extra_pages);
  352. struct userspace_mem_region *slot0;
  353. struct kvm_vm *vm;
  354. int i;
  355. pr_debug("%s: mode='%s' type='%d', pages='%ld'\n", __func__,
  356. vm_guest_mode_string(shape.mode), shape.type, nr_pages);
  357. vm = ____vm_create(shape);
  358. vm_userspace_mem_region_add(vm, VM_MEM_SRC_ANONYMOUS, 0, 0, nr_pages, 0);
  359. for (i = 0; i < NR_MEM_REGIONS; i++)
  360. vm->memslots[i] = 0;
  361. kvm_vm_elf_load(vm, program_invocation_name);
  362. /*
  363. * TODO: Add proper defines to protect the library's memslots, and then
  364. * carve out memslot1 for the ucall MMIO address. KVM treats writes to
  365. * read-only memslots as MMIO, and creating a read-only memslot for the
  366. * MMIO region would prevent silently clobbering the MMIO region.
  367. */
  368. slot0 = memslot2region(vm, 0);
  369. ucall_init(vm, slot0->region.guest_phys_addr + slot0->region.memory_size);
  370. if (guest_random_seed != last_guest_seed) {
  371. pr_info("Random seed: 0x%x\n", guest_random_seed);
  372. last_guest_seed = guest_random_seed;
  373. }
  374. guest_rng = new_guest_random_state(guest_random_seed);
  375. sync_global_to_guest(vm, guest_rng);
  376. kvm_arch_vm_post_create(vm);
  377. return vm;
  378. }
  379. /*
  380. * VM Create with customized parameters
  381. *
  382. * Input Args:
  383. * mode - VM Mode (e.g. VM_MODE_P52V48_4K)
  384. * nr_vcpus - VCPU count
  385. * extra_mem_pages - Non-slot0 physical memory total size
  386. * guest_code - Guest entry point
  387. * vcpuids - VCPU IDs
  388. *
  389. * Output Args: None
  390. *
  391. * Return:
  392. * Pointer to opaque structure that describes the created VM.
  393. *
  394. * Creates a VM with the mode specified by mode (e.g. VM_MODE_P52V48_4K).
  395. * extra_mem_pages is only used to calculate the maximum page table size,
  396. * no real memory allocation for non-slot0 memory in this function.
  397. */
  398. struct kvm_vm *__vm_create_with_vcpus(struct vm_shape shape, uint32_t nr_vcpus,
  399. uint64_t extra_mem_pages,
  400. void *guest_code, struct kvm_vcpu *vcpus[])
  401. {
  402. struct kvm_vm *vm;
  403. int i;
  404. TEST_ASSERT(!nr_vcpus || vcpus, "Must provide vCPU array");
  405. vm = __vm_create(shape, nr_vcpus, extra_mem_pages);
  406. for (i = 0; i < nr_vcpus; ++i)
  407. vcpus[i] = vm_vcpu_add(vm, i, guest_code);
  408. return vm;
  409. }
  410. struct kvm_vm *__vm_create_shape_with_one_vcpu(struct vm_shape shape,
  411. struct kvm_vcpu **vcpu,
  412. uint64_t extra_mem_pages,
  413. void *guest_code)
  414. {
  415. struct kvm_vcpu *vcpus[1];
  416. struct kvm_vm *vm;
  417. vm = __vm_create_with_vcpus(shape, 1, extra_mem_pages, guest_code, vcpus);
  418. *vcpu = vcpus[0];
  419. return vm;
  420. }
  421. /*
  422. * VM Restart
  423. *
  424. * Input Args:
  425. * vm - VM that has been released before
  426. *
  427. * Output Args: None
  428. *
  429. * Reopens the file descriptors associated to the VM and reinstates the
  430. * global state, such as the irqchip and the memory regions that are mapped
  431. * into the guest.
  432. */
  433. void kvm_vm_restart(struct kvm_vm *vmp)
  434. {
  435. int ctr;
  436. struct userspace_mem_region *region;
  437. vm_open(vmp);
  438. if (vmp->has_irqchip)
  439. vm_create_irqchip(vmp);
  440. hash_for_each(vmp->regions.slot_hash, ctr, region, slot_node) {
  441. int ret = ioctl(vmp->fd, KVM_SET_USER_MEMORY_REGION2, &region->region);
  442. TEST_ASSERT(ret == 0, "KVM_SET_USER_MEMORY_REGION2 IOCTL failed,\n"
  443. " rc: %i errno: %i\n"
  444. " slot: %u flags: 0x%x\n"
  445. " guest_phys_addr: 0x%llx size: 0x%llx",
  446. ret, errno, region->region.slot,
  447. region->region.flags,
  448. region->region.guest_phys_addr,
  449. region->region.memory_size);
  450. }
  451. }
  452. __weak struct kvm_vcpu *vm_arch_vcpu_recreate(struct kvm_vm *vm,
  453. uint32_t vcpu_id)
  454. {
  455. return __vm_vcpu_add(vm, vcpu_id);
  456. }
  457. struct kvm_vcpu *vm_recreate_with_one_vcpu(struct kvm_vm *vm)
  458. {
  459. kvm_vm_restart(vm);
  460. return vm_vcpu_recreate(vm, 0);
  461. }
  462. void kvm_pin_this_task_to_pcpu(uint32_t pcpu)
  463. {
  464. cpu_set_t mask;
  465. int r;
  466. CPU_ZERO(&mask);
  467. CPU_SET(pcpu, &mask);
  468. r = sched_setaffinity(0, sizeof(mask), &mask);
  469. TEST_ASSERT(!r, "sched_setaffinity() failed for pCPU '%u'.", pcpu);
  470. }
  471. static uint32_t parse_pcpu(const char *cpu_str, const cpu_set_t *allowed_mask)
  472. {
  473. uint32_t pcpu = atoi_non_negative("CPU number", cpu_str);
  474. TEST_ASSERT(CPU_ISSET(pcpu, allowed_mask),
  475. "Not allowed to run on pCPU '%d', check cgroups?", pcpu);
  476. return pcpu;
  477. }
  478. void kvm_print_vcpu_pinning_help(void)
  479. {
  480. const char *name = program_invocation_name;
  481. printf(" -c: Pin tasks to physical CPUs. Takes a list of comma separated\n"
  482. " values (target pCPU), one for each vCPU, plus an optional\n"
  483. " entry for the main application task (specified via entry\n"
  484. " <nr_vcpus + 1>). If used, entries must be provided for all\n"
  485. " vCPUs, i.e. pinning vCPUs is all or nothing.\n\n"
  486. " E.g. to create 3 vCPUs, pin vCPU0=>pCPU22, vCPU1=>pCPU23,\n"
  487. " vCPU2=>pCPU24, and pin the application task to pCPU50:\n\n"
  488. " %s -v 3 -c 22,23,24,50\n\n"
  489. " To leave the application task unpinned, drop the final entry:\n\n"
  490. " %s -v 3 -c 22,23,24\n\n"
  491. " (default: no pinning)\n", name, name);
  492. }
  493. void kvm_parse_vcpu_pinning(const char *pcpus_string, uint32_t vcpu_to_pcpu[],
  494. int nr_vcpus)
  495. {
  496. cpu_set_t allowed_mask;
  497. char *cpu, *cpu_list;
  498. char delim[2] = ",";
  499. int i, r;
  500. cpu_list = strdup(pcpus_string);
  501. TEST_ASSERT(cpu_list, "strdup() allocation failed.");
  502. r = sched_getaffinity(0, sizeof(allowed_mask), &allowed_mask);
  503. TEST_ASSERT(!r, "sched_getaffinity() failed");
  504. cpu = strtok(cpu_list, delim);
  505. /* 1. Get all pcpus for vcpus. */
  506. for (i = 0; i < nr_vcpus; i++) {
  507. TEST_ASSERT(cpu, "pCPU not provided for vCPU '%d'", i);
  508. vcpu_to_pcpu[i] = parse_pcpu(cpu, &allowed_mask);
  509. cpu = strtok(NULL, delim);
  510. }
  511. /* 2. Check if the main worker needs to be pinned. */
  512. if (cpu) {
  513. kvm_pin_this_task_to_pcpu(parse_pcpu(cpu, &allowed_mask));
  514. cpu = strtok(NULL, delim);
  515. }
  516. TEST_ASSERT(!cpu, "pCPU list contains trailing garbage characters '%s'", cpu);
  517. free(cpu_list);
  518. }
  519. /*
  520. * Userspace Memory Region Find
  521. *
  522. * Input Args:
  523. * vm - Virtual Machine
  524. * start - Starting VM physical address
  525. * end - Ending VM physical address, inclusive.
  526. *
  527. * Output Args: None
  528. *
  529. * Return:
  530. * Pointer to overlapping region, NULL if no such region.
  531. *
  532. * Searches for a region with any physical memory that overlaps with
  533. * any portion of the guest physical addresses from start to end
  534. * inclusive. If multiple overlapping regions exist, a pointer to any
  535. * of the regions is returned. Null is returned only when no overlapping
  536. * region exists.
  537. */
  538. static struct userspace_mem_region *
  539. userspace_mem_region_find(struct kvm_vm *vm, uint64_t start, uint64_t end)
  540. {
  541. struct rb_node *node;
  542. for (node = vm->regions.gpa_tree.rb_node; node; ) {
  543. struct userspace_mem_region *region =
  544. container_of(node, struct userspace_mem_region, gpa_node);
  545. uint64_t existing_start = region->region.guest_phys_addr;
  546. uint64_t existing_end = region->region.guest_phys_addr
  547. + region->region.memory_size - 1;
  548. if (start <= existing_end && end >= existing_start)
  549. return region;
  550. if (start < existing_start)
  551. node = node->rb_left;
  552. else
  553. node = node->rb_right;
  554. }
  555. return NULL;
  556. }
  557. __weak void vcpu_arch_free(struct kvm_vcpu *vcpu)
  558. {
  559. }
  560. /*
  561. * VM VCPU Remove
  562. *
  563. * Input Args:
  564. * vcpu - VCPU to remove
  565. *
  566. * Output Args: None
  567. *
  568. * Return: None, TEST_ASSERT failures for all error conditions
  569. *
  570. * Removes a vCPU from a VM and frees its resources.
  571. */
  572. static void vm_vcpu_rm(struct kvm_vm *vm, struct kvm_vcpu *vcpu)
  573. {
  574. int ret;
  575. if (vcpu->dirty_gfns) {
  576. ret = munmap(vcpu->dirty_gfns, vm->dirty_ring_size);
  577. TEST_ASSERT(!ret, __KVM_SYSCALL_ERROR("munmap()", ret));
  578. vcpu->dirty_gfns = NULL;
  579. }
  580. ret = munmap(vcpu->run, vcpu_mmap_sz());
  581. TEST_ASSERT(!ret, __KVM_SYSCALL_ERROR("munmap()", ret));
  582. ret = close(vcpu->fd);
  583. TEST_ASSERT(!ret, __KVM_SYSCALL_ERROR("close()", ret));
  584. list_del(&vcpu->list);
  585. vcpu_arch_free(vcpu);
  586. free(vcpu);
  587. }
  588. void kvm_vm_release(struct kvm_vm *vmp)
  589. {
  590. struct kvm_vcpu *vcpu, *tmp;
  591. int ret;
  592. list_for_each_entry_safe(vcpu, tmp, &vmp->vcpus, list)
  593. vm_vcpu_rm(vmp, vcpu);
  594. ret = close(vmp->fd);
  595. TEST_ASSERT(!ret, __KVM_SYSCALL_ERROR("close()", ret));
  596. ret = close(vmp->kvm_fd);
  597. TEST_ASSERT(!ret, __KVM_SYSCALL_ERROR("close()", ret));
  598. }
  599. static void __vm_mem_region_delete(struct kvm_vm *vm,
  600. struct userspace_mem_region *region)
  601. {
  602. int ret;
  603. rb_erase(&region->gpa_node, &vm->regions.gpa_tree);
  604. rb_erase(&region->hva_node, &vm->regions.hva_tree);
  605. hash_del(&region->slot_node);
  606. region->region.memory_size = 0;
  607. vm_ioctl(vm, KVM_SET_USER_MEMORY_REGION2, &region->region);
  608. sparsebit_free(&region->unused_phy_pages);
  609. sparsebit_free(&region->protected_phy_pages);
  610. ret = munmap(region->mmap_start, region->mmap_size);
  611. TEST_ASSERT(!ret, __KVM_SYSCALL_ERROR("munmap()", ret));
  612. if (region->fd >= 0) {
  613. /* There's an extra map when using shared memory. */
  614. ret = munmap(region->mmap_alias, region->mmap_size);
  615. TEST_ASSERT(!ret, __KVM_SYSCALL_ERROR("munmap()", ret));
  616. close(region->fd);
  617. }
  618. if (region->region.guest_memfd >= 0)
  619. close(region->region.guest_memfd);
  620. free(region);
  621. }
  622. /*
  623. * Destroys and frees the VM pointed to by vmp.
  624. */
  625. void kvm_vm_free(struct kvm_vm *vmp)
  626. {
  627. int ctr;
  628. struct hlist_node *node;
  629. struct userspace_mem_region *region;
  630. if (vmp == NULL)
  631. return;
  632. /* Free cached stats metadata and close FD */
  633. if (vmp->stats_fd) {
  634. free(vmp->stats_desc);
  635. close(vmp->stats_fd);
  636. }
  637. /* Free userspace_mem_regions. */
  638. hash_for_each_safe(vmp->regions.slot_hash, ctr, node, region, slot_node)
  639. __vm_mem_region_delete(vmp, region);
  640. /* Free sparsebit arrays. */
  641. sparsebit_free(&vmp->vpages_valid);
  642. sparsebit_free(&vmp->vpages_mapped);
  643. kvm_vm_release(vmp);
  644. /* Free the structure describing the VM. */
  645. free(vmp);
  646. }
  647. int kvm_memfd_alloc(size_t size, bool hugepages)
  648. {
  649. int memfd_flags = MFD_CLOEXEC;
  650. int fd, r;
  651. if (hugepages)
  652. memfd_flags |= MFD_HUGETLB;
  653. fd = memfd_create("kvm_selftest", memfd_flags);
  654. TEST_ASSERT(fd != -1, __KVM_SYSCALL_ERROR("memfd_create()", fd));
  655. r = ftruncate(fd, size);
  656. TEST_ASSERT(!r, __KVM_SYSCALL_ERROR("ftruncate()", r));
  657. r = fallocate(fd, FALLOC_FL_PUNCH_HOLE | FALLOC_FL_KEEP_SIZE, 0, size);
  658. TEST_ASSERT(!r, __KVM_SYSCALL_ERROR("fallocate()", r));
  659. return fd;
  660. }
  661. static void vm_userspace_mem_region_gpa_insert(struct rb_root *gpa_tree,
  662. struct userspace_mem_region *region)
  663. {
  664. struct rb_node **cur, *parent;
  665. for (cur = &gpa_tree->rb_node, parent = NULL; *cur; ) {
  666. struct userspace_mem_region *cregion;
  667. cregion = container_of(*cur, typeof(*cregion), gpa_node);
  668. parent = *cur;
  669. if (region->region.guest_phys_addr <
  670. cregion->region.guest_phys_addr)
  671. cur = &(*cur)->rb_left;
  672. else {
  673. TEST_ASSERT(region->region.guest_phys_addr !=
  674. cregion->region.guest_phys_addr,
  675. "Duplicate GPA in region tree");
  676. cur = &(*cur)->rb_right;
  677. }
  678. }
  679. rb_link_node(&region->gpa_node, parent, cur);
  680. rb_insert_color(&region->gpa_node, gpa_tree);
  681. }
  682. static void vm_userspace_mem_region_hva_insert(struct rb_root *hva_tree,
  683. struct userspace_mem_region *region)
  684. {
  685. struct rb_node **cur, *parent;
  686. for (cur = &hva_tree->rb_node, parent = NULL; *cur; ) {
  687. struct userspace_mem_region *cregion;
  688. cregion = container_of(*cur, typeof(*cregion), hva_node);
  689. parent = *cur;
  690. if (region->host_mem < cregion->host_mem)
  691. cur = &(*cur)->rb_left;
  692. else {
  693. TEST_ASSERT(region->host_mem !=
  694. cregion->host_mem,
  695. "Duplicate HVA in region tree");
  696. cur = &(*cur)->rb_right;
  697. }
  698. }
  699. rb_link_node(&region->hva_node, parent, cur);
  700. rb_insert_color(&region->hva_node, hva_tree);
  701. }
  702. int __vm_set_user_memory_region(struct kvm_vm *vm, uint32_t slot, uint32_t flags,
  703. uint64_t gpa, uint64_t size, void *hva)
  704. {
  705. struct kvm_userspace_memory_region region = {
  706. .slot = slot,
  707. .flags = flags,
  708. .guest_phys_addr = gpa,
  709. .memory_size = size,
  710. .userspace_addr = (uintptr_t)hva,
  711. };
  712. return ioctl(vm->fd, KVM_SET_USER_MEMORY_REGION, &region);
  713. }
  714. void vm_set_user_memory_region(struct kvm_vm *vm, uint32_t slot, uint32_t flags,
  715. uint64_t gpa, uint64_t size, void *hva)
  716. {
  717. int ret = __vm_set_user_memory_region(vm, slot, flags, gpa, size, hva);
  718. TEST_ASSERT(!ret, "KVM_SET_USER_MEMORY_REGION failed, errno = %d (%s)",
  719. errno, strerror(errno));
  720. }
  721. #define TEST_REQUIRE_SET_USER_MEMORY_REGION2() \
  722. __TEST_REQUIRE(kvm_has_cap(KVM_CAP_USER_MEMORY2), \
  723. "KVM selftests now require KVM_SET_USER_MEMORY_REGION2 (introduced in v6.8)")
  724. int __vm_set_user_memory_region2(struct kvm_vm *vm, uint32_t slot, uint32_t flags,
  725. uint64_t gpa, uint64_t size, void *hva,
  726. uint32_t guest_memfd, uint64_t guest_memfd_offset)
  727. {
  728. struct kvm_userspace_memory_region2 region = {
  729. .slot = slot,
  730. .flags = flags,
  731. .guest_phys_addr = gpa,
  732. .memory_size = size,
  733. .userspace_addr = (uintptr_t)hva,
  734. .guest_memfd = guest_memfd,
  735. .guest_memfd_offset = guest_memfd_offset,
  736. };
  737. TEST_REQUIRE_SET_USER_MEMORY_REGION2();
  738. return ioctl(vm->fd, KVM_SET_USER_MEMORY_REGION2, &region);
  739. }
  740. void vm_set_user_memory_region2(struct kvm_vm *vm, uint32_t slot, uint32_t flags,
  741. uint64_t gpa, uint64_t size, void *hva,
  742. uint32_t guest_memfd, uint64_t guest_memfd_offset)
  743. {
  744. int ret = __vm_set_user_memory_region2(vm, slot, flags, gpa, size, hva,
  745. guest_memfd, guest_memfd_offset);
  746. TEST_ASSERT(!ret, "KVM_SET_USER_MEMORY_REGION2 failed, errno = %d (%s)",
  747. errno, strerror(errno));
  748. }
  749. /* FIXME: This thing needs to be ripped apart and rewritten. */
  750. void vm_mem_add(struct kvm_vm *vm, enum vm_mem_backing_src_type src_type,
  751. uint64_t guest_paddr, uint32_t slot, uint64_t npages,
  752. uint32_t flags, int guest_memfd, uint64_t guest_memfd_offset)
  753. {
  754. int ret;
  755. struct userspace_mem_region *region;
  756. size_t backing_src_pagesz = get_backing_src_pagesz(src_type);
  757. size_t mem_size = npages * vm->page_size;
  758. size_t alignment;
  759. TEST_REQUIRE_SET_USER_MEMORY_REGION2();
  760. TEST_ASSERT(vm_adjust_num_guest_pages(vm->mode, npages) == npages,
  761. "Number of guest pages is not compatible with the host. "
  762. "Try npages=%d", vm_adjust_num_guest_pages(vm->mode, npages));
  763. TEST_ASSERT((guest_paddr % vm->page_size) == 0, "Guest physical "
  764. "address not on a page boundary.\n"
  765. " guest_paddr: 0x%lx vm->page_size: 0x%x",
  766. guest_paddr, vm->page_size);
  767. TEST_ASSERT((((guest_paddr >> vm->page_shift) + npages) - 1)
  768. <= vm->max_gfn, "Physical range beyond maximum "
  769. "supported physical address,\n"
  770. " guest_paddr: 0x%lx npages: 0x%lx\n"
  771. " vm->max_gfn: 0x%lx vm->page_size: 0x%x",
  772. guest_paddr, npages, vm->max_gfn, vm->page_size);
  773. /*
  774. * Confirm a mem region with an overlapping address doesn't
  775. * already exist.
  776. */
  777. region = (struct userspace_mem_region *) userspace_mem_region_find(
  778. vm, guest_paddr, (guest_paddr + npages * vm->page_size) - 1);
  779. if (region != NULL)
  780. TEST_FAIL("overlapping userspace_mem_region already "
  781. "exists\n"
  782. " requested guest_paddr: 0x%lx npages: 0x%lx "
  783. "page_size: 0x%x\n"
  784. " existing guest_paddr: 0x%lx size: 0x%lx",
  785. guest_paddr, npages, vm->page_size,
  786. (uint64_t) region->region.guest_phys_addr,
  787. (uint64_t) region->region.memory_size);
  788. /* Confirm no region with the requested slot already exists. */
  789. hash_for_each_possible(vm->regions.slot_hash, region, slot_node,
  790. slot) {
  791. if (region->region.slot != slot)
  792. continue;
  793. TEST_FAIL("A mem region with the requested slot "
  794. "already exists.\n"
  795. " requested slot: %u paddr: 0x%lx npages: 0x%lx\n"
  796. " existing slot: %u paddr: 0x%lx size: 0x%lx",
  797. slot, guest_paddr, npages,
  798. region->region.slot,
  799. (uint64_t) region->region.guest_phys_addr,
  800. (uint64_t) region->region.memory_size);
  801. }
  802. /* Allocate and initialize new mem region structure. */
  803. region = calloc(1, sizeof(*region));
  804. TEST_ASSERT(region != NULL, "Insufficient Memory");
  805. region->mmap_size = mem_size;
  806. #ifdef __s390x__
  807. /* On s390x, the host address must be aligned to 1M (due to PGSTEs) */
  808. alignment = 0x100000;
  809. #else
  810. alignment = 1;
  811. #endif
  812. /*
  813. * When using THP mmap is not guaranteed to returned a hugepage aligned
  814. * address so we have to pad the mmap. Padding is not needed for HugeTLB
  815. * because mmap will always return an address aligned to the HugeTLB
  816. * page size.
  817. */
  818. if (src_type == VM_MEM_SRC_ANONYMOUS_THP)
  819. alignment = max(backing_src_pagesz, alignment);
  820. TEST_ASSERT_EQ(guest_paddr, align_up(guest_paddr, backing_src_pagesz));
  821. /* Add enough memory to align up if necessary */
  822. if (alignment > 1)
  823. region->mmap_size += alignment;
  824. region->fd = -1;
  825. if (backing_src_is_shared(src_type))
  826. region->fd = kvm_memfd_alloc(region->mmap_size,
  827. src_type == VM_MEM_SRC_SHARED_HUGETLB);
  828. region->mmap_start = mmap(NULL, region->mmap_size,
  829. PROT_READ | PROT_WRITE,
  830. vm_mem_backing_src_alias(src_type)->flag,
  831. region->fd, 0);
  832. TEST_ASSERT(region->mmap_start != MAP_FAILED,
  833. __KVM_SYSCALL_ERROR("mmap()", (int)(unsigned long)MAP_FAILED));
  834. TEST_ASSERT(!is_backing_src_hugetlb(src_type) ||
  835. region->mmap_start == align_ptr_up(region->mmap_start, backing_src_pagesz),
  836. "mmap_start %p is not aligned to HugeTLB page size 0x%lx",
  837. region->mmap_start, backing_src_pagesz);
  838. /* Align host address */
  839. region->host_mem = align_ptr_up(region->mmap_start, alignment);
  840. /* As needed perform madvise */
  841. if ((src_type == VM_MEM_SRC_ANONYMOUS ||
  842. src_type == VM_MEM_SRC_ANONYMOUS_THP) && thp_configured()) {
  843. ret = madvise(region->host_mem, mem_size,
  844. src_type == VM_MEM_SRC_ANONYMOUS ? MADV_NOHUGEPAGE : MADV_HUGEPAGE);
  845. TEST_ASSERT(ret == 0, "madvise failed, addr: %p length: 0x%lx src_type: %s",
  846. region->host_mem, mem_size,
  847. vm_mem_backing_src_alias(src_type)->name);
  848. }
  849. region->backing_src_type = src_type;
  850. if (flags & KVM_MEM_GUEST_MEMFD) {
  851. if (guest_memfd < 0) {
  852. uint32_t guest_memfd_flags = 0;
  853. TEST_ASSERT(!guest_memfd_offset,
  854. "Offset must be zero when creating new guest_memfd");
  855. guest_memfd = vm_create_guest_memfd(vm, mem_size, guest_memfd_flags);
  856. } else {
  857. /*
  858. * Install a unique fd for each memslot so that the fd
  859. * can be closed when the region is deleted without
  860. * needing to track if the fd is owned by the framework
  861. * or by the caller.
  862. */
  863. guest_memfd = dup(guest_memfd);
  864. TEST_ASSERT(guest_memfd >= 0, __KVM_SYSCALL_ERROR("dup()", guest_memfd));
  865. }
  866. region->region.guest_memfd = guest_memfd;
  867. region->region.guest_memfd_offset = guest_memfd_offset;
  868. } else {
  869. region->region.guest_memfd = -1;
  870. }
  871. region->unused_phy_pages = sparsebit_alloc();
  872. if (vm_arch_has_protected_memory(vm))
  873. region->protected_phy_pages = sparsebit_alloc();
  874. sparsebit_set_num(region->unused_phy_pages,
  875. guest_paddr >> vm->page_shift, npages);
  876. region->region.slot = slot;
  877. region->region.flags = flags;
  878. region->region.guest_phys_addr = guest_paddr;
  879. region->region.memory_size = npages * vm->page_size;
  880. region->region.userspace_addr = (uintptr_t) region->host_mem;
  881. ret = __vm_ioctl(vm, KVM_SET_USER_MEMORY_REGION2, &region->region);
  882. TEST_ASSERT(ret == 0, "KVM_SET_USER_MEMORY_REGION2 IOCTL failed,\n"
  883. " rc: %i errno: %i\n"
  884. " slot: %u flags: 0x%x\n"
  885. " guest_phys_addr: 0x%lx size: 0x%lx guest_memfd: %d",
  886. ret, errno, slot, flags,
  887. guest_paddr, (uint64_t) region->region.memory_size,
  888. region->region.guest_memfd);
  889. /* Add to quick lookup data structures */
  890. vm_userspace_mem_region_gpa_insert(&vm->regions.gpa_tree, region);
  891. vm_userspace_mem_region_hva_insert(&vm->regions.hva_tree, region);
  892. hash_add(vm->regions.slot_hash, &region->slot_node, slot);
  893. /* If shared memory, create an alias. */
  894. if (region->fd >= 0) {
  895. region->mmap_alias = mmap(NULL, region->mmap_size,
  896. PROT_READ | PROT_WRITE,
  897. vm_mem_backing_src_alias(src_type)->flag,
  898. region->fd, 0);
  899. TEST_ASSERT(region->mmap_alias != MAP_FAILED,
  900. __KVM_SYSCALL_ERROR("mmap()", (int)(unsigned long)MAP_FAILED));
  901. /* Align host alias address */
  902. region->host_alias = align_ptr_up(region->mmap_alias, alignment);
  903. }
  904. }
  905. void vm_userspace_mem_region_add(struct kvm_vm *vm,
  906. enum vm_mem_backing_src_type src_type,
  907. uint64_t guest_paddr, uint32_t slot,
  908. uint64_t npages, uint32_t flags)
  909. {
  910. vm_mem_add(vm, src_type, guest_paddr, slot, npages, flags, -1, 0);
  911. }
  912. /*
  913. * Memslot to region
  914. *
  915. * Input Args:
  916. * vm - Virtual Machine
  917. * memslot - KVM memory slot ID
  918. *
  919. * Output Args: None
  920. *
  921. * Return:
  922. * Pointer to memory region structure that describe memory region
  923. * using kvm memory slot ID given by memslot. TEST_ASSERT failure
  924. * on error (e.g. currently no memory region using memslot as a KVM
  925. * memory slot ID).
  926. */
  927. struct userspace_mem_region *
  928. memslot2region(struct kvm_vm *vm, uint32_t memslot)
  929. {
  930. struct userspace_mem_region *region;
  931. hash_for_each_possible(vm->regions.slot_hash, region, slot_node,
  932. memslot)
  933. if (region->region.slot == memslot)
  934. return region;
  935. fprintf(stderr, "No mem region with the requested slot found,\n"
  936. " requested slot: %u\n", memslot);
  937. fputs("---- vm dump ----\n", stderr);
  938. vm_dump(stderr, vm, 2);
  939. TEST_FAIL("Mem region not found");
  940. return NULL;
  941. }
  942. /*
  943. * VM Memory Region Flags Set
  944. *
  945. * Input Args:
  946. * vm - Virtual Machine
  947. * flags - Starting guest physical address
  948. *
  949. * Output Args: None
  950. *
  951. * Return: None
  952. *
  953. * Sets the flags of the memory region specified by the value of slot,
  954. * to the values given by flags.
  955. */
  956. void vm_mem_region_set_flags(struct kvm_vm *vm, uint32_t slot, uint32_t flags)
  957. {
  958. int ret;
  959. struct userspace_mem_region *region;
  960. region = memslot2region(vm, slot);
  961. region->region.flags = flags;
  962. ret = __vm_ioctl(vm, KVM_SET_USER_MEMORY_REGION2, &region->region);
  963. TEST_ASSERT(ret == 0, "KVM_SET_USER_MEMORY_REGION2 IOCTL failed,\n"
  964. " rc: %i errno: %i slot: %u flags: 0x%x",
  965. ret, errno, slot, flags);
  966. }
  967. /*
  968. * VM Memory Region Move
  969. *
  970. * Input Args:
  971. * vm - Virtual Machine
  972. * slot - Slot of the memory region to move
  973. * new_gpa - Starting guest physical address
  974. *
  975. * Output Args: None
  976. *
  977. * Return: None
  978. *
  979. * Change the gpa of a memory region.
  980. */
  981. void vm_mem_region_move(struct kvm_vm *vm, uint32_t slot, uint64_t new_gpa)
  982. {
  983. struct userspace_mem_region *region;
  984. int ret;
  985. region = memslot2region(vm, slot);
  986. region->region.guest_phys_addr = new_gpa;
  987. ret = __vm_ioctl(vm, KVM_SET_USER_MEMORY_REGION2, &region->region);
  988. TEST_ASSERT(!ret, "KVM_SET_USER_MEMORY_REGION2 failed\n"
  989. "ret: %i errno: %i slot: %u new_gpa: 0x%lx",
  990. ret, errno, slot, new_gpa);
  991. }
  992. /*
  993. * VM Memory Region Delete
  994. *
  995. * Input Args:
  996. * vm - Virtual Machine
  997. * slot - Slot of the memory region to delete
  998. *
  999. * Output Args: None
  1000. *
  1001. * Return: None
  1002. *
  1003. * Delete a memory region.
  1004. */
  1005. void vm_mem_region_delete(struct kvm_vm *vm, uint32_t slot)
  1006. {
  1007. __vm_mem_region_delete(vm, memslot2region(vm, slot));
  1008. }
  1009. void vm_guest_mem_fallocate(struct kvm_vm *vm, uint64_t base, uint64_t size,
  1010. bool punch_hole)
  1011. {
  1012. const int mode = FALLOC_FL_KEEP_SIZE | (punch_hole ? FALLOC_FL_PUNCH_HOLE : 0);
  1013. struct userspace_mem_region *region;
  1014. uint64_t end = base + size;
  1015. uint64_t gpa, len;
  1016. off_t fd_offset;
  1017. int ret;
  1018. for (gpa = base; gpa < end; gpa += len) {
  1019. uint64_t offset;
  1020. region = userspace_mem_region_find(vm, gpa, gpa);
  1021. TEST_ASSERT(region && region->region.flags & KVM_MEM_GUEST_MEMFD,
  1022. "Private memory region not found for GPA 0x%lx", gpa);
  1023. offset = gpa - region->region.guest_phys_addr;
  1024. fd_offset = region->region.guest_memfd_offset + offset;
  1025. len = min_t(uint64_t, end - gpa, region->region.memory_size - offset);
  1026. ret = fallocate(region->region.guest_memfd, mode, fd_offset, len);
  1027. TEST_ASSERT(!ret, "fallocate() failed to %s at %lx (len = %lu), fd = %d, mode = %x, offset = %lx",
  1028. punch_hole ? "punch hole" : "allocate", gpa, len,
  1029. region->region.guest_memfd, mode, fd_offset);
  1030. }
  1031. }
  1032. /* Returns the size of a vCPU's kvm_run structure. */
  1033. static int vcpu_mmap_sz(void)
  1034. {
  1035. int dev_fd, ret;
  1036. dev_fd = open_kvm_dev_path_or_exit();
  1037. ret = ioctl(dev_fd, KVM_GET_VCPU_MMAP_SIZE, NULL);
  1038. TEST_ASSERT(ret >= sizeof(struct kvm_run),
  1039. KVM_IOCTL_ERROR(KVM_GET_VCPU_MMAP_SIZE, ret));
  1040. close(dev_fd);
  1041. return ret;
  1042. }
  1043. static bool vcpu_exists(struct kvm_vm *vm, uint32_t vcpu_id)
  1044. {
  1045. struct kvm_vcpu *vcpu;
  1046. list_for_each_entry(vcpu, &vm->vcpus, list) {
  1047. if (vcpu->id == vcpu_id)
  1048. return true;
  1049. }
  1050. return false;
  1051. }
  1052. /*
  1053. * Adds a virtual CPU to the VM specified by vm with the ID given by vcpu_id.
  1054. * No additional vCPU setup is done. Returns the vCPU.
  1055. */
  1056. struct kvm_vcpu *__vm_vcpu_add(struct kvm_vm *vm, uint32_t vcpu_id)
  1057. {
  1058. struct kvm_vcpu *vcpu;
  1059. /* Confirm a vcpu with the specified id doesn't already exist. */
  1060. TEST_ASSERT(!vcpu_exists(vm, vcpu_id), "vCPU%d already exists", vcpu_id);
  1061. /* Allocate and initialize new vcpu structure. */
  1062. vcpu = calloc(1, sizeof(*vcpu));
  1063. TEST_ASSERT(vcpu != NULL, "Insufficient Memory");
  1064. vcpu->vm = vm;
  1065. vcpu->id = vcpu_id;
  1066. vcpu->fd = __vm_ioctl(vm, KVM_CREATE_VCPU, (void *)(unsigned long)vcpu_id);
  1067. TEST_ASSERT_VM_VCPU_IOCTL(vcpu->fd >= 0, KVM_CREATE_VCPU, vcpu->fd, vm);
  1068. TEST_ASSERT(vcpu_mmap_sz() >= sizeof(*vcpu->run), "vcpu mmap size "
  1069. "smaller than expected, vcpu_mmap_sz: %i expected_min: %zi",
  1070. vcpu_mmap_sz(), sizeof(*vcpu->run));
  1071. vcpu->run = (struct kvm_run *) mmap(NULL, vcpu_mmap_sz(),
  1072. PROT_READ | PROT_WRITE, MAP_SHARED, vcpu->fd, 0);
  1073. TEST_ASSERT(vcpu->run != MAP_FAILED,
  1074. __KVM_SYSCALL_ERROR("mmap()", (int)(unsigned long)MAP_FAILED));
  1075. /* Add to linked-list of VCPUs. */
  1076. list_add(&vcpu->list, &vm->vcpus);
  1077. return vcpu;
  1078. }
  1079. /*
  1080. * VM Virtual Address Unused Gap
  1081. *
  1082. * Input Args:
  1083. * vm - Virtual Machine
  1084. * sz - Size (bytes)
  1085. * vaddr_min - Minimum Virtual Address
  1086. *
  1087. * Output Args: None
  1088. *
  1089. * Return:
  1090. * Lowest virtual address at or below vaddr_min, with at least
  1091. * sz unused bytes. TEST_ASSERT failure if no area of at least
  1092. * size sz is available.
  1093. *
  1094. * Within the VM specified by vm, locates the lowest starting virtual
  1095. * address >= vaddr_min, that has at least sz unallocated bytes. A
  1096. * TEST_ASSERT failure occurs for invalid input or no area of at least
  1097. * sz unallocated bytes >= vaddr_min is available.
  1098. */
  1099. vm_vaddr_t vm_vaddr_unused_gap(struct kvm_vm *vm, size_t sz,
  1100. vm_vaddr_t vaddr_min)
  1101. {
  1102. uint64_t pages = (sz + vm->page_size - 1) >> vm->page_shift;
  1103. /* Determine lowest permitted virtual page index. */
  1104. uint64_t pgidx_start = (vaddr_min + vm->page_size - 1) >> vm->page_shift;
  1105. if ((pgidx_start * vm->page_size) < vaddr_min)
  1106. goto no_va_found;
  1107. /* Loop over section with enough valid virtual page indexes. */
  1108. if (!sparsebit_is_set_num(vm->vpages_valid,
  1109. pgidx_start, pages))
  1110. pgidx_start = sparsebit_next_set_num(vm->vpages_valid,
  1111. pgidx_start, pages);
  1112. do {
  1113. /*
  1114. * Are there enough unused virtual pages available at
  1115. * the currently proposed starting virtual page index.
  1116. * If not, adjust proposed starting index to next
  1117. * possible.
  1118. */
  1119. if (sparsebit_is_clear_num(vm->vpages_mapped,
  1120. pgidx_start, pages))
  1121. goto va_found;
  1122. pgidx_start = sparsebit_next_clear_num(vm->vpages_mapped,
  1123. pgidx_start, pages);
  1124. if (pgidx_start == 0)
  1125. goto no_va_found;
  1126. /*
  1127. * If needed, adjust proposed starting virtual address,
  1128. * to next range of valid virtual addresses.
  1129. */
  1130. if (!sparsebit_is_set_num(vm->vpages_valid,
  1131. pgidx_start, pages)) {
  1132. pgidx_start = sparsebit_next_set_num(
  1133. vm->vpages_valid, pgidx_start, pages);
  1134. if (pgidx_start == 0)
  1135. goto no_va_found;
  1136. }
  1137. } while (pgidx_start != 0);
  1138. no_va_found:
  1139. TEST_FAIL("No vaddr of specified pages available, pages: 0x%lx", pages);
  1140. /* NOT REACHED */
  1141. return -1;
  1142. va_found:
  1143. TEST_ASSERT(sparsebit_is_set_num(vm->vpages_valid,
  1144. pgidx_start, pages),
  1145. "Unexpected, invalid virtual page index range,\n"
  1146. " pgidx_start: 0x%lx\n"
  1147. " pages: 0x%lx",
  1148. pgidx_start, pages);
  1149. TEST_ASSERT(sparsebit_is_clear_num(vm->vpages_mapped,
  1150. pgidx_start, pages),
  1151. "Unexpected, pages already mapped,\n"
  1152. " pgidx_start: 0x%lx\n"
  1153. " pages: 0x%lx",
  1154. pgidx_start, pages);
  1155. return pgidx_start * vm->page_size;
  1156. }
  1157. static vm_vaddr_t ____vm_vaddr_alloc(struct kvm_vm *vm, size_t sz,
  1158. vm_vaddr_t vaddr_min,
  1159. enum kvm_mem_region_type type,
  1160. bool protected)
  1161. {
  1162. uint64_t pages = (sz >> vm->page_shift) + ((sz % vm->page_size) != 0);
  1163. virt_pgd_alloc(vm);
  1164. vm_paddr_t paddr = __vm_phy_pages_alloc(vm, pages,
  1165. KVM_UTIL_MIN_PFN * vm->page_size,
  1166. vm->memslots[type], protected);
  1167. /*
  1168. * Find an unused range of virtual page addresses of at least
  1169. * pages in length.
  1170. */
  1171. vm_vaddr_t vaddr_start = vm_vaddr_unused_gap(vm, sz, vaddr_min);
  1172. /* Map the virtual pages. */
  1173. for (vm_vaddr_t vaddr = vaddr_start; pages > 0;
  1174. pages--, vaddr += vm->page_size, paddr += vm->page_size) {
  1175. virt_pg_map(vm, vaddr, paddr);
  1176. sparsebit_set(vm->vpages_mapped, vaddr >> vm->page_shift);
  1177. }
  1178. return vaddr_start;
  1179. }
  1180. vm_vaddr_t __vm_vaddr_alloc(struct kvm_vm *vm, size_t sz, vm_vaddr_t vaddr_min,
  1181. enum kvm_mem_region_type type)
  1182. {
  1183. return ____vm_vaddr_alloc(vm, sz, vaddr_min, type,
  1184. vm_arch_has_protected_memory(vm));
  1185. }
  1186. vm_vaddr_t vm_vaddr_alloc_shared(struct kvm_vm *vm, size_t sz,
  1187. vm_vaddr_t vaddr_min,
  1188. enum kvm_mem_region_type type)
  1189. {
  1190. return ____vm_vaddr_alloc(vm, sz, vaddr_min, type, false);
  1191. }
  1192. /*
  1193. * VM Virtual Address Allocate
  1194. *
  1195. * Input Args:
  1196. * vm - Virtual Machine
  1197. * sz - Size in bytes
  1198. * vaddr_min - Minimum starting virtual address
  1199. *
  1200. * Output Args: None
  1201. *
  1202. * Return:
  1203. * Starting guest virtual address
  1204. *
  1205. * Allocates at least sz bytes within the virtual address space of the vm
  1206. * given by vm. The allocated bytes are mapped to a virtual address >=
  1207. * the address given by vaddr_min. Note that each allocation uses a
  1208. * a unique set of pages, with the minimum real allocation being at least
  1209. * a page. The allocated physical space comes from the TEST_DATA memory region.
  1210. */
  1211. vm_vaddr_t vm_vaddr_alloc(struct kvm_vm *vm, size_t sz, vm_vaddr_t vaddr_min)
  1212. {
  1213. return __vm_vaddr_alloc(vm, sz, vaddr_min, MEM_REGION_TEST_DATA);
  1214. }
  1215. /*
  1216. * VM Virtual Address Allocate Pages
  1217. *
  1218. * Input Args:
  1219. * vm - Virtual Machine
  1220. *
  1221. * Output Args: None
  1222. *
  1223. * Return:
  1224. * Starting guest virtual address
  1225. *
  1226. * Allocates at least N system pages worth of bytes within the virtual address
  1227. * space of the vm.
  1228. */
  1229. vm_vaddr_t vm_vaddr_alloc_pages(struct kvm_vm *vm, int nr_pages)
  1230. {
  1231. return vm_vaddr_alloc(vm, nr_pages * getpagesize(), KVM_UTIL_MIN_VADDR);
  1232. }
  1233. vm_vaddr_t __vm_vaddr_alloc_page(struct kvm_vm *vm, enum kvm_mem_region_type type)
  1234. {
  1235. return __vm_vaddr_alloc(vm, getpagesize(), KVM_UTIL_MIN_VADDR, type);
  1236. }
  1237. /*
  1238. * VM Virtual Address Allocate Page
  1239. *
  1240. * Input Args:
  1241. * vm - Virtual Machine
  1242. *
  1243. * Output Args: None
  1244. *
  1245. * Return:
  1246. * Starting guest virtual address
  1247. *
  1248. * Allocates at least one system page worth of bytes within the virtual address
  1249. * space of the vm.
  1250. */
  1251. vm_vaddr_t vm_vaddr_alloc_page(struct kvm_vm *vm)
  1252. {
  1253. return vm_vaddr_alloc_pages(vm, 1);
  1254. }
  1255. /*
  1256. * Map a range of VM virtual address to the VM's physical address
  1257. *
  1258. * Input Args:
  1259. * vm - Virtual Machine
  1260. * vaddr - Virtuall address to map
  1261. * paddr - VM Physical Address
  1262. * npages - The number of pages to map
  1263. *
  1264. * Output Args: None
  1265. *
  1266. * Return: None
  1267. *
  1268. * Within the VM given by @vm, creates a virtual translation for
  1269. * @npages starting at @vaddr to the page range starting at @paddr.
  1270. */
  1271. void virt_map(struct kvm_vm *vm, uint64_t vaddr, uint64_t paddr,
  1272. unsigned int npages)
  1273. {
  1274. size_t page_size = vm->page_size;
  1275. size_t size = npages * page_size;
  1276. TEST_ASSERT(vaddr + size > vaddr, "Vaddr overflow");
  1277. TEST_ASSERT(paddr + size > paddr, "Paddr overflow");
  1278. while (npages--) {
  1279. virt_pg_map(vm, vaddr, paddr);
  1280. sparsebit_set(vm->vpages_mapped, vaddr >> vm->page_shift);
  1281. vaddr += page_size;
  1282. paddr += page_size;
  1283. }
  1284. }
  1285. /*
  1286. * Address VM Physical to Host Virtual
  1287. *
  1288. * Input Args:
  1289. * vm - Virtual Machine
  1290. * gpa - VM physical address
  1291. *
  1292. * Output Args: None
  1293. *
  1294. * Return:
  1295. * Equivalent host virtual address
  1296. *
  1297. * Locates the memory region containing the VM physical address given
  1298. * by gpa, within the VM given by vm. When found, the host virtual
  1299. * address providing the memory to the vm physical address is returned.
  1300. * A TEST_ASSERT failure occurs if no region containing gpa exists.
  1301. */
  1302. void *addr_gpa2hva(struct kvm_vm *vm, vm_paddr_t gpa)
  1303. {
  1304. struct userspace_mem_region *region;
  1305. gpa = vm_untag_gpa(vm, gpa);
  1306. region = userspace_mem_region_find(vm, gpa, gpa);
  1307. if (!region) {
  1308. TEST_FAIL("No vm physical memory at 0x%lx", gpa);
  1309. return NULL;
  1310. }
  1311. return (void *)((uintptr_t)region->host_mem
  1312. + (gpa - region->region.guest_phys_addr));
  1313. }
  1314. /*
  1315. * Address Host Virtual to VM Physical
  1316. *
  1317. * Input Args:
  1318. * vm - Virtual Machine
  1319. * hva - Host virtual address
  1320. *
  1321. * Output Args: None
  1322. *
  1323. * Return:
  1324. * Equivalent VM physical address
  1325. *
  1326. * Locates the memory region containing the host virtual address given
  1327. * by hva, within the VM given by vm. When found, the equivalent
  1328. * VM physical address is returned. A TEST_ASSERT failure occurs if no
  1329. * region containing hva exists.
  1330. */
  1331. vm_paddr_t addr_hva2gpa(struct kvm_vm *vm, void *hva)
  1332. {
  1333. struct rb_node *node;
  1334. for (node = vm->regions.hva_tree.rb_node; node; ) {
  1335. struct userspace_mem_region *region =
  1336. container_of(node, struct userspace_mem_region, hva_node);
  1337. if (hva >= region->host_mem) {
  1338. if (hva <= (region->host_mem
  1339. + region->region.memory_size - 1))
  1340. return (vm_paddr_t)((uintptr_t)
  1341. region->region.guest_phys_addr
  1342. + (hva - (uintptr_t)region->host_mem));
  1343. node = node->rb_right;
  1344. } else
  1345. node = node->rb_left;
  1346. }
  1347. TEST_FAIL("No mapping to a guest physical address, hva: %p", hva);
  1348. return -1;
  1349. }
  1350. /*
  1351. * Address VM physical to Host Virtual *alias*.
  1352. *
  1353. * Input Args:
  1354. * vm - Virtual Machine
  1355. * gpa - VM physical address
  1356. *
  1357. * Output Args: None
  1358. *
  1359. * Return:
  1360. * Equivalent address within the host virtual *alias* area, or NULL
  1361. * (without failing the test) if the guest memory is not shared (so
  1362. * no alias exists).
  1363. *
  1364. * Create a writable, shared virtual=>physical alias for the specific GPA.
  1365. * The primary use case is to allow the host selftest to manipulate guest
  1366. * memory without mapping said memory in the guest's address space. And, for
  1367. * userfaultfd-based demand paging, to do so without triggering userfaults.
  1368. */
  1369. void *addr_gpa2alias(struct kvm_vm *vm, vm_paddr_t gpa)
  1370. {
  1371. struct userspace_mem_region *region;
  1372. uintptr_t offset;
  1373. region = userspace_mem_region_find(vm, gpa, gpa);
  1374. if (!region)
  1375. return NULL;
  1376. if (!region->host_alias)
  1377. return NULL;
  1378. offset = gpa - region->region.guest_phys_addr;
  1379. return (void *) ((uintptr_t) region->host_alias + offset);
  1380. }
  1381. /* Create an interrupt controller chip for the specified VM. */
  1382. void vm_create_irqchip(struct kvm_vm *vm)
  1383. {
  1384. vm_ioctl(vm, KVM_CREATE_IRQCHIP, NULL);
  1385. vm->has_irqchip = true;
  1386. }
  1387. int _vcpu_run(struct kvm_vcpu *vcpu)
  1388. {
  1389. int rc;
  1390. do {
  1391. rc = __vcpu_run(vcpu);
  1392. } while (rc == -1 && errno == EINTR);
  1393. assert_on_unhandled_exception(vcpu);
  1394. return rc;
  1395. }
  1396. /*
  1397. * Invoke KVM_RUN on a vCPU until KVM returns something other than -EINTR.
  1398. * Assert if the KVM returns an error (other than -EINTR).
  1399. */
  1400. void vcpu_run(struct kvm_vcpu *vcpu)
  1401. {
  1402. int ret = _vcpu_run(vcpu);
  1403. TEST_ASSERT(!ret, KVM_IOCTL_ERROR(KVM_RUN, ret));
  1404. }
  1405. void vcpu_run_complete_io(struct kvm_vcpu *vcpu)
  1406. {
  1407. int ret;
  1408. vcpu->run->immediate_exit = 1;
  1409. ret = __vcpu_run(vcpu);
  1410. vcpu->run->immediate_exit = 0;
  1411. TEST_ASSERT(ret == -1 && errno == EINTR,
  1412. "KVM_RUN IOCTL didn't exit immediately, rc: %i, errno: %i",
  1413. ret, errno);
  1414. }
  1415. /*
  1416. * Get the list of guest registers which are supported for
  1417. * KVM_GET_ONE_REG/KVM_SET_ONE_REG ioctls. Returns a kvm_reg_list pointer,
  1418. * it is the caller's responsibility to free the list.
  1419. */
  1420. struct kvm_reg_list *vcpu_get_reg_list(struct kvm_vcpu *vcpu)
  1421. {
  1422. struct kvm_reg_list reg_list_n = { .n = 0 }, *reg_list;
  1423. int ret;
  1424. ret = __vcpu_ioctl(vcpu, KVM_GET_REG_LIST, &reg_list_n);
  1425. TEST_ASSERT(ret == -1 && errno == E2BIG, "KVM_GET_REG_LIST n=0");
  1426. reg_list = calloc(1, sizeof(*reg_list) + reg_list_n.n * sizeof(__u64));
  1427. reg_list->n = reg_list_n.n;
  1428. vcpu_ioctl(vcpu, KVM_GET_REG_LIST, reg_list);
  1429. return reg_list;
  1430. }
  1431. void *vcpu_map_dirty_ring(struct kvm_vcpu *vcpu)
  1432. {
  1433. uint32_t page_size = getpagesize();
  1434. uint32_t size = vcpu->vm->dirty_ring_size;
  1435. TEST_ASSERT(size > 0, "Should enable dirty ring first");
  1436. if (!vcpu->dirty_gfns) {
  1437. void *addr;
  1438. addr = mmap(NULL, size, PROT_READ, MAP_PRIVATE, vcpu->fd,
  1439. page_size * KVM_DIRTY_LOG_PAGE_OFFSET);
  1440. TEST_ASSERT(addr == MAP_FAILED, "Dirty ring mapped private");
  1441. addr = mmap(NULL, size, PROT_READ | PROT_EXEC, MAP_PRIVATE, vcpu->fd,
  1442. page_size * KVM_DIRTY_LOG_PAGE_OFFSET);
  1443. TEST_ASSERT(addr == MAP_FAILED, "Dirty ring mapped exec");
  1444. addr = mmap(NULL, size, PROT_READ | PROT_WRITE, MAP_SHARED, vcpu->fd,
  1445. page_size * KVM_DIRTY_LOG_PAGE_OFFSET);
  1446. TEST_ASSERT(addr != MAP_FAILED, "Dirty ring map failed");
  1447. vcpu->dirty_gfns = addr;
  1448. vcpu->dirty_gfns_count = size / sizeof(struct kvm_dirty_gfn);
  1449. }
  1450. return vcpu->dirty_gfns;
  1451. }
  1452. /*
  1453. * Device Ioctl
  1454. */
  1455. int __kvm_has_device_attr(int dev_fd, uint32_t group, uint64_t attr)
  1456. {
  1457. struct kvm_device_attr attribute = {
  1458. .group = group,
  1459. .attr = attr,
  1460. .flags = 0,
  1461. };
  1462. return ioctl(dev_fd, KVM_HAS_DEVICE_ATTR, &attribute);
  1463. }
  1464. int __kvm_test_create_device(struct kvm_vm *vm, uint64_t type)
  1465. {
  1466. struct kvm_create_device create_dev = {
  1467. .type = type,
  1468. .flags = KVM_CREATE_DEVICE_TEST,
  1469. };
  1470. return __vm_ioctl(vm, KVM_CREATE_DEVICE, &create_dev);
  1471. }
  1472. int __kvm_create_device(struct kvm_vm *vm, uint64_t type)
  1473. {
  1474. struct kvm_create_device create_dev = {
  1475. .type = type,
  1476. .fd = -1,
  1477. .flags = 0,
  1478. };
  1479. int err;
  1480. err = __vm_ioctl(vm, KVM_CREATE_DEVICE, &create_dev);
  1481. TEST_ASSERT(err <= 0, "KVM_CREATE_DEVICE shouldn't return a positive value");
  1482. return err ? : create_dev.fd;
  1483. }
  1484. int __kvm_device_attr_get(int dev_fd, uint32_t group, uint64_t attr, void *val)
  1485. {
  1486. struct kvm_device_attr kvmattr = {
  1487. .group = group,
  1488. .attr = attr,
  1489. .flags = 0,
  1490. .addr = (uintptr_t)val,
  1491. };
  1492. return __kvm_ioctl(dev_fd, KVM_GET_DEVICE_ATTR, &kvmattr);
  1493. }
  1494. int __kvm_device_attr_set(int dev_fd, uint32_t group, uint64_t attr, void *val)
  1495. {
  1496. struct kvm_device_attr kvmattr = {
  1497. .group = group,
  1498. .attr = attr,
  1499. .flags = 0,
  1500. .addr = (uintptr_t)val,
  1501. };
  1502. return __kvm_ioctl(dev_fd, KVM_SET_DEVICE_ATTR, &kvmattr);
  1503. }
  1504. /*
  1505. * IRQ related functions.
  1506. */
  1507. int _kvm_irq_line(struct kvm_vm *vm, uint32_t irq, int level)
  1508. {
  1509. struct kvm_irq_level irq_level = {
  1510. .irq = irq,
  1511. .level = level,
  1512. };
  1513. return __vm_ioctl(vm, KVM_IRQ_LINE, &irq_level);
  1514. }
  1515. void kvm_irq_line(struct kvm_vm *vm, uint32_t irq, int level)
  1516. {
  1517. int ret = _kvm_irq_line(vm, irq, level);
  1518. TEST_ASSERT(ret >= 0, KVM_IOCTL_ERROR(KVM_IRQ_LINE, ret));
  1519. }
  1520. struct kvm_irq_routing *kvm_gsi_routing_create(void)
  1521. {
  1522. struct kvm_irq_routing *routing;
  1523. size_t size;
  1524. size = sizeof(struct kvm_irq_routing);
  1525. /* Allocate space for the max number of entries: this wastes 196 KBs. */
  1526. size += KVM_MAX_IRQ_ROUTES * sizeof(struct kvm_irq_routing_entry);
  1527. routing = calloc(1, size);
  1528. assert(routing);
  1529. return routing;
  1530. }
  1531. void kvm_gsi_routing_irqchip_add(struct kvm_irq_routing *routing,
  1532. uint32_t gsi, uint32_t pin)
  1533. {
  1534. int i;
  1535. assert(routing);
  1536. assert(routing->nr < KVM_MAX_IRQ_ROUTES);
  1537. i = routing->nr;
  1538. routing->entries[i].gsi = gsi;
  1539. routing->entries[i].type = KVM_IRQ_ROUTING_IRQCHIP;
  1540. routing->entries[i].flags = 0;
  1541. routing->entries[i].u.irqchip.irqchip = 0;
  1542. routing->entries[i].u.irqchip.pin = pin;
  1543. routing->nr++;
  1544. }
  1545. int _kvm_gsi_routing_write(struct kvm_vm *vm, struct kvm_irq_routing *routing)
  1546. {
  1547. int ret;
  1548. assert(routing);
  1549. ret = __vm_ioctl(vm, KVM_SET_GSI_ROUTING, routing);
  1550. free(routing);
  1551. return ret;
  1552. }
  1553. void kvm_gsi_routing_write(struct kvm_vm *vm, struct kvm_irq_routing *routing)
  1554. {
  1555. int ret;
  1556. ret = _kvm_gsi_routing_write(vm, routing);
  1557. TEST_ASSERT(!ret, KVM_IOCTL_ERROR(KVM_SET_GSI_ROUTING, ret));
  1558. }
  1559. /*
  1560. * VM Dump
  1561. *
  1562. * Input Args:
  1563. * vm - Virtual Machine
  1564. * indent - Left margin indent amount
  1565. *
  1566. * Output Args:
  1567. * stream - Output FILE stream
  1568. *
  1569. * Return: None
  1570. *
  1571. * Dumps the current state of the VM given by vm, to the FILE stream
  1572. * given by stream.
  1573. */
  1574. void vm_dump(FILE *stream, struct kvm_vm *vm, uint8_t indent)
  1575. {
  1576. int ctr;
  1577. struct userspace_mem_region *region;
  1578. struct kvm_vcpu *vcpu;
  1579. fprintf(stream, "%*smode: 0x%x\n", indent, "", vm->mode);
  1580. fprintf(stream, "%*sfd: %i\n", indent, "", vm->fd);
  1581. fprintf(stream, "%*spage_size: 0x%x\n", indent, "", vm->page_size);
  1582. fprintf(stream, "%*sMem Regions:\n", indent, "");
  1583. hash_for_each(vm->regions.slot_hash, ctr, region, slot_node) {
  1584. fprintf(stream, "%*sguest_phys: 0x%lx size: 0x%lx "
  1585. "host_virt: %p\n", indent + 2, "",
  1586. (uint64_t) region->region.guest_phys_addr,
  1587. (uint64_t) region->region.memory_size,
  1588. region->host_mem);
  1589. fprintf(stream, "%*sunused_phy_pages: ", indent + 2, "");
  1590. sparsebit_dump(stream, region->unused_phy_pages, 0);
  1591. if (region->protected_phy_pages) {
  1592. fprintf(stream, "%*sprotected_phy_pages: ", indent + 2, "");
  1593. sparsebit_dump(stream, region->protected_phy_pages, 0);
  1594. }
  1595. }
  1596. fprintf(stream, "%*sMapped Virtual Pages:\n", indent, "");
  1597. sparsebit_dump(stream, vm->vpages_mapped, indent + 2);
  1598. fprintf(stream, "%*spgd_created: %u\n", indent, "",
  1599. vm->pgd_created);
  1600. if (vm->pgd_created) {
  1601. fprintf(stream, "%*sVirtual Translation Tables:\n",
  1602. indent + 2, "");
  1603. virt_dump(stream, vm, indent + 4);
  1604. }
  1605. fprintf(stream, "%*sVCPUs:\n", indent, "");
  1606. list_for_each_entry(vcpu, &vm->vcpus, list)
  1607. vcpu_dump(stream, vcpu, indent + 2);
  1608. }
  1609. #define KVM_EXIT_STRING(x) {KVM_EXIT_##x, #x}
  1610. /* Known KVM exit reasons */
  1611. static struct exit_reason {
  1612. unsigned int reason;
  1613. const char *name;
  1614. } exit_reasons_known[] = {
  1615. KVM_EXIT_STRING(UNKNOWN),
  1616. KVM_EXIT_STRING(EXCEPTION),
  1617. KVM_EXIT_STRING(IO),
  1618. KVM_EXIT_STRING(HYPERCALL),
  1619. KVM_EXIT_STRING(DEBUG),
  1620. KVM_EXIT_STRING(HLT),
  1621. KVM_EXIT_STRING(MMIO),
  1622. KVM_EXIT_STRING(IRQ_WINDOW_OPEN),
  1623. KVM_EXIT_STRING(SHUTDOWN),
  1624. KVM_EXIT_STRING(FAIL_ENTRY),
  1625. KVM_EXIT_STRING(INTR),
  1626. KVM_EXIT_STRING(SET_TPR),
  1627. KVM_EXIT_STRING(TPR_ACCESS),
  1628. KVM_EXIT_STRING(S390_SIEIC),
  1629. KVM_EXIT_STRING(S390_RESET),
  1630. KVM_EXIT_STRING(DCR),
  1631. KVM_EXIT_STRING(NMI),
  1632. KVM_EXIT_STRING(INTERNAL_ERROR),
  1633. KVM_EXIT_STRING(OSI),
  1634. KVM_EXIT_STRING(PAPR_HCALL),
  1635. KVM_EXIT_STRING(S390_UCONTROL),
  1636. KVM_EXIT_STRING(WATCHDOG),
  1637. KVM_EXIT_STRING(S390_TSCH),
  1638. KVM_EXIT_STRING(EPR),
  1639. KVM_EXIT_STRING(SYSTEM_EVENT),
  1640. KVM_EXIT_STRING(S390_STSI),
  1641. KVM_EXIT_STRING(IOAPIC_EOI),
  1642. KVM_EXIT_STRING(HYPERV),
  1643. KVM_EXIT_STRING(ARM_NISV),
  1644. KVM_EXIT_STRING(X86_RDMSR),
  1645. KVM_EXIT_STRING(X86_WRMSR),
  1646. KVM_EXIT_STRING(DIRTY_RING_FULL),
  1647. KVM_EXIT_STRING(AP_RESET_HOLD),
  1648. KVM_EXIT_STRING(X86_BUS_LOCK),
  1649. KVM_EXIT_STRING(XEN),
  1650. KVM_EXIT_STRING(RISCV_SBI),
  1651. KVM_EXIT_STRING(RISCV_CSR),
  1652. KVM_EXIT_STRING(NOTIFY),
  1653. #ifdef KVM_EXIT_MEMORY_NOT_PRESENT
  1654. KVM_EXIT_STRING(MEMORY_NOT_PRESENT),
  1655. #endif
  1656. };
  1657. /*
  1658. * Exit Reason String
  1659. *
  1660. * Input Args:
  1661. * exit_reason - Exit reason
  1662. *
  1663. * Output Args: None
  1664. *
  1665. * Return:
  1666. * Constant string pointer describing the exit reason.
  1667. *
  1668. * Locates and returns a constant string that describes the KVM exit
  1669. * reason given by exit_reason. If no such string is found, a constant
  1670. * string of "Unknown" is returned.
  1671. */
  1672. const char *exit_reason_str(unsigned int exit_reason)
  1673. {
  1674. unsigned int n1;
  1675. for (n1 = 0; n1 < ARRAY_SIZE(exit_reasons_known); n1++) {
  1676. if (exit_reason == exit_reasons_known[n1].reason)
  1677. return exit_reasons_known[n1].name;
  1678. }
  1679. return "Unknown";
  1680. }
  1681. /*
  1682. * Physical Contiguous Page Allocator
  1683. *
  1684. * Input Args:
  1685. * vm - Virtual Machine
  1686. * num - number of pages
  1687. * paddr_min - Physical address minimum
  1688. * memslot - Memory region to allocate page from
  1689. * protected - True if the pages will be used as protected/private memory
  1690. *
  1691. * Output Args: None
  1692. *
  1693. * Return:
  1694. * Starting physical address
  1695. *
  1696. * Within the VM specified by vm, locates a range of available physical
  1697. * pages at or above paddr_min. If found, the pages are marked as in use
  1698. * and their base address is returned. A TEST_ASSERT failure occurs if
  1699. * not enough pages are available at or above paddr_min.
  1700. */
  1701. vm_paddr_t __vm_phy_pages_alloc(struct kvm_vm *vm, size_t num,
  1702. vm_paddr_t paddr_min, uint32_t memslot,
  1703. bool protected)
  1704. {
  1705. struct userspace_mem_region *region;
  1706. sparsebit_idx_t pg, base;
  1707. TEST_ASSERT(num > 0, "Must allocate at least one page");
  1708. TEST_ASSERT((paddr_min % vm->page_size) == 0, "Min physical address "
  1709. "not divisible by page size.\n"
  1710. " paddr_min: 0x%lx page_size: 0x%x",
  1711. paddr_min, vm->page_size);
  1712. region = memslot2region(vm, memslot);
  1713. TEST_ASSERT(!protected || region->protected_phy_pages,
  1714. "Region doesn't support protected memory");
  1715. base = pg = paddr_min >> vm->page_shift;
  1716. do {
  1717. for (; pg < base + num; ++pg) {
  1718. if (!sparsebit_is_set(region->unused_phy_pages, pg)) {
  1719. base = pg = sparsebit_next_set(region->unused_phy_pages, pg);
  1720. break;
  1721. }
  1722. }
  1723. } while (pg && pg != base + num);
  1724. if (pg == 0) {
  1725. fprintf(stderr, "No guest physical page available, "
  1726. "paddr_min: 0x%lx page_size: 0x%x memslot: %u\n",
  1727. paddr_min, vm->page_size, memslot);
  1728. fputs("---- vm dump ----\n", stderr);
  1729. vm_dump(stderr, vm, 2);
  1730. abort();
  1731. }
  1732. for (pg = base; pg < base + num; ++pg) {
  1733. sparsebit_clear(region->unused_phy_pages, pg);
  1734. if (protected)
  1735. sparsebit_set(region->protected_phy_pages, pg);
  1736. }
  1737. return base * vm->page_size;
  1738. }
  1739. vm_paddr_t vm_phy_page_alloc(struct kvm_vm *vm, vm_paddr_t paddr_min,
  1740. uint32_t memslot)
  1741. {
  1742. return vm_phy_pages_alloc(vm, 1, paddr_min, memslot);
  1743. }
  1744. vm_paddr_t vm_alloc_page_table(struct kvm_vm *vm)
  1745. {
  1746. return vm_phy_page_alloc(vm, KVM_GUEST_PAGE_TABLE_MIN_PADDR,
  1747. vm->memslots[MEM_REGION_PT]);
  1748. }
  1749. /*
  1750. * Address Guest Virtual to Host Virtual
  1751. *
  1752. * Input Args:
  1753. * vm - Virtual Machine
  1754. * gva - VM virtual address
  1755. *
  1756. * Output Args: None
  1757. *
  1758. * Return:
  1759. * Equivalent host virtual address
  1760. */
  1761. void *addr_gva2hva(struct kvm_vm *vm, vm_vaddr_t gva)
  1762. {
  1763. return addr_gpa2hva(vm, addr_gva2gpa(vm, gva));
  1764. }
  1765. unsigned long __weak vm_compute_max_gfn(struct kvm_vm *vm)
  1766. {
  1767. return ((1ULL << vm->pa_bits) >> vm->page_shift) - 1;
  1768. }
  1769. static unsigned int vm_calc_num_pages(unsigned int num_pages,
  1770. unsigned int page_shift,
  1771. unsigned int new_page_shift,
  1772. bool ceil)
  1773. {
  1774. unsigned int n = 1 << (new_page_shift - page_shift);
  1775. if (page_shift >= new_page_shift)
  1776. return num_pages * (1 << (page_shift - new_page_shift));
  1777. return num_pages / n + !!(ceil && num_pages % n);
  1778. }
  1779. static inline int getpageshift(void)
  1780. {
  1781. return __builtin_ffs(getpagesize()) - 1;
  1782. }
  1783. unsigned int
  1784. vm_num_host_pages(enum vm_guest_mode mode, unsigned int num_guest_pages)
  1785. {
  1786. return vm_calc_num_pages(num_guest_pages,
  1787. vm_guest_mode_params[mode].page_shift,
  1788. getpageshift(), true);
  1789. }
  1790. unsigned int
  1791. vm_num_guest_pages(enum vm_guest_mode mode, unsigned int num_host_pages)
  1792. {
  1793. return vm_calc_num_pages(num_host_pages, getpageshift(),
  1794. vm_guest_mode_params[mode].page_shift, false);
  1795. }
  1796. unsigned int vm_calc_num_guest_pages(enum vm_guest_mode mode, size_t size)
  1797. {
  1798. unsigned int n;
  1799. n = DIV_ROUND_UP(size, vm_guest_mode_params[mode].page_size);
  1800. return vm_adjust_num_guest_pages(mode, n);
  1801. }
  1802. /*
  1803. * Read binary stats descriptors
  1804. *
  1805. * Input Args:
  1806. * stats_fd - the file descriptor for the binary stats file from which to read
  1807. * header - the binary stats metadata header corresponding to the given FD
  1808. *
  1809. * Output Args: None
  1810. *
  1811. * Return:
  1812. * A pointer to a newly allocated series of stat descriptors.
  1813. * Caller is responsible for freeing the returned kvm_stats_desc.
  1814. *
  1815. * Read the stats descriptors from the binary stats interface.
  1816. */
  1817. struct kvm_stats_desc *read_stats_descriptors(int stats_fd,
  1818. struct kvm_stats_header *header)
  1819. {
  1820. struct kvm_stats_desc *stats_desc;
  1821. ssize_t desc_size, total_size, ret;
  1822. desc_size = get_stats_descriptor_size(header);
  1823. total_size = header->num_desc * desc_size;
  1824. stats_desc = calloc(header->num_desc, desc_size);
  1825. TEST_ASSERT(stats_desc, "Allocate memory for stats descriptors");
  1826. ret = pread(stats_fd, stats_desc, total_size, header->desc_offset);
  1827. TEST_ASSERT(ret == total_size, "Read KVM stats descriptors");
  1828. return stats_desc;
  1829. }
  1830. /*
  1831. * Read stat data for a particular stat
  1832. *
  1833. * Input Args:
  1834. * stats_fd - the file descriptor for the binary stats file from which to read
  1835. * header - the binary stats metadata header corresponding to the given FD
  1836. * desc - the binary stat metadata for the particular stat to be read
  1837. * max_elements - the maximum number of 8-byte values to read into data
  1838. *
  1839. * Output Args:
  1840. * data - the buffer into which stat data should be read
  1841. *
  1842. * Read the data values of a specified stat from the binary stats interface.
  1843. */
  1844. void read_stat_data(int stats_fd, struct kvm_stats_header *header,
  1845. struct kvm_stats_desc *desc, uint64_t *data,
  1846. size_t max_elements)
  1847. {
  1848. size_t nr_elements = min_t(ssize_t, desc->size, max_elements);
  1849. size_t size = nr_elements * sizeof(*data);
  1850. ssize_t ret;
  1851. TEST_ASSERT(desc->size, "No elements in stat '%s'", desc->name);
  1852. TEST_ASSERT(max_elements, "Zero elements requested for stat '%s'", desc->name);
  1853. ret = pread(stats_fd, data, size,
  1854. header->data_offset + desc->offset);
  1855. TEST_ASSERT(ret >= 0, "pread() failed on stat '%s', errno: %i (%s)",
  1856. desc->name, errno, strerror(errno));
  1857. TEST_ASSERT(ret == size,
  1858. "pread() on stat '%s' read %ld bytes, wanted %lu bytes",
  1859. desc->name, size, ret);
  1860. }
  1861. /*
  1862. * Read the data of the named stat
  1863. *
  1864. * Input Args:
  1865. * vm - the VM for which the stat should be read
  1866. * stat_name - the name of the stat to read
  1867. * max_elements - the maximum number of 8-byte values to read into data
  1868. *
  1869. * Output Args:
  1870. * data - the buffer into which stat data should be read
  1871. *
  1872. * Read the data values of a specified stat from the binary stats interface.
  1873. */
  1874. void __vm_get_stat(struct kvm_vm *vm, const char *stat_name, uint64_t *data,
  1875. size_t max_elements)
  1876. {
  1877. struct kvm_stats_desc *desc;
  1878. size_t size_desc;
  1879. int i;
  1880. if (!vm->stats_fd) {
  1881. vm->stats_fd = vm_get_stats_fd(vm);
  1882. read_stats_header(vm->stats_fd, &vm->stats_header);
  1883. vm->stats_desc = read_stats_descriptors(vm->stats_fd,
  1884. &vm->stats_header);
  1885. }
  1886. size_desc = get_stats_descriptor_size(&vm->stats_header);
  1887. for (i = 0; i < vm->stats_header.num_desc; ++i) {
  1888. desc = (void *)vm->stats_desc + (i * size_desc);
  1889. if (strcmp(desc->name, stat_name))
  1890. continue;
  1891. read_stat_data(vm->stats_fd, &vm->stats_header, desc,
  1892. data, max_elements);
  1893. break;
  1894. }
  1895. }
  1896. __weak void kvm_arch_vm_post_create(struct kvm_vm *vm)
  1897. {
  1898. }
  1899. __weak void kvm_selftest_arch_init(void)
  1900. {
  1901. }
  1902. void __attribute((constructor)) kvm_selftest_init(void)
  1903. {
  1904. /* Tell stdout not to buffer its content. */
  1905. setbuf(stdout, NULL);
  1906. guest_random_seed = last_guest_seed = random();
  1907. pr_info("Random seed: 0x%x\n", guest_random_seed);
  1908. kvm_selftest_arch_init();
  1909. }
  1910. bool vm_is_gpa_protected(struct kvm_vm *vm, vm_paddr_t paddr)
  1911. {
  1912. sparsebit_idx_t pg = 0;
  1913. struct userspace_mem_region *region;
  1914. if (!vm_arch_has_protected_memory(vm))
  1915. return false;
  1916. region = userspace_mem_region_find(vm, paddr, paddr);
  1917. TEST_ASSERT(region, "No vm physical memory at 0x%lx", paddr);
  1918. pg = paddr >> vm->page_shift;
  1919. return sparsebit_is_set(region->protected_phy_pages, pg);
  1920. }