mmu.c 81 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434
  1. /*
  2. * Kernel-based Virtual Machine driver for Linux
  3. *
  4. * This module enables machines with Intel VT-x extensions to run virtual
  5. * machines without emulation or binary translation.
  6. *
  7. * MMU support
  8. *
  9. * Copyright (C) 2006 Qumranet, Inc.
  10. *
  11. * Authors:
  12. * Yaniv Kamay <yaniv@qumranet.com>
  13. * Avi Kivity <avi@qumranet.com>
  14. *
  15. * This work is licensed under the terms of the GNU GPL, version 2. See
  16. * the COPYING file in the top-level directory.
  17. *
  18. */
  19. #include "mmu.h"
  20. #include "kvm_cache_regs.h"
  21. #include <linux/kvm_host.h>
  22. #include <linux/types.h>
  23. #include <linux/string.h>
  24. #include <linux/mm.h>
  25. #include <linux/highmem.h>
  26. #include <linux/module.h>
  27. #include <linux/swap.h>
  28. #include <linux/hugetlb.h>
  29. #include <linux/compiler.h>
  30. #include <asm/page.h>
  31. #include <asm/cmpxchg.h>
  32. #include <asm/io.h>
  33. #include <asm/vmx.h>
  34. /*
  35. * When setting this variable to true it enables Two-Dimensional-Paging
  36. * where the hardware walks 2 page tables:
  37. * 1. the guest-virtual to guest-physical
  38. * 2. while doing 1. it walks guest-physical to host-physical
  39. * If the hardware supports that we don't need to do shadow paging.
  40. */
  41. bool tdp_enabled = false;
  42. #undef MMU_DEBUG
  43. #undef AUDIT
  44. #ifdef AUDIT
  45. static void kvm_mmu_audit(struct kvm_vcpu *vcpu, const char *msg);
  46. #else
  47. static void kvm_mmu_audit(struct kvm_vcpu *vcpu, const char *msg) {}
  48. #endif
  49. #ifdef MMU_DEBUG
  50. #define pgprintk(x...) do { if (dbg) printk(x); } while (0)
  51. #define rmap_printk(x...) do { if (dbg) printk(x); } while (0)
  52. #else
  53. #define pgprintk(x...) do { } while (0)
  54. #define rmap_printk(x...) do { } while (0)
  55. #endif
  56. #if defined(MMU_DEBUG) || defined(AUDIT)
  57. static int dbg = 0;
  58. module_param(dbg, bool, 0644);
  59. #endif
  60. static int oos_shadow = 1;
  61. module_param(oos_shadow, bool, 0644);
  62. #ifndef MMU_DEBUG
  63. #define ASSERT(x) do { } while (0)
  64. #else
  65. #define ASSERT(x) \
  66. if (!(x)) { \
  67. printk(KERN_WARNING "assertion failed %s:%d: %s\n", \
  68. __FILE__, __LINE__, #x); \
  69. }
  70. #endif
  71. #define PT_FIRST_AVAIL_BITS_SHIFT 9
  72. #define PT64_SECOND_AVAIL_BITS_SHIFT 52
  73. #define VALID_PAGE(x) ((x) != INVALID_PAGE)
  74. #define PT64_LEVEL_BITS 9
  75. #define PT64_LEVEL_SHIFT(level) \
  76. (PAGE_SHIFT + (level - 1) * PT64_LEVEL_BITS)
  77. #define PT64_LEVEL_MASK(level) \
  78. (((1ULL << PT64_LEVEL_BITS) - 1) << PT64_LEVEL_SHIFT(level))
  79. #define PT64_INDEX(address, level)\
  80. (((address) >> PT64_LEVEL_SHIFT(level)) & ((1 << PT64_LEVEL_BITS) - 1))
  81. #define PT32_LEVEL_BITS 10
  82. #define PT32_LEVEL_SHIFT(level) \
  83. (PAGE_SHIFT + (level - 1) * PT32_LEVEL_BITS)
  84. #define PT32_LEVEL_MASK(level) \
  85. (((1ULL << PT32_LEVEL_BITS) - 1) << PT32_LEVEL_SHIFT(level))
  86. #define PT32_LVL_OFFSET_MASK(level) \
  87. (PT32_BASE_ADDR_MASK & ((1ULL << (PAGE_SHIFT + (((level) - 1) \
  88. * PT32_LEVEL_BITS))) - 1))
  89. #define PT32_INDEX(address, level)\
  90. (((address) >> PT32_LEVEL_SHIFT(level)) & ((1 << PT32_LEVEL_BITS) - 1))
  91. #define PT64_BASE_ADDR_MASK (((1ULL << 52) - 1) & ~(u64)(PAGE_SIZE-1))
  92. #define PT64_DIR_BASE_ADDR_MASK \
  93. (PT64_BASE_ADDR_MASK & ~((1ULL << (PAGE_SHIFT + PT64_LEVEL_BITS)) - 1))
  94. #define PT64_LVL_ADDR_MASK(level) \
  95. (PT64_BASE_ADDR_MASK & ~((1ULL << (PAGE_SHIFT + (((level) - 1) \
  96. * PT64_LEVEL_BITS))) - 1))
  97. #define PT64_LVL_OFFSET_MASK(level) \
  98. (PT64_BASE_ADDR_MASK & ((1ULL << (PAGE_SHIFT + (((level) - 1) \
  99. * PT64_LEVEL_BITS))) - 1))
  100. #define PT32_BASE_ADDR_MASK PAGE_MASK
  101. #define PT32_DIR_BASE_ADDR_MASK \
  102. (PAGE_MASK & ~((1ULL << (PAGE_SHIFT + PT32_LEVEL_BITS)) - 1))
  103. #define PT32_LVL_ADDR_MASK(level) \
  104. (PAGE_MASK & ~((1ULL << (PAGE_SHIFT + (((level) - 1) \
  105. * PT32_LEVEL_BITS))) - 1))
  106. #define PT64_PERM_MASK (PT_PRESENT_MASK | PT_WRITABLE_MASK | PT_USER_MASK \
  107. | PT64_NX_MASK)
  108. #define PFERR_PRESENT_MASK (1U << 0)
  109. #define PFERR_WRITE_MASK (1U << 1)
  110. #define PFERR_USER_MASK (1U << 2)
  111. #define PFERR_RSVD_MASK (1U << 3)
  112. #define PFERR_FETCH_MASK (1U << 4)
  113. #define PT_PDPE_LEVEL 3
  114. #define PT_DIRECTORY_LEVEL 2
  115. #define PT_PAGE_TABLE_LEVEL 1
  116. #define RMAP_EXT 4
  117. #define ACC_EXEC_MASK 1
  118. #define ACC_WRITE_MASK PT_WRITABLE_MASK
  119. #define ACC_USER_MASK PT_USER_MASK
  120. #define ACC_ALL (ACC_EXEC_MASK | ACC_WRITE_MASK | ACC_USER_MASK)
  121. #define CREATE_TRACE_POINTS
  122. #include "mmutrace.h"
  123. #define SPTE_HOST_WRITEABLE (1ULL << PT_FIRST_AVAIL_BITS_SHIFT)
  124. #define SHADOW_PT_INDEX(addr, level) PT64_INDEX(addr, level)
  125. struct kvm_rmap_desc {
  126. u64 *sptes[RMAP_EXT];
  127. struct kvm_rmap_desc *more;
  128. };
  129. struct kvm_shadow_walk_iterator {
  130. u64 addr;
  131. hpa_t shadow_addr;
  132. int level;
  133. u64 *sptep;
  134. unsigned index;
  135. };
  136. #define for_each_shadow_entry(_vcpu, _addr, _walker) \
  137. for (shadow_walk_init(&(_walker), _vcpu, _addr); \
  138. shadow_walk_okay(&(_walker)); \
  139. shadow_walk_next(&(_walker)))
  140. struct kvm_unsync_walk {
  141. int (*entry) (struct kvm_mmu_page *sp, struct kvm_unsync_walk *walk);
  142. };
  143. typedef int (*mmu_parent_walk_fn) (struct kvm_vcpu *vcpu, struct kvm_mmu_page *sp);
  144. static struct kmem_cache *pte_chain_cache;
  145. static struct kmem_cache *rmap_desc_cache;
  146. static struct kmem_cache *mmu_page_header_cache;
  147. static u64 __read_mostly shadow_trap_nonpresent_pte;
  148. static u64 __read_mostly shadow_notrap_nonpresent_pte;
  149. static u64 __read_mostly shadow_base_present_pte;
  150. static u64 __read_mostly shadow_nx_mask;
  151. static u64 __read_mostly shadow_x_mask; /* mutual exclusive with nx_mask */
  152. static u64 __read_mostly shadow_user_mask;
  153. static u64 __read_mostly shadow_accessed_mask;
  154. static u64 __read_mostly shadow_dirty_mask;
  155. static inline u64 rsvd_bits(int s, int e)
  156. {
  157. return ((1ULL << (e - s + 1)) - 1) << s;
  158. }
  159. void kvm_mmu_set_nonpresent_ptes(u64 trap_pte, u64 notrap_pte)
  160. {
  161. shadow_trap_nonpresent_pte = trap_pte;
  162. shadow_notrap_nonpresent_pte = notrap_pte;
  163. }
  164. EXPORT_SYMBOL_GPL(kvm_mmu_set_nonpresent_ptes);
  165. void kvm_mmu_set_base_ptes(u64 base_pte)
  166. {
  167. shadow_base_present_pte = base_pte;
  168. }
  169. EXPORT_SYMBOL_GPL(kvm_mmu_set_base_ptes);
  170. void kvm_mmu_set_mask_ptes(u64 user_mask, u64 accessed_mask,
  171. u64 dirty_mask, u64 nx_mask, u64 x_mask)
  172. {
  173. shadow_user_mask = user_mask;
  174. shadow_accessed_mask = accessed_mask;
  175. shadow_dirty_mask = dirty_mask;
  176. shadow_nx_mask = nx_mask;
  177. shadow_x_mask = x_mask;
  178. }
  179. EXPORT_SYMBOL_GPL(kvm_mmu_set_mask_ptes);
  180. static int is_write_protection(struct kvm_vcpu *vcpu)
  181. {
  182. return vcpu->arch.cr0 & X86_CR0_WP;
  183. }
  184. static int is_cpuid_PSE36(void)
  185. {
  186. return 1;
  187. }
  188. static int is_nx(struct kvm_vcpu *vcpu)
  189. {
  190. return vcpu->arch.shadow_efer & EFER_NX;
  191. }
  192. static int is_shadow_present_pte(u64 pte)
  193. {
  194. return pte != shadow_trap_nonpresent_pte
  195. && pte != shadow_notrap_nonpresent_pte;
  196. }
  197. static int is_large_pte(u64 pte)
  198. {
  199. return pte & PT_PAGE_SIZE_MASK;
  200. }
  201. static int is_writeble_pte(unsigned long pte)
  202. {
  203. return pte & PT_WRITABLE_MASK;
  204. }
  205. static int is_dirty_gpte(unsigned long pte)
  206. {
  207. return pte & PT_DIRTY_MASK;
  208. }
  209. static int is_rmap_spte(u64 pte)
  210. {
  211. return is_shadow_present_pte(pte);
  212. }
  213. static int is_last_spte(u64 pte, int level)
  214. {
  215. if (level == PT_PAGE_TABLE_LEVEL)
  216. return 1;
  217. if (is_large_pte(pte))
  218. return 1;
  219. return 0;
  220. }
  221. static pfn_t spte_to_pfn(u64 pte)
  222. {
  223. return (pte & PT64_BASE_ADDR_MASK) >> PAGE_SHIFT;
  224. }
  225. static gfn_t pse36_gfn_delta(u32 gpte)
  226. {
  227. int shift = 32 - PT32_DIR_PSE36_SHIFT - PAGE_SHIFT;
  228. return (gpte & PT32_DIR_PSE36_MASK) << shift;
  229. }
  230. static void __set_spte(u64 *sptep, u64 spte)
  231. {
  232. #ifdef CONFIG_X86_64
  233. set_64bit((unsigned long *)sptep, spte);
  234. #else
  235. set_64bit((unsigned long long *)sptep, spte);
  236. #endif
  237. }
  238. static int mmu_topup_memory_cache(struct kvm_mmu_memory_cache *cache,
  239. struct kmem_cache *base_cache, int min)
  240. {
  241. void *obj;
  242. if (cache->nobjs >= min)
  243. return 0;
  244. while (cache->nobjs < ARRAY_SIZE(cache->objects)) {
  245. obj = kmem_cache_zalloc(base_cache, GFP_KERNEL);
  246. if (!obj)
  247. return -ENOMEM;
  248. cache->objects[cache->nobjs++] = obj;
  249. }
  250. return 0;
  251. }
  252. static void mmu_free_memory_cache(struct kvm_mmu_memory_cache *mc)
  253. {
  254. while (mc->nobjs)
  255. kfree(mc->objects[--mc->nobjs]);
  256. }
  257. static int mmu_topup_memory_cache_page(struct kvm_mmu_memory_cache *cache,
  258. int min)
  259. {
  260. struct page *page;
  261. if (cache->nobjs >= min)
  262. return 0;
  263. while (cache->nobjs < ARRAY_SIZE(cache->objects)) {
  264. page = alloc_page(GFP_KERNEL);
  265. if (!page)
  266. return -ENOMEM;
  267. set_page_private(page, 0);
  268. cache->objects[cache->nobjs++] = page_address(page);
  269. }
  270. return 0;
  271. }
  272. static void mmu_free_memory_cache_page(struct kvm_mmu_memory_cache *mc)
  273. {
  274. while (mc->nobjs)
  275. free_page((unsigned long)mc->objects[--mc->nobjs]);
  276. }
  277. static int mmu_topup_memory_caches(struct kvm_vcpu *vcpu)
  278. {
  279. int r;
  280. r = mmu_topup_memory_cache(&vcpu->arch.mmu_pte_chain_cache,
  281. pte_chain_cache, 4);
  282. if (r)
  283. goto out;
  284. r = mmu_topup_memory_cache(&vcpu->arch.mmu_rmap_desc_cache,
  285. rmap_desc_cache, 4);
  286. if (r)
  287. goto out;
  288. r = mmu_topup_memory_cache_page(&vcpu->arch.mmu_page_cache, 8);
  289. if (r)
  290. goto out;
  291. r = mmu_topup_memory_cache(&vcpu->arch.mmu_page_header_cache,
  292. mmu_page_header_cache, 4);
  293. out:
  294. return r;
  295. }
  296. static void mmu_free_memory_caches(struct kvm_vcpu *vcpu)
  297. {
  298. mmu_free_memory_cache(&vcpu->arch.mmu_pte_chain_cache);
  299. mmu_free_memory_cache(&vcpu->arch.mmu_rmap_desc_cache);
  300. mmu_free_memory_cache_page(&vcpu->arch.mmu_page_cache);
  301. mmu_free_memory_cache(&vcpu->arch.mmu_page_header_cache);
  302. }
  303. static void *mmu_memory_cache_alloc(struct kvm_mmu_memory_cache *mc,
  304. size_t size)
  305. {
  306. void *p;
  307. BUG_ON(!mc->nobjs);
  308. p = mc->objects[--mc->nobjs];
  309. return p;
  310. }
  311. static struct kvm_pte_chain *mmu_alloc_pte_chain(struct kvm_vcpu *vcpu)
  312. {
  313. return mmu_memory_cache_alloc(&vcpu->arch.mmu_pte_chain_cache,
  314. sizeof(struct kvm_pte_chain));
  315. }
  316. static void mmu_free_pte_chain(struct kvm_pte_chain *pc)
  317. {
  318. kfree(pc);
  319. }
  320. static struct kvm_rmap_desc *mmu_alloc_rmap_desc(struct kvm_vcpu *vcpu)
  321. {
  322. return mmu_memory_cache_alloc(&vcpu->arch.mmu_rmap_desc_cache,
  323. sizeof(struct kvm_rmap_desc));
  324. }
  325. static void mmu_free_rmap_desc(struct kvm_rmap_desc *rd)
  326. {
  327. kfree(rd);
  328. }
  329. /*
  330. * Return the pointer to the largepage write count for a given
  331. * gfn, handling slots that are not large page aligned.
  332. */
  333. static int *slot_largepage_idx(gfn_t gfn,
  334. struct kvm_memory_slot *slot,
  335. int level)
  336. {
  337. unsigned long idx;
  338. idx = (gfn / KVM_PAGES_PER_HPAGE(level)) -
  339. (slot->base_gfn / KVM_PAGES_PER_HPAGE(level));
  340. return &slot->lpage_info[level - 2][idx].write_count;
  341. }
  342. static void account_shadowed(struct kvm *kvm, gfn_t gfn)
  343. {
  344. struct kvm_memory_slot *slot;
  345. int *write_count;
  346. int i;
  347. gfn = unalias_gfn(kvm, gfn);
  348. slot = gfn_to_memslot_unaliased(kvm, gfn);
  349. for (i = PT_DIRECTORY_LEVEL;
  350. i < PT_PAGE_TABLE_LEVEL + KVM_NR_PAGE_SIZES; ++i) {
  351. write_count = slot_largepage_idx(gfn, slot, i);
  352. *write_count += 1;
  353. }
  354. }
  355. static void unaccount_shadowed(struct kvm *kvm, gfn_t gfn)
  356. {
  357. struct kvm_memory_slot *slot;
  358. int *write_count;
  359. int i;
  360. gfn = unalias_gfn(kvm, gfn);
  361. for (i = PT_DIRECTORY_LEVEL;
  362. i < PT_PAGE_TABLE_LEVEL + KVM_NR_PAGE_SIZES; ++i) {
  363. slot = gfn_to_memslot_unaliased(kvm, gfn);
  364. write_count = slot_largepage_idx(gfn, slot, i);
  365. *write_count -= 1;
  366. WARN_ON(*write_count < 0);
  367. }
  368. }
  369. static int has_wrprotected_page(struct kvm *kvm,
  370. gfn_t gfn,
  371. int level)
  372. {
  373. struct kvm_memory_slot *slot;
  374. int *largepage_idx;
  375. gfn = unalias_gfn(kvm, gfn);
  376. slot = gfn_to_memslot_unaliased(kvm, gfn);
  377. if (slot) {
  378. largepage_idx = slot_largepage_idx(gfn, slot, level);
  379. return *largepage_idx;
  380. }
  381. return 1;
  382. }
  383. static int host_mapping_level(struct kvm *kvm, gfn_t gfn)
  384. {
  385. unsigned long page_size = PAGE_SIZE;
  386. struct vm_area_struct *vma;
  387. unsigned long addr;
  388. int i, ret = 0;
  389. addr = gfn_to_hva(kvm, gfn);
  390. if (kvm_is_error_hva(addr))
  391. return page_size;
  392. down_read(&current->mm->mmap_sem);
  393. vma = find_vma(current->mm, addr);
  394. if (!vma)
  395. goto out;
  396. page_size = vma_kernel_pagesize(vma);
  397. out:
  398. up_read(&current->mm->mmap_sem);
  399. for (i = PT_PAGE_TABLE_LEVEL;
  400. i < (PT_PAGE_TABLE_LEVEL + KVM_NR_PAGE_SIZES); ++i) {
  401. if (page_size >= KVM_HPAGE_SIZE(i))
  402. ret = i;
  403. else
  404. break;
  405. }
  406. return ret;
  407. }
  408. static int mapping_level(struct kvm_vcpu *vcpu, gfn_t large_gfn)
  409. {
  410. struct kvm_memory_slot *slot;
  411. int host_level;
  412. int level = PT_PAGE_TABLE_LEVEL;
  413. slot = gfn_to_memslot(vcpu->kvm, large_gfn);
  414. if (slot && slot->dirty_bitmap)
  415. return PT_PAGE_TABLE_LEVEL;
  416. host_level = host_mapping_level(vcpu->kvm, large_gfn);
  417. if (host_level == PT_PAGE_TABLE_LEVEL)
  418. return host_level;
  419. for (level = PT_DIRECTORY_LEVEL; level <= host_level; ++level) {
  420. if (has_wrprotected_page(vcpu->kvm, large_gfn, level))
  421. break;
  422. }
  423. return level - 1;
  424. }
  425. /*
  426. * Take gfn and return the reverse mapping to it.
  427. * Note: gfn must be unaliased before this function get called
  428. */
  429. static unsigned long *gfn_to_rmap(struct kvm *kvm, gfn_t gfn, int level)
  430. {
  431. struct kvm_memory_slot *slot;
  432. unsigned long idx;
  433. slot = gfn_to_memslot(kvm, gfn);
  434. if (likely(level == PT_PAGE_TABLE_LEVEL))
  435. return &slot->rmap[gfn - slot->base_gfn];
  436. idx = (gfn / KVM_PAGES_PER_HPAGE(level)) -
  437. (slot->base_gfn / KVM_PAGES_PER_HPAGE(level));
  438. return &slot->lpage_info[level - 2][idx].rmap_pde;
  439. }
  440. /*
  441. * Reverse mapping data structures:
  442. *
  443. * If rmapp bit zero is zero, then rmapp point to the shadw page table entry
  444. * that points to page_address(page).
  445. *
  446. * If rmapp bit zero is one, (then rmap & ~1) points to a struct kvm_rmap_desc
  447. * containing more mappings.
  448. *
  449. * Returns the number of rmap entries before the spte was added or zero if
  450. * the spte was not added.
  451. *
  452. */
  453. static int rmap_add(struct kvm_vcpu *vcpu, u64 *spte, gfn_t gfn)
  454. {
  455. struct kvm_mmu_page *sp;
  456. struct kvm_rmap_desc *desc;
  457. unsigned long *rmapp;
  458. int i, count = 0;
  459. if (!is_rmap_spte(*spte))
  460. return count;
  461. gfn = unalias_gfn(vcpu->kvm, gfn);
  462. sp = page_header(__pa(spte));
  463. sp->gfns[spte - sp->spt] = gfn;
  464. rmapp = gfn_to_rmap(vcpu->kvm, gfn, sp->role.level);
  465. if (!*rmapp) {
  466. rmap_printk("rmap_add: %p %llx 0->1\n", spte, *spte);
  467. *rmapp = (unsigned long)spte;
  468. } else if (!(*rmapp & 1)) {
  469. rmap_printk("rmap_add: %p %llx 1->many\n", spte, *spte);
  470. desc = mmu_alloc_rmap_desc(vcpu);
  471. desc->sptes[0] = (u64 *)*rmapp;
  472. desc->sptes[1] = spte;
  473. *rmapp = (unsigned long)desc | 1;
  474. } else {
  475. rmap_printk("rmap_add: %p %llx many->many\n", spte, *spte);
  476. desc = (struct kvm_rmap_desc *)(*rmapp & ~1ul);
  477. while (desc->sptes[RMAP_EXT-1] && desc->more) {
  478. desc = desc->more;
  479. count += RMAP_EXT;
  480. }
  481. if (desc->sptes[RMAP_EXT-1]) {
  482. desc->more = mmu_alloc_rmap_desc(vcpu);
  483. desc = desc->more;
  484. }
  485. for (i = 0; desc->sptes[i]; ++i)
  486. ;
  487. desc->sptes[i] = spte;
  488. }
  489. return count;
  490. }
  491. static void rmap_desc_remove_entry(unsigned long *rmapp,
  492. struct kvm_rmap_desc *desc,
  493. int i,
  494. struct kvm_rmap_desc *prev_desc)
  495. {
  496. int j;
  497. for (j = RMAP_EXT - 1; !desc->sptes[j] && j > i; --j)
  498. ;
  499. desc->sptes[i] = desc->sptes[j];
  500. desc->sptes[j] = NULL;
  501. if (j != 0)
  502. return;
  503. if (!prev_desc && !desc->more)
  504. *rmapp = (unsigned long)desc->sptes[0];
  505. else
  506. if (prev_desc)
  507. prev_desc->more = desc->more;
  508. else
  509. *rmapp = (unsigned long)desc->more | 1;
  510. mmu_free_rmap_desc(desc);
  511. }
  512. static void rmap_remove(struct kvm *kvm, u64 *spte)
  513. {
  514. struct kvm_rmap_desc *desc;
  515. struct kvm_rmap_desc *prev_desc;
  516. struct kvm_mmu_page *sp;
  517. pfn_t pfn;
  518. unsigned long *rmapp;
  519. int i;
  520. if (!is_rmap_spte(*spte))
  521. return;
  522. sp = page_header(__pa(spte));
  523. pfn = spte_to_pfn(*spte);
  524. if (*spte & shadow_accessed_mask)
  525. kvm_set_pfn_accessed(pfn);
  526. if (is_writeble_pte(*spte))
  527. kvm_set_pfn_dirty(pfn);
  528. rmapp = gfn_to_rmap(kvm, sp->gfns[spte - sp->spt], sp->role.level);
  529. if (!*rmapp) {
  530. printk(KERN_ERR "rmap_remove: %p %llx 0->BUG\n", spte, *spte);
  531. BUG();
  532. } else if (!(*rmapp & 1)) {
  533. rmap_printk("rmap_remove: %p %llx 1->0\n", spte, *spte);
  534. if ((u64 *)*rmapp != spte) {
  535. printk(KERN_ERR "rmap_remove: %p %llx 1->BUG\n",
  536. spte, *spte);
  537. BUG();
  538. }
  539. *rmapp = 0;
  540. } else {
  541. rmap_printk("rmap_remove: %p %llx many->many\n", spte, *spte);
  542. desc = (struct kvm_rmap_desc *)(*rmapp & ~1ul);
  543. prev_desc = NULL;
  544. while (desc) {
  545. for (i = 0; i < RMAP_EXT && desc->sptes[i]; ++i)
  546. if (desc->sptes[i] == spte) {
  547. rmap_desc_remove_entry(rmapp,
  548. desc, i,
  549. prev_desc);
  550. return;
  551. }
  552. prev_desc = desc;
  553. desc = desc->more;
  554. }
  555. BUG();
  556. }
  557. }
  558. static u64 *rmap_next(struct kvm *kvm, unsigned long *rmapp, u64 *spte)
  559. {
  560. struct kvm_rmap_desc *desc;
  561. struct kvm_rmap_desc *prev_desc;
  562. u64 *prev_spte;
  563. int i;
  564. if (!*rmapp)
  565. return NULL;
  566. else if (!(*rmapp & 1)) {
  567. if (!spte)
  568. return (u64 *)*rmapp;
  569. return NULL;
  570. }
  571. desc = (struct kvm_rmap_desc *)(*rmapp & ~1ul);
  572. prev_desc = NULL;
  573. prev_spte = NULL;
  574. while (desc) {
  575. for (i = 0; i < RMAP_EXT && desc->sptes[i]; ++i) {
  576. if (prev_spte == spte)
  577. return desc->sptes[i];
  578. prev_spte = desc->sptes[i];
  579. }
  580. desc = desc->more;
  581. }
  582. return NULL;
  583. }
  584. static int rmap_write_protect(struct kvm *kvm, u64 gfn)
  585. {
  586. unsigned long *rmapp;
  587. u64 *spte;
  588. int i, write_protected = 0;
  589. gfn = unalias_gfn(kvm, gfn);
  590. rmapp = gfn_to_rmap(kvm, gfn, PT_PAGE_TABLE_LEVEL);
  591. spte = rmap_next(kvm, rmapp, NULL);
  592. while (spte) {
  593. BUG_ON(!spte);
  594. BUG_ON(!(*spte & PT_PRESENT_MASK));
  595. rmap_printk("rmap_write_protect: spte %p %llx\n", spte, *spte);
  596. if (is_writeble_pte(*spte)) {
  597. __set_spte(spte, *spte & ~PT_WRITABLE_MASK);
  598. write_protected = 1;
  599. }
  600. spte = rmap_next(kvm, rmapp, spte);
  601. }
  602. if (write_protected) {
  603. pfn_t pfn;
  604. spte = rmap_next(kvm, rmapp, NULL);
  605. pfn = spte_to_pfn(*spte);
  606. kvm_set_pfn_dirty(pfn);
  607. }
  608. /* check for huge page mappings */
  609. for (i = PT_DIRECTORY_LEVEL;
  610. i < PT_PAGE_TABLE_LEVEL + KVM_NR_PAGE_SIZES; ++i) {
  611. rmapp = gfn_to_rmap(kvm, gfn, i);
  612. spte = rmap_next(kvm, rmapp, NULL);
  613. while (spte) {
  614. BUG_ON(!spte);
  615. BUG_ON(!(*spte & PT_PRESENT_MASK));
  616. BUG_ON((*spte & (PT_PAGE_SIZE_MASK|PT_PRESENT_MASK)) != (PT_PAGE_SIZE_MASK|PT_PRESENT_MASK));
  617. pgprintk("rmap_write_protect(large): spte %p %llx %lld\n", spte, *spte, gfn);
  618. if (is_writeble_pte(*spte)) {
  619. rmap_remove(kvm, spte);
  620. --kvm->stat.lpages;
  621. __set_spte(spte, shadow_trap_nonpresent_pte);
  622. spte = NULL;
  623. write_protected = 1;
  624. }
  625. spte = rmap_next(kvm, rmapp, spte);
  626. }
  627. }
  628. return write_protected;
  629. }
  630. static int kvm_unmap_rmapp(struct kvm *kvm, unsigned long *rmapp, u64 data)
  631. {
  632. u64 *spte;
  633. int need_tlb_flush = 0;
  634. while ((spte = rmap_next(kvm, rmapp, NULL))) {
  635. BUG_ON(!(*spte & PT_PRESENT_MASK));
  636. rmap_printk("kvm_rmap_unmap_hva: spte %p %llx\n", spte, *spte);
  637. rmap_remove(kvm, spte);
  638. __set_spte(spte, shadow_trap_nonpresent_pte);
  639. need_tlb_flush = 1;
  640. }
  641. return need_tlb_flush;
  642. }
  643. static int kvm_set_pte_rmapp(struct kvm *kvm, unsigned long *rmapp, u64 data)
  644. {
  645. int need_flush = 0;
  646. u64 *spte, new_spte;
  647. pte_t *ptep = (pte_t *)data;
  648. pfn_t new_pfn;
  649. WARN_ON(pte_huge(*ptep));
  650. new_pfn = pte_pfn(*ptep);
  651. spte = rmap_next(kvm, rmapp, NULL);
  652. while (spte) {
  653. BUG_ON(!is_shadow_present_pte(*spte));
  654. rmap_printk("kvm_set_pte_rmapp: spte %p %llx\n", spte, *spte);
  655. need_flush = 1;
  656. if (pte_write(*ptep)) {
  657. rmap_remove(kvm, spte);
  658. __set_spte(spte, shadow_trap_nonpresent_pte);
  659. spte = rmap_next(kvm, rmapp, NULL);
  660. } else {
  661. new_spte = *spte &~ (PT64_BASE_ADDR_MASK);
  662. new_spte |= (u64)new_pfn << PAGE_SHIFT;
  663. new_spte &= ~PT_WRITABLE_MASK;
  664. new_spte &= ~SPTE_HOST_WRITEABLE;
  665. if (is_writeble_pte(*spte))
  666. kvm_set_pfn_dirty(spte_to_pfn(*spte));
  667. __set_spte(spte, new_spte);
  668. spte = rmap_next(kvm, rmapp, spte);
  669. }
  670. }
  671. if (need_flush)
  672. kvm_flush_remote_tlbs(kvm);
  673. return 0;
  674. }
  675. static int kvm_handle_hva(struct kvm *kvm, unsigned long hva, u64 data,
  676. int (*handler)(struct kvm *kvm, unsigned long *rmapp,
  677. u64 data))
  678. {
  679. int i, j;
  680. int retval = 0;
  681. /*
  682. * If mmap_sem isn't taken, we can look the memslots with only
  683. * the mmu_lock by skipping over the slots with userspace_addr == 0.
  684. */
  685. for (i = 0; i < kvm->nmemslots; i++) {
  686. struct kvm_memory_slot *memslot = &kvm->memslots[i];
  687. unsigned long start = memslot->userspace_addr;
  688. unsigned long end;
  689. /* mmu_lock protects userspace_addr */
  690. if (!start)
  691. continue;
  692. end = start + (memslot->npages << PAGE_SHIFT);
  693. if (hva >= start && hva < end) {
  694. gfn_t gfn_offset = (hva - start) >> PAGE_SHIFT;
  695. retval |= handler(kvm, &memslot->rmap[gfn_offset],
  696. data);
  697. for (j = 0; j < KVM_NR_PAGE_SIZES - 1; ++j) {
  698. int idx = gfn_offset;
  699. idx /= KVM_PAGES_PER_HPAGE(PT_DIRECTORY_LEVEL + j);
  700. retval |= handler(kvm,
  701. &memslot->lpage_info[j][idx].rmap_pde,
  702. data);
  703. }
  704. }
  705. }
  706. return retval;
  707. }
  708. int kvm_unmap_hva(struct kvm *kvm, unsigned long hva)
  709. {
  710. return kvm_handle_hva(kvm, hva, 0, kvm_unmap_rmapp);
  711. }
  712. void kvm_set_spte_hva(struct kvm *kvm, unsigned long hva, pte_t pte)
  713. {
  714. kvm_handle_hva(kvm, hva, (u64)&pte, kvm_set_pte_rmapp);
  715. }
  716. static int kvm_age_rmapp(struct kvm *kvm, unsigned long *rmapp, u64 data)
  717. {
  718. u64 *spte;
  719. int young = 0;
  720. /* always return old for EPT */
  721. if (!shadow_accessed_mask)
  722. return 0;
  723. spte = rmap_next(kvm, rmapp, NULL);
  724. while (spte) {
  725. int _young;
  726. u64 _spte = *spte;
  727. BUG_ON(!(_spte & PT_PRESENT_MASK));
  728. _young = _spte & PT_ACCESSED_MASK;
  729. if (_young) {
  730. young = 1;
  731. clear_bit(PT_ACCESSED_SHIFT, (unsigned long *)spte);
  732. }
  733. spte = rmap_next(kvm, rmapp, spte);
  734. }
  735. return young;
  736. }
  737. #define RMAP_RECYCLE_THRESHOLD 1000
  738. static void rmap_recycle(struct kvm_vcpu *vcpu, u64 *spte, gfn_t gfn)
  739. {
  740. unsigned long *rmapp;
  741. struct kvm_mmu_page *sp;
  742. sp = page_header(__pa(spte));
  743. gfn = unalias_gfn(vcpu->kvm, gfn);
  744. rmapp = gfn_to_rmap(vcpu->kvm, gfn, sp->role.level);
  745. kvm_unmap_rmapp(vcpu->kvm, rmapp, 0);
  746. kvm_flush_remote_tlbs(vcpu->kvm);
  747. }
  748. int kvm_age_hva(struct kvm *kvm, unsigned long hva)
  749. {
  750. return kvm_handle_hva(kvm, hva, 0, kvm_age_rmapp);
  751. }
  752. #ifdef MMU_DEBUG
  753. static int is_empty_shadow_page(u64 *spt)
  754. {
  755. u64 *pos;
  756. u64 *end;
  757. for (pos = spt, end = pos + PAGE_SIZE / sizeof(u64); pos != end; pos++)
  758. if (is_shadow_present_pte(*pos)) {
  759. printk(KERN_ERR "%s: %p %llx\n", __func__,
  760. pos, *pos);
  761. return 0;
  762. }
  763. return 1;
  764. }
  765. #endif
  766. static void kvm_mmu_free_page(struct kvm *kvm, struct kvm_mmu_page *sp)
  767. {
  768. ASSERT(is_empty_shadow_page(sp->spt));
  769. list_del(&sp->link);
  770. __free_page(virt_to_page(sp->spt));
  771. __free_page(virt_to_page(sp->gfns));
  772. kfree(sp);
  773. ++kvm->arch.n_free_mmu_pages;
  774. }
  775. static unsigned kvm_page_table_hashfn(gfn_t gfn)
  776. {
  777. return gfn & ((1 << KVM_MMU_HASH_SHIFT) - 1);
  778. }
  779. static struct kvm_mmu_page *kvm_mmu_alloc_page(struct kvm_vcpu *vcpu,
  780. u64 *parent_pte)
  781. {
  782. struct kvm_mmu_page *sp;
  783. sp = mmu_memory_cache_alloc(&vcpu->arch.mmu_page_header_cache, sizeof *sp);
  784. sp->spt = mmu_memory_cache_alloc(&vcpu->arch.mmu_page_cache, PAGE_SIZE);
  785. sp->gfns = mmu_memory_cache_alloc(&vcpu->arch.mmu_page_cache, PAGE_SIZE);
  786. set_page_private(virt_to_page(sp->spt), (unsigned long)sp);
  787. list_add(&sp->link, &vcpu->kvm->arch.active_mmu_pages);
  788. INIT_LIST_HEAD(&sp->oos_link);
  789. bitmap_zero(sp->slot_bitmap, KVM_MEMORY_SLOTS + KVM_PRIVATE_MEM_SLOTS);
  790. sp->multimapped = 0;
  791. sp->parent_pte = parent_pte;
  792. --vcpu->kvm->arch.n_free_mmu_pages;
  793. return sp;
  794. }
  795. static void mmu_page_add_parent_pte(struct kvm_vcpu *vcpu,
  796. struct kvm_mmu_page *sp, u64 *parent_pte)
  797. {
  798. struct kvm_pte_chain *pte_chain;
  799. struct hlist_node *node;
  800. int i;
  801. if (!parent_pte)
  802. return;
  803. if (!sp->multimapped) {
  804. u64 *old = sp->parent_pte;
  805. if (!old) {
  806. sp->parent_pte = parent_pte;
  807. return;
  808. }
  809. sp->multimapped = 1;
  810. pte_chain = mmu_alloc_pte_chain(vcpu);
  811. INIT_HLIST_HEAD(&sp->parent_ptes);
  812. hlist_add_head(&pte_chain->link, &sp->parent_ptes);
  813. pte_chain->parent_ptes[0] = old;
  814. }
  815. hlist_for_each_entry(pte_chain, node, &sp->parent_ptes, link) {
  816. if (pte_chain->parent_ptes[NR_PTE_CHAIN_ENTRIES-1])
  817. continue;
  818. for (i = 0; i < NR_PTE_CHAIN_ENTRIES; ++i)
  819. if (!pte_chain->parent_ptes[i]) {
  820. pte_chain->parent_ptes[i] = parent_pte;
  821. return;
  822. }
  823. }
  824. pte_chain = mmu_alloc_pte_chain(vcpu);
  825. BUG_ON(!pte_chain);
  826. hlist_add_head(&pte_chain->link, &sp->parent_ptes);
  827. pte_chain->parent_ptes[0] = parent_pte;
  828. }
  829. static void mmu_page_remove_parent_pte(struct kvm_mmu_page *sp,
  830. u64 *parent_pte)
  831. {
  832. struct kvm_pte_chain *pte_chain;
  833. struct hlist_node *node;
  834. int i;
  835. if (!sp->multimapped) {
  836. BUG_ON(sp->parent_pte != parent_pte);
  837. sp->parent_pte = NULL;
  838. return;
  839. }
  840. hlist_for_each_entry(pte_chain, node, &sp->parent_ptes, link)
  841. for (i = 0; i < NR_PTE_CHAIN_ENTRIES; ++i) {
  842. if (!pte_chain->parent_ptes[i])
  843. break;
  844. if (pte_chain->parent_ptes[i] != parent_pte)
  845. continue;
  846. while (i + 1 < NR_PTE_CHAIN_ENTRIES
  847. && pte_chain->parent_ptes[i + 1]) {
  848. pte_chain->parent_ptes[i]
  849. = pte_chain->parent_ptes[i + 1];
  850. ++i;
  851. }
  852. pte_chain->parent_ptes[i] = NULL;
  853. if (i == 0) {
  854. hlist_del(&pte_chain->link);
  855. mmu_free_pte_chain(pte_chain);
  856. if (hlist_empty(&sp->parent_ptes)) {
  857. sp->multimapped = 0;
  858. sp->parent_pte = NULL;
  859. }
  860. }
  861. return;
  862. }
  863. BUG();
  864. }
  865. static void mmu_parent_walk(struct kvm_vcpu *vcpu, struct kvm_mmu_page *sp,
  866. mmu_parent_walk_fn fn)
  867. {
  868. struct kvm_pte_chain *pte_chain;
  869. struct hlist_node *node;
  870. struct kvm_mmu_page *parent_sp;
  871. int i;
  872. if (!sp->multimapped && sp->parent_pte) {
  873. parent_sp = page_header(__pa(sp->parent_pte));
  874. fn(vcpu, parent_sp);
  875. mmu_parent_walk(vcpu, parent_sp, fn);
  876. return;
  877. }
  878. hlist_for_each_entry(pte_chain, node, &sp->parent_ptes, link)
  879. for (i = 0; i < NR_PTE_CHAIN_ENTRIES; ++i) {
  880. if (!pte_chain->parent_ptes[i])
  881. break;
  882. parent_sp = page_header(__pa(pte_chain->parent_ptes[i]));
  883. fn(vcpu, parent_sp);
  884. mmu_parent_walk(vcpu, parent_sp, fn);
  885. }
  886. }
  887. static void kvm_mmu_update_unsync_bitmap(u64 *spte)
  888. {
  889. unsigned int index;
  890. struct kvm_mmu_page *sp = page_header(__pa(spte));
  891. index = spte - sp->spt;
  892. if (!__test_and_set_bit(index, sp->unsync_child_bitmap))
  893. sp->unsync_children++;
  894. WARN_ON(!sp->unsync_children);
  895. }
  896. static void kvm_mmu_update_parents_unsync(struct kvm_mmu_page *sp)
  897. {
  898. struct kvm_pte_chain *pte_chain;
  899. struct hlist_node *node;
  900. int i;
  901. if (!sp->parent_pte)
  902. return;
  903. if (!sp->multimapped) {
  904. kvm_mmu_update_unsync_bitmap(sp->parent_pte);
  905. return;
  906. }
  907. hlist_for_each_entry(pte_chain, node, &sp->parent_ptes, link)
  908. for (i = 0; i < NR_PTE_CHAIN_ENTRIES; ++i) {
  909. if (!pte_chain->parent_ptes[i])
  910. break;
  911. kvm_mmu_update_unsync_bitmap(pte_chain->parent_ptes[i]);
  912. }
  913. }
  914. static int unsync_walk_fn(struct kvm_vcpu *vcpu, struct kvm_mmu_page *sp)
  915. {
  916. kvm_mmu_update_parents_unsync(sp);
  917. return 1;
  918. }
  919. static void kvm_mmu_mark_parents_unsync(struct kvm_vcpu *vcpu,
  920. struct kvm_mmu_page *sp)
  921. {
  922. mmu_parent_walk(vcpu, sp, unsync_walk_fn);
  923. kvm_mmu_update_parents_unsync(sp);
  924. }
  925. static void nonpaging_prefetch_page(struct kvm_vcpu *vcpu,
  926. struct kvm_mmu_page *sp)
  927. {
  928. int i;
  929. for (i = 0; i < PT64_ENT_PER_PAGE; ++i)
  930. sp->spt[i] = shadow_trap_nonpresent_pte;
  931. }
  932. static int nonpaging_sync_page(struct kvm_vcpu *vcpu,
  933. struct kvm_mmu_page *sp)
  934. {
  935. return 1;
  936. }
  937. static void nonpaging_invlpg(struct kvm_vcpu *vcpu, gva_t gva)
  938. {
  939. }
  940. #define KVM_PAGE_ARRAY_NR 16
  941. struct kvm_mmu_pages {
  942. struct mmu_page_and_offset {
  943. struct kvm_mmu_page *sp;
  944. unsigned int idx;
  945. } page[KVM_PAGE_ARRAY_NR];
  946. unsigned int nr;
  947. };
  948. #define for_each_unsync_children(bitmap, idx) \
  949. for (idx = find_first_bit(bitmap, 512); \
  950. idx < 512; \
  951. idx = find_next_bit(bitmap, 512, idx+1))
  952. static int mmu_pages_add(struct kvm_mmu_pages *pvec, struct kvm_mmu_page *sp,
  953. int idx)
  954. {
  955. int i;
  956. if (sp->unsync)
  957. for (i=0; i < pvec->nr; i++)
  958. if (pvec->page[i].sp == sp)
  959. return 0;
  960. pvec->page[pvec->nr].sp = sp;
  961. pvec->page[pvec->nr].idx = idx;
  962. pvec->nr++;
  963. return (pvec->nr == KVM_PAGE_ARRAY_NR);
  964. }
  965. static int __mmu_unsync_walk(struct kvm_mmu_page *sp,
  966. struct kvm_mmu_pages *pvec)
  967. {
  968. int i, ret, nr_unsync_leaf = 0;
  969. for_each_unsync_children(sp->unsync_child_bitmap, i) {
  970. u64 ent = sp->spt[i];
  971. if (is_shadow_present_pte(ent) && !is_large_pte(ent)) {
  972. struct kvm_mmu_page *child;
  973. child = page_header(ent & PT64_BASE_ADDR_MASK);
  974. if (child->unsync_children) {
  975. if (mmu_pages_add(pvec, child, i))
  976. return -ENOSPC;
  977. ret = __mmu_unsync_walk(child, pvec);
  978. if (!ret)
  979. __clear_bit(i, sp->unsync_child_bitmap);
  980. else if (ret > 0)
  981. nr_unsync_leaf += ret;
  982. else
  983. return ret;
  984. }
  985. if (child->unsync) {
  986. nr_unsync_leaf++;
  987. if (mmu_pages_add(pvec, child, i))
  988. return -ENOSPC;
  989. }
  990. }
  991. }
  992. if (find_first_bit(sp->unsync_child_bitmap, 512) == 512)
  993. sp->unsync_children = 0;
  994. return nr_unsync_leaf;
  995. }
  996. static int mmu_unsync_walk(struct kvm_mmu_page *sp,
  997. struct kvm_mmu_pages *pvec)
  998. {
  999. if (!sp->unsync_children)
  1000. return 0;
  1001. mmu_pages_add(pvec, sp, 0);
  1002. return __mmu_unsync_walk(sp, pvec);
  1003. }
  1004. static struct kvm_mmu_page *kvm_mmu_lookup_page(struct kvm *kvm, gfn_t gfn)
  1005. {
  1006. unsigned index;
  1007. struct hlist_head *bucket;
  1008. struct kvm_mmu_page *sp;
  1009. struct hlist_node *node;
  1010. pgprintk("%s: looking for gfn %lx\n", __func__, gfn);
  1011. index = kvm_page_table_hashfn(gfn);
  1012. bucket = &kvm->arch.mmu_page_hash[index];
  1013. hlist_for_each_entry(sp, node, bucket, hash_link)
  1014. if (sp->gfn == gfn && !sp->role.direct
  1015. && !sp->role.invalid) {
  1016. pgprintk("%s: found role %x\n",
  1017. __func__, sp->role.word);
  1018. return sp;
  1019. }
  1020. return NULL;
  1021. }
  1022. static void kvm_unlink_unsync_page(struct kvm *kvm, struct kvm_mmu_page *sp)
  1023. {
  1024. WARN_ON(!sp->unsync);
  1025. sp->unsync = 0;
  1026. --kvm->stat.mmu_unsync;
  1027. }
  1028. static int kvm_mmu_zap_page(struct kvm *kvm, struct kvm_mmu_page *sp);
  1029. static int kvm_sync_page(struct kvm_vcpu *vcpu, struct kvm_mmu_page *sp)
  1030. {
  1031. if (sp->role.glevels != vcpu->arch.mmu.root_level) {
  1032. kvm_mmu_zap_page(vcpu->kvm, sp);
  1033. return 1;
  1034. }
  1035. trace_kvm_mmu_sync_page(sp);
  1036. if (rmap_write_protect(vcpu->kvm, sp->gfn))
  1037. kvm_flush_remote_tlbs(vcpu->kvm);
  1038. kvm_unlink_unsync_page(vcpu->kvm, sp);
  1039. if (vcpu->arch.mmu.sync_page(vcpu, sp)) {
  1040. kvm_mmu_zap_page(vcpu->kvm, sp);
  1041. return 1;
  1042. }
  1043. kvm_mmu_flush_tlb(vcpu);
  1044. return 0;
  1045. }
  1046. struct mmu_page_path {
  1047. struct kvm_mmu_page *parent[PT64_ROOT_LEVEL-1];
  1048. unsigned int idx[PT64_ROOT_LEVEL-1];
  1049. };
  1050. #define for_each_sp(pvec, sp, parents, i) \
  1051. for (i = mmu_pages_next(&pvec, &parents, -1), \
  1052. sp = pvec.page[i].sp; \
  1053. i < pvec.nr && ({ sp = pvec.page[i].sp; 1;}); \
  1054. i = mmu_pages_next(&pvec, &parents, i))
  1055. static int mmu_pages_next(struct kvm_mmu_pages *pvec,
  1056. struct mmu_page_path *parents,
  1057. int i)
  1058. {
  1059. int n;
  1060. for (n = i+1; n < pvec->nr; n++) {
  1061. struct kvm_mmu_page *sp = pvec->page[n].sp;
  1062. if (sp->role.level == PT_PAGE_TABLE_LEVEL) {
  1063. parents->idx[0] = pvec->page[n].idx;
  1064. return n;
  1065. }
  1066. parents->parent[sp->role.level-2] = sp;
  1067. parents->idx[sp->role.level-1] = pvec->page[n].idx;
  1068. }
  1069. return n;
  1070. }
  1071. static void mmu_pages_clear_parents(struct mmu_page_path *parents)
  1072. {
  1073. struct kvm_mmu_page *sp;
  1074. unsigned int level = 0;
  1075. do {
  1076. unsigned int idx = parents->idx[level];
  1077. sp = parents->parent[level];
  1078. if (!sp)
  1079. return;
  1080. --sp->unsync_children;
  1081. WARN_ON((int)sp->unsync_children < 0);
  1082. __clear_bit(idx, sp->unsync_child_bitmap);
  1083. level++;
  1084. } while (level < PT64_ROOT_LEVEL-1 && !sp->unsync_children);
  1085. }
  1086. static void kvm_mmu_pages_init(struct kvm_mmu_page *parent,
  1087. struct mmu_page_path *parents,
  1088. struct kvm_mmu_pages *pvec)
  1089. {
  1090. parents->parent[parent->role.level-1] = NULL;
  1091. pvec->nr = 0;
  1092. }
  1093. static void mmu_sync_children(struct kvm_vcpu *vcpu,
  1094. struct kvm_mmu_page *parent)
  1095. {
  1096. int i;
  1097. struct kvm_mmu_page *sp;
  1098. struct mmu_page_path parents;
  1099. struct kvm_mmu_pages pages;
  1100. kvm_mmu_pages_init(parent, &parents, &pages);
  1101. while (mmu_unsync_walk(parent, &pages)) {
  1102. int protected = 0;
  1103. for_each_sp(pages, sp, parents, i)
  1104. protected |= rmap_write_protect(vcpu->kvm, sp->gfn);
  1105. if (protected)
  1106. kvm_flush_remote_tlbs(vcpu->kvm);
  1107. for_each_sp(pages, sp, parents, i) {
  1108. kvm_sync_page(vcpu, sp);
  1109. mmu_pages_clear_parents(&parents);
  1110. }
  1111. cond_resched_lock(&vcpu->kvm->mmu_lock);
  1112. kvm_mmu_pages_init(parent, &parents, &pages);
  1113. }
  1114. }
  1115. static struct kvm_mmu_page *kvm_mmu_get_page(struct kvm_vcpu *vcpu,
  1116. gfn_t gfn,
  1117. gva_t gaddr,
  1118. unsigned level,
  1119. int direct,
  1120. unsigned access,
  1121. u64 *parent_pte)
  1122. {
  1123. union kvm_mmu_page_role role;
  1124. unsigned index;
  1125. unsigned quadrant;
  1126. struct hlist_head *bucket;
  1127. struct kvm_mmu_page *sp;
  1128. struct hlist_node *node, *tmp;
  1129. role = vcpu->arch.mmu.base_role;
  1130. role.level = level;
  1131. role.direct = direct;
  1132. role.access = access;
  1133. if (vcpu->arch.mmu.root_level <= PT32_ROOT_LEVEL) {
  1134. quadrant = gaddr >> (PAGE_SHIFT + (PT64_PT_BITS * level));
  1135. quadrant &= (1 << ((PT32_PT_BITS - PT64_PT_BITS) * level)) - 1;
  1136. role.quadrant = quadrant;
  1137. }
  1138. index = kvm_page_table_hashfn(gfn);
  1139. bucket = &vcpu->kvm->arch.mmu_page_hash[index];
  1140. hlist_for_each_entry_safe(sp, node, tmp, bucket, hash_link)
  1141. if (sp->gfn == gfn) {
  1142. if (sp->unsync)
  1143. if (kvm_sync_page(vcpu, sp))
  1144. continue;
  1145. if (sp->role.word != role.word)
  1146. continue;
  1147. mmu_page_add_parent_pte(vcpu, sp, parent_pte);
  1148. if (sp->unsync_children) {
  1149. set_bit(KVM_REQ_MMU_SYNC, &vcpu->requests);
  1150. kvm_mmu_mark_parents_unsync(vcpu, sp);
  1151. }
  1152. trace_kvm_mmu_get_page(sp, false);
  1153. return sp;
  1154. }
  1155. ++vcpu->kvm->stat.mmu_cache_miss;
  1156. sp = kvm_mmu_alloc_page(vcpu, parent_pte);
  1157. if (!sp)
  1158. return sp;
  1159. sp->gfn = gfn;
  1160. sp->role = role;
  1161. hlist_add_head(&sp->hash_link, bucket);
  1162. if (!direct) {
  1163. if (rmap_write_protect(vcpu->kvm, gfn))
  1164. kvm_flush_remote_tlbs(vcpu->kvm);
  1165. account_shadowed(vcpu->kvm, gfn);
  1166. }
  1167. if (shadow_trap_nonpresent_pte != shadow_notrap_nonpresent_pte)
  1168. vcpu->arch.mmu.prefetch_page(vcpu, sp);
  1169. else
  1170. nonpaging_prefetch_page(vcpu, sp);
  1171. trace_kvm_mmu_get_page(sp, true);
  1172. return sp;
  1173. }
  1174. static void shadow_walk_init(struct kvm_shadow_walk_iterator *iterator,
  1175. struct kvm_vcpu *vcpu, u64 addr)
  1176. {
  1177. iterator->addr = addr;
  1178. iterator->shadow_addr = vcpu->arch.mmu.root_hpa;
  1179. iterator->level = vcpu->arch.mmu.shadow_root_level;
  1180. if (iterator->level == PT32E_ROOT_LEVEL) {
  1181. iterator->shadow_addr
  1182. = vcpu->arch.mmu.pae_root[(addr >> 30) & 3];
  1183. iterator->shadow_addr &= PT64_BASE_ADDR_MASK;
  1184. --iterator->level;
  1185. if (!iterator->shadow_addr)
  1186. iterator->level = 0;
  1187. }
  1188. }
  1189. static bool shadow_walk_okay(struct kvm_shadow_walk_iterator *iterator)
  1190. {
  1191. if (iterator->level < PT_PAGE_TABLE_LEVEL)
  1192. return false;
  1193. if (iterator->level == PT_PAGE_TABLE_LEVEL)
  1194. if (is_large_pte(*iterator->sptep))
  1195. return false;
  1196. iterator->index = SHADOW_PT_INDEX(iterator->addr, iterator->level);
  1197. iterator->sptep = ((u64 *)__va(iterator->shadow_addr)) + iterator->index;
  1198. return true;
  1199. }
  1200. static void shadow_walk_next(struct kvm_shadow_walk_iterator *iterator)
  1201. {
  1202. iterator->shadow_addr = *iterator->sptep & PT64_BASE_ADDR_MASK;
  1203. --iterator->level;
  1204. }
  1205. static void kvm_mmu_page_unlink_children(struct kvm *kvm,
  1206. struct kvm_mmu_page *sp)
  1207. {
  1208. unsigned i;
  1209. u64 *pt;
  1210. u64 ent;
  1211. pt = sp->spt;
  1212. for (i = 0; i < PT64_ENT_PER_PAGE; ++i) {
  1213. ent = pt[i];
  1214. if (is_shadow_present_pte(ent)) {
  1215. if (!is_last_spte(ent, sp->role.level)) {
  1216. ent &= PT64_BASE_ADDR_MASK;
  1217. mmu_page_remove_parent_pte(page_header(ent),
  1218. &pt[i]);
  1219. } else {
  1220. if (is_large_pte(ent))
  1221. --kvm->stat.lpages;
  1222. rmap_remove(kvm, &pt[i]);
  1223. }
  1224. }
  1225. pt[i] = shadow_trap_nonpresent_pte;
  1226. }
  1227. }
  1228. static void kvm_mmu_put_page(struct kvm_mmu_page *sp, u64 *parent_pte)
  1229. {
  1230. mmu_page_remove_parent_pte(sp, parent_pte);
  1231. }
  1232. static void kvm_mmu_reset_last_pte_updated(struct kvm *kvm)
  1233. {
  1234. int i;
  1235. struct kvm_vcpu *vcpu;
  1236. kvm_for_each_vcpu(i, vcpu, kvm)
  1237. vcpu->arch.last_pte_updated = NULL;
  1238. }
  1239. static void kvm_mmu_unlink_parents(struct kvm *kvm, struct kvm_mmu_page *sp)
  1240. {
  1241. u64 *parent_pte;
  1242. while (sp->multimapped || sp->parent_pte) {
  1243. if (!sp->multimapped)
  1244. parent_pte = sp->parent_pte;
  1245. else {
  1246. struct kvm_pte_chain *chain;
  1247. chain = container_of(sp->parent_ptes.first,
  1248. struct kvm_pte_chain, link);
  1249. parent_pte = chain->parent_ptes[0];
  1250. }
  1251. BUG_ON(!parent_pte);
  1252. kvm_mmu_put_page(sp, parent_pte);
  1253. __set_spte(parent_pte, shadow_trap_nonpresent_pte);
  1254. }
  1255. }
  1256. static int mmu_zap_unsync_children(struct kvm *kvm,
  1257. struct kvm_mmu_page *parent)
  1258. {
  1259. int i, zapped = 0;
  1260. struct mmu_page_path parents;
  1261. struct kvm_mmu_pages pages;
  1262. if (parent->role.level == PT_PAGE_TABLE_LEVEL)
  1263. return 0;
  1264. kvm_mmu_pages_init(parent, &parents, &pages);
  1265. while (mmu_unsync_walk(parent, &pages)) {
  1266. struct kvm_mmu_page *sp;
  1267. for_each_sp(pages, sp, parents, i) {
  1268. kvm_mmu_zap_page(kvm, sp);
  1269. mmu_pages_clear_parents(&parents);
  1270. }
  1271. zapped += pages.nr;
  1272. kvm_mmu_pages_init(parent, &parents, &pages);
  1273. }
  1274. return zapped;
  1275. }
  1276. static int kvm_mmu_zap_page(struct kvm *kvm, struct kvm_mmu_page *sp)
  1277. {
  1278. int ret;
  1279. trace_kvm_mmu_zap_page(sp);
  1280. ++kvm->stat.mmu_shadow_zapped;
  1281. ret = mmu_zap_unsync_children(kvm, sp);
  1282. kvm_mmu_page_unlink_children(kvm, sp);
  1283. kvm_mmu_unlink_parents(kvm, sp);
  1284. kvm_flush_remote_tlbs(kvm);
  1285. if (!sp->role.invalid && !sp->role.direct)
  1286. unaccount_shadowed(kvm, sp->gfn);
  1287. if (sp->unsync)
  1288. kvm_unlink_unsync_page(kvm, sp);
  1289. if (!sp->root_count) {
  1290. hlist_del(&sp->hash_link);
  1291. kvm_mmu_free_page(kvm, sp);
  1292. } else {
  1293. sp->role.invalid = 1;
  1294. list_move(&sp->link, &kvm->arch.active_mmu_pages);
  1295. kvm_reload_remote_mmus(kvm);
  1296. }
  1297. kvm_mmu_reset_last_pte_updated(kvm);
  1298. return ret;
  1299. }
  1300. /*
  1301. * Changing the number of mmu pages allocated to the vm
  1302. * Note: if kvm_nr_mmu_pages is too small, you will get dead lock
  1303. */
  1304. void kvm_mmu_change_mmu_pages(struct kvm *kvm, unsigned int kvm_nr_mmu_pages)
  1305. {
  1306. int used_pages;
  1307. used_pages = kvm->arch.n_alloc_mmu_pages - kvm->arch.n_free_mmu_pages;
  1308. used_pages = max(0, used_pages);
  1309. /*
  1310. * If we set the number of mmu pages to be smaller be than the
  1311. * number of actived pages , we must to free some mmu pages before we
  1312. * change the value
  1313. */
  1314. if (used_pages > kvm_nr_mmu_pages) {
  1315. while (used_pages > kvm_nr_mmu_pages) {
  1316. struct kvm_mmu_page *page;
  1317. page = container_of(kvm->arch.active_mmu_pages.prev,
  1318. struct kvm_mmu_page, link);
  1319. kvm_mmu_zap_page(kvm, page);
  1320. used_pages--;
  1321. }
  1322. kvm->arch.n_free_mmu_pages = 0;
  1323. }
  1324. else
  1325. kvm->arch.n_free_mmu_pages += kvm_nr_mmu_pages
  1326. - kvm->arch.n_alloc_mmu_pages;
  1327. kvm->arch.n_alloc_mmu_pages = kvm_nr_mmu_pages;
  1328. }
  1329. static int kvm_mmu_unprotect_page(struct kvm *kvm, gfn_t gfn)
  1330. {
  1331. unsigned index;
  1332. struct hlist_head *bucket;
  1333. struct kvm_mmu_page *sp;
  1334. struct hlist_node *node, *n;
  1335. int r;
  1336. pgprintk("%s: looking for gfn %lx\n", __func__, gfn);
  1337. r = 0;
  1338. index = kvm_page_table_hashfn(gfn);
  1339. bucket = &kvm->arch.mmu_page_hash[index];
  1340. hlist_for_each_entry_safe(sp, node, n, bucket, hash_link)
  1341. if (sp->gfn == gfn && !sp->role.direct) {
  1342. pgprintk("%s: gfn %lx role %x\n", __func__, gfn,
  1343. sp->role.word);
  1344. r = 1;
  1345. if (kvm_mmu_zap_page(kvm, sp))
  1346. n = bucket->first;
  1347. }
  1348. return r;
  1349. }
  1350. static void mmu_unshadow(struct kvm *kvm, gfn_t gfn)
  1351. {
  1352. unsigned index;
  1353. struct hlist_head *bucket;
  1354. struct kvm_mmu_page *sp;
  1355. struct hlist_node *node, *nn;
  1356. index = kvm_page_table_hashfn(gfn);
  1357. bucket = &kvm->arch.mmu_page_hash[index];
  1358. hlist_for_each_entry_safe(sp, node, nn, bucket, hash_link) {
  1359. if (sp->gfn == gfn && !sp->role.direct
  1360. && !sp->role.invalid) {
  1361. pgprintk("%s: zap %lx %x\n",
  1362. __func__, gfn, sp->role.word);
  1363. kvm_mmu_zap_page(kvm, sp);
  1364. }
  1365. }
  1366. }
  1367. static void page_header_update_slot(struct kvm *kvm, void *pte, gfn_t gfn)
  1368. {
  1369. int slot = memslot_id(kvm, gfn_to_memslot(kvm, gfn));
  1370. struct kvm_mmu_page *sp = page_header(__pa(pte));
  1371. __set_bit(slot, sp->slot_bitmap);
  1372. }
  1373. static void mmu_convert_notrap(struct kvm_mmu_page *sp)
  1374. {
  1375. int i;
  1376. u64 *pt = sp->spt;
  1377. if (shadow_trap_nonpresent_pte == shadow_notrap_nonpresent_pte)
  1378. return;
  1379. for (i = 0; i < PT64_ENT_PER_PAGE; ++i) {
  1380. if (pt[i] == shadow_notrap_nonpresent_pte)
  1381. __set_spte(&pt[i], shadow_trap_nonpresent_pte);
  1382. }
  1383. }
  1384. struct page *gva_to_page(struct kvm_vcpu *vcpu, gva_t gva)
  1385. {
  1386. struct page *page;
  1387. gpa_t gpa = vcpu->arch.mmu.gva_to_gpa(vcpu, gva);
  1388. if (gpa == UNMAPPED_GVA)
  1389. return NULL;
  1390. page = gfn_to_page(vcpu->kvm, gpa >> PAGE_SHIFT);
  1391. return page;
  1392. }
  1393. /*
  1394. * The function is based on mtrr_type_lookup() in
  1395. * arch/x86/kernel/cpu/mtrr/generic.c
  1396. */
  1397. static int get_mtrr_type(struct mtrr_state_type *mtrr_state,
  1398. u64 start, u64 end)
  1399. {
  1400. int i;
  1401. u64 base, mask;
  1402. u8 prev_match, curr_match;
  1403. int num_var_ranges = KVM_NR_VAR_MTRR;
  1404. if (!mtrr_state->enabled)
  1405. return 0xFF;
  1406. /* Make end inclusive end, instead of exclusive */
  1407. end--;
  1408. /* Look in fixed ranges. Just return the type as per start */
  1409. if (mtrr_state->have_fixed && (start < 0x100000)) {
  1410. int idx;
  1411. if (start < 0x80000) {
  1412. idx = 0;
  1413. idx += (start >> 16);
  1414. return mtrr_state->fixed_ranges[idx];
  1415. } else if (start < 0xC0000) {
  1416. idx = 1 * 8;
  1417. idx += ((start - 0x80000) >> 14);
  1418. return mtrr_state->fixed_ranges[idx];
  1419. } else if (start < 0x1000000) {
  1420. idx = 3 * 8;
  1421. idx += ((start - 0xC0000) >> 12);
  1422. return mtrr_state->fixed_ranges[idx];
  1423. }
  1424. }
  1425. /*
  1426. * Look in variable ranges
  1427. * Look of multiple ranges matching this address and pick type
  1428. * as per MTRR precedence
  1429. */
  1430. if (!(mtrr_state->enabled & 2))
  1431. return mtrr_state->def_type;
  1432. prev_match = 0xFF;
  1433. for (i = 0; i < num_var_ranges; ++i) {
  1434. unsigned short start_state, end_state;
  1435. if (!(mtrr_state->var_ranges[i].mask_lo & (1 << 11)))
  1436. continue;
  1437. base = (((u64)mtrr_state->var_ranges[i].base_hi) << 32) +
  1438. (mtrr_state->var_ranges[i].base_lo & PAGE_MASK);
  1439. mask = (((u64)mtrr_state->var_ranges[i].mask_hi) << 32) +
  1440. (mtrr_state->var_ranges[i].mask_lo & PAGE_MASK);
  1441. start_state = ((start & mask) == (base & mask));
  1442. end_state = ((end & mask) == (base & mask));
  1443. if (start_state != end_state)
  1444. return 0xFE;
  1445. if ((start & mask) != (base & mask))
  1446. continue;
  1447. curr_match = mtrr_state->var_ranges[i].base_lo & 0xff;
  1448. if (prev_match == 0xFF) {
  1449. prev_match = curr_match;
  1450. continue;
  1451. }
  1452. if (prev_match == MTRR_TYPE_UNCACHABLE ||
  1453. curr_match == MTRR_TYPE_UNCACHABLE)
  1454. return MTRR_TYPE_UNCACHABLE;
  1455. if ((prev_match == MTRR_TYPE_WRBACK &&
  1456. curr_match == MTRR_TYPE_WRTHROUGH) ||
  1457. (prev_match == MTRR_TYPE_WRTHROUGH &&
  1458. curr_match == MTRR_TYPE_WRBACK)) {
  1459. prev_match = MTRR_TYPE_WRTHROUGH;
  1460. curr_match = MTRR_TYPE_WRTHROUGH;
  1461. }
  1462. if (prev_match != curr_match)
  1463. return MTRR_TYPE_UNCACHABLE;
  1464. }
  1465. if (prev_match != 0xFF)
  1466. return prev_match;
  1467. return mtrr_state->def_type;
  1468. }
  1469. u8 kvm_get_guest_memory_type(struct kvm_vcpu *vcpu, gfn_t gfn)
  1470. {
  1471. u8 mtrr;
  1472. mtrr = get_mtrr_type(&vcpu->arch.mtrr_state, gfn << PAGE_SHIFT,
  1473. (gfn << PAGE_SHIFT) + PAGE_SIZE);
  1474. if (mtrr == 0xfe || mtrr == 0xff)
  1475. mtrr = MTRR_TYPE_WRBACK;
  1476. return mtrr;
  1477. }
  1478. EXPORT_SYMBOL_GPL(kvm_get_guest_memory_type);
  1479. static int kvm_unsync_page(struct kvm_vcpu *vcpu, struct kvm_mmu_page *sp)
  1480. {
  1481. unsigned index;
  1482. struct hlist_head *bucket;
  1483. struct kvm_mmu_page *s;
  1484. struct hlist_node *node, *n;
  1485. trace_kvm_mmu_unsync_page(sp);
  1486. index = kvm_page_table_hashfn(sp->gfn);
  1487. bucket = &vcpu->kvm->arch.mmu_page_hash[index];
  1488. /* don't unsync if pagetable is shadowed with multiple roles */
  1489. hlist_for_each_entry_safe(s, node, n, bucket, hash_link) {
  1490. if (s->gfn != sp->gfn || s->role.direct)
  1491. continue;
  1492. if (s->role.word != sp->role.word)
  1493. return 1;
  1494. }
  1495. ++vcpu->kvm->stat.mmu_unsync;
  1496. sp->unsync = 1;
  1497. kvm_mmu_mark_parents_unsync(vcpu, sp);
  1498. mmu_convert_notrap(sp);
  1499. return 0;
  1500. }
  1501. static int mmu_need_write_protect(struct kvm_vcpu *vcpu, gfn_t gfn,
  1502. bool can_unsync)
  1503. {
  1504. struct kvm_mmu_page *shadow;
  1505. shadow = kvm_mmu_lookup_page(vcpu->kvm, gfn);
  1506. if (shadow) {
  1507. if (shadow->role.level != PT_PAGE_TABLE_LEVEL)
  1508. return 1;
  1509. if (shadow->unsync)
  1510. return 0;
  1511. if (can_unsync && oos_shadow)
  1512. return kvm_unsync_page(vcpu, shadow);
  1513. return 1;
  1514. }
  1515. return 0;
  1516. }
  1517. static int set_spte(struct kvm_vcpu *vcpu, u64 *sptep,
  1518. unsigned pte_access, int user_fault,
  1519. int write_fault, int dirty, int level,
  1520. gfn_t gfn, pfn_t pfn, bool speculative,
  1521. bool can_unsync, bool reset_host_protection)
  1522. {
  1523. u64 spte;
  1524. int ret = 0;
  1525. /*
  1526. * We don't set the accessed bit, since we sometimes want to see
  1527. * whether the guest actually used the pte (in order to detect
  1528. * demand paging).
  1529. */
  1530. spte = shadow_base_present_pte | shadow_dirty_mask;
  1531. if (!speculative)
  1532. spte |= shadow_accessed_mask;
  1533. if (!dirty)
  1534. pte_access &= ~ACC_WRITE_MASK;
  1535. if (pte_access & ACC_EXEC_MASK)
  1536. spte |= shadow_x_mask;
  1537. else
  1538. spte |= shadow_nx_mask;
  1539. if (pte_access & ACC_USER_MASK)
  1540. spte |= shadow_user_mask;
  1541. if (level > PT_PAGE_TABLE_LEVEL)
  1542. spte |= PT_PAGE_SIZE_MASK;
  1543. if (tdp_enabled)
  1544. spte |= kvm_x86_ops->get_mt_mask(vcpu, gfn,
  1545. kvm_is_mmio_pfn(pfn));
  1546. if (reset_host_protection)
  1547. spte |= SPTE_HOST_WRITEABLE;
  1548. spte |= (u64)pfn << PAGE_SHIFT;
  1549. if ((pte_access & ACC_WRITE_MASK)
  1550. || (write_fault && !is_write_protection(vcpu) && !user_fault)) {
  1551. if (level > PT_PAGE_TABLE_LEVEL &&
  1552. has_wrprotected_page(vcpu->kvm, gfn, level)) {
  1553. ret = 1;
  1554. spte = shadow_trap_nonpresent_pte;
  1555. goto set_pte;
  1556. }
  1557. spte |= PT_WRITABLE_MASK;
  1558. /*
  1559. * Optimization: for pte sync, if spte was writable the hash
  1560. * lookup is unnecessary (and expensive). Write protection
  1561. * is responsibility of mmu_get_page / kvm_sync_page.
  1562. * Same reasoning can be applied to dirty page accounting.
  1563. */
  1564. if (!can_unsync && is_writeble_pte(*sptep))
  1565. goto set_pte;
  1566. if (mmu_need_write_protect(vcpu, gfn, can_unsync)) {
  1567. pgprintk("%s: found shadow page for %lx, marking ro\n",
  1568. __func__, gfn);
  1569. ret = 1;
  1570. pte_access &= ~ACC_WRITE_MASK;
  1571. if (is_writeble_pte(spte))
  1572. spte &= ~PT_WRITABLE_MASK;
  1573. }
  1574. }
  1575. if (pte_access & ACC_WRITE_MASK)
  1576. mark_page_dirty(vcpu->kvm, gfn);
  1577. set_pte:
  1578. __set_spte(sptep, spte);
  1579. return ret;
  1580. }
  1581. static void mmu_set_spte(struct kvm_vcpu *vcpu, u64 *sptep,
  1582. unsigned pt_access, unsigned pte_access,
  1583. int user_fault, int write_fault, int dirty,
  1584. int *ptwrite, int level, gfn_t gfn,
  1585. pfn_t pfn, bool speculative,
  1586. bool reset_host_protection)
  1587. {
  1588. int was_rmapped = 0;
  1589. int was_writeble = is_writeble_pte(*sptep);
  1590. int rmap_count;
  1591. pgprintk("%s: spte %llx access %x write_fault %d"
  1592. " user_fault %d gfn %lx\n",
  1593. __func__, *sptep, pt_access,
  1594. write_fault, user_fault, gfn);
  1595. if (is_rmap_spte(*sptep)) {
  1596. /*
  1597. * If we overwrite a PTE page pointer with a 2MB PMD, unlink
  1598. * the parent of the now unreachable PTE.
  1599. */
  1600. if (level > PT_PAGE_TABLE_LEVEL &&
  1601. !is_large_pte(*sptep)) {
  1602. struct kvm_mmu_page *child;
  1603. u64 pte = *sptep;
  1604. child = page_header(pte & PT64_BASE_ADDR_MASK);
  1605. mmu_page_remove_parent_pte(child, sptep);
  1606. } else if (pfn != spte_to_pfn(*sptep)) {
  1607. pgprintk("hfn old %lx new %lx\n",
  1608. spte_to_pfn(*sptep), pfn);
  1609. rmap_remove(vcpu->kvm, sptep);
  1610. } else
  1611. was_rmapped = 1;
  1612. }
  1613. if (set_spte(vcpu, sptep, pte_access, user_fault, write_fault,
  1614. dirty, level, gfn, pfn, speculative, true,
  1615. reset_host_protection)) {
  1616. if (write_fault)
  1617. *ptwrite = 1;
  1618. kvm_x86_ops->tlb_flush(vcpu);
  1619. }
  1620. pgprintk("%s: setting spte %llx\n", __func__, *sptep);
  1621. pgprintk("instantiating %s PTE (%s) at %ld (%llx) addr %p\n",
  1622. is_large_pte(*sptep)? "2MB" : "4kB",
  1623. *sptep & PT_PRESENT_MASK ?"RW":"R", gfn,
  1624. *sptep, sptep);
  1625. if (!was_rmapped && is_large_pte(*sptep))
  1626. ++vcpu->kvm->stat.lpages;
  1627. page_header_update_slot(vcpu->kvm, sptep, gfn);
  1628. if (!was_rmapped) {
  1629. rmap_count = rmap_add(vcpu, sptep, gfn);
  1630. kvm_release_pfn_clean(pfn);
  1631. if (rmap_count > RMAP_RECYCLE_THRESHOLD)
  1632. rmap_recycle(vcpu, sptep, gfn);
  1633. } else {
  1634. if (was_writeble)
  1635. kvm_release_pfn_dirty(pfn);
  1636. else
  1637. kvm_release_pfn_clean(pfn);
  1638. }
  1639. if (speculative) {
  1640. vcpu->arch.last_pte_updated = sptep;
  1641. vcpu->arch.last_pte_gfn = gfn;
  1642. }
  1643. }
  1644. static void nonpaging_new_cr3(struct kvm_vcpu *vcpu)
  1645. {
  1646. }
  1647. static int __direct_map(struct kvm_vcpu *vcpu, gpa_t v, int write,
  1648. int level, gfn_t gfn, pfn_t pfn)
  1649. {
  1650. struct kvm_shadow_walk_iterator iterator;
  1651. struct kvm_mmu_page *sp;
  1652. int pt_write = 0;
  1653. gfn_t pseudo_gfn;
  1654. for_each_shadow_entry(vcpu, (u64)gfn << PAGE_SHIFT, iterator) {
  1655. if (iterator.level == level) {
  1656. mmu_set_spte(vcpu, iterator.sptep, ACC_ALL, ACC_ALL,
  1657. 0, write, 1, &pt_write,
  1658. level, gfn, pfn, false, true);
  1659. ++vcpu->stat.pf_fixed;
  1660. break;
  1661. }
  1662. if (*iterator.sptep == shadow_trap_nonpresent_pte) {
  1663. pseudo_gfn = (iterator.addr & PT64_DIR_BASE_ADDR_MASK) >> PAGE_SHIFT;
  1664. sp = kvm_mmu_get_page(vcpu, pseudo_gfn, iterator.addr,
  1665. iterator.level - 1,
  1666. 1, ACC_ALL, iterator.sptep);
  1667. if (!sp) {
  1668. pgprintk("nonpaging_map: ENOMEM\n");
  1669. kvm_release_pfn_clean(pfn);
  1670. return -ENOMEM;
  1671. }
  1672. __set_spte(iterator.sptep,
  1673. __pa(sp->spt)
  1674. | PT_PRESENT_MASK | PT_WRITABLE_MASK
  1675. | shadow_user_mask | shadow_x_mask);
  1676. }
  1677. }
  1678. return pt_write;
  1679. }
  1680. static int nonpaging_map(struct kvm_vcpu *vcpu, gva_t v, int write, gfn_t gfn)
  1681. {
  1682. int r;
  1683. int level;
  1684. pfn_t pfn;
  1685. unsigned long mmu_seq;
  1686. level = mapping_level(vcpu, gfn);
  1687. /*
  1688. * This path builds a PAE pagetable - so we can map 2mb pages at
  1689. * maximum. Therefore check if the level is larger than that.
  1690. */
  1691. if (level > PT_DIRECTORY_LEVEL)
  1692. level = PT_DIRECTORY_LEVEL;
  1693. gfn &= ~(KVM_PAGES_PER_HPAGE(level) - 1);
  1694. mmu_seq = vcpu->kvm->mmu_notifier_seq;
  1695. smp_rmb();
  1696. pfn = gfn_to_pfn(vcpu->kvm, gfn);
  1697. /* mmio */
  1698. if (is_error_pfn(pfn)) {
  1699. kvm_release_pfn_clean(pfn);
  1700. return 1;
  1701. }
  1702. spin_lock(&vcpu->kvm->mmu_lock);
  1703. if (mmu_notifier_retry(vcpu, mmu_seq))
  1704. goto out_unlock;
  1705. kvm_mmu_free_some_pages(vcpu);
  1706. r = __direct_map(vcpu, v, write, level, gfn, pfn);
  1707. spin_unlock(&vcpu->kvm->mmu_lock);
  1708. return r;
  1709. out_unlock:
  1710. spin_unlock(&vcpu->kvm->mmu_lock);
  1711. kvm_release_pfn_clean(pfn);
  1712. return 0;
  1713. }
  1714. static void mmu_free_roots(struct kvm_vcpu *vcpu)
  1715. {
  1716. int i;
  1717. struct kvm_mmu_page *sp;
  1718. if (!VALID_PAGE(vcpu->arch.mmu.root_hpa))
  1719. return;
  1720. spin_lock(&vcpu->kvm->mmu_lock);
  1721. if (vcpu->arch.mmu.shadow_root_level == PT64_ROOT_LEVEL) {
  1722. hpa_t root = vcpu->arch.mmu.root_hpa;
  1723. sp = page_header(root);
  1724. --sp->root_count;
  1725. if (!sp->root_count && sp->role.invalid)
  1726. kvm_mmu_zap_page(vcpu->kvm, sp);
  1727. vcpu->arch.mmu.root_hpa = INVALID_PAGE;
  1728. spin_unlock(&vcpu->kvm->mmu_lock);
  1729. return;
  1730. }
  1731. for (i = 0; i < 4; ++i) {
  1732. hpa_t root = vcpu->arch.mmu.pae_root[i];
  1733. if (root) {
  1734. root &= PT64_BASE_ADDR_MASK;
  1735. sp = page_header(root);
  1736. --sp->root_count;
  1737. if (!sp->root_count && sp->role.invalid)
  1738. kvm_mmu_zap_page(vcpu->kvm, sp);
  1739. }
  1740. vcpu->arch.mmu.pae_root[i] = INVALID_PAGE;
  1741. }
  1742. spin_unlock(&vcpu->kvm->mmu_lock);
  1743. vcpu->arch.mmu.root_hpa = INVALID_PAGE;
  1744. }
  1745. static int mmu_check_root(struct kvm_vcpu *vcpu, gfn_t root_gfn)
  1746. {
  1747. int ret = 0;
  1748. if (!kvm_is_visible_gfn(vcpu->kvm, root_gfn)) {
  1749. set_bit(KVM_REQ_TRIPLE_FAULT, &vcpu->requests);
  1750. ret = 1;
  1751. }
  1752. return ret;
  1753. }
  1754. static int mmu_alloc_roots(struct kvm_vcpu *vcpu)
  1755. {
  1756. int i;
  1757. gfn_t root_gfn;
  1758. struct kvm_mmu_page *sp;
  1759. int direct = 0;
  1760. u64 pdptr;
  1761. root_gfn = vcpu->arch.cr3 >> PAGE_SHIFT;
  1762. if (vcpu->arch.mmu.shadow_root_level == PT64_ROOT_LEVEL) {
  1763. hpa_t root = vcpu->arch.mmu.root_hpa;
  1764. ASSERT(!VALID_PAGE(root));
  1765. if (tdp_enabled)
  1766. direct = 1;
  1767. if (mmu_check_root(vcpu, root_gfn))
  1768. return 1;
  1769. sp = kvm_mmu_get_page(vcpu, root_gfn, 0,
  1770. PT64_ROOT_LEVEL, direct,
  1771. ACC_ALL, NULL);
  1772. root = __pa(sp->spt);
  1773. ++sp->root_count;
  1774. vcpu->arch.mmu.root_hpa = root;
  1775. return 0;
  1776. }
  1777. direct = !is_paging(vcpu);
  1778. if (tdp_enabled)
  1779. direct = 1;
  1780. for (i = 0; i < 4; ++i) {
  1781. hpa_t root = vcpu->arch.mmu.pae_root[i];
  1782. ASSERT(!VALID_PAGE(root));
  1783. if (vcpu->arch.mmu.root_level == PT32E_ROOT_LEVEL) {
  1784. pdptr = kvm_pdptr_read(vcpu, i);
  1785. if (!is_present_gpte(pdptr)) {
  1786. vcpu->arch.mmu.pae_root[i] = 0;
  1787. continue;
  1788. }
  1789. root_gfn = pdptr >> PAGE_SHIFT;
  1790. } else if (vcpu->arch.mmu.root_level == 0)
  1791. root_gfn = 0;
  1792. if (mmu_check_root(vcpu, root_gfn))
  1793. return 1;
  1794. sp = kvm_mmu_get_page(vcpu, root_gfn, i << 30,
  1795. PT32_ROOT_LEVEL, direct,
  1796. ACC_ALL, NULL);
  1797. root = __pa(sp->spt);
  1798. ++sp->root_count;
  1799. vcpu->arch.mmu.pae_root[i] = root | PT_PRESENT_MASK;
  1800. }
  1801. vcpu->arch.mmu.root_hpa = __pa(vcpu->arch.mmu.pae_root);
  1802. return 0;
  1803. }
  1804. static void mmu_sync_roots(struct kvm_vcpu *vcpu)
  1805. {
  1806. int i;
  1807. struct kvm_mmu_page *sp;
  1808. if (!VALID_PAGE(vcpu->arch.mmu.root_hpa))
  1809. return;
  1810. if (vcpu->arch.mmu.shadow_root_level == PT64_ROOT_LEVEL) {
  1811. hpa_t root = vcpu->arch.mmu.root_hpa;
  1812. sp = page_header(root);
  1813. mmu_sync_children(vcpu, sp);
  1814. return;
  1815. }
  1816. for (i = 0; i < 4; ++i) {
  1817. hpa_t root = vcpu->arch.mmu.pae_root[i];
  1818. if (root && VALID_PAGE(root)) {
  1819. root &= PT64_BASE_ADDR_MASK;
  1820. sp = page_header(root);
  1821. mmu_sync_children(vcpu, sp);
  1822. }
  1823. }
  1824. }
  1825. void kvm_mmu_sync_roots(struct kvm_vcpu *vcpu)
  1826. {
  1827. spin_lock(&vcpu->kvm->mmu_lock);
  1828. mmu_sync_roots(vcpu);
  1829. spin_unlock(&vcpu->kvm->mmu_lock);
  1830. }
  1831. static gpa_t nonpaging_gva_to_gpa(struct kvm_vcpu *vcpu, gva_t vaddr)
  1832. {
  1833. return vaddr;
  1834. }
  1835. static int nonpaging_page_fault(struct kvm_vcpu *vcpu, gva_t gva,
  1836. u32 error_code)
  1837. {
  1838. gfn_t gfn;
  1839. int r;
  1840. pgprintk("%s: gva %lx error %x\n", __func__, gva, error_code);
  1841. r = mmu_topup_memory_caches(vcpu);
  1842. if (r)
  1843. return r;
  1844. ASSERT(vcpu);
  1845. ASSERT(VALID_PAGE(vcpu->arch.mmu.root_hpa));
  1846. gfn = gva >> PAGE_SHIFT;
  1847. return nonpaging_map(vcpu, gva & PAGE_MASK,
  1848. error_code & PFERR_WRITE_MASK, gfn);
  1849. }
  1850. static int tdp_page_fault(struct kvm_vcpu *vcpu, gva_t gpa,
  1851. u32 error_code)
  1852. {
  1853. pfn_t pfn;
  1854. int r;
  1855. int level;
  1856. gfn_t gfn = gpa >> PAGE_SHIFT;
  1857. unsigned long mmu_seq;
  1858. ASSERT(vcpu);
  1859. ASSERT(VALID_PAGE(vcpu->arch.mmu.root_hpa));
  1860. r = mmu_topup_memory_caches(vcpu);
  1861. if (r)
  1862. return r;
  1863. level = mapping_level(vcpu, gfn);
  1864. gfn &= ~(KVM_PAGES_PER_HPAGE(level) - 1);
  1865. mmu_seq = vcpu->kvm->mmu_notifier_seq;
  1866. smp_rmb();
  1867. pfn = gfn_to_pfn(vcpu->kvm, gfn);
  1868. if (is_error_pfn(pfn)) {
  1869. kvm_release_pfn_clean(pfn);
  1870. return 1;
  1871. }
  1872. spin_lock(&vcpu->kvm->mmu_lock);
  1873. if (mmu_notifier_retry(vcpu, mmu_seq))
  1874. goto out_unlock;
  1875. kvm_mmu_free_some_pages(vcpu);
  1876. r = __direct_map(vcpu, gpa, error_code & PFERR_WRITE_MASK,
  1877. level, gfn, pfn);
  1878. spin_unlock(&vcpu->kvm->mmu_lock);
  1879. return r;
  1880. out_unlock:
  1881. spin_unlock(&vcpu->kvm->mmu_lock);
  1882. kvm_release_pfn_clean(pfn);
  1883. return 0;
  1884. }
  1885. static void nonpaging_free(struct kvm_vcpu *vcpu)
  1886. {
  1887. mmu_free_roots(vcpu);
  1888. }
  1889. static int nonpaging_init_context(struct kvm_vcpu *vcpu)
  1890. {
  1891. struct kvm_mmu *context = &vcpu->arch.mmu;
  1892. context->new_cr3 = nonpaging_new_cr3;
  1893. context->page_fault = nonpaging_page_fault;
  1894. context->gva_to_gpa = nonpaging_gva_to_gpa;
  1895. context->free = nonpaging_free;
  1896. context->prefetch_page = nonpaging_prefetch_page;
  1897. context->sync_page = nonpaging_sync_page;
  1898. context->invlpg = nonpaging_invlpg;
  1899. context->root_level = 0;
  1900. context->shadow_root_level = PT32E_ROOT_LEVEL;
  1901. context->root_hpa = INVALID_PAGE;
  1902. return 0;
  1903. }
  1904. void kvm_mmu_flush_tlb(struct kvm_vcpu *vcpu)
  1905. {
  1906. ++vcpu->stat.tlb_flush;
  1907. kvm_x86_ops->tlb_flush(vcpu);
  1908. }
  1909. static void paging_new_cr3(struct kvm_vcpu *vcpu)
  1910. {
  1911. pgprintk("%s: cr3 %lx\n", __func__, vcpu->arch.cr3);
  1912. mmu_free_roots(vcpu);
  1913. }
  1914. static void inject_page_fault(struct kvm_vcpu *vcpu,
  1915. u64 addr,
  1916. u32 err_code)
  1917. {
  1918. kvm_inject_page_fault(vcpu, addr, err_code);
  1919. }
  1920. static void paging_free(struct kvm_vcpu *vcpu)
  1921. {
  1922. nonpaging_free(vcpu);
  1923. }
  1924. static bool is_rsvd_bits_set(struct kvm_vcpu *vcpu, u64 gpte, int level)
  1925. {
  1926. int bit7;
  1927. bit7 = (gpte >> 7) & 1;
  1928. return (gpte & vcpu->arch.mmu.rsvd_bits_mask[bit7][level-1]) != 0;
  1929. }
  1930. #define PTTYPE 64
  1931. #include "paging_tmpl.h"
  1932. #undef PTTYPE
  1933. #define PTTYPE 32
  1934. #include "paging_tmpl.h"
  1935. #undef PTTYPE
  1936. static void reset_rsvds_bits_mask(struct kvm_vcpu *vcpu, int level)
  1937. {
  1938. struct kvm_mmu *context = &vcpu->arch.mmu;
  1939. int maxphyaddr = cpuid_maxphyaddr(vcpu);
  1940. u64 exb_bit_rsvd = 0;
  1941. if (!is_nx(vcpu))
  1942. exb_bit_rsvd = rsvd_bits(63, 63);
  1943. switch (level) {
  1944. case PT32_ROOT_LEVEL:
  1945. /* no rsvd bits for 2 level 4K page table entries */
  1946. context->rsvd_bits_mask[0][1] = 0;
  1947. context->rsvd_bits_mask[0][0] = 0;
  1948. if (is_cpuid_PSE36())
  1949. /* 36bits PSE 4MB page */
  1950. context->rsvd_bits_mask[1][1] = rsvd_bits(17, 21);
  1951. else
  1952. /* 32 bits PSE 4MB page */
  1953. context->rsvd_bits_mask[1][1] = rsvd_bits(13, 21);
  1954. context->rsvd_bits_mask[1][0] = context->rsvd_bits_mask[1][0];
  1955. break;
  1956. case PT32E_ROOT_LEVEL:
  1957. context->rsvd_bits_mask[0][2] =
  1958. rsvd_bits(maxphyaddr, 63) |
  1959. rsvd_bits(7, 8) | rsvd_bits(1, 2); /* PDPTE */
  1960. context->rsvd_bits_mask[0][1] = exb_bit_rsvd |
  1961. rsvd_bits(maxphyaddr, 62); /* PDE */
  1962. context->rsvd_bits_mask[0][0] = exb_bit_rsvd |
  1963. rsvd_bits(maxphyaddr, 62); /* PTE */
  1964. context->rsvd_bits_mask[1][1] = exb_bit_rsvd |
  1965. rsvd_bits(maxphyaddr, 62) |
  1966. rsvd_bits(13, 20); /* large page */
  1967. context->rsvd_bits_mask[1][0] = context->rsvd_bits_mask[1][0];
  1968. break;
  1969. case PT64_ROOT_LEVEL:
  1970. context->rsvd_bits_mask[0][3] = exb_bit_rsvd |
  1971. rsvd_bits(maxphyaddr, 51) | rsvd_bits(7, 8);
  1972. context->rsvd_bits_mask[0][2] = exb_bit_rsvd |
  1973. rsvd_bits(maxphyaddr, 51) | rsvd_bits(7, 8);
  1974. context->rsvd_bits_mask[0][1] = exb_bit_rsvd |
  1975. rsvd_bits(maxphyaddr, 51);
  1976. context->rsvd_bits_mask[0][0] = exb_bit_rsvd |
  1977. rsvd_bits(maxphyaddr, 51);
  1978. context->rsvd_bits_mask[1][3] = context->rsvd_bits_mask[0][3];
  1979. context->rsvd_bits_mask[1][2] = exb_bit_rsvd |
  1980. rsvd_bits(maxphyaddr, 51) |
  1981. rsvd_bits(13, 29);
  1982. context->rsvd_bits_mask[1][1] = exb_bit_rsvd |
  1983. rsvd_bits(maxphyaddr, 51) |
  1984. rsvd_bits(13, 20); /* large page */
  1985. context->rsvd_bits_mask[1][0] = context->rsvd_bits_mask[1][0];
  1986. break;
  1987. }
  1988. }
  1989. static int paging64_init_context_common(struct kvm_vcpu *vcpu, int level)
  1990. {
  1991. struct kvm_mmu *context = &vcpu->arch.mmu;
  1992. ASSERT(is_pae(vcpu));
  1993. context->new_cr3 = paging_new_cr3;
  1994. context->page_fault = paging64_page_fault;
  1995. context->gva_to_gpa = paging64_gva_to_gpa;
  1996. context->prefetch_page = paging64_prefetch_page;
  1997. context->sync_page = paging64_sync_page;
  1998. context->invlpg = paging64_invlpg;
  1999. context->free = paging_free;
  2000. context->root_level = level;
  2001. context->shadow_root_level = level;
  2002. context->root_hpa = INVALID_PAGE;
  2003. return 0;
  2004. }
  2005. static int paging64_init_context(struct kvm_vcpu *vcpu)
  2006. {
  2007. reset_rsvds_bits_mask(vcpu, PT64_ROOT_LEVEL);
  2008. return paging64_init_context_common(vcpu, PT64_ROOT_LEVEL);
  2009. }
  2010. static int paging32_init_context(struct kvm_vcpu *vcpu)
  2011. {
  2012. struct kvm_mmu *context = &vcpu->arch.mmu;
  2013. reset_rsvds_bits_mask(vcpu, PT32_ROOT_LEVEL);
  2014. context->new_cr3 = paging_new_cr3;
  2015. context->page_fault = paging32_page_fault;
  2016. context->gva_to_gpa = paging32_gva_to_gpa;
  2017. context->free = paging_free;
  2018. context->prefetch_page = paging32_prefetch_page;
  2019. context->sync_page = paging32_sync_page;
  2020. context->invlpg = paging32_invlpg;
  2021. context->root_level = PT32_ROOT_LEVEL;
  2022. context->shadow_root_level = PT32E_ROOT_LEVEL;
  2023. context->root_hpa = INVALID_PAGE;
  2024. return 0;
  2025. }
  2026. static int paging32E_init_context(struct kvm_vcpu *vcpu)
  2027. {
  2028. reset_rsvds_bits_mask(vcpu, PT32E_ROOT_LEVEL);
  2029. return paging64_init_context_common(vcpu, PT32E_ROOT_LEVEL);
  2030. }
  2031. static int init_kvm_tdp_mmu(struct kvm_vcpu *vcpu)
  2032. {
  2033. struct kvm_mmu *context = &vcpu->arch.mmu;
  2034. context->new_cr3 = nonpaging_new_cr3;
  2035. context->page_fault = tdp_page_fault;
  2036. context->free = nonpaging_free;
  2037. context->prefetch_page = nonpaging_prefetch_page;
  2038. context->sync_page = nonpaging_sync_page;
  2039. context->invlpg = nonpaging_invlpg;
  2040. context->shadow_root_level = kvm_x86_ops->get_tdp_level();
  2041. context->root_hpa = INVALID_PAGE;
  2042. if (!is_paging(vcpu)) {
  2043. context->gva_to_gpa = nonpaging_gva_to_gpa;
  2044. context->root_level = 0;
  2045. } else if (is_long_mode(vcpu)) {
  2046. reset_rsvds_bits_mask(vcpu, PT64_ROOT_LEVEL);
  2047. context->gva_to_gpa = paging64_gva_to_gpa;
  2048. context->root_level = PT64_ROOT_LEVEL;
  2049. } else if (is_pae(vcpu)) {
  2050. reset_rsvds_bits_mask(vcpu, PT32E_ROOT_LEVEL);
  2051. context->gva_to_gpa = paging64_gva_to_gpa;
  2052. context->root_level = PT32E_ROOT_LEVEL;
  2053. } else {
  2054. reset_rsvds_bits_mask(vcpu, PT32_ROOT_LEVEL);
  2055. context->gva_to_gpa = paging32_gva_to_gpa;
  2056. context->root_level = PT32_ROOT_LEVEL;
  2057. }
  2058. return 0;
  2059. }
  2060. static int init_kvm_softmmu(struct kvm_vcpu *vcpu)
  2061. {
  2062. int r;
  2063. ASSERT(vcpu);
  2064. ASSERT(!VALID_PAGE(vcpu->arch.mmu.root_hpa));
  2065. if (!is_paging(vcpu))
  2066. r = nonpaging_init_context(vcpu);
  2067. else if (is_long_mode(vcpu))
  2068. r = paging64_init_context(vcpu);
  2069. else if (is_pae(vcpu))
  2070. r = paging32E_init_context(vcpu);
  2071. else
  2072. r = paging32_init_context(vcpu);
  2073. vcpu->arch.mmu.base_role.glevels = vcpu->arch.mmu.root_level;
  2074. return r;
  2075. }
  2076. static int init_kvm_mmu(struct kvm_vcpu *vcpu)
  2077. {
  2078. vcpu->arch.update_pte.pfn = bad_pfn;
  2079. if (tdp_enabled)
  2080. return init_kvm_tdp_mmu(vcpu);
  2081. else
  2082. return init_kvm_softmmu(vcpu);
  2083. }
  2084. static void destroy_kvm_mmu(struct kvm_vcpu *vcpu)
  2085. {
  2086. ASSERT(vcpu);
  2087. if (VALID_PAGE(vcpu->arch.mmu.root_hpa)) {
  2088. vcpu->arch.mmu.free(vcpu);
  2089. vcpu->arch.mmu.root_hpa = INVALID_PAGE;
  2090. }
  2091. }
  2092. int kvm_mmu_reset_context(struct kvm_vcpu *vcpu)
  2093. {
  2094. destroy_kvm_mmu(vcpu);
  2095. return init_kvm_mmu(vcpu);
  2096. }
  2097. EXPORT_SYMBOL_GPL(kvm_mmu_reset_context);
  2098. int kvm_mmu_load(struct kvm_vcpu *vcpu)
  2099. {
  2100. int r;
  2101. r = mmu_topup_memory_caches(vcpu);
  2102. if (r)
  2103. goto out;
  2104. spin_lock(&vcpu->kvm->mmu_lock);
  2105. kvm_mmu_free_some_pages(vcpu);
  2106. r = mmu_alloc_roots(vcpu);
  2107. mmu_sync_roots(vcpu);
  2108. spin_unlock(&vcpu->kvm->mmu_lock);
  2109. if (r)
  2110. goto out;
  2111. /* set_cr3() should ensure TLB has been flushed */
  2112. kvm_x86_ops->set_cr3(vcpu, vcpu->arch.mmu.root_hpa);
  2113. out:
  2114. return r;
  2115. }
  2116. EXPORT_SYMBOL_GPL(kvm_mmu_load);
  2117. void kvm_mmu_unload(struct kvm_vcpu *vcpu)
  2118. {
  2119. mmu_free_roots(vcpu);
  2120. }
  2121. static void mmu_pte_write_zap_pte(struct kvm_vcpu *vcpu,
  2122. struct kvm_mmu_page *sp,
  2123. u64 *spte)
  2124. {
  2125. u64 pte;
  2126. struct kvm_mmu_page *child;
  2127. pte = *spte;
  2128. if (is_shadow_present_pte(pte)) {
  2129. if (is_last_spte(pte, sp->role.level))
  2130. rmap_remove(vcpu->kvm, spte);
  2131. else {
  2132. child = page_header(pte & PT64_BASE_ADDR_MASK);
  2133. mmu_page_remove_parent_pte(child, spte);
  2134. }
  2135. }
  2136. __set_spte(spte, shadow_trap_nonpresent_pte);
  2137. if (is_large_pte(pte))
  2138. --vcpu->kvm->stat.lpages;
  2139. }
  2140. static void mmu_pte_write_new_pte(struct kvm_vcpu *vcpu,
  2141. struct kvm_mmu_page *sp,
  2142. u64 *spte,
  2143. const void *new)
  2144. {
  2145. if (sp->role.level != PT_PAGE_TABLE_LEVEL) {
  2146. ++vcpu->kvm->stat.mmu_pde_zapped;
  2147. return;
  2148. }
  2149. ++vcpu->kvm->stat.mmu_pte_updated;
  2150. if (sp->role.glevels == PT32_ROOT_LEVEL)
  2151. paging32_update_pte(vcpu, sp, spte, new);
  2152. else
  2153. paging64_update_pte(vcpu, sp, spte, new);
  2154. }
  2155. static bool need_remote_flush(u64 old, u64 new)
  2156. {
  2157. if (!is_shadow_present_pte(old))
  2158. return false;
  2159. if (!is_shadow_present_pte(new))
  2160. return true;
  2161. if ((old ^ new) & PT64_BASE_ADDR_MASK)
  2162. return true;
  2163. old ^= PT64_NX_MASK;
  2164. new ^= PT64_NX_MASK;
  2165. return (old & ~new & PT64_PERM_MASK) != 0;
  2166. }
  2167. static void mmu_pte_write_flush_tlb(struct kvm_vcpu *vcpu, u64 old, u64 new)
  2168. {
  2169. if (need_remote_flush(old, new))
  2170. kvm_flush_remote_tlbs(vcpu->kvm);
  2171. else
  2172. kvm_mmu_flush_tlb(vcpu);
  2173. }
  2174. static bool last_updated_pte_accessed(struct kvm_vcpu *vcpu)
  2175. {
  2176. u64 *spte = vcpu->arch.last_pte_updated;
  2177. return !!(spte && (*spte & shadow_accessed_mask));
  2178. }
  2179. static void mmu_guess_page_from_pte_write(struct kvm_vcpu *vcpu, gpa_t gpa,
  2180. const u8 *new, int bytes)
  2181. {
  2182. gfn_t gfn;
  2183. int r;
  2184. u64 gpte = 0;
  2185. pfn_t pfn;
  2186. if (bytes != 4 && bytes != 8)
  2187. return;
  2188. /*
  2189. * Assume that the pte write on a page table of the same type
  2190. * as the current vcpu paging mode. This is nearly always true
  2191. * (might be false while changing modes). Note it is verified later
  2192. * by update_pte().
  2193. */
  2194. if (is_pae(vcpu)) {
  2195. /* Handle a 32-bit guest writing two halves of a 64-bit gpte */
  2196. if ((bytes == 4) && (gpa % 4 == 0)) {
  2197. r = kvm_read_guest(vcpu->kvm, gpa & ~(u64)7, &gpte, 8);
  2198. if (r)
  2199. return;
  2200. memcpy((void *)&gpte + (gpa % 8), new, 4);
  2201. } else if ((bytes == 8) && (gpa % 8 == 0)) {
  2202. memcpy((void *)&gpte, new, 8);
  2203. }
  2204. } else {
  2205. if ((bytes == 4) && (gpa % 4 == 0))
  2206. memcpy((void *)&gpte, new, 4);
  2207. }
  2208. if (!is_present_gpte(gpte))
  2209. return;
  2210. gfn = (gpte & PT64_BASE_ADDR_MASK) >> PAGE_SHIFT;
  2211. vcpu->arch.update_pte.mmu_seq = vcpu->kvm->mmu_notifier_seq;
  2212. smp_rmb();
  2213. pfn = gfn_to_pfn(vcpu->kvm, gfn);
  2214. if (is_error_pfn(pfn)) {
  2215. kvm_release_pfn_clean(pfn);
  2216. return;
  2217. }
  2218. vcpu->arch.update_pte.gfn = gfn;
  2219. vcpu->arch.update_pte.pfn = pfn;
  2220. }
  2221. static void kvm_mmu_access_page(struct kvm_vcpu *vcpu, gfn_t gfn)
  2222. {
  2223. u64 *spte = vcpu->arch.last_pte_updated;
  2224. if (spte
  2225. && vcpu->arch.last_pte_gfn == gfn
  2226. && shadow_accessed_mask
  2227. && !(*spte & shadow_accessed_mask)
  2228. && is_shadow_present_pte(*spte))
  2229. set_bit(PT_ACCESSED_SHIFT, (unsigned long *)spte);
  2230. }
  2231. void kvm_mmu_pte_write(struct kvm_vcpu *vcpu, gpa_t gpa,
  2232. const u8 *new, int bytes,
  2233. bool guest_initiated)
  2234. {
  2235. gfn_t gfn = gpa >> PAGE_SHIFT;
  2236. struct kvm_mmu_page *sp;
  2237. struct hlist_node *node, *n;
  2238. struct hlist_head *bucket;
  2239. unsigned index;
  2240. u64 entry, gentry;
  2241. u64 *spte;
  2242. unsigned offset = offset_in_page(gpa);
  2243. unsigned pte_size;
  2244. unsigned page_offset;
  2245. unsigned misaligned;
  2246. unsigned quadrant;
  2247. int level;
  2248. int flooded = 0;
  2249. int npte;
  2250. int r;
  2251. pgprintk("%s: gpa %llx bytes %d\n", __func__, gpa, bytes);
  2252. mmu_guess_page_from_pte_write(vcpu, gpa, new, bytes);
  2253. spin_lock(&vcpu->kvm->mmu_lock);
  2254. kvm_mmu_access_page(vcpu, gfn);
  2255. kvm_mmu_free_some_pages(vcpu);
  2256. ++vcpu->kvm->stat.mmu_pte_write;
  2257. kvm_mmu_audit(vcpu, "pre pte write");
  2258. if (guest_initiated) {
  2259. if (gfn == vcpu->arch.last_pt_write_gfn
  2260. && !last_updated_pte_accessed(vcpu)) {
  2261. ++vcpu->arch.last_pt_write_count;
  2262. if (vcpu->arch.last_pt_write_count >= 3)
  2263. flooded = 1;
  2264. } else {
  2265. vcpu->arch.last_pt_write_gfn = gfn;
  2266. vcpu->arch.last_pt_write_count = 1;
  2267. vcpu->arch.last_pte_updated = NULL;
  2268. }
  2269. }
  2270. index = kvm_page_table_hashfn(gfn);
  2271. bucket = &vcpu->kvm->arch.mmu_page_hash[index];
  2272. hlist_for_each_entry_safe(sp, node, n, bucket, hash_link) {
  2273. if (sp->gfn != gfn || sp->role.direct || sp->role.invalid)
  2274. continue;
  2275. pte_size = sp->role.glevels == PT32_ROOT_LEVEL ? 4 : 8;
  2276. misaligned = (offset ^ (offset + bytes - 1)) & ~(pte_size - 1);
  2277. misaligned |= bytes < 4;
  2278. if (misaligned || flooded) {
  2279. /*
  2280. * Misaligned accesses are too much trouble to fix
  2281. * up; also, they usually indicate a page is not used
  2282. * as a page table.
  2283. *
  2284. * If we're seeing too many writes to a page,
  2285. * it may no longer be a page table, or we may be
  2286. * forking, in which case it is better to unmap the
  2287. * page.
  2288. */
  2289. pgprintk("misaligned: gpa %llx bytes %d role %x\n",
  2290. gpa, bytes, sp->role.word);
  2291. if (kvm_mmu_zap_page(vcpu->kvm, sp))
  2292. n = bucket->first;
  2293. ++vcpu->kvm->stat.mmu_flooded;
  2294. continue;
  2295. }
  2296. page_offset = offset;
  2297. level = sp->role.level;
  2298. npte = 1;
  2299. if (sp->role.glevels == PT32_ROOT_LEVEL) {
  2300. page_offset <<= 1; /* 32->64 */
  2301. /*
  2302. * A 32-bit pde maps 4MB while the shadow pdes map
  2303. * only 2MB. So we need to double the offset again
  2304. * and zap two pdes instead of one.
  2305. */
  2306. if (level == PT32_ROOT_LEVEL) {
  2307. page_offset &= ~7; /* kill rounding error */
  2308. page_offset <<= 1;
  2309. npte = 2;
  2310. }
  2311. quadrant = page_offset >> PAGE_SHIFT;
  2312. page_offset &= ~PAGE_MASK;
  2313. if (quadrant != sp->role.quadrant)
  2314. continue;
  2315. }
  2316. spte = &sp->spt[page_offset / sizeof(*spte)];
  2317. if ((gpa & (pte_size - 1)) || (bytes < pte_size)) {
  2318. gentry = 0;
  2319. r = kvm_read_guest_atomic(vcpu->kvm,
  2320. gpa & ~(u64)(pte_size - 1),
  2321. &gentry, pte_size);
  2322. new = (const void *)&gentry;
  2323. if (r < 0)
  2324. new = NULL;
  2325. }
  2326. while (npte--) {
  2327. entry = *spte;
  2328. mmu_pte_write_zap_pte(vcpu, sp, spte);
  2329. if (new)
  2330. mmu_pte_write_new_pte(vcpu, sp, spte, new);
  2331. mmu_pte_write_flush_tlb(vcpu, entry, *spte);
  2332. ++spte;
  2333. }
  2334. }
  2335. kvm_mmu_audit(vcpu, "post pte write");
  2336. spin_unlock(&vcpu->kvm->mmu_lock);
  2337. if (!is_error_pfn(vcpu->arch.update_pte.pfn)) {
  2338. kvm_release_pfn_clean(vcpu->arch.update_pte.pfn);
  2339. vcpu->arch.update_pte.pfn = bad_pfn;
  2340. }
  2341. }
  2342. int kvm_mmu_unprotect_page_virt(struct kvm_vcpu *vcpu, gva_t gva)
  2343. {
  2344. gpa_t gpa;
  2345. int r;
  2346. if (tdp_enabled)
  2347. return 0;
  2348. gpa = vcpu->arch.mmu.gva_to_gpa(vcpu, gva);
  2349. spin_lock(&vcpu->kvm->mmu_lock);
  2350. r = kvm_mmu_unprotect_page(vcpu->kvm, gpa >> PAGE_SHIFT);
  2351. spin_unlock(&vcpu->kvm->mmu_lock);
  2352. return r;
  2353. }
  2354. EXPORT_SYMBOL_GPL(kvm_mmu_unprotect_page_virt);
  2355. void __kvm_mmu_free_some_pages(struct kvm_vcpu *vcpu)
  2356. {
  2357. while (vcpu->kvm->arch.n_free_mmu_pages < KVM_REFILL_PAGES &&
  2358. !list_empty(&vcpu->kvm->arch.active_mmu_pages)) {
  2359. struct kvm_mmu_page *sp;
  2360. sp = container_of(vcpu->kvm->arch.active_mmu_pages.prev,
  2361. struct kvm_mmu_page, link);
  2362. kvm_mmu_zap_page(vcpu->kvm, sp);
  2363. ++vcpu->kvm->stat.mmu_recycled;
  2364. }
  2365. }
  2366. int kvm_mmu_page_fault(struct kvm_vcpu *vcpu, gva_t cr2, u32 error_code)
  2367. {
  2368. int r;
  2369. enum emulation_result er;
  2370. r = vcpu->arch.mmu.page_fault(vcpu, cr2, error_code);
  2371. if (r < 0)
  2372. goto out;
  2373. if (!r) {
  2374. r = 1;
  2375. goto out;
  2376. }
  2377. r = mmu_topup_memory_caches(vcpu);
  2378. if (r)
  2379. goto out;
  2380. er = emulate_instruction(vcpu, vcpu->run, cr2, error_code, 0);
  2381. switch (er) {
  2382. case EMULATE_DONE:
  2383. return 1;
  2384. case EMULATE_DO_MMIO:
  2385. ++vcpu->stat.mmio_exits;
  2386. return 0;
  2387. case EMULATE_FAIL:
  2388. vcpu->run->exit_reason = KVM_EXIT_INTERNAL_ERROR;
  2389. vcpu->run->internal.suberror = KVM_INTERNAL_ERROR_EMULATION;
  2390. return 0;
  2391. default:
  2392. BUG();
  2393. }
  2394. out:
  2395. return r;
  2396. }
  2397. EXPORT_SYMBOL_GPL(kvm_mmu_page_fault);
  2398. void kvm_mmu_invlpg(struct kvm_vcpu *vcpu, gva_t gva)
  2399. {
  2400. vcpu->arch.mmu.invlpg(vcpu, gva);
  2401. kvm_mmu_flush_tlb(vcpu);
  2402. ++vcpu->stat.invlpg;
  2403. }
  2404. EXPORT_SYMBOL_GPL(kvm_mmu_invlpg);
  2405. void kvm_enable_tdp(void)
  2406. {
  2407. tdp_enabled = true;
  2408. }
  2409. EXPORT_SYMBOL_GPL(kvm_enable_tdp);
  2410. void kvm_disable_tdp(void)
  2411. {
  2412. tdp_enabled = false;
  2413. }
  2414. EXPORT_SYMBOL_GPL(kvm_disable_tdp);
  2415. static void free_mmu_pages(struct kvm_vcpu *vcpu)
  2416. {
  2417. free_page((unsigned long)vcpu->arch.mmu.pae_root);
  2418. }
  2419. static int alloc_mmu_pages(struct kvm_vcpu *vcpu)
  2420. {
  2421. struct page *page;
  2422. int i;
  2423. ASSERT(vcpu);
  2424. /*
  2425. * When emulating 32-bit mode, cr3 is only 32 bits even on x86_64.
  2426. * Therefore we need to allocate shadow page tables in the first
  2427. * 4GB of memory, which happens to fit the DMA32 zone.
  2428. */
  2429. page = alloc_page(GFP_KERNEL | __GFP_DMA32);
  2430. if (!page)
  2431. goto error_1;
  2432. vcpu->arch.mmu.pae_root = page_address(page);
  2433. for (i = 0; i < 4; ++i)
  2434. vcpu->arch.mmu.pae_root[i] = INVALID_PAGE;
  2435. return 0;
  2436. error_1:
  2437. free_mmu_pages(vcpu);
  2438. return -ENOMEM;
  2439. }
  2440. int kvm_mmu_create(struct kvm_vcpu *vcpu)
  2441. {
  2442. ASSERT(vcpu);
  2443. ASSERT(!VALID_PAGE(vcpu->arch.mmu.root_hpa));
  2444. return alloc_mmu_pages(vcpu);
  2445. }
  2446. int kvm_mmu_setup(struct kvm_vcpu *vcpu)
  2447. {
  2448. ASSERT(vcpu);
  2449. ASSERT(!VALID_PAGE(vcpu->arch.mmu.root_hpa));
  2450. return init_kvm_mmu(vcpu);
  2451. }
  2452. void kvm_mmu_destroy(struct kvm_vcpu *vcpu)
  2453. {
  2454. ASSERT(vcpu);
  2455. destroy_kvm_mmu(vcpu);
  2456. free_mmu_pages(vcpu);
  2457. mmu_free_memory_caches(vcpu);
  2458. }
  2459. void kvm_mmu_slot_remove_write_access(struct kvm *kvm, int slot)
  2460. {
  2461. struct kvm_mmu_page *sp;
  2462. list_for_each_entry(sp, &kvm->arch.active_mmu_pages, link) {
  2463. int i;
  2464. u64 *pt;
  2465. if (!test_bit(slot, sp->slot_bitmap))
  2466. continue;
  2467. pt = sp->spt;
  2468. for (i = 0; i < PT64_ENT_PER_PAGE; ++i)
  2469. /* avoid RMW */
  2470. if (pt[i] & PT_WRITABLE_MASK)
  2471. pt[i] &= ~PT_WRITABLE_MASK;
  2472. }
  2473. kvm_flush_remote_tlbs(kvm);
  2474. }
  2475. void kvm_mmu_zap_all(struct kvm *kvm)
  2476. {
  2477. struct kvm_mmu_page *sp, *node;
  2478. spin_lock(&kvm->mmu_lock);
  2479. list_for_each_entry_safe(sp, node, &kvm->arch.active_mmu_pages, link)
  2480. if (kvm_mmu_zap_page(kvm, sp))
  2481. node = container_of(kvm->arch.active_mmu_pages.next,
  2482. struct kvm_mmu_page, link);
  2483. spin_unlock(&kvm->mmu_lock);
  2484. kvm_flush_remote_tlbs(kvm);
  2485. }
  2486. static void kvm_mmu_remove_one_alloc_mmu_page(struct kvm *kvm)
  2487. {
  2488. struct kvm_mmu_page *page;
  2489. page = container_of(kvm->arch.active_mmu_pages.prev,
  2490. struct kvm_mmu_page, link);
  2491. kvm_mmu_zap_page(kvm, page);
  2492. }
  2493. static int mmu_shrink(int nr_to_scan, gfp_t gfp_mask)
  2494. {
  2495. struct kvm *kvm;
  2496. struct kvm *kvm_freed = NULL;
  2497. int cache_count = 0;
  2498. spin_lock(&kvm_lock);
  2499. list_for_each_entry(kvm, &vm_list, vm_list) {
  2500. int npages;
  2501. if (!down_read_trylock(&kvm->slots_lock))
  2502. continue;
  2503. spin_lock(&kvm->mmu_lock);
  2504. npages = kvm->arch.n_alloc_mmu_pages -
  2505. kvm->arch.n_free_mmu_pages;
  2506. cache_count += npages;
  2507. if (!kvm_freed && nr_to_scan > 0 && npages > 0) {
  2508. kvm_mmu_remove_one_alloc_mmu_page(kvm);
  2509. cache_count--;
  2510. kvm_freed = kvm;
  2511. }
  2512. nr_to_scan--;
  2513. spin_unlock(&kvm->mmu_lock);
  2514. up_read(&kvm->slots_lock);
  2515. }
  2516. if (kvm_freed)
  2517. list_move_tail(&kvm_freed->vm_list, &vm_list);
  2518. spin_unlock(&kvm_lock);
  2519. return cache_count;
  2520. }
  2521. static struct shrinker mmu_shrinker = {
  2522. .shrink = mmu_shrink,
  2523. .seeks = DEFAULT_SEEKS * 10,
  2524. };
  2525. static void mmu_destroy_caches(void)
  2526. {
  2527. if (pte_chain_cache)
  2528. kmem_cache_destroy(pte_chain_cache);
  2529. if (rmap_desc_cache)
  2530. kmem_cache_destroy(rmap_desc_cache);
  2531. if (mmu_page_header_cache)
  2532. kmem_cache_destroy(mmu_page_header_cache);
  2533. }
  2534. void kvm_mmu_module_exit(void)
  2535. {
  2536. mmu_destroy_caches();
  2537. unregister_shrinker(&mmu_shrinker);
  2538. }
  2539. int kvm_mmu_module_init(void)
  2540. {
  2541. pte_chain_cache = kmem_cache_create("kvm_pte_chain",
  2542. sizeof(struct kvm_pte_chain),
  2543. 0, 0, NULL);
  2544. if (!pte_chain_cache)
  2545. goto nomem;
  2546. rmap_desc_cache = kmem_cache_create("kvm_rmap_desc",
  2547. sizeof(struct kvm_rmap_desc),
  2548. 0, 0, NULL);
  2549. if (!rmap_desc_cache)
  2550. goto nomem;
  2551. mmu_page_header_cache = kmem_cache_create("kvm_mmu_page_header",
  2552. sizeof(struct kvm_mmu_page),
  2553. 0, 0, NULL);
  2554. if (!mmu_page_header_cache)
  2555. goto nomem;
  2556. register_shrinker(&mmu_shrinker);
  2557. return 0;
  2558. nomem:
  2559. mmu_destroy_caches();
  2560. return -ENOMEM;
  2561. }
  2562. /*
  2563. * Caculate mmu pages needed for kvm.
  2564. */
  2565. unsigned int kvm_mmu_calculate_mmu_pages(struct kvm *kvm)
  2566. {
  2567. int i;
  2568. unsigned int nr_mmu_pages;
  2569. unsigned int nr_pages = 0;
  2570. for (i = 0; i < kvm->nmemslots; i++)
  2571. nr_pages += kvm->memslots[i].npages;
  2572. nr_mmu_pages = nr_pages * KVM_PERMILLE_MMU_PAGES / 1000;
  2573. nr_mmu_pages = max(nr_mmu_pages,
  2574. (unsigned int) KVM_MIN_ALLOC_MMU_PAGES);
  2575. return nr_mmu_pages;
  2576. }
  2577. static void *pv_mmu_peek_buffer(struct kvm_pv_mmu_op_buffer *buffer,
  2578. unsigned len)
  2579. {
  2580. if (len > buffer->len)
  2581. return NULL;
  2582. return buffer->ptr;
  2583. }
  2584. static void *pv_mmu_read_buffer(struct kvm_pv_mmu_op_buffer *buffer,
  2585. unsigned len)
  2586. {
  2587. void *ret;
  2588. ret = pv_mmu_peek_buffer(buffer, len);
  2589. if (!ret)
  2590. return ret;
  2591. buffer->ptr += len;
  2592. buffer->len -= len;
  2593. buffer->processed += len;
  2594. return ret;
  2595. }
  2596. static int kvm_pv_mmu_write(struct kvm_vcpu *vcpu,
  2597. gpa_t addr, gpa_t value)
  2598. {
  2599. int bytes = 8;
  2600. int r;
  2601. if (!is_long_mode(vcpu) && !is_pae(vcpu))
  2602. bytes = 4;
  2603. r = mmu_topup_memory_caches(vcpu);
  2604. if (r)
  2605. return r;
  2606. if (!emulator_write_phys(vcpu, addr, &value, bytes))
  2607. return -EFAULT;
  2608. return 1;
  2609. }
  2610. static int kvm_pv_mmu_flush_tlb(struct kvm_vcpu *vcpu)
  2611. {
  2612. kvm_set_cr3(vcpu, vcpu->arch.cr3);
  2613. return 1;
  2614. }
  2615. static int kvm_pv_mmu_release_pt(struct kvm_vcpu *vcpu, gpa_t addr)
  2616. {
  2617. spin_lock(&vcpu->kvm->mmu_lock);
  2618. mmu_unshadow(vcpu->kvm, addr >> PAGE_SHIFT);
  2619. spin_unlock(&vcpu->kvm->mmu_lock);
  2620. return 1;
  2621. }
  2622. static int kvm_pv_mmu_op_one(struct kvm_vcpu *vcpu,
  2623. struct kvm_pv_mmu_op_buffer *buffer)
  2624. {
  2625. struct kvm_mmu_op_header *header;
  2626. header = pv_mmu_peek_buffer(buffer, sizeof *header);
  2627. if (!header)
  2628. return 0;
  2629. switch (header->op) {
  2630. case KVM_MMU_OP_WRITE_PTE: {
  2631. struct kvm_mmu_op_write_pte *wpte;
  2632. wpte = pv_mmu_read_buffer(buffer, sizeof *wpte);
  2633. if (!wpte)
  2634. return 0;
  2635. return kvm_pv_mmu_write(vcpu, wpte->pte_phys,
  2636. wpte->pte_val);
  2637. }
  2638. case KVM_MMU_OP_FLUSH_TLB: {
  2639. struct kvm_mmu_op_flush_tlb *ftlb;
  2640. ftlb = pv_mmu_read_buffer(buffer, sizeof *ftlb);
  2641. if (!ftlb)
  2642. return 0;
  2643. return kvm_pv_mmu_flush_tlb(vcpu);
  2644. }
  2645. case KVM_MMU_OP_RELEASE_PT: {
  2646. struct kvm_mmu_op_release_pt *rpt;
  2647. rpt = pv_mmu_read_buffer(buffer, sizeof *rpt);
  2648. if (!rpt)
  2649. return 0;
  2650. return kvm_pv_mmu_release_pt(vcpu, rpt->pt_phys);
  2651. }
  2652. default: return 0;
  2653. }
  2654. }
  2655. int kvm_pv_mmu_op(struct kvm_vcpu *vcpu, unsigned long bytes,
  2656. gpa_t addr, unsigned long *ret)
  2657. {
  2658. int r;
  2659. struct kvm_pv_mmu_op_buffer *buffer = &vcpu->arch.mmu_op_buffer;
  2660. buffer->ptr = buffer->buf;
  2661. buffer->len = min_t(unsigned long, bytes, sizeof buffer->buf);
  2662. buffer->processed = 0;
  2663. r = kvm_read_guest(vcpu->kvm, addr, buffer->buf, buffer->len);
  2664. if (r)
  2665. goto out;
  2666. while (buffer->len) {
  2667. r = kvm_pv_mmu_op_one(vcpu, buffer);
  2668. if (r < 0)
  2669. goto out;
  2670. if (r == 0)
  2671. break;
  2672. }
  2673. r = 1;
  2674. out:
  2675. *ret = buffer->processed;
  2676. return r;
  2677. }
  2678. int kvm_mmu_get_spte_hierarchy(struct kvm_vcpu *vcpu, u64 addr, u64 sptes[4])
  2679. {
  2680. struct kvm_shadow_walk_iterator iterator;
  2681. int nr_sptes = 0;
  2682. spin_lock(&vcpu->kvm->mmu_lock);
  2683. for_each_shadow_entry(vcpu, addr, iterator) {
  2684. sptes[iterator.level-1] = *iterator.sptep;
  2685. nr_sptes++;
  2686. if (!is_shadow_present_pte(*iterator.sptep))
  2687. break;
  2688. }
  2689. spin_unlock(&vcpu->kvm->mmu_lock);
  2690. return nr_sptes;
  2691. }
  2692. EXPORT_SYMBOL_GPL(kvm_mmu_get_spte_hierarchy);
  2693. #ifdef AUDIT
  2694. static const char *audit_msg;
  2695. static gva_t canonicalize(gva_t gva)
  2696. {
  2697. #ifdef CONFIG_X86_64
  2698. gva = (long long)(gva << 16) >> 16;
  2699. #endif
  2700. return gva;
  2701. }
  2702. typedef void (*inspect_spte_fn) (struct kvm *kvm, struct kvm_mmu_page *sp,
  2703. u64 *sptep);
  2704. static void __mmu_spte_walk(struct kvm *kvm, struct kvm_mmu_page *sp,
  2705. inspect_spte_fn fn)
  2706. {
  2707. int i;
  2708. for (i = 0; i < PT64_ENT_PER_PAGE; ++i) {
  2709. u64 ent = sp->spt[i];
  2710. if (is_shadow_present_pte(ent)) {
  2711. if (!is_last_spte(ent, sp->role.level)) {
  2712. struct kvm_mmu_page *child;
  2713. child = page_header(ent & PT64_BASE_ADDR_MASK);
  2714. __mmu_spte_walk(kvm, child, fn);
  2715. } else
  2716. fn(kvm, sp, &sp->spt[i]);
  2717. }
  2718. }
  2719. }
  2720. static void mmu_spte_walk(struct kvm_vcpu *vcpu, inspect_spte_fn fn)
  2721. {
  2722. int i;
  2723. struct kvm_mmu_page *sp;
  2724. if (!VALID_PAGE(vcpu->arch.mmu.root_hpa))
  2725. return;
  2726. if (vcpu->arch.mmu.shadow_root_level == PT64_ROOT_LEVEL) {
  2727. hpa_t root = vcpu->arch.mmu.root_hpa;
  2728. sp = page_header(root);
  2729. __mmu_spte_walk(vcpu->kvm, sp, fn);
  2730. return;
  2731. }
  2732. for (i = 0; i < 4; ++i) {
  2733. hpa_t root = vcpu->arch.mmu.pae_root[i];
  2734. if (root && VALID_PAGE(root)) {
  2735. root &= PT64_BASE_ADDR_MASK;
  2736. sp = page_header(root);
  2737. __mmu_spte_walk(vcpu->kvm, sp, fn);
  2738. }
  2739. }
  2740. return;
  2741. }
  2742. static void audit_mappings_page(struct kvm_vcpu *vcpu, u64 page_pte,
  2743. gva_t va, int level)
  2744. {
  2745. u64 *pt = __va(page_pte & PT64_BASE_ADDR_MASK);
  2746. int i;
  2747. gva_t va_delta = 1ul << (PAGE_SHIFT + 9 * (level - 1));
  2748. for (i = 0; i < PT64_ENT_PER_PAGE; ++i, va += va_delta) {
  2749. u64 ent = pt[i];
  2750. if (ent == shadow_trap_nonpresent_pte)
  2751. continue;
  2752. va = canonicalize(va);
  2753. if (is_shadow_present_pte(ent) && !is_last_spte(ent, level))
  2754. audit_mappings_page(vcpu, ent, va, level - 1);
  2755. else {
  2756. gpa_t gpa = vcpu->arch.mmu.gva_to_gpa(vcpu, va);
  2757. gfn_t gfn = gpa >> PAGE_SHIFT;
  2758. pfn_t pfn = gfn_to_pfn(vcpu->kvm, gfn);
  2759. hpa_t hpa = (hpa_t)pfn << PAGE_SHIFT;
  2760. if (is_error_pfn(pfn)) {
  2761. kvm_release_pfn_clean(pfn);
  2762. continue;
  2763. }
  2764. if (is_shadow_present_pte(ent)
  2765. && (ent & PT64_BASE_ADDR_MASK) != hpa)
  2766. printk(KERN_ERR "xx audit error: (%s) levels %d"
  2767. " gva %lx gpa %llx hpa %llx ent %llx %d\n",
  2768. audit_msg, vcpu->arch.mmu.root_level,
  2769. va, gpa, hpa, ent,
  2770. is_shadow_present_pte(ent));
  2771. else if (ent == shadow_notrap_nonpresent_pte
  2772. && !is_error_hpa(hpa))
  2773. printk(KERN_ERR "audit: (%s) notrap shadow,"
  2774. " valid guest gva %lx\n", audit_msg, va);
  2775. kvm_release_pfn_clean(pfn);
  2776. }
  2777. }
  2778. }
  2779. static void audit_mappings(struct kvm_vcpu *vcpu)
  2780. {
  2781. unsigned i;
  2782. if (vcpu->arch.mmu.root_level == 4)
  2783. audit_mappings_page(vcpu, vcpu->arch.mmu.root_hpa, 0, 4);
  2784. else
  2785. for (i = 0; i < 4; ++i)
  2786. if (vcpu->arch.mmu.pae_root[i] & PT_PRESENT_MASK)
  2787. audit_mappings_page(vcpu,
  2788. vcpu->arch.mmu.pae_root[i],
  2789. i << 30,
  2790. 2);
  2791. }
  2792. static int count_rmaps(struct kvm_vcpu *vcpu)
  2793. {
  2794. int nmaps = 0;
  2795. int i, j, k;
  2796. for (i = 0; i < KVM_MEMORY_SLOTS; ++i) {
  2797. struct kvm_memory_slot *m = &vcpu->kvm->memslots[i];
  2798. struct kvm_rmap_desc *d;
  2799. for (j = 0; j < m->npages; ++j) {
  2800. unsigned long *rmapp = &m->rmap[j];
  2801. if (!*rmapp)
  2802. continue;
  2803. if (!(*rmapp & 1)) {
  2804. ++nmaps;
  2805. continue;
  2806. }
  2807. d = (struct kvm_rmap_desc *)(*rmapp & ~1ul);
  2808. while (d) {
  2809. for (k = 0; k < RMAP_EXT; ++k)
  2810. if (d->sptes[k])
  2811. ++nmaps;
  2812. else
  2813. break;
  2814. d = d->more;
  2815. }
  2816. }
  2817. }
  2818. return nmaps;
  2819. }
  2820. void inspect_spte_has_rmap(struct kvm *kvm, struct kvm_mmu_page *sp, u64 *sptep)
  2821. {
  2822. unsigned long *rmapp;
  2823. struct kvm_mmu_page *rev_sp;
  2824. gfn_t gfn;
  2825. if (*sptep & PT_WRITABLE_MASK) {
  2826. rev_sp = page_header(__pa(sptep));
  2827. gfn = rev_sp->gfns[sptep - rev_sp->spt];
  2828. if (!gfn_to_memslot(kvm, gfn)) {
  2829. if (!printk_ratelimit())
  2830. return;
  2831. printk(KERN_ERR "%s: no memslot for gfn %ld\n",
  2832. audit_msg, gfn);
  2833. printk(KERN_ERR "%s: index %ld of sp (gfn=%lx)\n",
  2834. audit_msg, sptep - rev_sp->spt,
  2835. rev_sp->gfn);
  2836. dump_stack();
  2837. return;
  2838. }
  2839. rmapp = gfn_to_rmap(kvm, rev_sp->gfns[sptep - rev_sp->spt],
  2840. is_large_pte(*sptep));
  2841. if (!*rmapp) {
  2842. if (!printk_ratelimit())
  2843. return;
  2844. printk(KERN_ERR "%s: no rmap for writable spte %llx\n",
  2845. audit_msg, *sptep);
  2846. dump_stack();
  2847. }
  2848. }
  2849. }
  2850. void audit_writable_sptes_have_rmaps(struct kvm_vcpu *vcpu)
  2851. {
  2852. mmu_spte_walk(vcpu, inspect_spte_has_rmap);
  2853. }
  2854. static void check_writable_mappings_rmap(struct kvm_vcpu *vcpu)
  2855. {
  2856. struct kvm_mmu_page *sp;
  2857. int i;
  2858. list_for_each_entry(sp, &vcpu->kvm->arch.active_mmu_pages, link) {
  2859. u64 *pt = sp->spt;
  2860. if (sp->role.level != PT_PAGE_TABLE_LEVEL)
  2861. continue;
  2862. for (i = 0; i < PT64_ENT_PER_PAGE; ++i) {
  2863. u64 ent = pt[i];
  2864. if (!(ent & PT_PRESENT_MASK))
  2865. continue;
  2866. if (!(ent & PT_WRITABLE_MASK))
  2867. continue;
  2868. inspect_spte_has_rmap(vcpu->kvm, sp, &pt[i]);
  2869. }
  2870. }
  2871. return;
  2872. }
  2873. static void audit_rmap(struct kvm_vcpu *vcpu)
  2874. {
  2875. check_writable_mappings_rmap(vcpu);
  2876. count_rmaps(vcpu);
  2877. }
  2878. static void audit_write_protection(struct kvm_vcpu *vcpu)
  2879. {
  2880. struct kvm_mmu_page *sp;
  2881. struct kvm_memory_slot *slot;
  2882. unsigned long *rmapp;
  2883. u64 *spte;
  2884. gfn_t gfn;
  2885. list_for_each_entry(sp, &vcpu->kvm->arch.active_mmu_pages, link) {
  2886. if (sp->role.direct)
  2887. continue;
  2888. if (sp->unsync)
  2889. continue;
  2890. gfn = unalias_gfn(vcpu->kvm, sp->gfn);
  2891. slot = gfn_to_memslot_unaliased(vcpu->kvm, sp->gfn);
  2892. rmapp = &slot->rmap[gfn - slot->base_gfn];
  2893. spte = rmap_next(vcpu->kvm, rmapp, NULL);
  2894. while (spte) {
  2895. if (*spte & PT_WRITABLE_MASK)
  2896. printk(KERN_ERR "%s: (%s) shadow page has "
  2897. "writable mappings: gfn %lx role %x\n",
  2898. __func__, audit_msg, sp->gfn,
  2899. sp->role.word);
  2900. spte = rmap_next(vcpu->kvm, rmapp, spte);
  2901. }
  2902. }
  2903. }
  2904. static void kvm_mmu_audit(struct kvm_vcpu *vcpu, const char *msg)
  2905. {
  2906. int olddbg = dbg;
  2907. dbg = 0;
  2908. audit_msg = msg;
  2909. audit_rmap(vcpu);
  2910. audit_write_protection(vcpu);
  2911. if (strcmp("pre pte write", audit_msg) != 0)
  2912. audit_mappings(vcpu);
  2913. audit_writable_sptes_have_rmaps(vcpu);
  2914. dbg = olddbg;
  2915. }
  2916. #endif