book3s_64_mmu_host.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331
  1. /*
  2. * Copyright (C) 2009 SUSE Linux Products GmbH. All rights reserved.
  3. *
  4. * Authors:
  5. * Alexander Graf <agraf@suse.de>
  6. * Kevin Wolf <mail@kevin-wolf.de>
  7. *
  8. * This program is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License, version 2, as
  10. * published by the Free Software Foundation.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  20. */
  21. #include <linux/kvm_host.h>
  22. #include <asm/kvm_ppc.h>
  23. #include <asm/kvm_book3s.h>
  24. #include <asm/mmu-hash64.h>
  25. #include <asm/machdep.h>
  26. #include <asm/mmu_context.h>
  27. #include <asm/hw_irq.h>
  28. #include "trace.h"
  29. #define PTE_SIZE 12
  30. void kvmppc_mmu_invalidate_pte(struct kvm_vcpu *vcpu, struct hpte_cache *pte)
  31. {
  32. ppc_md.hpte_invalidate(pte->slot, pte->host_va,
  33. MMU_PAGE_4K, MMU_SEGSIZE_256M,
  34. false);
  35. }
  36. /* We keep 512 gvsid->hvsid entries, mapping the guest ones to the array using
  37. * a hash, so we don't waste cycles on looping */
  38. static u16 kvmppc_sid_hash(struct kvm_vcpu *vcpu, u64 gvsid)
  39. {
  40. return (u16)(((gvsid >> (SID_MAP_BITS * 7)) & SID_MAP_MASK) ^
  41. ((gvsid >> (SID_MAP_BITS * 6)) & SID_MAP_MASK) ^
  42. ((gvsid >> (SID_MAP_BITS * 5)) & SID_MAP_MASK) ^
  43. ((gvsid >> (SID_MAP_BITS * 4)) & SID_MAP_MASK) ^
  44. ((gvsid >> (SID_MAP_BITS * 3)) & SID_MAP_MASK) ^
  45. ((gvsid >> (SID_MAP_BITS * 2)) & SID_MAP_MASK) ^
  46. ((gvsid >> (SID_MAP_BITS * 1)) & SID_MAP_MASK) ^
  47. ((gvsid >> (SID_MAP_BITS * 0)) & SID_MAP_MASK));
  48. }
  49. static struct kvmppc_sid_map *find_sid_vsid(struct kvm_vcpu *vcpu, u64 gvsid)
  50. {
  51. struct kvmppc_sid_map *map;
  52. u16 sid_map_mask;
  53. if (vcpu->arch.shared->msr & MSR_PR)
  54. gvsid |= VSID_PR;
  55. sid_map_mask = kvmppc_sid_hash(vcpu, gvsid);
  56. map = &to_book3s(vcpu)->sid_map[sid_map_mask];
  57. if (map->valid && (map->guest_vsid == gvsid)) {
  58. trace_kvm_book3s_slb_found(gvsid, map->host_vsid);
  59. return map;
  60. }
  61. map = &to_book3s(vcpu)->sid_map[SID_MAP_MASK - sid_map_mask];
  62. if (map->valid && (map->guest_vsid == gvsid)) {
  63. trace_kvm_book3s_slb_found(gvsid, map->host_vsid);
  64. return map;
  65. }
  66. trace_kvm_book3s_slb_fail(sid_map_mask, gvsid);
  67. return NULL;
  68. }
  69. int kvmppc_mmu_map_page(struct kvm_vcpu *vcpu, struct kvmppc_pte *orig_pte)
  70. {
  71. pfn_t hpaddr;
  72. ulong hash, hpteg, va;
  73. u64 vsid;
  74. int ret;
  75. int rflags = 0x192;
  76. int vflags = 0;
  77. int attempt = 0;
  78. struct kvmppc_sid_map *map;
  79. int r = 0;
  80. /* Get host physical address for gpa */
  81. hpaddr = kvmppc_gfn_to_pfn(vcpu, orig_pte->raddr >> PAGE_SHIFT);
  82. if (is_error_pfn(hpaddr)) {
  83. printk(KERN_INFO "Couldn't get guest page for gfn %lx!\n", orig_pte->eaddr);
  84. r = -EINVAL;
  85. goto out;
  86. }
  87. hpaddr <<= PAGE_SHIFT;
  88. hpaddr |= orig_pte->raddr & (~0xfffULL & ~PAGE_MASK);
  89. /* and write the mapping ea -> hpa into the pt */
  90. vcpu->arch.mmu.esid_to_vsid(vcpu, orig_pte->eaddr >> SID_SHIFT, &vsid);
  91. map = find_sid_vsid(vcpu, vsid);
  92. if (!map) {
  93. ret = kvmppc_mmu_map_segment(vcpu, orig_pte->eaddr);
  94. WARN_ON(ret < 0);
  95. map = find_sid_vsid(vcpu, vsid);
  96. }
  97. if (!map) {
  98. printk(KERN_ERR "KVM: Segment map for 0x%llx (0x%lx) failed\n",
  99. vsid, orig_pte->eaddr);
  100. WARN_ON(true);
  101. r = -EINVAL;
  102. goto out;
  103. }
  104. vsid = map->host_vsid;
  105. va = hpt_va(orig_pte->eaddr, vsid, MMU_SEGSIZE_256M);
  106. if (!orig_pte->may_write)
  107. rflags |= HPTE_R_PP;
  108. else
  109. mark_page_dirty(vcpu->kvm, orig_pte->raddr >> PAGE_SHIFT);
  110. if (!orig_pte->may_execute)
  111. rflags |= HPTE_R_N;
  112. hash = hpt_hash(va, PTE_SIZE, MMU_SEGSIZE_256M);
  113. map_again:
  114. hpteg = ((hash & htab_hash_mask) * HPTES_PER_GROUP);
  115. /* In case we tried normal mapping already, let's nuke old entries */
  116. if (attempt > 1)
  117. if (ppc_md.hpte_remove(hpteg) < 0) {
  118. r = -1;
  119. goto out;
  120. }
  121. ret = ppc_md.hpte_insert(hpteg, va, hpaddr, rflags, vflags, MMU_PAGE_4K, MMU_SEGSIZE_256M);
  122. if (ret < 0) {
  123. /* If we couldn't map a primary PTE, try a secondary */
  124. hash = ~hash;
  125. vflags ^= HPTE_V_SECONDARY;
  126. attempt++;
  127. goto map_again;
  128. } else {
  129. struct hpte_cache *pte = kvmppc_mmu_hpte_cache_next(vcpu);
  130. trace_kvm_book3s_64_mmu_map(rflags, hpteg, va, hpaddr, orig_pte);
  131. /* The ppc_md code may give us a secondary entry even though we
  132. asked for a primary. Fix up. */
  133. if ((ret & _PTEIDX_SECONDARY) && !(vflags & HPTE_V_SECONDARY)) {
  134. hash = ~hash;
  135. hpteg = ((hash & htab_hash_mask) * HPTES_PER_GROUP);
  136. }
  137. pte->slot = hpteg + (ret & 7);
  138. pte->host_va = va;
  139. pte->pte = *orig_pte;
  140. pte->pfn = hpaddr >> PAGE_SHIFT;
  141. kvmppc_mmu_hpte_cache_map(vcpu, pte);
  142. }
  143. out:
  144. return r;
  145. }
  146. static struct kvmppc_sid_map *create_sid_map(struct kvm_vcpu *vcpu, u64 gvsid)
  147. {
  148. struct kvmppc_sid_map *map;
  149. struct kvmppc_vcpu_book3s *vcpu_book3s = to_book3s(vcpu);
  150. u16 sid_map_mask;
  151. static int backwards_map = 0;
  152. if (vcpu->arch.shared->msr & MSR_PR)
  153. gvsid |= VSID_PR;
  154. /* We might get collisions that trap in preceding order, so let's
  155. map them differently */
  156. sid_map_mask = kvmppc_sid_hash(vcpu, gvsid);
  157. if (backwards_map)
  158. sid_map_mask = SID_MAP_MASK - sid_map_mask;
  159. map = &to_book3s(vcpu)->sid_map[sid_map_mask];
  160. /* Make sure we're taking the other map next time */
  161. backwards_map = !backwards_map;
  162. /* Uh-oh ... out of mappings. Let's flush! */
  163. if (vcpu_book3s->proto_vsid_next == vcpu_book3s->proto_vsid_max) {
  164. vcpu_book3s->proto_vsid_next = vcpu_book3s->proto_vsid_first;
  165. memset(vcpu_book3s->sid_map, 0,
  166. sizeof(struct kvmppc_sid_map) * SID_MAP_NUM);
  167. kvmppc_mmu_pte_flush(vcpu, 0, 0);
  168. kvmppc_mmu_flush_segments(vcpu);
  169. }
  170. map->host_vsid = vsid_scramble(vcpu_book3s->proto_vsid_next++, 256M);
  171. map->guest_vsid = gvsid;
  172. map->valid = true;
  173. trace_kvm_book3s_slb_map(sid_map_mask, gvsid, map->host_vsid);
  174. return map;
  175. }
  176. static int kvmppc_mmu_next_segment(struct kvm_vcpu *vcpu, ulong esid)
  177. {
  178. struct kvmppc_book3s_shadow_vcpu *svcpu = svcpu_get(vcpu);
  179. int i;
  180. int max_slb_size = 64;
  181. int found_inval = -1;
  182. int r;
  183. if (!svcpu->slb_max)
  184. svcpu->slb_max = 1;
  185. /* Are we overwriting? */
  186. for (i = 1; i < svcpu->slb_max; i++) {
  187. if (!(svcpu->slb[i].esid & SLB_ESID_V))
  188. found_inval = i;
  189. else if ((svcpu->slb[i].esid & ESID_MASK) == esid) {
  190. r = i;
  191. goto out;
  192. }
  193. }
  194. /* Found a spare entry that was invalidated before */
  195. if (found_inval > 0) {
  196. r = found_inval;
  197. goto out;
  198. }
  199. /* No spare invalid entry, so create one */
  200. if (mmu_slb_size < 64)
  201. max_slb_size = mmu_slb_size;
  202. /* Overflowing -> purge */
  203. if ((svcpu->slb_max) == max_slb_size)
  204. kvmppc_mmu_flush_segments(vcpu);
  205. r = svcpu->slb_max;
  206. svcpu->slb_max++;
  207. out:
  208. svcpu_put(svcpu);
  209. return r;
  210. }
  211. int kvmppc_mmu_map_segment(struct kvm_vcpu *vcpu, ulong eaddr)
  212. {
  213. struct kvmppc_book3s_shadow_vcpu *svcpu = svcpu_get(vcpu);
  214. u64 esid = eaddr >> SID_SHIFT;
  215. u64 slb_esid = (eaddr & ESID_MASK) | SLB_ESID_V;
  216. u64 slb_vsid = SLB_VSID_USER;
  217. u64 gvsid;
  218. int slb_index;
  219. struct kvmppc_sid_map *map;
  220. int r = 0;
  221. slb_index = kvmppc_mmu_next_segment(vcpu, eaddr & ESID_MASK);
  222. if (vcpu->arch.mmu.esid_to_vsid(vcpu, esid, &gvsid)) {
  223. /* Invalidate an entry */
  224. svcpu->slb[slb_index].esid = 0;
  225. r = -ENOENT;
  226. goto out;
  227. }
  228. map = find_sid_vsid(vcpu, gvsid);
  229. if (!map)
  230. map = create_sid_map(vcpu, gvsid);
  231. map->guest_esid = esid;
  232. slb_vsid |= (map->host_vsid << 12);
  233. slb_vsid &= ~SLB_VSID_KP;
  234. slb_esid |= slb_index;
  235. svcpu->slb[slb_index].esid = slb_esid;
  236. svcpu->slb[slb_index].vsid = slb_vsid;
  237. trace_kvm_book3s_slbmte(slb_vsid, slb_esid);
  238. out:
  239. svcpu_put(svcpu);
  240. return r;
  241. }
  242. void kvmppc_mmu_flush_segments(struct kvm_vcpu *vcpu)
  243. {
  244. struct kvmppc_book3s_shadow_vcpu *svcpu = svcpu_get(vcpu);
  245. svcpu->slb_max = 1;
  246. svcpu->slb[0].esid = 0;
  247. svcpu_put(svcpu);
  248. }
  249. void kvmppc_mmu_destroy(struct kvm_vcpu *vcpu)
  250. {
  251. kvmppc_mmu_hpte_destroy(vcpu);
  252. __destroy_context(to_book3s(vcpu)->context_id[0]);
  253. }
  254. int kvmppc_mmu_init(struct kvm_vcpu *vcpu)
  255. {
  256. struct kvmppc_vcpu_book3s *vcpu3s = to_book3s(vcpu);
  257. int err;
  258. err = __init_new_context();
  259. if (err < 0)
  260. return -1;
  261. vcpu3s->context_id[0] = err;
  262. vcpu3s->proto_vsid_max = ((vcpu3s->context_id[0] + 1)
  263. << USER_ESID_BITS) - 1;
  264. vcpu3s->proto_vsid_first = vcpu3s->context_id[0] << USER_ESID_BITS;
  265. vcpu3s->proto_vsid_next = vcpu3s->proto_vsid_first;
  266. kvmppc_mmu_hpte_init(vcpu);
  267. return 0;
  268. }