tlb.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * Copyright (c) 2022 Ventana Micro Systems Inc.
  4. */
  5. #include <linux/bitmap.h>
  6. #include <linux/cpumask.h>
  7. #include <linux/errno.h>
  8. #include <linux/err.h>
  9. #include <linux/module.h>
  10. #include <linux/smp.h>
  11. #include <linux/kvm_host.h>
  12. #include <asm/cacheflush.h>
  13. #include <asm/csr.h>
  14. #include <asm/cpufeature.h>
  15. #include <asm/insn-def.h>
  16. #include <asm/kvm_nacl.h>
  17. #include <asm/kvm_tlb.h>
  18. #include <asm/kvm_vmid.h>
  19. #define has_svinval() riscv_has_extension_unlikely(RISCV_ISA_EXT_SVINVAL)
  20. void kvm_riscv_local_hfence_gvma_vmid_gpa(unsigned long vmid,
  21. gpa_t gpa, gpa_t gpsz,
  22. unsigned long order)
  23. {
  24. gpa_t pos;
  25. if (PTRS_PER_PTE < (gpsz >> order)) {
  26. kvm_riscv_local_hfence_gvma_vmid_all(vmid);
  27. return;
  28. }
  29. if (has_svinval()) {
  30. asm volatile (SFENCE_W_INVAL() ::: "memory");
  31. for (pos = gpa; pos < (gpa + gpsz); pos += BIT(order))
  32. asm volatile (HINVAL_GVMA(%0, %1)
  33. : : "r" (pos >> 2), "r" (vmid) : "memory");
  34. asm volatile (SFENCE_INVAL_IR() ::: "memory");
  35. } else {
  36. for (pos = gpa; pos < (gpa + gpsz); pos += BIT(order))
  37. asm volatile (HFENCE_GVMA(%0, %1)
  38. : : "r" (pos >> 2), "r" (vmid) : "memory");
  39. }
  40. }
  41. void kvm_riscv_local_hfence_gvma_vmid_all(unsigned long vmid)
  42. {
  43. asm volatile(HFENCE_GVMA(zero, %0) : : "r" (vmid) : "memory");
  44. }
  45. void kvm_riscv_local_hfence_gvma_gpa(gpa_t gpa, gpa_t gpsz,
  46. unsigned long order)
  47. {
  48. gpa_t pos;
  49. if (PTRS_PER_PTE < (gpsz >> order)) {
  50. kvm_riscv_local_hfence_gvma_all();
  51. return;
  52. }
  53. if (has_svinval()) {
  54. asm volatile (SFENCE_W_INVAL() ::: "memory");
  55. for (pos = gpa; pos < (gpa + gpsz); pos += BIT(order))
  56. asm volatile(HINVAL_GVMA(%0, zero)
  57. : : "r" (pos >> 2) : "memory");
  58. asm volatile (SFENCE_INVAL_IR() ::: "memory");
  59. } else {
  60. for (pos = gpa; pos < (gpa + gpsz); pos += BIT(order))
  61. asm volatile(HFENCE_GVMA(%0, zero)
  62. : : "r" (pos >> 2) : "memory");
  63. }
  64. }
  65. void kvm_riscv_local_hfence_gvma_all(void)
  66. {
  67. asm volatile(HFENCE_GVMA(zero, zero) : : : "memory");
  68. }
  69. void kvm_riscv_local_hfence_vvma_asid_gva(unsigned long vmid,
  70. unsigned long asid,
  71. unsigned long gva,
  72. unsigned long gvsz,
  73. unsigned long order)
  74. {
  75. unsigned long pos, hgatp;
  76. if (PTRS_PER_PTE < (gvsz >> order)) {
  77. kvm_riscv_local_hfence_vvma_asid_all(vmid, asid);
  78. return;
  79. }
  80. hgatp = csr_swap(CSR_HGATP, vmid << HGATP_VMID_SHIFT);
  81. if (has_svinval()) {
  82. asm volatile (SFENCE_W_INVAL() ::: "memory");
  83. for (pos = gva; pos < (gva + gvsz); pos += BIT(order))
  84. asm volatile(HINVAL_VVMA(%0, %1)
  85. : : "r" (pos), "r" (asid) : "memory");
  86. asm volatile (SFENCE_INVAL_IR() ::: "memory");
  87. } else {
  88. for (pos = gva; pos < (gva + gvsz); pos += BIT(order))
  89. asm volatile(HFENCE_VVMA(%0, %1)
  90. : : "r" (pos), "r" (asid) : "memory");
  91. }
  92. csr_write(CSR_HGATP, hgatp);
  93. }
  94. void kvm_riscv_local_hfence_vvma_asid_all(unsigned long vmid,
  95. unsigned long asid)
  96. {
  97. unsigned long hgatp;
  98. hgatp = csr_swap(CSR_HGATP, vmid << HGATP_VMID_SHIFT);
  99. asm volatile(HFENCE_VVMA(zero, %0) : : "r" (asid) : "memory");
  100. csr_write(CSR_HGATP, hgatp);
  101. }
  102. void kvm_riscv_local_hfence_vvma_gva(unsigned long vmid,
  103. unsigned long gva, unsigned long gvsz,
  104. unsigned long order)
  105. {
  106. unsigned long pos, hgatp;
  107. if (PTRS_PER_PTE < (gvsz >> order)) {
  108. kvm_riscv_local_hfence_vvma_all(vmid);
  109. return;
  110. }
  111. hgatp = csr_swap(CSR_HGATP, vmid << HGATP_VMID_SHIFT);
  112. if (has_svinval()) {
  113. asm volatile (SFENCE_W_INVAL() ::: "memory");
  114. for (pos = gva; pos < (gva + gvsz); pos += BIT(order))
  115. asm volatile(HINVAL_VVMA(%0, zero)
  116. : : "r" (pos) : "memory");
  117. asm volatile (SFENCE_INVAL_IR() ::: "memory");
  118. } else {
  119. for (pos = gva; pos < (gva + gvsz); pos += BIT(order))
  120. asm volatile(HFENCE_VVMA(%0, zero)
  121. : : "r" (pos) : "memory");
  122. }
  123. csr_write(CSR_HGATP, hgatp);
  124. }
  125. void kvm_riscv_local_hfence_vvma_all(unsigned long vmid)
  126. {
  127. unsigned long hgatp;
  128. hgatp = csr_swap(CSR_HGATP, vmid << HGATP_VMID_SHIFT);
  129. asm volatile(HFENCE_VVMA(zero, zero) : : : "memory");
  130. csr_write(CSR_HGATP, hgatp);
  131. }
  132. void kvm_riscv_local_tlb_sanitize(struct kvm_vcpu *vcpu)
  133. {
  134. unsigned long vmid;
  135. if (!kvm_riscv_gstage_vmid_bits() ||
  136. vcpu->arch.last_exit_cpu == vcpu->cpu)
  137. return;
  138. /*
  139. * On RISC-V platforms with hardware VMID support, we share same
  140. * VMID for all VCPUs of a particular Guest/VM. This means we might
  141. * have stale G-stage TLB entries on the current Host CPU due to
  142. * some other VCPU of the same Guest which ran previously on the
  143. * current Host CPU.
  144. *
  145. * To cleanup stale TLB entries, we simply flush all G-stage TLB
  146. * entries by VMID whenever underlying Host CPU changes for a VCPU.
  147. */
  148. vmid = READ_ONCE(vcpu->kvm->arch.vmid.vmid);
  149. kvm_riscv_local_hfence_gvma_vmid_all(vmid);
  150. /*
  151. * Flush VS-stage TLB entries for implementation where VS-stage
  152. * TLB does not cahce guest physical address and VMID.
  153. */
  154. if (static_branch_unlikely(&kvm_riscv_vsstage_tlb_no_gpa))
  155. kvm_riscv_local_hfence_vvma_all(vmid);
  156. }
  157. void kvm_riscv_fence_i_process(struct kvm_vcpu *vcpu)
  158. {
  159. kvm_riscv_vcpu_pmu_incr_fw(vcpu, SBI_PMU_FW_FENCE_I_RCVD);
  160. local_flush_icache_all();
  161. }
  162. void kvm_riscv_tlb_flush_process(struct kvm_vcpu *vcpu)
  163. {
  164. struct kvm_vmid *v = &vcpu->kvm->arch.vmid;
  165. unsigned long vmid = READ_ONCE(v->vmid);
  166. if (kvm_riscv_nacl_available())
  167. nacl_hfence_gvma_vmid_all(nacl_shmem(), vmid);
  168. else
  169. kvm_riscv_local_hfence_gvma_vmid_all(vmid);
  170. }
  171. void kvm_riscv_hfence_vvma_all_process(struct kvm_vcpu *vcpu)
  172. {
  173. struct kvm_vmid *v = &vcpu->kvm->arch.vmid;
  174. unsigned long vmid = READ_ONCE(v->vmid);
  175. if (kvm_riscv_nacl_available())
  176. nacl_hfence_vvma_all(nacl_shmem(), vmid);
  177. else
  178. kvm_riscv_local_hfence_vvma_all(vmid);
  179. }
  180. static bool vcpu_hfence_dequeue(struct kvm_vcpu *vcpu,
  181. struct kvm_riscv_hfence *out_data)
  182. {
  183. bool ret = false;
  184. struct kvm_vcpu_arch *varch = &vcpu->arch;
  185. spin_lock(&varch->hfence_lock);
  186. if (varch->hfence_queue[varch->hfence_head].type) {
  187. memcpy(out_data, &varch->hfence_queue[varch->hfence_head],
  188. sizeof(*out_data));
  189. varch->hfence_queue[varch->hfence_head].type = 0;
  190. varch->hfence_head++;
  191. if (varch->hfence_head == KVM_RISCV_VCPU_MAX_HFENCE)
  192. varch->hfence_head = 0;
  193. ret = true;
  194. }
  195. spin_unlock(&varch->hfence_lock);
  196. return ret;
  197. }
  198. static bool vcpu_hfence_enqueue(struct kvm_vcpu *vcpu,
  199. const struct kvm_riscv_hfence *data)
  200. {
  201. bool ret = false;
  202. struct kvm_vcpu_arch *varch = &vcpu->arch;
  203. spin_lock(&varch->hfence_lock);
  204. if (!varch->hfence_queue[varch->hfence_tail].type) {
  205. memcpy(&varch->hfence_queue[varch->hfence_tail],
  206. data, sizeof(*data));
  207. varch->hfence_tail++;
  208. if (varch->hfence_tail == KVM_RISCV_VCPU_MAX_HFENCE)
  209. varch->hfence_tail = 0;
  210. ret = true;
  211. }
  212. spin_unlock(&varch->hfence_lock);
  213. return ret;
  214. }
  215. void kvm_riscv_hfence_process(struct kvm_vcpu *vcpu)
  216. {
  217. struct kvm_riscv_hfence d = { 0 };
  218. while (vcpu_hfence_dequeue(vcpu, &d)) {
  219. switch (d.type) {
  220. case KVM_RISCV_HFENCE_UNKNOWN:
  221. break;
  222. case KVM_RISCV_HFENCE_GVMA_VMID_GPA:
  223. if (kvm_riscv_nacl_available())
  224. nacl_hfence_gvma_vmid(nacl_shmem(), d.vmid,
  225. d.addr, d.size, d.order);
  226. else
  227. kvm_riscv_local_hfence_gvma_vmid_gpa(d.vmid, d.addr,
  228. d.size, d.order);
  229. break;
  230. case KVM_RISCV_HFENCE_GVMA_VMID_ALL:
  231. if (kvm_riscv_nacl_available())
  232. nacl_hfence_gvma_vmid_all(nacl_shmem(), d.vmid);
  233. else
  234. kvm_riscv_local_hfence_gvma_vmid_all(d.vmid);
  235. break;
  236. case KVM_RISCV_HFENCE_VVMA_ASID_GVA:
  237. kvm_riscv_vcpu_pmu_incr_fw(vcpu, SBI_PMU_FW_HFENCE_VVMA_ASID_RCVD);
  238. if (kvm_riscv_nacl_available())
  239. nacl_hfence_vvma_asid(nacl_shmem(), d.vmid, d.asid,
  240. d.addr, d.size, d.order);
  241. else
  242. kvm_riscv_local_hfence_vvma_asid_gva(d.vmid, d.asid, d.addr,
  243. d.size, d.order);
  244. break;
  245. case KVM_RISCV_HFENCE_VVMA_ASID_ALL:
  246. kvm_riscv_vcpu_pmu_incr_fw(vcpu, SBI_PMU_FW_HFENCE_VVMA_ASID_RCVD);
  247. if (kvm_riscv_nacl_available())
  248. nacl_hfence_vvma_asid_all(nacl_shmem(), d.vmid, d.asid);
  249. else
  250. kvm_riscv_local_hfence_vvma_asid_all(d.vmid, d.asid);
  251. break;
  252. case KVM_RISCV_HFENCE_VVMA_GVA:
  253. kvm_riscv_vcpu_pmu_incr_fw(vcpu, SBI_PMU_FW_HFENCE_VVMA_RCVD);
  254. if (kvm_riscv_nacl_available())
  255. nacl_hfence_vvma(nacl_shmem(), d.vmid,
  256. d.addr, d.size, d.order);
  257. else
  258. kvm_riscv_local_hfence_vvma_gva(d.vmid, d.addr,
  259. d.size, d.order);
  260. break;
  261. case KVM_RISCV_HFENCE_VVMA_ALL:
  262. kvm_riscv_vcpu_pmu_incr_fw(vcpu, SBI_PMU_FW_HFENCE_VVMA_RCVD);
  263. if (kvm_riscv_nacl_available())
  264. nacl_hfence_vvma_all(nacl_shmem(), d.vmid);
  265. else
  266. kvm_riscv_local_hfence_vvma_all(d.vmid);
  267. break;
  268. default:
  269. break;
  270. }
  271. }
  272. }
  273. static void make_xfence_request(struct kvm *kvm,
  274. unsigned long hbase, unsigned long hmask,
  275. unsigned int req, unsigned int fallback_req,
  276. const struct kvm_riscv_hfence *data)
  277. {
  278. unsigned long i;
  279. struct kvm_vcpu *vcpu;
  280. unsigned int actual_req = req;
  281. DECLARE_BITMAP(vcpu_mask, KVM_MAX_VCPUS);
  282. bitmap_zero(vcpu_mask, KVM_MAX_VCPUS);
  283. kvm_for_each_vcpu(i, vcpu, kvm) {
  284. if (hbase != -1UL) {
  285. if (vcpu->vcpu_id < hbase)
  286. continue;
  287. if (!(hmask & (1UL << (vcpu->vcpu_id - hbase))))
  288. continue;
  289. }
  290. bitmap_set(vcpu_mask, i, 1);
  291. if (!data || !data->type)
  292. continue;
  293. /*
  294. * Enqueue hfence data to VCPU hfence queue. If we don't
  295. * have space in the VCPU hfence queue then fallback to
  296. * a more conservative hfence request.
  297. */
  298. if (!vcpu_hfence_enqueue(vcpu, data))
  299. actual_req = fallback_req;
  300. }
  301. kvm_make_vcpus_request_mask(kvm, actual_req, vcpu_mask);
  302. }
  303. void kvm_riscv_fence_i(struct kvm *kvm,
  304. unsigned long hbase, unsigned long hmask)
  305. {
  306. make_xfence_request(kvm, hbase, hmask, KVM_REQ_FENCE_I,
  307. KVM_REQ_FENCE_I, NULL);
  308. }
  309. void kvm_riscv_hfence_gvma_vmid_gpa(struct kvm *kvm,
  310. unsigned long hbase, unsigned long hmask,
  311. gpa_t gpa, gpa_t gpsz,
  312. unsigned long order, unsigned long vmid)
  313. {
  314. struct kvm_riscv_hfence data;
  315. data.type = KVM_RISCV_HFENCE_GVMA_VMID_GPA;
  316. data.asid = 0;
  317. data.vmid = vmid;
  318. data.addr = gpa;
  319. data.size = gpsz;
  320. data.order = order;
  321. make_xfence_request(kvm, hbase, hmask, KVM_REQ_HFENCE,
  322. KVM_REQ_TLB_FLUSH, &data);
  323. }
  324. void kvm_riscv_hfence_gvma_vmid_all(struct kvm *kvm,
  325. unsigned long hbase, unsigned long hmask,
  326. unsigned long vmid)
  327. {
  328. struct kvm_riscv_hfence data = {0};
  329. data.type = KVM_RISCV_HFENCE_GVMA_VMID_ALL;
  330. data.vmid = vmid;
  331. make_xfence_request(kvm, hbase, hmask, KVM_REQ_HFENCE,
  332. KVM_REQ_TLB_FLUSH, &data);
  333. }
  334. void kvm_riscv_hfence_vvma_asid_gva(struct kvm *kvm,
  335. unsigned long hbase, unsigned long hmask,
  336. unsigned long gva, unsigned long gvsz,
  337. unsigned long order, unsigned long asid,
  338. unsigned long vmid)
  339. {
  340. struct kvm_riscv_hfence data;
  341. data.type = KVM_RISCV_HFENCE_VVMA_ASID_GVA;
  342. data.asid = asid;
  343. data.vmid = vmid;
  344. data.addr = gva;
  345. data.size = gvsz;
  346. data.order = order;
  347. make_xfence_request(kvm, hbase, hmask, KVM_REQ_HFENCE,
  348. KVM_REQ_HFENCE_VVMA_ALL, &data);
  349. }
  350. void kvm_riscv_hfence_vvma_asid_all(struct kvm *kvm,
  351. unsigned long hbase, unsigned long hmask,
  352. unsigned long asid, unsigned long vmid)
  353. {
  354. struct kvm_riscv_hfence data = {0};
  355. data.type = KVM_RISCV_HFENCE_VVMA_ASID_ALL;
  356. data.asid = asid;
  357. data.vmid = vmid;
  358. make_xfence_request(kvm, hbase, hmask, KVM_REQ_HFENCE,
  359. KVM_REQ_HFENCE_VVMA_ALL, &data);
  360. }
  361. void kvm_riscv_hfence_vvma_gva(struct kvm *kvm,
  362. unsigned long hbase, unsigned long hmask,
  363. unsigned long gva, unsigned long gvsz,
  364. unsigned long order, unsigned long vmid)
  365. {
  366. struct kvm_riscv_hfence data;
  367. data.type = KVM_RISCV_HFENCE_VVMA_GVA;
  368. data.asid = 0;
  369. data.vmid = vmid;
  370. data.addr = gva;
  371. data.size = gvsz;
  372. data.order = order;
  373. make_xfence_request(kvm, hbase, hmask, KVM_REQ_HFENCE,
  374. KVM_REQ_HFENCE_VVMA_ALL, &data);
  375. }
  376. void kvm_riscv_hfence_vvma_all(struct kvm *kvm,
  377. unsigned long hbase, unsigned long hmask,
  378. unsigned long vmid)
  379. {
  380. struct kvm_riscv_hfence data = {0};
  381. data.type = KVM_RISCV_HFENCE_VVMA_ALL;
  382. data.vmid = vmid;
  383. make_xfence_request(kvm, hbase, hmask, KVM_REQ_HFENCE,
  384. KVM_REQ_HFENCE_VVMA_ALL, &data);
  385. }
  386. int kvm_arch_flush_remote_tlbs_range(struct kvm *kvm, gfn_t gfn, u64 nr_pages)
  387. {
  388. kvm_riscv_hfence_gvma_vmid_gpa(kvm, -1UL, 0,
  389. gfn << PAGE_SHIFT, nr_pages << PAGE_SHIFT,
  390. PAGE_SHIFT, READ_ONCE(kvm->arch.vmid.vmid));
  391. return 0;
  392. }