kvm_main.c 91 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906
  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. * Copyright (C) 2006 Qumranet, Inc.
  8. * Copyright 2010 Red Hat, Inc. and/or its affiliates.
  9. *
  10. * Authors:
  11. * Avi Kivity <avi@qumranet.com>
  12. * Yaniv Kamay <yaniv@qumranet.com>
  13. *
  14. * This work is licensed under the terms of the GNU GPL, version 2. See
  15. * the COPYING file in the top-level directory.
  16. *
  17. */
  18. #include <kvm/iodev.h>
  19. #include <linux/kvm_host.h>
  20. #include <linux/kvm.h>
  21. #include <linux/module.h>
  22. #include <linux/errno.h>
  23. #include <linux/percpu.h>
  24. #include <linux/mm.h>
  25. #include <linux/miscdevice.h>
  26. #include <linux/vmalloc.h>
  27. #include <linux/reboot.h>
  28. #include <linux/debugfs.h>
  29. #include <linux/highmem.h>
  30. #include <linux/file.h>
  31. #include <linux/syscore_ops.h>
  32. #include <linux/cpu.h>
  33. #include <linux/sched.h>
  34. #include <linux/cpumask.h>
  35. #include <linux/smp.h>
  36. #include <linux/anon_inodes.h>
  37. #include <linux/profile.h>
  38. #include <linux/kvm_para.h>
  39. #include <linux/pagemap.h>
  40. #include <linux/mman.h>
  41. #include <linux/swap.h>
  42. #include <linux/bitops.h>
  43. #include <linux/spinlock.h>
  44. #include <linux/compat.h>
  45. #include <linux/srcu.h>
  46. #include <linux/hugetlb.h>
  47. #include <linux/slab.h>
  48. #include <linux/sort.h>
  49. #include <linux/bsearch.h>
  50. #include <asm/processor.h>
  51. #include <asm/io.h>
  52. #include <asm/ioctl.h>
  53. #include <asm/uaccess.h>
  54. #include <asm/pgtable.h>
  55. #include "coalesced_mmio.h"
  56. #include "async_pf.h"
  57. #include "vfio.h"
  58. #define CREATE_TRACE_POINTS
  59. #include <trace/events/kvm.h>
  60. /* Worst case buffer size needed for holding an integer. */
  61. #define ITOA_MAX_LEN 12
  62. MODULE_AUTHOR("Qumranet");
  63. MODULE_LICENSE("GPL");
  64. /* Architectures should define their poll value according to the halt latency */
  65. static unsigned int halt_poll_ns = KVM_HALT_POLL_NS_DEFAULT;
  66. module_param(halt_poll_ns, uint, S_IRUGO | S_IWUSR);
  67. /* Default doubles per-vcpu halt_poll_ns. */
  68. static unsigned int halt_poll_ns_grow = 2;
  69. module_param(halt_poll_ns_grow, uint, S_IRUGO | S_IWUSR);
  70. /* Default resets per-vcpu halt_poll_ns . */
  71. static unsigned int halt_poll_ns_shrink;
  72. module_param(halt_poll_ns_shrink, uint, S_IRUGO | S_IWUSR);
  73. /*
  74. * Ordering of locks:
  75. *
  76. * kvm->lock --> kvm->slots_lock --> kvm->irq_lock
  77. */
  78. DEFINE_SPINLOCK(kvm_lock);
  79. static DEFINE_RAW_SPINLOCK(kvm_count_lock);
  80. LIST_HEAD(vm_list);
  81. static cpumask_var_t cpus_hardware_enabled;
  82. static int kvm_usage_count;
  83. static atomic_t hardware_enable_failed;
  84. struct kmem_cache *kvm_vcpu_cache;
  85. EXPORT_SYMBOL_GPL(kvm_vcpu_cache);
  86. static __read_mostly struct preempt_ops kvm_preempt_ops;
  87. struct dentry *kvm_debugfs_dir;
  88. EXPORT_SYMBOL_GPL(kvm_debugfs_dir);
  89. static int kvm_debugfs_num_entries;
  90. static const struct file_operations *stat_fops_per_vm[];
  91. static long kvm_vcpu_ioctl(struct file *file, unsigned int ioctl,
  92. unsigned long arg);
  93. #ifdef CONFIG_KVM_COMPAT
  94. static long kvm_vcpu_compat_ioctl(struct file *file, unsigned int ioctl,
  95. unsigned long arg);
  96. #endif
  97. static int hardware_enable_all(void);
  98. static void hardware_disable_all(void);
  99. static void kvm_io_bus_destroy(struct kvm_io_bus *bus);
  100. static void kvm_release_pfn_dirty(kvm_pfn_t pfn);
  101. static void mark_page_dirty_in_slot(struct kvm_memory_slot *memslot, gfn_t gfn);
  102. __visible bool kvm_rebooting;
  103. EXPORT_SYMBOL_GPL(kvm_rebooting);
  104. static bool largepages_enabled = true;
  105. bool kvm_is_reserved_pfn(kvm_pfn_t pfn)
  106. {
  107. if (pfn_valid(pfn))
  108. return PageReserved(pfn_to_page(pfn));
  109. return true;
  110. }
  111. /*
  112. * Switches to specified vcpu, until a matching vcpu_put()
  113. */
  114. int vcpu_load(struct kvm_vcpu *vcpu)
  115. {
  116. int cpu;
  117. if (mutex_lock_killable(&vcpu->mutex))
  118. return -EINTR;
  119. cpu = get_cpu();
  120. preempt_notifier_register(&vcpu->preempt_notifier);
  121. kvm_arch_vcpu_load(vcpu, cpu);
  122. put_cpu();
  123. return 0;
  124. }
  125. EXPORT_SYMBOL_GPL(vcpu_load);
  126. void vcpu_put(struct kvm_vcpu *vcpu)
  127. {
  128. preempt_disable();
  129. kvm_arch_vcpu_put(vcpu);
  130. preempt_notifier_unregister(&vcpu->preempt_notifier);
  131. preempt_enable();
  132. mutex_unlock(&vcpu->mutex);
  133. }
  134. EXPORT_SYMBOL_GPL(vcpu_put);
  135. static void ack_flush(void *_completed)
  136. {
  137. }
  138. bool kvm_make_all_cpus_request(struct kvm *kvm, unsigned int req)
  139. {
  140. int i, cpu, me;
  141. cpumask_var_t cpus;
  142. bool called = true;
  143. struct kvm_vcpu *vcpu;
  144. zalloc_cpumask_var(&cpus, GFP_ATOMIC);
  145. me = get_cpu();
  146. kvm_for_each_vcpu(i, vcpu, kvm) {
  147. kvm_make_request(req, vcpu);
  148. cpu = vcpu->cpu;
  149. /* Set ->requests bit before we read ->mode. */
  150. smp_mb__after_atomic();
  151. if (cpus != NULL && cpu != -1 && cpu != me &&
  152. kvm_vcpu_exiting_guest_mode(vcpu) != OUTSIDE_GUEST_MODE)
  153. cpumask_set_cpu(cpu, cpus);
  154. }
  155. if (unlikely(cpus == NULL))
  156. smp_call_function_many(cpu_online_mask, ack_flush, NULL, 1);
  157. else if (!cpumask_empty(cpus))
  158. smp_call_function_many(cpus, ack_flush, NULL, 1);
  159. else
  160. called = false;
  161. put_cpu();
  162. free_cpumask_var(cpus);
  163. return called;
  164. }
  165. #ifndef CONFIG_HAVE_KVM_ARCH_TLB_FLUSH_ALL
  166. void kvm_flush_remote_tlbs(struct kvm *kvm)
  167. {
  168. /*
  169. * Read tlbs_dirty before setting KVM_REQ_TLB_FLUSH in
  170. * kvm_make_all_cpus_request.
  171. */
  172. long dirty_count = smp_load_acquire(&kvm->tlbs_dirty);
  173. /*
  174. * We want to publish modifications to the page tables before reading
  175. * mode. Pairs with a memory barrier in arch-specific code.
  176. * - x86: smp_mb__after_srcu_read_unlock in vcpu_enter_guest
  177. * and smp_mb in walk_shadow_page_lockless_begin/end.
  178. * - powerpc: smp_mb in kvmppc_prepare_to_enter.
  179. *
  180. * There is already an smp_mb__after_atomic() before
  181. * kvm_make_all_cpus_request() reads vcpu->mode. We reuse that
  182. * barrier here.
  183. */
  184. if (kvm_make_all_cpus_request(kvm, KVM_REQ_TLB_FLUSH))
  185. ++kvm->stat.remote_tlb_flush;
  186. cmpxchg(&kvm->tlbs_dirty, dirty_count, 0);
  187. }
  188. EXPORT_SYMBOL_GPL(kvm_flush_remote_tlbs);
  189. #endif
  190. void kvm_reload_remote_mmus(struct kvm *kvm)
  191. {
  192. kvm_make_all_cpus_request(kvm, KVM_REQ_MMU_RELOAD);
  193. }
  194. int kvm_vcpu_init(struct kvm_vcpu *vcpu, struct kvm *kvm, unsigned id)
  195. {
  196. struct page *page;
  197. int r;
  198. mutex_init(&vcpu->mutex);
  199. vcpu->cpu = -1;
  200. vcpu->kvm = kvm;
  201. vcpu->vcpu_id = id;
  202. vcpu->pid = NULL;
  203. init_swait_queue_head(&vcpu->wq);
  204. kvm_async_pf_vcpu_init(vcpu);
  205. vcpu->pre_pcpu = -1;
  206. INIT_LIST_HEAD(&vcpu->blocked_vcpu_list);
  207. page = alloc_page(GFP_KERNEL | __GFP_ZERO);
  208. if (!page) {
  209. r = -ENOMEM;
  210. goto fail;
  211. }
  212. vcpu->run = page_address(page);
  213. kvm_vcpu_set_in_spin_loop(vcpu, false);
  214. kvm_vcpu_set_dy_eligible(vcpu, false);
  215. vcpu->preempted = false;
  216. r = kvm_arch_vcpu_init(vcpu);
  217. if (r < 0)
  218. goto fail_free_run;
  219. return 0;
  220. fail_free_run:
  221. free_page((unsigned long)vcpu->run);
  222. fail:
  223. return r;
  224. }
  225. EXPORT_SYMBOL_GPL(kvm_vcpu_init);
  226. void kvm_vcpu_uninit(struct kvm_vcpu *vcpu)
  227. {
  228. put_pid(vcpu->pid);
  229. kvm_arch_vcpu_uninit(vcpu);
  230. free_page((unsigned long)vcpu->run);
  231. }
  232. EXPORT_SYMBOL_GPL(kvm_vcpu_uninit);
  233. #if defined(CONFIG_MMU_NOTIFIER) && defined(KVM_ARCH_WANT_MMU_NOTIFIER)
  234. static inline struct kvm *mmu_notifier_to_kvm(struct mmu_notifier *mn)
  235. {
  236. return container_of(mn, struct kvm, mmu_notifier);
  237. }
  238. static void kvm_mmu_notifier_invalidate_page(struct mmu_notifier *mn,
  239. struct mm_struct *mm,
  240. unsigned long address)
  241. {
  242. struct kvm *kvm = mmu_notifier_to_kvm(mn);
  243. int need_tlb_flush, idx;
  244. /*
  245. * When ->invalidate_page runs, the linux pte has been zapped
  246. * already but the page is still allocated until
  247. * ->invalidate_page returns. So if we increase the sequence
  248. * here the kvm page fault will notice if the spte can't be
  249. * established because the page is going to be freed. If
  250. * instead the kvm page fault establishes the spte before
  251. * ->invalidate_page runs, kvm_unmap_hva will release it
  252. * before returning.
  253. *
  254. * The sequence increase only need to be seen at spin_unlock
  255. * time, and not at spin_lock time.
  256. *
  257. * Increasing the sequence after the spin_unlock would be
  258. * unsafe because the kvm page fault could then establish the
  259. * pte after kvm_unmap_hva returned, without noticing the page
  260. * is going to be freed.
  261. */
  262. idx = srcu_read_lock(&kvm->srcu);
  263. spin_lock(&kvm->mmu_lock);
  264. kvm->mmu_notifier_seq++;
  265. need_tlb_flush = kvm_unmap_hva(kvm, address) | kvm->tlbs_dirty;
  266. /* we've to flush the tlb before the pages can be freed */
  267. if (need_tlb_flush)
  268. kvm_flush_remote_tlbs(kvm);
  269. spin_unlock(&kvm->mmu_lock);
  270. kvm_arch_mmu_notifier_invalidate_page(kvm, address);
  271. srcu_read_unlock(&kvm->srcu, idx);
  272. }
  273. static void kvm_mmu_notifier_change_pte(struct mmu_notifier *mn,
  274. struct mm_struct *mm,
  275. unsigned long address,
  276. pte_t pte)
  277. {
  278. struct kvm *kvm = mmu_notifier_to_kvm(mn);
  279. int idx;
  280. idx = srcu_read_lock(&kvm->srcu);
  281. spin_lock(&kvm->mmu_lock);
  282. kvm->mmu_notifier_seq++;
  283. kvm_set_spte_hva(kvm, address, pte);
  284. spin_unlock(&kvm->mmu_lock);
  285. srcu_read_unlock(&kvm->srcu, idx);
  286. }
  287. static void kvm_mmu_notifier_invalidate_range_start(struct mmu_notifier *mn,
  288. struct mm_struct *mm,
  289. unsigned long start,
  290. unsigned long end)
  291. {
  292. struct kvm *kvm = mmu_notifier_to_kvm(mn);
  293. int need_tlb_flush = 0, idx;
  294. idx = srcu_read_lock(&kvm->srcu);
  295. spin_lock(&kvm->mmu_lock);
  296. /*
  297. * The count increase must become visible at unlock time as no
  298. * spte can be established without taking the mmu_lock and
  299. * count is also read inside the mmu_lock critical section.
  300. */
  301. kvm->mmu_notifier_count++;
  302. need_tlb_flush = kvm_unmap_hva_range(kvm, start, end);
  303. need_tlb_flush |= kvm->tlbs_dirty;
  304. /* we've to flush the tlb before the pages can be freed */
  305. if (need_tlb_flush)
  306. kvm_flush_remote_tlbs(kvm);
  307. spin_unlock(&kvm->mmu_lock);
  308. srcu_read_unlock(&kvm->srcu, idx);
  309. }
  310. static void kvm_mmu_notifier_invalidate_range_end(struct mmu_notifier *mn,
  311. struct mm_struct *mm,
  312. unsigned long start,
  313. unsigned long end)
  314. {
  315. struct kvm *kvm = mmu_notifier_to_kvm(mn);
  316. spin_lock(&kvm->mmu_lock);
  317. /*
  318. * This sequence increase will notify the kvm page fault that
  319. * the page that is going to be mapped in the spte could have
  320. * been freed.
  321. */
  322. kvm->mmu_notifier_seq++;
  323. smp_wmb();
  324. /*
  325. * The above sequence increase must be visible before the
  326. * below count decrease, which is ensured by the smp_wmb above
  327. * in conjunction with the smp_rmb in mmu_notifier_retry().
  328. */
  329. kvm->mmu_notifier_count--;
  330. spin_unlock(&kvm->mmu_lock);
  331. BUG_ON(kvm->mmu_notifier_count < 0);
  332. }
  333. static int kvm_mmu_notifier_clear_flush_young(struct mmu_notifier *mn,
  334. struct mm_struct *mm,
  335. unsigned long start,
  336. unsigned long end)
  337. {
  338. struct kvm *kvm = mmu_notifier_to_kvm(mn);
  339. int young, idx;
  340. idx = srcu_read_lock(&kvm->srcu);
  341. spin_lock(&kvm->mmu_lock);
  342. young = kvm_age_hva(kvm, start, end);
  343. if (young)
  344. kvm_flush_remote_tlbs(kvm);
  345. spin_unlock(&kvm->mmu_lock);
  346. srcu_read_unlock(&kvm->srcu, idx);
  347. return young;
  348. }
  349. static int kvm_mmu_notifier_clear_young(struct mmu_notifier *mn,
  350. struct mm_struct *mm,
  351. unsigned long start,
  352. unsigned long end)
  353. {
  354. struct kvm *kvm = mmu_notifier_to_kvm(mn);
  355. int young, idx;
  356. idx = srcu_read_lock(&kvm->srcu);
  357. spin_lock(&kvm->mmu_lock);
  358. /*
  359. * Even though we do not flush TLB, this will still adversely
  360. * affect performance on pre-Haswell Intel EPT, where there is
  361. * no EPT Access Bit to clear so that we have to tear down EPT
  362. * tables instead. If we find this unacceptable, we can always
  363. * add a parameter to kvm_age_hva so that it effectively doesn't
  364. * do anything on clear_young.
  365. *
  366. * Also note that currently we never issue secondary TLB flushes
  367. * from clear_young, leaving this job up to the regular system
  368. * cadence. If we find this inaccurate, we might come up with a
  369. * more sophisticated heuristic later.
  370. */
  371. young = kvm_age_hva(kvm, start, end);
  372. spin_unlock(&kvm->mmu_lock);
  373. srcu_read_unlock(&kvm->srcu, idx);
  374. return young;
  375. }
  376. static int kvm_mmu_notifier_test_young(struct mmu_notifier *mn,
  377. struct mm_struct *mm,
  378. unsigned long address)
  379. {
  380. struct kvm *kvm = mmu_notifier_to_kvm(mn);
  381. int young, idx;
  382. idx = srcu_read_lock(&kvm->srcu);
  383. spin_lock(&kvm->mmu_lock);
  384. young = kvm_test_age_hva(kvm, address);
  385. spin_unlock(&kvm->mmu_lock);
  386. srcu_read_unlock(&kvm->srcu, idx);
  387. return young;
  388. }
  389. static void kvm_mmu_notifier_release(struct mmu_notifier *mn,
  390. struct mm_struct *mm)
  391. {
  392. struct kvm *kvm = mmu_notifier_to_kvm(mn);
  393. int idx;
  394. idx = srcu_read_lock(&kvm->srcu);
  395. kvm_arch_flush_shadow_all(kvm);
  396. srcu_read_unlock(&kvm->srcu, idx);
  397. }
  398. static const struct mmu_notifier_ops kvm_mmu_notifier_ops = {
  399. .invalidate_page = kvm_mmu_notifier_invalidate_page,
  400. .invalidate_range_start = kvm_mmu_notifier_invalidate_range_start,
  401. .invalidate_range_end = kvm_mmu_notifier_invalidate_range_end,
  402. .clear_flush_young = kvm_mmu_notifier_clear_flush_young,
  403. .clear_young = kvm_mmu_notifier_clear_young,
  404. .test_young = kvm_mmu_notifier_test_young,
  405. .change_pte = kvm_mmu_notifier_change_pte,
  406. .release = kvm_mmu_notifier_release,
  407. };
  408. static int kvm_init_mmu_notifier(struct kvm *kvm)
  409. {
  410. kvm->mmu_notifier.ops = &kvm_mmu_notifier_ops;
  411. return mmu_notifier_register(&kvm->mmu_notifier, current->mm);
  412. }
  413. #else /* !(CONFIG_MMU_NOTIFIER && KVM_ARCH_WANT_MMU_NOTIFIER) */
  414. static int kvm_init_mmu_notifier(struct kvm *kvm)
  415. {
  416. return 0;
  417. }
  418. #endif /* CONFIG_MMU_NOTIFIER && KVM_ARCH_WANT_MMU_NOTIFIER */
  419. static struct kvm_memslots *kvm_alloc_memslots(void)
  420. {
  421. int i;
  422. struct kvm_memslots *slots;
  423. slots = kvm_kvzalloc(sizeof(struct kvm_memslots));
  424. if (!slots)
  425. return NULL;
  426. /*
  427. * Init kvm generation close to the maximum to easily test the
  428. * code of handling generation number wrap-around.
  429. */
  430. slots->generation = -150;
  431. for (i = 0; i < KVM_MEM_SLOTS_NUM; i++)
  432. slots->id_to_index[i] = slots->memslots[i].id = i;
  433. return slots;
  434. }
  435. static void kvm_destroy_dirty_bitmap(struct kvm_memory_slot *memslot)
  436. {
  437. if (!memslot->dirty_bitmap)
  438. return;
  439. kvfree(memslot->dirty_bitmap);
  440. memslot->dirty_bitmap = NULL;
  441. }
  442. /*
  443. * Free any memory in @free but not in @dont.
  444. */
  445. static void kvm_free_memslot(struct kvm *kvm, struct kvm_memory_slot *free,
  446. struct kvm_memory_slot *dont)
  447. {
  448. if (!dont || free->dirty_bitmap != dont->dirty_bitmap)
  449. kvm_destroy_dirty_bitmap(free);
  450. kvm_arch_free_memslot(kvm, free, dont);
  451. free->npages = 0;
  452. }
  453. static void kvm_free_memslots(struct kvm *kvm, struct kvm_memslots *slots)
  454. {
  455. struct kvm_memory_slot *memslot;
  456. if (!slots)
  457. return;
  458. kvm_for_each_memslot(memslot, slots)
  459. kvm_free_memslot(kvm, memslot, NULL);
  460. kvfree(slots);
  461. }
  462. static void kvm_destroy_vm_debugfs(struct kvm *kvm)
  463. {
  464. int i;
  465. if (!kvm->debugfs_dentry)
  466. return;
  467. debugfs_remove_recursive(kvm->debugfs_dentry);
  468. for (i = 0; i < kvm_debugfs_num_entries; i++)
  469. kfree(kvm->debugfs_stat_data[i]);
  470. kfree(kvm->debugfs_stat_data);
  471. }
  472. static int kvm_create_vm_debugfs(struct kvm *kvm, int fd)
  473. {
  474. char dir_name[ITOA_MAX_LEN * 2];
  475. struct kvm_stat_data *stat_data;
  476. struct kvm_stats_debugfs_item *p;
  477. if (!debugfs_initialized())
  478. return 0;
  479. snprintf(dir_name, sizeof(dir_name), "%d-%d", task_pid_nr(current), fd);
  480. kvm->debugfs_dentry = debugfs_create_dir(dir_name,
  481. kvm_debugfs_dir);
  482. if (!kvm->debugfs_dentry)
  483. return -ENOMEM;
  484. kvm->debugfs_stat_data = kcalloc(kvm_debugfs_num_entries,
  485. sizeof(*kvm->debugfs_stat_data),
  486. GFP_KERNEL);
  487. if (!kvm->debugfs_stat_data)
  488. return -ENOMEM;
  489. for (p = debugfs_entries; p->name; p++) {
  490. stat_data = kzalloc(sizeof(*stat_data), GFP_KERNEL);
  491. if (!stat_data)
  492. return -ENOMEM;
  493. stat_data->kvm = kvm;
  494. stat_data->offset = p->offset;
  495. kvm->debugfs_stat_data[p - debugfs_entries] = stat_data;
  496. if (!debugfs_create_file(p->name, 0444,
  497. kvm->debugfs_dentry,
  498. stat_data,
  499. stat_fops_per_vm[p->kind]))
  500. return -ENOMEM;
  501. }
  502. return 0;
  503. }
  504. static struct kvm *kvm_create_vm(unsigned long type)
  505. {
  506. int r, i;
  507. struct kvm *kvm = kvm_arch_alloc_vm();
  508. if (!kvm)
  509. return ERR_PTR(-ENOMEM);
  510. spin_lock_init(&kvm->mmu_lock);
  511. atomic_inc(&current->mm->mm_count);
  512. kvm->mm = current->mm;
  513. kvm_eventfd_init(kvm);
  514. mutex_init(&kvm->lock);
  515. mutex_init(&kvm->irq_lock);
  516. mutex_init(&kvm->slots_lock);
  517. atomic_set(&kvm->users_count, 1);
  518. INIT_LIST_HEAD(&kvm->devices);
  519. r = kvm_arch_init_vm(kvm, type);
  520. if (r)
  521. goto out_err_no_disable;
  522. r = hardware_enable_all();
  523. if (r)
  524. goto out_err_no_disable;
  525. #ifdef CONFIG_HAVE_KVM_IRQFD
  526. INIT_HLIST_HEAD(&kvm->irq_ack_notifier_list);
  527. #endif
  528. BUILD_BUG_ON(KVM_MEM_SLOTS_NUM > SHRT_MAX);
  529. r = -ENOMEM;
  530. for (i = 0; i < KVM_ADDRESS_SPACE_NUM; i++) {
  531. kvm->memslots[i] = kvm_alloc_memslots();
  532. if (!kvm->memslots[i])
  533. goto out_err_no_srcu;
  534. }
  535. if (init_srcu_struct(&kvm->srcu))
  536. goto out_err_no_srcu;
  537. if (init_srcu_struct(&kvm->irq_srcu))
  538. goto out_err_no_irq_srcu;
  539. for (i = 0; i < KVM_NR_BUSES; i++) {
  540. kvm->buses[i] = kzalloc(sizeof(struct kvm_io_bus),
  541. GFP_KERNEL);
  542. if (!kvm->buses[i])
  543. goto out_err;
  544. }
  545. r = kvm_init_mmu_notifier(kvm);
  546. if (r)
  547. goto out_err;
  548. spin_lock(&kvm_lock);
  549. list_add(&kvm->vm_list, &vm_list);
  550. spin_unlock(&kvm_lock);
  551. preempt_notifier_inc();
  552. return kvm;
  553. out_err:
  554. cleanup_srcu_struct(&kvm->irq_srcu);
  555. out_err_no_irq_srcu:
  556. cleanup_srcu_struct(&kvm->srcu);
  557. out_err_no_srcu:
  558. hardware_disable_all();
  559. out_err_no_disable:
  560. for (i = 0; i < KVM_NR_BUSES; i++)
  561. kfree(kvm->buses[i]);
  562. for (i = 0; i < KVM_ADDRESS_SPACE_NUM; i++)
  563. kvm_free_memslots(kvm, kvm->memslots[i]);
  564. kvm_arch_free_vm(kvm);
  565. mmdrop(current->mm);
  566. return ERR_PTR(r);
  567. }
  568. /*
  569. * Avoid using vmalloc for a small buffer.
  570. * Should not be used when the size is statically known.
  571. */
  572. void *kvm_kvzalloc(unsigned long size)
  573. {
  574. if (size > PAGE_SIZE)
  575. return vzalloc(size);
  576. else
  577. return kzalloc(size, GFP_KERNEL);
  578. }
  579. static void kvm_destroy_devices(struct kvm *kvm)
  580. {
  581. struct kvm_device *dev, *tmp;
  582. list_for_each_entry_safe(dev, tmp, &kvm->devices, vm_node) {
  583. list_del(&dev->vm_node);
  584. dev->ops->destroy(dev);
  585. }
  586. }
  587. static void kvm_destroy_vm(struct kvm *kvm)
  588. {
  589. int i;
  590. struct mm_struct *mm = kvm->mm;
  591. kvm_destroy_vm_debugfs(kvm);
  592. kvm_arch_sync_events(kvm);
  593. spin_lock(&kvm_lock);
  594. list_del(&kvm->vm_list);
  595. spin_unlock(&kvm_lock);
  596. kvm_free_irq_routing(kvm);
  597. for (i = 0; i < KVM_NR_BUSES; i++)
  598. kvm_io_bus_destroy(kvm->buses[i]);
  599. kvm_coalesced_mmio_free(kvm);
  600. #if defined(CONFIG_MMU_NOTIFIER) && defined(KVM_ARCH_WANT_MMU_NOTIFIER)
  601. mmu_notifier_unregister(&kvm->mmu_notifier, kvm->mm);
  602. #else
  603. kvm_arch_flush_shadow_all(kvm);
  604. #endif
  605. kvm_arch_destroy_vm(kvm);
  606. kvm_destroy_devices(kvm);
  607. for (i = 0; i < KVM_ADDRESS_SPACE_NUM; i++)
  608. kvm_free_memslots(kvm, kvm->memslots[i]);
  609. cleanup_srcu_struct(&kvm->irq_srcu);
  610. cleanup_srcu_struct(&kvm->srcu);
  611. kvm_arch_free_vm(kvm);
  612. preempt_notifier_dec();
  613. hardware_disable_all();
  614. mmdrop(mm);
  615. }
  616. void kvm_get_kvm(struct kvm *kvm)
  617. {
  618. atomic_inc(&kvm->users_count);
  619. }
  620. EXPORT_SYMBOL_GPL(kvm_get_kvm);
  621. void kvm_put_kvm(struct kvm *kvm)
  622. {
  623. if (atomic_dec_and_test(&kvm->users_count))
  624. kvm_destroy_vm(kvm);
  625. }
  626. EXPORT_SYMBOL_GPL(kvm_put_kvm);
  627. static int kvm_vm_release(struct inode *inode, struct file *filp)
  628. {
  629. struct kvm *kvm = filp->private_data;
  630. kvm_irqfd_release(kvm);
  631. kvm_put_kvm(kvm);
  632. return 0;
  633. }
  634. /*
  635. * Allocation size is twice as large as the actual dirty bitmap size.
  636. * See x86's kvm_vm_ioctl_get_dirty_log() why this is needed.
  637. */
  638. static int kvm_create_dirty_bitmap(struct kvm_memory_slot *memslot)
  639. {
  640. unsigned long dirty_bytes = 2 * kvm_dirty_bitmap_bytes(memslot);
  641. memslot->dirty_bitmap = kvm_kvzalloc(dirty_bytes);
  642. if (!memslot->dirty_bitmap)
  643. return -ENOMEM;
  644. return 0;
  645. }
  646. /*
  647. * Insert memslot and re-sort memslots based on their GFN,
  648. * so binary search could be used to lookup GFN.
  649. * Sorting algorithm takes advantage of having initially
  650. * sorted array and known changed memslot position.
  651. */
  652. static void update_memslots(struct kvm_memslots *slots,
  653. struct kvm_memory_slot *new)
  654. {
  655. int id = new->id;
  656. int i = slots->id_to_index[id];
  657. struct kvm_memory_slot *mslots = slots->memslots;
  658. WARN_ON(mslots[i].id != id);
  659. if (!new->npages) {
  660. WARN_ON(!mslots[i].npages);
  661. if (mslots[i].npages)
  662. slots->used_slots--;
  663. } else {
  664. if (!mslots[i].npages)
  665. slots->used_slots++;
  666. }
  667. while (i < KVM_MEM_SLOTS_NUM - 1 &&
  668. new->base_gfn <= mslots[i + 1].base_gfn) {
  669. if (!mslots[i + 1].npages)
  670. break;
  671. mslots[i] = mslots[i + 1];
  672. slots->id_to_index[mslots[i].id] = i;
  673. i++;
  674. }
  675. /*
  676. * The ">=" is needed when creating a slot with base_gfn == 0,
  677. * so that it moves before all those with base_gfn == npages == 0.
  678. *
  679. * On the other hand, if new->npages is zero, the above loop has
  680. * already left i pointing to the beginning of the empty part of
  681. * mslots, and the ">=" would move the hole backwards in this
  682. * case---which is wrong. So skip the loop when deleting a slot.
  683. */
  684. if (new->npages) {
  685. while (i > 0 &&
  686. new->base_gfn >= mslots[i - 1].base_gfn) {
  687. mslots[i] = mslots[i - 1];
  688. slots->id_to_index[mslots[i].id] = i;
  689. i--;
  690. }
  691. } else
  692. WARN_ON_ONCE(i != slots->used_slots);
  693. mslots[i] = *new;
  694. slots->id_to_index[mslots[i].id] = i;
  695. }
  696. static int check_memory_region_flags(const struct kvm_userspace_memory_region *mem)
  697. {
  698. u32 valid_flags = KVM_MEM_LOG_DIRTY_PAGES;
  699. #ifdef __KVM_HAVE_READONLY_MEM
  700. valid_flags |= KVM_MEM_READONLY;
  701. #endif
  702. if (mem->flags & ~valid_flags)
  703. return -EINVAL;
  704. return 0;
  705. }
  706. static struct kvm_memslots *install_new_memslots(struct kvm *kvm,
  707. int as_id, struct kvm_memslots *slots)
  708. {
  709. struct kvm_memslots *old_memslots = __kvm_memslots(kvm, as_id);
  710. /*
  711. * Set the low bit in the generation, which disables SPTE caching
  712. * until the end of synchronize_srcu_expedited.
  713. */
  714. WARN_ON(old_memslots->generation & 1);
  715. slots->generation = old_memslots->generation + 1;
  716. rcu_assign_pointer(kvm->memslots[as_id], slots);
  717. synchronize_srcu_expedited(&kvm->srcu);
  718. /*
  719. * Increment the new memslot generation a second time. This prevents
  720. * vm exits that race with memslot updates from caching a memslot
  721. * generation that will (potentially) be valid forever.
  722. */
  723. slots->generation++;
  724. kvm_arch_memslots_updated(kvm, slots);
  725. return old_memslots;
  726. }
  727. /*
  728. * Allocate some memory and give it an address in the guest physical address
  729. * space.
  730. *
  731. * Discontiguous memory is allowed, mostly for framebuffers.
  732. *
  733. * Must be called holding kvm->slots_lock for write.
  734. */
  735. int __kvm_set_memory_region(struct kvm *kvm,
  736. const struct kvm_userspace_memory_region *mem)
  737. {
  738. int r;
  739. gfn_t base_gfn;
  740. unsigned long npages;
  741. struct kvm_memory_slot *slot;
  742. struct kvm_memory_slot old, new;
  743. struct kvm_memslots *slots = NULL, *old_memslots;
  744. int as_id, id;
  745. enum kvm_mr_change change;
  746. r = check_memory_region_flags(mem);
  747. if (r)
  748. goto out;
  749. r = -EINVAL;
  750. as_id = mem->slot >> 16;
  751. id = (u16)mem->slot;
  752. /* General sanity checks */
  753. if (mem->memory_size & (PAGE_SIZE - 1))
  754. goto out;
  755. if (mem->guest_phys_addr & (PAGE_SIZE - 1))
  756. goto out;
  757. /* We can read the guest memory with __xxx_user() later on. */
  758. if ((id < KVM_USER_MEM_SLOTS) &&
  759. ((mem->userspace_addr & (PAGE_SIZE - 1)) ||
  760. !access_ok(VERIFY_WRITE,
  761. (void __user *)(unsigned long)mem->userspace_addr,
  762. mem->memory_size)))
  763. goto out;
  764. if (as_id >= KVM_ADDRESS_SPACE_NUM || id >= KVM_MEM_SLOTS_NUM)
  765. goto out;
  766. if (mem->guest_phys_addr + mem->memory_size < mem->guest_phys_addr)
  767. goto out;
  768. slot = id_to_memslot(__kvm_memslots(kvm, as_id), id);
  769. base_gfn = mem->guest_phys_addr >> PAGE_SHIFT;
  770. npages = mem->memory_size >> PAGE_SHIFT;
  771. if (npages > KVM_MEM_MAX_NR_PAGES)
  772. goto out;
  773. new = old = *slot;
  774. new.id = id;
  775. new.base_gfn = base_gfn;
  776. new.npages = npages;
  777. new.flags = mem->flags;
  778. if (npages) {
  779. if (!old.npages)
  780. change = KVM_MR_CREATE;
  781. else { /* Modify an existing slot. */
  782. if ((mem->userspace_addr != old.userspace_addr) ||
  783. (npages != old.npages) ||
  784. ((new.flags ^ old.flags) & KVM_MEM_READONLY))
  785. goto out;
  786. if (base_gfn != old.base_gfn)
  787. change = KVM_MR_MOVE;
  788. else if (new.flags != old.flags)
  789. change = KVM_MR_FLAGS_ONLY;
  790. else { /* Nothing to change. */
  791. r = 0;
  792. goto out;
  793. }
  794. }
  795. } else {
  796. if (!old.npages)
  797. goto out;
  798. change = KVM_MR_DELETE;
  799. new.base_gfn = 0;
  800. new.flags = 0;
  801. }
  802. if ((change == KVM_MR_CREATE) || (change == KVM_MR_MOVE)) {
  803. /* Check for overlaps */
  804. r = -EEXIST;
  805. kvm_for_each_memslot(slot, __kvm_memslots(kvm, as_id)) {
  806. if ((slot->id >= KVM_USER_MEM_SLOTS) ||
  807. (slot->id == id))
  808. continue;
  809. if (!((base_gfn + npages <= slot->base_gfn) ||
  810. (base_gfn >= slot->base_gfn + slot->npages)))
  811. goto out;
  812. }
  813. }
  814. /* Free page dirty bitmap if unneeded */
  815. if (!(new.flags & KVM_MEM_LOG_DIRTY_PAGES))
  816. new.dirty_bitmap = NULL;
  817. r = -ENOMEM;
  818. if (change == KVM_MR_CREATE) {
  819. new.userspace_addr = mem->userspace_addr;
  820. if (kvm_arch_create_memslot(kvm, &new, npages))
  821. goto out_free;
  822. }
  823. /* Allocate page dirty bitmap if needed */
  824. if ((new.flags & KVM_MEM_LOG_DIRTY_PAGES) && !new.dirty_bitmap) {
  825. if (kvm_create_dirty_bitmap(&new) < 0)
  826. goto out_free;
  827. }
  828. slots = kvm_kvzalloc(sizeof(struct kvm_memslots));
  829. if (!slots)
  830. goto out_free;
  831. memcpy(slots, __kvm_memslots(kvm, as_id), sizeof(struct kvm_memslots));
  832. if ((change == KVM_MR_DELETE) || (change == KVM_MR_MOVE)) {
  833. slot = id_to_memslot(slots, id);
  834. slot->flags |= KVM_MEMSLOT_INVALID;
  835. old_memslots = install_new_memslots(kvm, as_id, slots);
  836. /* slot was deleted or moved, clear iommu mapping */
  837. kvm_iommu_unmap_pages(kvm, &old);
  838. /* From this point no new shadow pages pointing to a deleted,
  839. * or moved, memslot will be created.
  840. *
  841. * validation of sp->gfn happens in:
  842. * - gfn_to_hva (kvm_read_guest, gfn_to_pfn)
  843. * - kvm_is_visible_gfn (mmu_check_roots)
  844. */
  845. kvm_arch_flush_shadow_memslot(kvm, slot);
  846. /*
  847. * We can re-use the old_memslots from above, the only difference
  848. * from the currently installed memslots is the invalid flag. This
  849. * will get overwritten by update_memslots anyway.
  850. */
  851. slots = old_memslots;
  852. }
  853. r = kvm_arch_prepare_memory_region(kvm, &new, mem, change);
  854. if (r)
  855. goto out_slots;
  856. /* actual memory is freed via old in kvm_free_memslot below */
  857. if (change == KVM_MR_DELETE) {
  858. new.dirty_bitmap = NULL;
  859. memset(&new.arch, 0, sizeof(new.arch));
  860. }
  861. update_memslots(slots, &new);
  862. old_memslots = install_new_memslots(kvm, as_id, slots);
  863. kvm_arch_commit_memory_region(kvm, mem, &old, &new, change);
  864. kvm_free_memslot(kvm, &old, &new);
  865. kvfree(old_memslots);
  866. /*
  867. * IOMMU mapping: New slots need to be mapped. Old slots need to be
  868. * un-mapped and re-mapped if their base changes. Since base change
  869. * unmapping is handled above with slot deletion, mapping alone is
  870. * needed here. Anything else the iommu might care about for existing
  871. * slots (size changes, userspace addr changes and read-only flag
  872. * changes) is disallowed above, so any other attribute changes getting
  873. * here can be skipped.
  874. */
  875. if ((change == KVM_MR_CREATE) || (change == KVM_MR_MOVE)) {
  876. r = kvm_iommu_map_pages(kvm, &new);
  877. return r;
  878. }
  879. return 0;
  880. out_slots:
  881. kvfree(slots);
  882. out_free:
  883. kvm_free_memslot(kvm, &new, &old);
  884. out:
  885. return r;
  886. }
  887. EXPORT_SYMBOL_GPL(__kvm_set_memory_region);
  888. int kvm_set_memory_region(struct kvm *kvm,
  889. const struct kvm_userspace_memory_region *mem)
  890. {
  891. int r;
  892. mutex_lock(&kvm->slots_lock);
  893. r = __kvm_set_memory_region(kvm, mem);
  894. mutex_unlock(&kvm->slots_lock);
  895. return r;
  896. }
  897. EXPORT_SYMBOL_GPL(kvm_set_memory_region);
  898. static int kvm_vm_ioctl_set_memory_region(struct kvm *kvm,
  899. struct kvm_userspace_memory_region *mem)
  900. {
  901. if ((u16)mem->slot >= KVM_USER_MEM_SLOTS)
  902. return -EINVAL;
  903. return kvm_set_memory_region(kvm, mem);
  904. }
  905. int kvm_get_dirty_log(struct kvm *kvm,
  906. struct kvm_dirty_log *log, int *is_dirty)
  907. {
  908. struct kvm_memslots *slots;
  909. struct kvm_memory_slot *memslot;
  910. int r, i, as_id, id;
  911. unsigned long n;
  912. unsigned long any = 0;
  913. r = -EINVAL;
  914. as_id = log->slot >> 16;
  915. id = (u16)log->slot;
  916. if (as_id >= KVM_ADDRESS_SPACE_NUM || id >= KVM_USER_MEM_SLOTS)
  917. goto out;
  918. slots = __kvm_memslots(kvm, as_id);
  919. memslot = id_to_memslot(slots, id);
  920. r = -ENOENT;
  921. if (!memslot->dirty_bitmap)
  922. goto out;
  923. n = kvm_dirty_bitmap_bytes(memslot);
  924. for (i = 0; !any && i < n/sizeof(long); ++i)
  925. any = memslot->dirty_bitmap[i];
  926. r = -EFAULT;
  927. if (copy_to_user(log->dirty_bitmap, memslot->dirty_bitmap, n))
  928. goto out;
  929. if (any)
  930. *is_dirty = 1;
  931. r = 0;
  932. out:
  933. return r;
  934. }
  935. EXPORT_SYMBOL_GPL(kvm_get_dirty_log);
  936. #ifdef CONFIG_KVM_GENERIC_DIRTYLOG_READ_PROTECT
  937. /**
  938. * kvm_get_dirty_log_protect - get a snapshot of dirty pages, and if any pages
  939. * are dirty write protect them for next write.
  940. * @kvm: pointer to kvm instance
  941. * @log: slot id and address to which we copy the log
  942. * @is_dirty: flag set if any page is dirty
  943. *
  944. * We need to keep it in mind that VCPU threads can write to the bitmap
  945. * concurrently. So, to avoid losing track of dirty pages we keep the
  946. * following order:
  947. *
  948. * 1. Take a snapshot of the bit and clear it if needed.
  949. * 2. Write protect the corresponding page.
  950. * 3. Copy the snapshot to the userspace.
  951. * 4. Upon return caller flushes TLB's if needed.
  952. *
  953. * Between 2 and 4, the guest may write to the page using the remaining TLB
  954. * entry. This is not a problem because the page is reported dirty using
  955. * the snapshot taken before and step 4 ensures that writes done after
  956. * exiting to userspace will be logged for the next call.
  957. *
  958. */
  959. int kvm_get_dirty_log_protect(struct kvm *kvm,
  960. struct kvm_dirty_log *log, bool *is_dirty)
  961. {
  962. struct kvm_memslots *slots;
  963. struct kvm_memory_slot *memslot;
  964. int r, i, as_id, id;
  965. unsigned long n;
  966. unsigned long *dirty_bitmap;
  967. unsigned long *dirty_bitmap_buffer;
  968. r = -EINVAL;
  969. as_id = log->slot >> 16;
  970. id = (u16)log->slot;
  971. if (as_id >= KVM_ADDRESS_SPACE_NUM || id >= KVM_USER_MEM_SLOTS)
  972. goto out;
  973. slots = __kvm_memslots(kvm, as_id);
  974. memslot = id_to_memslot(slots, id);
  975. dirty_bitmap = memslot->dirty_bitmap;
  976. r = -ENOENT;
  977. if (!dirty_bitmap)
  978. goto out;
  979. n = kvm_dirty_bitmap_bytes(memslot);
  980. dirty_bitmap_buffer = dirty_bitmap + n / sizeof(long);
  981. memset(dirty_bitmap_buffer, 0, n);
  982. spin_lock(&kvm->mmu_lock);
  983. *is_dirty = false;
  984. for (i = 0; i < n / sizeof(long); i++) {
  985. unsigned long mask;
  986. gfn_t offset;
  987. if (!dirty_bitmap[i])
  988. continue;
  989. *is_dirty = true;
  990. mask = xchg(&dirty_bitmap[i], 0);
  991. dirty_bitmap_buffer[i] = mask;
  992. if (mask) {
  993. offset = i * BITS_PER_LONG;
  994. kvm_arch_mmu_enable_log_dirty_pt_masked(kvm, memslot,
  995. offset, mask);
  996. }
  997. }
  998. spin_unlock(&kvm->mmu_lock);
  999. r = -EFAULT;
  1000. if (copy_to_user(log->dirty_bitmap, dirty_bitmap_buffer, n))
  1001. goto out;
  1002. r = 0;
  1003. out:
  1004. return r;
  1005. }
  1006. EXPORT_SYMBOL_GPL(kvm_get_dirty_log_protect);
  1007. #endif
  1008. bool kvm_largepages_enabled(void)
  1009. {
  1010. return largepages_enabled;
  1011. }
  1012. void kvm_disable_largepages(void)
  1013. {
  1014. largepages_enabled = false;
  1015. }
  1016. EXPORT_SYMBOL_GPL(kvm_disable_largepages);
  1017. struct kvm_memory_slot *gfn_to_memslot(struct kvm *kvm, gfn_t gfn)
  1018. {
  1019. return __gfn_to_memslot(kvm_memslots(kvm), gfn);
  1020. }
  1021. EXPORT_SYMBOL_GPL(gfn_to_memslot);
  1022. struct kvm_memory_slot *kvm_vcpu_gfn_to_memslot(struct kvm_vcpu *vcpu, gfn_t gfn)
  1023. {
  1024. return __gfn_to_memslot(kvm_vcpu_memslots(vcpu), gfn);
  1025. }
  1026. bool kvm_is_visible_gfn(struct kvm *kvm, gfn_t gfn)
  1027. {
  1028. struct kvm_memory_slot *memslot = gfn_to_memslot(kvm, gfn);
  1029. if (!memslot || memslot->id >= KVM_USER_MEM_SLOTS ||
  1030. memslot->flags & KVM_MEMSLOT_INVALID)
  1031. return false;
  1032. return true;
  1033. }
  1034. EXPORT_SYMBOL_GPL(kvm_is_visible_gfn);
  1035. unsigned long kvm_host_page_size(struct kvm *kvm, gfn_t gfn)
  1036. {
  1037. struct vm_area_struct *vma;
  1038. unsigned long addr, size;
  1039. size = PAGE_SIZE;
  1040. addr = gfn_to_hva(kvm, gfn);
  1041. if (kvm_is_error_hva(addr))
  1042. return PAGE_SIZE;
  1043. down_read(&current->mm->mmap_sem);
  1044. vma = find_vma(current->mm, addr);
  1045. if (!vma)
  1046. goto out;
  1047. size = vma_kernel_pagesize(vma);
  1048. out:
  1049. up_read(&current->mm->mmap_sem);
  1050. return size;
  1051. }
  1052. static bool memslot_is_readonly(struct kvm_memory_slot *slot)
  1053. {
  1054. return slot->flags & KVM_MEM_READONLY;
  1055. }
  1056. static unsigned long __gfn_to_hva_many(struct kvm_memory_slot *slot, gfn_t gfn,
  1057. gfn_t *nr_pages, bool write)
  1058. {
  1059. if (!slot || slot->flags & KVM_MEMSLOT_INVALID)
  1060. return KVM_HVA_ERR_BAD;
  1061. if (memslot_is_readonly(slot) && write)
  1062. return KVM_HVA_ERR_RO_BAD;
  1063. if (nr_pages)
  1064. *nr_pages = slot->npages - (gfn - slot->base_gfn);
  1065. return __gfn_to_hva_memslot(slot, gfn);
  1066. }
  1067. static unsigned long gfn_to_hva_many(struct kvm_memory_slot *slot, gfn_t gfn,
  1068. gfn_t *nr_pages)
  1069. {
  1070. return __gfn_to_hva_many(slot, gfn, nr_pages, true);
  1071. }
  1072. unsigned long gfn_to_hva_memslot(struct kvm_memory_slot *slot,
  1073. gfn_t gfn)
  1074. {
  1075. return gfn_to_hva_many(slot, gfn, NULL);
  1076. }
  1077. EXPORT_SYMBOL_GPL(gfn_to_hva_memslot);
  1078. unsigned long gfn_to_hva(struct kvm *kvm, gfn_t gfn)
  1079. {
  1080. return gfn_to_hva_many(gfn_to_memslot(kvm, gfn), gfn, NULL);
  1081. }
  1082. EXPORT_SYMBOL_GPL(gfn_to_hva);
  1083. unsigned long kvm_vcpu_gfn_to_hva(struct kvm_vcpu *vcpu, gfn_t gfn)
  1084. {
  1085. return gfn_to_hva_many(kvm_vcpu_gfn_to_memslot(vcpu, gfn), gfn, NULL);
  1086. }
  1087. EXPORT_SYMBOL_GPL(kvm_vcpu_gfn_to_hva);
  1088. /*
  1089. * If writable is set to false, the hva returned by this function is only
  1090. * allowed to be read.
  1091. */
  1092. unsigned long gfn_to_hva_memslot_prot(struct kvm_memory_slot *slot,
  1093. gfn_t gfn, bool *writable)
  1094. {
  1095. unsigned long hva = __gfn_to_hva_many(slot, gfn, NULL, false);
  1096. if (!kvm_is_error_hva(hva) && writable)
  1097. *writable = !memslot_is_readonly(slot);
  1098. return hva;
  1099. }
  1100. unsigned long gfn_to_hva_prot(struct kvm *kvm, gfn_t gfn, bool *writable)
  1101. {
  1102. struct kvm_memory_slot *slot = gfn_to_memslot(kvm, gfn);
  1103. return gfn_to_hva_memslot_prot(slot, gfn, writable);
  1104. }
  1105. unsigned long kvm_vcpu_gfn_to_hva_prot(struct kvm_vcpu *vcpu, gfn_t gfn, bool *writable)
  1106. {
  1107. struct kvm_memory_slot *slot = kvm_vcpu_gfn_to_memslot(vcpu, gfn);
  1108. return gfn_to_hva_memslot_prot(slot, gfn, writable);
  1109. }
  1110. static int get_user_page_nowait(unsigned long start, int write,
  1111. struct page **page)
  1112. {
  1113. int flags = FOLL_TOUCH | FOLL_NOWAIT | FOLL_HWPOISON | FOLL_GET;
  1114. if (write)
  1115. flags |= FOLL_WRITE;
  1116. return __get_user_pages(current, current->mm, start, 1, flags, page,
  1117. NULL, NULL);
  1118. }
  1119. static inline int check_user_page_hwpoison(unsigned long addr)
  1120. {
  1121. int rc, flags = FOLL_TOUCH | FOLL_HWPOISON | FOLL_WRITE;
  1122. rc = __get_user_pages(current, current->mm, addr, 1,
  1123. flags, NULL, NULL, NULL);
  1124. return rc == -EHWPOISON;
  1125. }
  1126. /*
  1127. * The atomic path to get the writable pfn which will be stored in @pfn,
  1128. * true indicates success, otherwise false is returned.
  1129. */
  1130. static bool hva_to_pfn_fast(unsigned long addr, bool atomic, bool *async,
  1131. bool write_fault, bool *writable, kvm_pfn_t *pfn)
  1132. {
  1133. struct page *page[1];
  1134. int npages;
  1135. if (!(async || atomic))
  1136. return false;
  1137. /*
  1138. * Fast pin a writable pfn only if it is a write fault request
  1139. * or the caller allows to map a writable pfn for a read fault
  1140. * request.
  1141. */
  1142. if (!(write_fault || writable))
  1143. return false;
  1144. npages = __get_user_pages_fast(addr, 1, 1, page);
  1145. if (npages == 1) {
  1146. *pfn = page_to_pfn(page[0]);
  1147. if (writable)
  1148. *writable = true;
  1149. return true;
  1150. }
  1151. return false;
  1152. }
  1153. /*
  1154. * The slow path to get the pfn of the specified host virtual address,
  1155. * 1 indicates success, -errno is returned if error is detected.
  1156. */
  1157. static int hva_to_pfn_slow(unsigned long addr, bool *async, bool write_fault,
  1158. bool *writable, kvm_pfn_t *pfn)
  1159. {
  1160. struct page *page[1];
  1161. int npages = 0;
  1162. might_sleep();
  1163. if (writable)
  1164. *writable = write_fault;
  1165. if (async) {
  1166. down_read(&current->mm->mmap_sem);
  1167. npages = get_user_page_nowait(addr, write_fault, page);
  1168. up_read(&current->mm->mmap_sem);
  1169. } else
  1170. npages = __get_user_pages_unlocked(current, current->mm, addr, 1,
  1171. write_fault, 0, page,
  1172. FOLL_TOUCH|FOLL_HWPOISON);
  1173. if (npages != 1)
  1174. return npages;
  1175. /* map read fault as writable if possible */
  1176. if (unlikely(!write_fault) && writable) {
  1177. struct page *wpage[1];
  1178. npages = __get_user_pages_fast(addr, 1, 1, wpage);
  1179. if (npages == 1) {
  1180. *writable = true;
  1181. put_page(page[0]);
  1182. page[0] = wpage[0];
  1183. }
  1184. npages = 1;
  1185. }
  1186. *pfn = page_to_pfn(page[0]);
  1187. return npages;
  1188. }
  1189. static bool vma_is_valid(struct vm_area_struct *vma, bool write_fault)
  1190. {
  1191. if (unlikely(!(vma->vm_flags & VM_READ)))
  1192. return false;
  1193. if (write_fault && (unlikely(!(vma->vm_flags & VM_WRITE))))
  1194. return false;
  1195. return true;
  1196. }
  1197. static int hva_to_pfn_remapped(struct vm_area_struct *vma,
  1198. unsigned long addr, bool *async,
  1199. bool write_fault, kvm_pfn_t *p_pfn)
  1200. {
  1201. unsigned long pfn;
  1202. int r;
  1203. r = follow_pfn(vma, addr, &pfn);
  1204. if (r) {
  1205. /*
  1206. * get_user_pages fails for VM_IO and VM_PFNMAP vmas and does
  1207. * not call the fault handler, so do it here.
  1208. */
  1209. bool unlocked = false;
  1210. r = fixup_user_fault(current, current->mm, addr,
  1211. (write_fault ? FAULT_FLAG_WRITE : 0),
  1212. &unlocked);
  1213. if (unlocked)
  1214. return -EAGAIN;
  1215. if (r)
  1216. return r;
  1217. r = follow_pfn(vma, addr, &pfn);
  1218. if (r)
  1219. return r;
  1220. }
  1221. /*
  1222. * Get a reference here because callers of *hva_to_pfn* and
  1223. * *gfn_to_pfn* ultimately call kvm_release_pfn_clean on the
  1224. * returned pfn. This is only needed if the VMA has VM_MIXEDMAP
  1225. * set, but the kvm_get_pfn/kvm_release_pfn_clean pair will
  1226. * simply do nothing for reserved pfns.
  1227. *
  1228. * Whoever called remap_pfn_range is also going to call e.g.
  1229. * unmap_mapping_range before the underlying pages are freed,
  1230. * causing a call to our MMU notifier.
  1231. */
  1232. kvm_get_pfn(pfn);
  1233. *p_pfn = pfn;
  1234. return 0;
  1235. }
  1236. /*
  1237. * Pin guest page in memory and return its pfn.
  1238. * @addr: host virtual address which maps memory to the guest
  1239. * @atomic: whether this function can sleep
  1240. * @async: whether this function need to wait IO complete if the
  1241. * host page is not in the memory
  1242. * @write_fault: whether we should get a writable host page
  1243. * @writable: whether it allows to map a writable host page for !@write_fault
  1244. *
  1245. * The function will map a writable host page for these two cases:
  1246. * 1): @write_fault = true
  1247. * 2): @write_fault = false && @writable, @writable will tell the caller
  1248. * whether the mapping is writable.
  1249. */
  1250. static kvm_pfn_t hva_to_pfn(unsigned long addr, bool atomic, bool *async,
  1251. bool write_fault, bool *writable)
  1252. {
  1253. struct vm_area_struct *vma;
  1254. kvm_pfn_t pfn = 0;
  1255. int npages, r;
  1256. /* we can do it either atomically or asynchronously, not both */
  1257. BUG_ON(atomic && async);
  1258. if (hva_to_pfn_fast(addr, atomic, async, write_fault, writable, &pfn))
  1259. return pfn;
  1260. if (atomic)
  1261. return KVM_PFN_ERR_FAULT;
  1262. npages = hva_to_pfn_slow(addr, async, write_fault, writable, &pfn);
  1263. if (npages == 1)
  1264. return pfn;
  1265. down_read(&current->mm->mmap_sem);
  1266. if (npages == -EHWPOISON ||
  1267. (!async && check_user_page_hwpoison(addr))) {
  1268. pfn = KVM_PFN_ERR_HWPOISON;
  1269. goto exit;
  1270. }
  1271. retry:
  1272. vma = find_vma_intersection(current->mm, addr, addr + 1);
  1273. if (vma == NULL)
  1274. pfn = KVM_PFN_ERR_FAULT;
  1275. else if (vma->vm_flags & (VM_IO | VM_PFNMAP)) {
  1276. r = hva_to_pfn_remapped(vma, addr, async, write_fault, &pfn);
  1277. if (r == -EAGAIN)
  1278. goto retry;
  1279. if (r < 0)
  1280. pfn = KVM_PFN_ERR_FAULT;
  1281. } else {
  1282. if (async && vma_is_valid(vma, write_fault))
  1283. *async = true;
  1284. pfn = KVM_PFN_ERR_FAULT;
  1285. }
  1286. exit:
  1287. up_read(&current->mm->mmap_sem);
  1288. return pfn;
  1289. }
  1290. kvm_pfn_t __gfn_to_pfn_memslot(struct kvm_memory_slot *slot, gfn_t gfn,
  1291. bool atomic, bool *async, bool write_fault,
  1292. bool *writable)
  1293. {
  1294. unsigned long addr = __gfn_to_hva_many(slot, gfn, NULL, write_fault);
  1295. if (addr == KVM_HVA_ERR_RO_BAD) {
  1296. if (writable)
  1297. *writable = false;
  1298. return KVM_PFN_ERR_RO_FAULT;
  1299. }
  1300. if (kvm_is_error_hva(addr)) {
  1301. if (writable)
  1302. *writable = false;
  1303. return KVM_PFN_NOSLOT;
  1304. }
  1305. /* Do not map writable pfn in the readonly memslot. */
  1306. if (writable && memslot_is_readonly(slot)) {
  1307. *writable = false;
  1308. writable = NULL;
  1309. }
  1310. return hva_to_pfn(addr, atomic, async, write_fault,
  1311. writable);
  1312. }
  1313. EXPORT_SYMBOL_GPL(__gfn_to_pfn_memslot);
  1314. kvm_pfn_t gfn_to_pfn_prot(struct kvm *kvm, gfn_t gfn, bool write_fault,
  1315. bool *writable)
  1316. {
  1317. return __gfn_to_pfn_memslot(gfn_to_memslot(kvm, gfn), gfn, false, NULL,
  1318. write_fault, writable);
  1319. }
  1320. EXPORT_SYMBOL_GPL(gfn_to_pfn_prot);
  1321. kvm_pfn_t gfn_to_pfn_memslot(struct kvm_memory_slot *slot, gfn_t gfn)
  1322. {
  1323. return __gfn_to_pfn_memslot(slot, gfn, false, NULL, true, NULL);
  1324. }
  1325. EXPORT_SYMBOL_GPL(gfn_to_pfn_memslot);
  1326. kvm_pfn_t gfn_to_pfn_memslot_atomic(struct kvm_memory_slot *slot, gfn_t gfn)
  1327. {
  1328. return __gfn_to_pfn_memslot(slot, gfn, true, NULL, true, NULL);
  1329. }
  1330. EXPORT_SYMBOL_GPL(gfn_to_pfn_memslot_atomic);
  1331. kvm_pfn_t gfn_to_pfn_atomic(struct kvm *kvm, gfn_t gfn)
  1332. {
  1333. return gfn_to_pfn_memslot_atomic(gfn_to_memslot(kvm, gfn), gfn);
  1334. }
  1335. EXPORT_SYMBOL_GPL(gfn_to_pfn_atomic);
  1336. kvm_pfn_t kvm_vcpu_gfn_to_pfn_atomic(struct kvm_vcpu *vcpu, gfn_t gfn)
  1337. {
  1338. return gfn_to_pfn_memslot_atomic(kvm_vcpu_gfn_to_memslot(vcpu, gfn), gfn);
  1339. }
  1340. EXPORT_SYMBOL_GPL(kvm_vcpu_gfn_to_pfn_atomic);
  1341. kvm_pfn_t gfn_to_pfn(struct kvm *kvm, gfn_t gfn)
  1342. {
  1343. return gfn_to_pfn_memslot(gfn_to_memslot(kvm, gfn), gfn);
  1344. }
  1345. EXPORT_SYMBOL_GPL(gfn_to_pfn);
  1346. kvm_pfn_t kvm_vcpu_gfn_to_pfn(struct kvm_vcpu *vcpu, gfn_t gfn)
  1347. {
  1348. return gfn_to_pfn_memslot(kvm_vcpu_gfn_to_memslot(vcpu, gfn), gfn);
  1349. }
  1350. EXPORT_SYMBOL_GPL(kvm_vcpu_gfn_to_pfn);
  1351. int gfn_to_page_many_atomic(struct kvm_memory_slot *slot, gfn_t gfn,
  1352. struct page **pages, int nr_pages)
  1353. {
  1354. unsigned long addr;
  1355. gfn_t entry;
  1356. addr = gfn_to_hva_many(slot, gfn, &entry);
  1357. if (kvm_is_error_hva(addr))
  1358. return -1;
  1359. if (entry < nr_pages)
  1360. return 0;
  1361. return __get_user_pages_fast(addr, nr_pages, 1, pages);
  1362. }
  1363. EXPORT_SYMBOL_GPL(gfn_to_page_many_atomic);
  1364. static struct page *kvm_pfn_to_page(kvm_pfn_t pfn)
  1365. {
  1366. if (is_error_noslot_pfn(pfn))
  1367. return KVM_ERR_PTR_BAD_PAGE;
  1368. if (kvm_is_reserved_pfn(pfn)) {
  1369. WARN_ON(1);
  1370. return KVM_ERR_PTR_BAD_PAGE;
  1371. }
  1372. return pfn_to_page(pfn);
  1373. }
  1374. struct page *gfn_to_page(struct kvm *kvm, gfn_t gfn)
  1375. {
  1376. kvm_pfn_t pfn;
  1377. pfn = gfn_to_pfn(kvm, gfn);
  1378. return kvm_pfn_to_page(pfn);
  1379. }
  1380. EXPORT_SYMBOL_GPL(gfn_to_page);
  1381. struct page *kvm_vcpu_gfn_to_page(struct kvm_vcpu *vcpu, gfn_t gfn)
  1382. {
  1383. kvm_pfn_t pfn;
  1384. pfn = kvm_vcpu_gfn_to_pfn(vcpu, gfn);
  1385. return kvm_pfn_to_page(pfn);
  1386. }
  1387. EXPORT_SYMBOL_GPL(kvm_vcpu_gfn_to_page);
  1388. void kvm_release_page_clean(struct page *page)
  1389. {
  1390. WARN_ON(is_error_page(page));
  1391. kvm_release_pfn_clean(page_to_pfn(page));
  1392. }
  1393. EXPORT_SYMBOL_GPL(kvm_release_page_clean);
  1394. void kvm_release_pfn_clean(kvm_pfn_t pfn)
  1395. {
  1396. if (!is_error_noslot_pfn(pfn) && !kvm_is_reserved_pfn(pfn))
  1397. put_page(pfn_to_page(pfn));
  1398. }
  1399. EXPORT_SYMBOL_GPL(kvm_release_pfn_clean);
  1400. void kvm_release_page_dirty(struct page *page)
  1401. {
  1402. WARN_ON(is_error_page(page));
  1403. kvm_release_pfn_dirty(page_to_pfn(page));
  1404. }
  1405. EXPORT_SYMBOL_GPL(kvm_release_page_dirty);
  1406. static void kvm_release_pfn_dirty(kvm_pfn_t pfn)
  1407. {
  1408. kvm_set_pfn_dirty(pfn);
  1409. kvm_release_pfn_clean(pfn);
  1410. }
  1411. void kvm_set_pfn_dirty(kvm_pfn_t pfn)
  1412. {
  1413. if (!kvm_is_reserved_pfn(pfn)) {
  1414. struct page *page = pfn_to_page(pfn);
  1415. if (!PageReserved(page))
  1416. SetPageDirty(page);
  1417. }
  1418. }
  1419. EXPORT_SYMBOL_GPL(kvm_set_pfn_dirty);
  1420. void kvm_set_pfn_accessed(kvm_pfn_t pfn)
  1421. {
  1422. if (!kvm_is_reserved_pfn(pfn))
  1423. mark_page_accessed(pfn_to_page(pfn));
  1424. }
  1425. EXPORT_SYMBOL_GPL(kvm_set_pfn_accessed);
  1426. void kvm_get_pfn(kvm_pfn_t pfn)
  1427. {
  1428. if (!kvm_is_reserved_pfn(pfn))
  1429. get_page(pfn_to_page(pfn));
  1430. }
  1431. EXPORT_SYMBOL_GPL(kvm_get_pfn);
  1432. static int next_segment(unsigned long len, int offset)
  1433. {
  1434. if (len > PAGE_SIZE - offset)
  1435. return PAGE_SIZE - offset;
  1436. else
  1437. return len;
  1438. }
  1439. static int __kvm_read_guest_page(struct kvm_memory_slot *slot, gfn_t gfn,
  1440. void *data, int offset, int len)
  1441. {
  1442. int r;
  1443. unsigned long addr;
  1444. addr = gfn_to_hva_memslot_prot(slot, gfn, NULL);
  1445. if (kvm_is_error_hva(addr))
  1446. return -EFAULT;
  1447. r = __copy_from_user(data, (void __user *)addr + offset, len);
  1448. if (r)
  1449. return -EFAULT;
  1450. return 0;
  1451. }
  1452. int kvm_read_guest_page(struct kvm *kvm, gfn_t gfn, void *data, int offset,
  1453. int len)
  1454. {
  1455. struct kvm_memory_slot *slot = gfn_to_memslot(kvm, gfn);
  1456. return __kvm_read_guest_page(slot, gfn, data, offset, len);
  1457. }
  1458. EXPORT_SYMBOL_GPL(kvm_read_guest_page);
  1459. int kvm_vcpu_read_guest_page(struct kvm_vcpu *vcpu, gfn_t gfn, void *data,
  1460. int offset, int len)
  1461. {
  1462. struct kvm_memory_slot *slot = kvm_vcpu_gfn_to_memslot(vcpu, gfn);
  1463. return __kvm_read_guest_page(slot, gfn, data, offset, len);
  1464. }
  1465. EXPORT_SYMBOL_GPL(kvm_vcpu_read_guest_page);
  1466. int kvm_read_guest(struct kvm *kvm, gpa_t gpa, void *data, unsigned long len)
  1467. {
  1468. gfn_t gfn = gpa >> PAGE_SHIFT;
  1469. int seg;
  1470. int offset = offset_in_page(gpa);
  1471. int ret;
  1472. while ((seg = next_segment(len, offset)) != 0) {
  1473. ret = kvm_read_guest_page(kvm, gfn, data, offset, seg);
  1474. if (ret < 0)
  1475. return ret;
  1476. offset = 0;
  1477. len -= seg;
  1478. data += seg;
  1479. ++gfn;
  1480. }
  1481. return 0;
  1482. }
  1483. EXPORT_SYMBOL_GPL(kvm_read_guest);
  1484. int kvm_vcpu_read_guest(struct kvm_vcpu *vcpu, gpa_t gpa, void *data, unsigned long len)
  1485. {
  1486. gfn_t gfn = gpa >> PAGE_SHIFT;
  1487. int seg;
  1488. int offset = offset_in_page(gpa);
  1489. int ret;
  1490. while ((seg = next_segment(len, offset)) != 0) {
  1491. ret = kvm_vcpu_read_guest_page(vcpu, gfn, data, offset, seg);
  1492. if (ret < 0)
  1493. return ret;
  1494. offset = 0;
  1495. len -= seg;
  1496. data += seg;
  1497. ++gfn;
  1498. }
  1499. return 0;
  1500. }
  1501. EXPORT_SYMBOL_GPL(kvm_vcpu_read_guest);
  1502. static int __kvm_read_guest_atomic(struct kvm_memory_slot *slot, gfn_t gfn,
  1503. void *data, int offset, unsigned long len)
  1504. {
  1505. int r;
  1506. unsigned long addr;
  1507. addr = gfn_to_hva_memslot_prot(slot, gfn, NULL);
  1508. if (kvm_is_error_hva(addr))
  1509. return -EFAULT;
  1510. pagefault_disable();
  1511. r = __copy_from_user_inatomic(data, (void __user *)addr + offset, len);
  1512. pagefault_enable();
  1513. if (r)
  1514. return -EFAULT;
  1515. return 0;
  1516. }
  1517. int kvm_read_guest_atomic(struct kvm *kvm, gpa_t gpa, void *data,
  1518. unsigned long len)
  1519. {
  1520. gfn_t gfn = gpa >> PAGE_SHIFT;
  1521. struct kvm_memory_slot *slot = gfn_to_memslot(kvm, gfn);
  1522. int offset = offset_in_page(gpa);
  1523. return __kvm_read_guest_atomic(slot, gfn, data, offset, len);
  1524. }
  1525. EXPORT_SYMBOL_GPL(kvm_read_guest_atomic);
  1526. int kvm_vcpu_read_guest_atomic(struct kvm_vcpu *vcpu, gpa_t gpa,
  1527. void *data, unsigned long len)
  1528. {
  1529. gfn_t gfn = gpa >> PAGE_SHIFT;
  1530. struct kvm_memory_slot *slot = kvm_vcpu_gfn_to_memslot(vcpu, gfn);
  1531. int offset = offset_in_page(gpa);
  1532. return __kvm_read_guest_atomic(slot, gfn, data, offset, len);
  1533. }
  1534. EXPORT_SYMBOL_GPL(kvm_vcpu_read_guest_atomic);
  1535. static int __kvm_write_guest_page(struct kvm_memory_slot *memslot, gfn_t gfn,
  1536. const void *data, int offset, int len)
  1537. {
  1538. int r;
  1539. unsigned long addr;
  1540. addr = gfn_to_hva_memslot(memslot, gfn);
  1541. if (kvm_is_error_hva(addr))
  1542. return -EFAULT;
  1543. r = __copy_to_user((void __user *)addr + offset, data, len);
  1544. if (r)
  1545. return -EFAULT;
  1546. mark_page_dirty_in_slot(memslot, gfn);
  1547. return 0;
  1548. }
  1549. int kvm_write_guest_page(struct kvm *kvm, gfn_t gfn,
  1550. const void *data, int offset, int len)
  1551. {
  1552. struct kvm_memory_slot *slot = gfn_to_memslot(kvm, gfn);
  1553. return __kvm_write_guest_page(slot, gfn, data, offset, len);
  1554. }
  1555. EXPORT_SYMBOL_GPL(kvm_write_guest_page);
  1556. int kvm_vcpu_write_guest_page(struct kvm_vcpu *vcpu, gfn_t gfn,
  1557. const void *data, int offset, int len)
  1558. {
  1559. struct kvm_memory_slot *slot = kvm_vcpu_gfn_to_memslot(vcpu, gfn);
  1560. return __kvm_write_guest_page(slot, gfn, data, offset, len);
  1561. }
  1562. EXPORT_SYMBOL_GPL(kvm_vcpu_write_guest_page);
  1563. int kvm_write_guest(struct kvm *kvm, gpa_t gpa, const void *data,
  1564. unsigned long len)
  1565. {
  1566. gfn_t gfn = gpa >> PAGE_SHIFT;
  1567. int seg;
  1568. int offset = offset_in_page(gpa);
  1569. int ret;
  1570. while ((seg = next_segment(len, offset)) != 0) {
  1571. ret = kvm_write_guest_page(kvm, gfn, data, offset, seg);
  1572. if (ret < 0)
  1573. return ret;
  1574. offset = 0;
  1575. len -= seg;
  1576. data += seg;
  1577. ++gfn;
  1578. }
  1579. return 0;
  1580. }
  1581. EXPORT_SYMBOL_GPL(kvm_write_guest);
  1582. int kvm_vcpu_write_guest(struct kvm_vcpu *vcpu, gpa_t gpa, const void *data,
  1583. unsigned long len)
  1584. {
  1585. gfn_t gfn = gpa >> PAGE_SHIFT;
  1586. int seg;
  1587. int offset = offset_in_page(gpa);
  1588. int ret;
  1589. while ((seg = next_segment(len, offset)) != 0) {
  1590. ret = kvm_vcpu_write_guest_page(vcpu, gfn, data, offset, seg);
  1591. if (ret < 0)
  1592. return ret;
  1593. offset = 0;
  1594. len -= seg;
  1595. data += seg;
  1596. ++gfn;
  1597. }
  1598. return 0;
  1599. }
  1600. EXPORT_SYMBOL_GPL(kvm_vcpu_write_guest);
  1601. int kvm_gfn_to_hva_cache_init(struct kvm *kvm, struct gfn_to_hva_cache *ghc,
  1602. gpa_t gpa, unsigned long len)
  1603. {
  1604. struct kvm_memslots *slots = kvm_memslots(kvm);
  1605. int offset = offset_in_page(gpa);
  1606. gfn_t start_gfn = gpa >> PAGE_SHIFT;
  1607. gfn_t end_gfn = (gpa + len - 1) >> PAGE_SHIFT;
  1608. gfn_t nr_pages_needed = end_gfn - start_gfn + 1;
  1609. gfn_t nr_pages_avail;
  1610. ghc->gpa = gpa;
  1611. ghc->generation = slots->generation;
  1612. ghc->len = len;
  1613. ghc->memslot = gfn_to_memslot(kvm, start_gfn);
  1614. ghc->hva = gfn_to_hva_many(ghc->memslot, start_gfn, NULL);
  1615. if (!kvm_is_error_hva(ghc->hva) && nr_pages_needed <= 1) {
  1616. ghc->hva += offset;
  1617. } else {
  1618. /*
  1619. * If the requested region crosses two memslots, we still
  1620. * verify that the entire region is valid here.
  1621. */
  1622. while (start_gfn <= end_gfn) {
  1623. ghc->memslot = gfn_to_memslot(kvm, start_gfn);
  1624. ghc->hva = gfn_to_hva_many(ghc->memslot, start_gfn,
  1625. &nr_pages_avail);
  1626. if (kvm_is_error_hva(ghc->hva))
  1627. return -EFAULT;
  1628. start_gfn += nr_pages_avail;
  1629. }
  1630. /* Use the slow path for cross page reads and writes. */
  1631. ghc->memslot = NULL;
  1632. }
  1633. return 0;
  1634. }
  1635. EXPORT_SYMBOL_GPL(kvm_gfn_to_hva_cache_init);
  1636. int kvm_write_guest_cached(struct kvm *kvm, struct gfn_to_hva_cache *ghc,
  1637. void *data, unsigned long len)
  1638. {
  1639. struct kvm_memslots *slots = kvm_memslots(kvm);
  1640. int r;
  1641. BUG_ON(len > ghc->len);
  1642. if (slots->generation != ghc->generation)
  1643. kvm_gfn_to_hva_cache_init(kvm, ghc, ghc->gpa, ghc->len);
  1644. if (unlikely(!ghc->memslot))
  1645. return kvm_write_guest(kvm, ghc->gpa, data, len);
  1646. if (kvm_is_error_hva(ghc->hva))
  1647. return -EFAULT;
  1648. r = __copy_to_user((void __user *)ghc->hva, data, len);
  1649. if (r)
  1650. return -EFAULT;
  1651. mark_page_dirty_in_slot(ghc->memslot, ghc->gpa >> PAGE_SHIFT);
  1652. return 0;
  1653. }
  1654. EXPORT_SYMBOL_GPL(kvm_write_guest_cached);
  1655. int kvm_read_guest_cached(struct kvm *kvm, struct gfn_to_hva_cache *ghc,
  1656. void *data, unsigned long len)
  1657. {
  1658. struct kvm_memslots *slots = kvm_memslots(kvm);
  1659. int r;
  1660. BUG_ON(len > ghc->len);
  1661. if (slots->generation != ghc->generation)
  1662. kvm_gfn_to_hva_cache_init(kvm, ghc, ghc->gpa, ghc->len);
  1663. if (unlikely(!ghc->memslot))
  1664. return kvm_read_guest(kvm, ghc->gpa, data, len);
  1665. if (kvm_is_error_hva(ghc->hva))
  1666. return -EFAULT;
  1667. r = __copy_from_user(data, (void __user *)ghc->hva, len);
  1668. if (r)
  1669. return -EFAULT;
  1670. return 0;
  1671. }
  1672. EXPORT_SYMBOL_GPL(kvm_read_guest_cached);
  1673. int kvm_clear_guest_page(struct kvm *kvm, gfn_t gfn, int offset, int len)
  1674. {
  1675. const void *zero_page = (const void *) __va(page_to_phys(ZERO_PAGE(0)));
  1676. return kvm_write_guest_page(kvm, gfn, zero_page, offset, len);
  1677. }
  1678. EXPORT_SYMBOL_GPL(kvm_clear_guest_page);
  1679. int kvm_clear_guest(struct kvm *kvm, gpa_t gpa, unsigned long len)
  1680. {
  1681. gfn_t gfn = gpa >> PAGE_SHIFT;
  1682. int seg;
  1683. int offset = offset_in_page(gpa);
  1684. int ret;
  1685. while ((seg = next_segment(len, offset)) != 0) {
  1686. ret = kvm_clear_guest_page(kvm, gfn, offset, seg);
  1687. if (ret < 0)
  1688. return ret;
  1689. offset = 0;
  1690. len -= seg;
  1691. ++gfn;
  1692. }
  1693. return 0;
  1694. }
  1695. EXPORT_SYMBOL_GPL(kvm_clear_guest);
  1696. static void mark_page_dirty_in_slot(struct kvm_memory_slot *memslot,
  1697. gfn_t gfn)
  1698. {
  1699. if (memslot && memslot->dirty_bitmap) {
  1700. unsigned long rel_gfn = gfn - memslot->base_gfn;
  1701. set_bit_le(rel_gfn, memslot->dirty_bitmap);
  1702. }
  1703. }
  1704. void mark_page_dirty(struct kvm *kvm, gfn_t gfn)
  1705. {
  1706. struct kvm_memory_slot *memslot;
  1707. memslot = gfn_to_memslot(kvm, gfn);
  1708. mark_page_dirty_in_slot(memslot, gfn);
  1709. }
  1710. EXPORT_SYMBOL_GPL(mark_page_dirty);
  1711. void kvm_vcpu_mark_page_dirty(struct kvm_vcpu *vcpu, gfn_t gfn)
  1712. {
  1713. struct kvm_memory_slot *memslot;
  1714. memslot = kvm_vcpu_gfn_to_memslot(vcpu, gfn);
  1715. mark_page_dirty_in_slot(memslot, gfn);
  1716. }
  1717. EXPORT_SYMBOL_GPL(kvm_vcpu_mark_page_dirty);
  1718. static void grow_halt_poll_ns(struct kvm_vcpu *vcpu)
  1719. {
  1720. unsigned int old, val, grow;
  1721. old = val = vcpu->halt_poll_ns;
  1722. grow = READ_ONCE(halt_poll_ns_grow);
  1723. /* 10us base */
  1724. if (val == 0 && grow)
  1725. val = 10000;
  1726. else
  1727. val *= grow;
  1728. if (val > halt_poll_ns)
  1729. val = halt_poll_ns;
  1730. vcpu->halt_poll_ns = val;
  1731. trace_kvm_halt_poll_ns_grow(vcpu->vcpu_id, val, old);
  1732. }
  1733. static void shrink_halt_poll_ns(struct kvm_vcpu *vcpu)
  1734. {
  1735. unsigned int old, val, shrink;
  1736. old = val = vcpu->halt_poll_ns;
  1737. shrink = READ_ONCE(halt_poll_ns_shrink);
  1738. if (shrink == 0)
  1739. val = 0;
  1740. else
  1741. val /= shrink;
  1742. vcpu->halt_poll_ns = val;
  1743. trace_kvm_halt_poll_ns_shrink(vcpu->vcpu_id, val, old);
  1744. }
  1745. static int kvm_vcpu_check_block(struct kvm_vcpu *vcpu)
  1746. {
  1747. if (kvm_arch_vcpu_runnable(vcpu)) {
  1748. kvm_make_request(KVM_REQ_UNHALT, vcpu);
  1749. return -EINTR;
  1750. }
  1751. if (kvm_cpu_has_pending_timer(vcpu))
  1752. return -EINTR;
  1753. if (signal_pending(current))
  1754. return -EINTR;
  1755. return 0;
  1756. }
  1757. /*
  1758. * The vCPU has executed a HLT instruction with in-kernel mode enabled.
  1759. */
  1760. void kvm_vcpu_block(struct kvm_vcpu *vcpu)
  1761. {
  1762. ktime_t start, cur;
  1763. DECLARE_SWAITQUEUE(wait);
  1764. bool waited = false;
  1765. u64 block_ns;
  1766. start = cur = ktime_get();
  1767. if (vcpu->halt_poll_ns) {
  1768. ktime_t stop = ktime_add_ns(ktime_get(), vcpu->halt_poll_ns);
  1769. ++vcpu->stat.halt_attempted_poll;
  1770. do {
  1771. /*
  1772. * This sets KVM_REQ_UNHALT if an interrupt
  1773. * arrives.
  1774. */
  1775. if (kvm_vcpu_check_block(vcpu) < 0) {
  1776. ++vcpu->stat.halt_successful_poll;
  1777. if (!vcpu_valid_wakeup(vcpu))
  1778. ++vcpu->stat.halt_poll_invalid;
  1779. goto out;
  1780. }
  1781. cur = ktime_get();
  1782. } while (single_task_running() && ktime_before(cur, stop));
  1783. }
  1784. kvm_arch_vcpu_blocking(vcpu);
  1785. for (;;) {
  1786. prepare_to_swait(&vcpu->wq, &wait, TASK_INTERRUPTIBLE);
  1787. if (kvm_vcpu_check_block(vcpu) < 0)
  1788. break;
  1789. waited = true;
  1790. schedule();
  1791. }
  1792. finish_swait(&vcpu->wq, &wait);
  1793. cur = ktime_get();
  1794. kvm_arch_vcpu_unblocking(vcpu);
  1795. out:
  1796. block_ns = ktime_to_ns(cur) - ktime_to_ns(start);
  1797. if (!vcpu_valid_wakeup(vcpu))
  1798. shrink_halt_poll_ns(vcpu);
  1799. else if (halt_poll_ns) {
  1800. if (block_ns <= vcpu->halt_poll_ns)
  1801. ;
  1802. /* we had a long block, shrink polling */
  1803. else if (vcpu->halt_poll_ns && block_ns > halt_poll_ns)
  1804. shrink_halt_poll_ns(vcpu);
  1805. /* we had a short halt and our poll time is too small */
  1806. else if (vcpu->halt_poll_ns < halt_poll_ns &&
  1807. block_ns < halt_poll_ns)
  1808. grow_halt_poll_ns(vcpu);
  1809. } else
  1810. vcpu->halt_poll_ns = 0;
  1811. trace_kvm_vcpu_wakeup(block_ns, waited, vcpu_valid_wakeup(vcpu));
  1812. kvm_arch_vcpu_block_finish(vcpu);
  1813. }
  1814. EXPORT_SYMBOL_GPL(kvm_vcpu_block);
  1815. #ifndef CONFIG_S390
  1816. void kvm_vcpu_wake_up(struct kvm_vcpu *vcpu)
  1817. {
  1818. struct swait_queue_head *wqp;
  1819. wqp = kvm_arch_vcpu_wq(vcpu);
  1820. if (swait_active(wqp)) {
  1821. swake_up(wqp);
  1822. ++vcpu->stat.halt_wakeup;
  1823. }
  1824. }
  1825. EXPORT_SYMBOL_GPL(kvm_vcpu_wake_up);
  1826. /*
  1827. * Kick a sleeping VCPU, or a guest VCPU in guest mode, into host kernel mode.
  1828. */
  1829. void kvm_vcpu_kick(struct kvm_vcpu *vcpu)
  1830. {
  1831. int me;
  1832. int cpu = vcpu->cpu;
  1833. kvm_vcpu_wake_up(vcpu);
  1834. me = get_cpu();
  1835. if (cpu != me && (unsigned)cpu < nr_cpu_ids && cpu_online(cpu))
  1836. if (kvm_arch_vcpu_should_kick(vcpu))
  1837. smp_send_reschedule(cpu);
  1838. put_cpu();
  1839. }
  1840. EXPORT_SYMBOL_GPL(kvm_vcpu_kick);
  1841. #endif /* !CONFIG_S390 */
  1842. int kvm_vcpu_yield_to(struct kvm_vcpu *target)
  1843. {
  1844. struct pid *pid;
  1845. struct task_struct *task = NULL;
  1846. int ret = 0;
  1847. rcu_read_lock();
  1848. pid = rcu_dereference(target->pid);
  1849. if (pid)
  1850. task = get_pid_task(pid, PIDTYPE_PID);
  1851. rcu_read_unlock();
  1852. if (!task)
  1853. return ret;
  1854. ret = yield_to(task, 1);
  1855. put_task_struct(task);
  1856. return ret;
  1857. }
  1858. EXPORT_SYMBOL_GPL(kvm_vcpu_yield_to);
  1859. /*
  1860. * Helper that checks whether a VCPU is eligible for directed yield.
  1861. * Most eligible candidate to yield is decided by following heuristics:
  1862. *
  1863. * (a) VCPU which has not done pl-exit or cpu relax intercepted recently
  1864. * (preempted lock holder), indicated by @in_spin_loop.
  1865. * Set at the beiginning and cleared at the end of interception/PLE handler.
  1866. *
  1867. * (b) VCPU which has done pl-exit/ cpu relax intercepted but did not get
  1868. * chance last time (mostly it has become eligible now since we have probably
  1869. * yielded to lockholder in last iteration. This is done by toggling
  1870. * @dy_eligible each time a VCPU checked for eligibility.)
  1871. *
  1872. * Yielding to a recently pl-exited/cpu relax intercepted VCPU before yielding
  1873. * to preempted lock-holder could result in wrong VCPU selection and CPU
  1874. * burning. Giving priority for a potential lock-holder increases lock
  1875. * progress.
  1876. *
  1877. * Since algorithm is based on heuristics, accessing another VCPU data without
  1878. * locking does not harm. It may result in trying to yield to same VCPU, fail
  1879. * and continue with next VCPU and so on.
  1880. */
  1881. static bool kvm_vcpu_eligible_for_directed_yield(struct kvm_vcpu *vcpu)
  1882. {
  1883. #ifdef CONFIG_HAVE_KVM_CPU_RELAX_INTERCEPT
  1884. bool eligible;
  1885. eligible = !vcpu->spin_loop.in_spin_loop ||
  1886. vcpu->spin_loop.dy_eligible;
  1887. if (vcpu->spin_loop.in_spin_loop)
  1888. kvm_vcpu_set_dy_eligible(vcpu, !vcpu->spin_loop.dy_eligible);
  1889. return eligible;
  1890. #else
  1891. return true;
  1892. #endif
  1893. }
  1894. void kvm_vcpu_on_spin(struct kvm_vcpu *me)
  1895. {
  1896. struct kvm *kvm = me->kvm;
  1897. struct kvm_vcpu *vcpu;
  1898. int last_boosted_vcpu = me->kvm->last_boosted_vcpu;
  1899. int yielded = 0;
  1900. int try = 3;
  1901. int pass;
  1902. int i;
  1903. kvm_vcpu_set_in_spin_loop(me, true);
  1904. /*
  1905. * We boost the priority of a VCPU that is runnable but not
  1906. * currently running, because it got preempted by something
  1907. * else and called schedule in __vcpu_run. Hopefully that
  1908. * VCPU is holding the lock that we need and will release it.
  1909. * We approximate round-robin by starting at the last boosted VCPU.
  1910. */
  1911. for (pass = 0; pass < 2 && !yielded && try; pass++) {
  1912. kvm_for_each_vcpu(i, vcpu, kvm) {
  1913. if (!pass && i <= last_boosted_vcpu) {
  1914. i = last_boosted_vcpu;
  1915. continue;
  1916. } else if (pass && i > last_boosted_vcpu)
  1917. break;
  1918. if (!ACCESS_ONCE(vcpu->preempted))
  1919. continue;
  1920. if (vcpu == me)
  1921. continue;
  1922. if (swait_active(&vcpu->wq) && !kvm_arch_vcpu_runnable(vcpu))
  1923. continue;
  1924. if (!kvm_vcpu_eligible_for_directed_yield(vcpu))
  1925. continue;
  1926. yielded = kvm_vcpu_yield_to(vcpu);
  1927. if (yielded > 0) {
  1928. kvm->last_boosted_vcpu = i;
  1929. break;
  1930. } else if (yielded < 0) {
  1931. try--;
  1932. if (!try)
  1933. break;
  1934. }
  1935. }
  1936. }
  1937. kvm_vcpu_set_in_spin_loop(me, false);
  1938. /* Ensure vcpu is not eligible during next spinloop */
  1939. kvm_vcpu_set_dy_eligible(me, false);
  1940. }
  1941. EXPORT_SYMBOL_GPL(kvm_vcpu_on_spin);
  1942. static int kvm_vcpu_fault(struct vm_area_struct *vma, struct vm_fault *vmf)
  1943. {
  1944. struct kvm_vcpu *vcpu = vma->vm_file->private_data;
  1945. struct page *page;
  1946. if (vmf->pgoff == 0)
  1947. page = virt_to_page(vcpu->run);
  1948. #ifdef CONFIG_X86
  1949. else if (vmf->pgoff == KVM_PIO_PAGE_OFFSET)
  1950. page = virt_to_page(vcpu->arch.pio_data);
  1951. #endif
  1952. #ifdef KVM_COALESCED_MMIO_PAGE_OFFSET
  1953. else if (vmf->pgoff == KVM_COALESCED_MMIO_PAGE_OFFSET)
  1954. page = virt_to_page(vcpu->kvm->coalesced_mmio_ring);
  1955. #endif
  1956. else
  1957. return kvm_arch_vcpu_fault(vcpu, vmf);
  1958. get_page(page);
  1959. vmf->page = page;
  1960. return 0;
  1961. }
  1962. static const struct vm_operations_struct kvm_vcpu_vm_ops = {
  1963. .fault = kvm_vcpu_fault,
  1964. };
  1965. static int kvm_vcpu_mmap(struct file *file, struct vm_area_struct *vma)
  1966. {
  1967. vma->vm_ops = &kvm_vcpu_vm_ops;
  1968. return 0;
  1969. }
  1970. static int kvm_vcpu_release(struct inode *inode, struct file *filp)
  1971. {
  1972. struct kvm_vcpu *vcpu = filp->private_data;
  1973. kvm_put_kvm(vcpu->kvm);
  1974. return 0;
  1975. }
  1976. static struct file_operations kvm_vcpu_fops = {
  1977. .release = kvm_vcpu_release,
  1978. .unlocked_ioctl = kvm_vcpu_ioctl,
  1979. #ifdef CONFIG_KVM_COMPAT
  1980. .compat_ioctl = kvm_vcpu_compat_ioctl,
  1981. #endif
  1982. .mmap = kvm_vcpu_mmap,
  1983. .llseek = noop_llseek,
  1984. };
  1985. /*
  1986. * Allocates an inode for the vcpu.
  1987. */
  1988. static int create_vcpu_fd(struct kvm_vcpu *vcpu)
  1989. {
  1990. return anon_inode_getfd("kvm-vcpu", &kvm_vcpu_fops, vcpu, O_RDWR | O_CLOEXEC);
  1991. }
  1992. /*
  1993. * Creates some virtual cpus. Good luck creating more than one.
  1994. */
  1995. static int kvm_vm_ioctl_create_vcpu(struct kvm *kvm, u32 id)
  1996. {
  1997. int r;
  1998. struct kvm_vcpu *vcpu;
  1999. if (id >= KVM_MAX_VCPU_ID)
  2000. return -EINVAL;
  2001. mutex_lock(&kvm->lock);
  2002. if (kvm->created_vcpus == KVM_MAX_VCPUS) {
  2003. mutex_unlock(&kvm->lock);
  2004. return -EINVAL;
  2005. }
  2006. kvm->created_vcpus++;
  2007. mutex_unlock(&kvm->lock);
  2008. vcpu = kvm_arch_vcpu_create(kvm, id);
  2009. if (IS_ERR(vcpu)) {
  2010. r = PTR_ERR(vcpu);
  2011. goto vcpu_decrement;
  2012. }
  2013. preempt_notifier_init(&vcpu->preempt_notifier, &kvm_preempt_ops);
  2014. r = kvm_arch_vcpu_setup(vcpu);
  2015. if (r)
  2016. goto vcpu_destroy;
  2017. mutex_lock(&kvm->lock);
  2018. if (kvm_get_vcpu_by_id(kvm, id)) {
  2019. r = -EEXIST;
  2020. goto unlock_vcpu_destroy;
  2021. }
  2022. BUG_ON(kvm->vcpus[atomic_read(&kvm->online_vcpus)]);
  2023. /* Now it's all set up, let userspace reach it */
  2024. kvm_get_kvm(kvm);
  2025. r = create_vcpu_fd(vcpu);
  2026. if (r < 0) {
  2027. kvm_put_kvm(kvm);
  2028. goto unlock_vcpu_destroy;
  2029. }
  2030. kvm->vcpus[atomic_read(&kvm->online_vcpus)] = vcpu;
  2031. /*
  2032. * Pairs with smp_rmb() in kvm_get_vcpu. Write kvm->vcpus
  2033. * before kvm->online_vcpu's incremented value.
  2034. */
  2035. smp_wmb();
  2036. atomic_inc(&kvm->online_vcpus);
  2037. mutex_unlock(&kvm->lock);
  2038. kvm_arch_vcpu_postcreate(vcpu);
  2039. return r;
  2040. unlock_vcpu_destroy:
  2041. mutex_unlock(&kvm->lock);
  2042. vcpu_destroy:
  2043. kvm_arch_vcpu_destroy(vcpu);
  2044. vcpu_decrement:
  2045. mutex_lock(&kvm->lock);
  2046. kvm->created_vcpus--;
  2047. mutex_unlock(&kvm->lock);
  2048. return r;
  2049. }
  2050. static int kvm_vcpu_ioctl_set_sigmask(struct kvm_vcpu *vcpu, sigset_t *sigset)
  2051. {
  2052. if (sigset) {
  2053. sigdelsetmask(sigset, sigmask(SIGKILL)|sigmask(SIGSTOP));
  2054. vcpu->sigset_active = 1;
  2055. vcpu->sigset = *sigset;
  2056. } else
  2057. vcpu->sigset_active = 0;
  2058. return 0;
  2059. }
  2060. static long kvm_vcpu_ioctl(struct file *filp,
  2061. unsigned int ioctl, unsigned long arg)
  2062. {
  2063. struct kvm_vcpu *vcpu = filp->private_data;
  2064. void __user *argp = (void __user *)arg;
  2065. int r;
  2066. struct kvm_fpu *fpu = NULL;
  2067. struct kvm_sregs *kvm_sregs = NULL;
  2068. if (vcpu->kvm->mm != current->mm)
  2069. return -EIO;
  2070. if (unlikely(_IOC_TYPE(ioctl) != KVMIO))
  2071. return -EINVAL;
  2072. #if defined(CONFIG_S390) || defined(CONFIG_PPC) || defined(CONFIG_MIPS)
  2073. /*
  2074. * Special cases: vcpu ioctls that are asynchronous to vcpu execution,
  2075. * so vcpu_load() would break it.
  2076. */
  2077. if (ioctl == KVM_S390_INTERRUPT || ioctl == KVM_S390_IRQ || ioctl == KVM_INTERRUPT)
  2078. return kvm_arch_vcpu_ioctl(filp, ioctl, arg);
  2079. #endif
  2080. r = vcpu_load(vcpu);
  2081. if (r)
  2082. return r;
  2083. switch (ioctl) {
  2084. case KVM_RUN:
  2085. r = -EINVAL;
  2086. if (arg)
  2087. goto out;
  2088. if (unlikely(vcpu->pid != current->pids[PIDTYPE_PID].pid)) {
  2089. /* The thread running this VCPU changed. */
  2090. struct pid *oldpid = vcpu->pid;
  2091. struct pid *newpid = get_task_pid(current, PIDTYPE_PID);
  2092. rcu_assign_pointer(vcpu->pid, newpid);
  2093. if (oldpid)
  2094. synchronize_rcu();
  2095. put_pid(oldpid);
  2096. }
  2097. r = kvm_arch_vcpu_ioctl_run(vcpu, vcpu->run);
  2098. trace_kvm_userspace_exit(vcpu->run->exit_reason, r);
  2099. break;
  2100. case KVM_GET_REGS: {
  2101. struct kvm_regs *kvm_regs;
  2102. r = -ENOMEM;
  2103. kvm_regs = kzalloc(sizeof(struct kvm_regs), GFP_KERNEL);
  2104. if (!kvm_regs)
  2105. goto out;
  2106. r = kvm_arch_vcpu_ioctl_get_regs(vcpu, kvm_regs);
  2107. if (r)
  2108. goto out_free1;
  2109. r = -EFAULT;
  2110. if (copy_to_user(argp, kvm_regs, sizeof(struct kvm_regs)))
  2111. goto out_free1;
  2112. r = 0;
  2113. out_free1:
  2114. kfree(kvm_regs);
  2115. break;
  2116. }
  2117. case KVM_SET_REGS: {
  2118. struct kvm_regs *kvm_regs;
  2119. r = -ENOMEM;
  2120. kvm_regs = memdup_user(argp, sizeof(*kvm_regs));
  2121. if (IS_ERR(kvm_regs)) {
  2122. r = PTR_ERR(kvm_regs);
  2123. goto out;
  2124. }
  2125. r = kvm_arch_vcpu_ioctl_set_regs(vcpu, kvm_regs);
  2126. kfree(kvm_regs);
  2127. break;
  2128. }
  2129. case KVM_GET_SREGS: {
  2130. kvm_sregs = kzalloc(sizeof(struct kvm_sregs), GFP_KERNEL);
  2131. r = -ENOMEM;
  2132. if (!kvm_sregs)
  2133. goto out;
  2134. r = kvm_arch_vcpu_ioctl_get_sregs(vcpu, kvm_sregs);
  2135. if (r)
  2136. goto out;
  2137. r = -EFAULT;
  2138. if (copy_to_user(argp, kvm_sregs, sizeof(struct kvm_sregs)))
  2139. goto out;
  2140. r = 0;
  2141. break;
  2142. }
  2143. case KVM_SET_SREGS: {
  2144. kvm_sregs = memdup_user(argp, sizeof(*kvm_sregs));
  2145. if (IS_ERR(kvm_sregs)) {
  2146. r = PTR_ERR(kvm_sregs);
  2147. kvm_sregs = NULL;
  2148. goto out;
  2149. }
  2150. r = kvm_arch_vcpu_ioctl_set_sregs(vcpu, kvm_sregs);
  2151. break;
  2152. }
  2153. case KVM_GET_MP_STATE: {
  2154. struct kvm_mp_state mp_state;
  2155. r = kvm_arch_vcpu_ioctl_get_mpstate(vcpu, &mp_state);
  2156. if (r)
  2157. goto out;
  2158. r = -EFAULT;
  2159. if (copy_to_user(argp, &mp_state, sizeof(mp_state)))
  2160. goto out;
  2161. r = 0;
  2162. break;
  2163. }
  2164. case KVM_SET_MP_STATE: {
  2165. struct kvm_mp_state mp_state;
  2166. r = -EFAULT;
  2167. if (copy_from_user(&mp_state, argp, sizeof(mp_state)))
  2168. goto out;
  2169. r = kvm_arch_vcpu_ioctl_set_mpstate(vcpu, &mp_state);
  2170. break;
  2171. }
  2172. case KVM_TRANSLATE: {
  2173. struct kvm_translation tr;
  2174. r = -EFAULT;
  2175. if (copy_from_user(&tr, argp, sizeof(tr)))
  2176. goto out;
  2177. r = kvm_arch_vcpu_ioctl_translate(vcpu, &tr);
  2178. if (r)
  2179. goto out;
  2180. r = -EFAULT;
  2181. if (copy_to_user(argp, &tr, sizeof(tr)))
  2182. goto out;
  2183. r = 0;
  2184. break;
  2185. }
  2186. case KVM_SET_GUEST_DEBUG: {
  2187. struct kvm_guest_debug dbg;
  2188. r = -EFAULT;
  2189. if (copy_from_user(&dbg, argp, sizeof(dbg)))
  2190. goto out;
  2191. r = kvm_arch_vcpu_ioctl_set_guest_debug(vcpu, &dbg);
  2192. break;
  2193. }
  2194. case KVM_SET_SIGNAL_MASK: {
  2195. struct kvm_signal_mask __user *sigmask_arg = argp;
  2196. struct kvm_signal_mask kvm_sigmask;
  2197. sigset_t sigset, *p;
  2198. p = NULL;
  2199. if (argp) {
  2200. r = -EFAULT;
  2201. if (copy_from_user(&kvm_sigmask, argp,
  2202. sizeof(kvm_sigmask)))
  2203. goto out;
  2204. r = -EINVAL;
  2205. if (kvm_sigmask.len != sizeof(sigset))
  2206. goto out;
  2207. r = -EFAULT;
  2208. if (copy_from_user(&sigset, sigmask_arg->sigset,
  2209. sizeof(sigset)))
  2210. goto out;
  2211. p = &sigset;
  2212. }
  2213. r = kvm_vcpu_ioctl_set_sigmask(vcpu, p);
  2214. break;
  2215. }
  2216. case KVM_GET_FPU: {
  2217. fpu = kzalloc(sizeof(struct kvm_fpu), GFP_KERNEL);
  2218. r = -ENOMEM;
  2219. if (!fpu)
  2220. goto out;
  2221. r = kvm_arch_vcpu_ioctl_get_fpu(vcpu, fpu);
  2222. if (r)
  2223. goto out;
  2224. r = -EFAULT;
  2225. if (copy_to_user(argp, fpu, sizeof(struct kvm_fpu)))
  2226. goto out;
  2227. r = 0;
  2228. break;
  2229. }
  2230. case KVM_SET_FPU: {
  2231. fpu = memdup_user(argp, sizeof(*fpu));
  2232. if (IS_ERR(fpu)) {
  2233. r = PTR_ERR(fpu);
  2234. fpu = NULL;
  2235. goto out;
  2236. }
  2237. r = kvm_arch_vcpu_ioctl_set_fpu(vcpu, fpu);
  2238. break;
  2239. }
  2240. default:
  2241. r = kvm_arch_vcpu_ioctl(filp, ioctl, arg);
  2242. }
  2243. out:
  2244. vcpu_put(vcpu);
  2245. kfree(fpu);
  2246. kfree(kvm_sregs);
  2247. return r;
  2248. }
  2249. #ifdef CONFIG_KVM_COMPAT
  2250. static long kvm_vcpu_compat_ioctl(struct file *filp,
  2251. unsigned int ioctl, unsigned long arg)
  2252. {
  2253. struct kvm_vcpu *vcpu = filp->private_data;
  2254. void __user *argp = compat_ptr(arg);
  2255. int r;
  2256. if (vcpu->kvm->mm != current->mm)
  2257. return -EIO;
  2258. switch (ioctl) {
  2259. case KVM_SET_SIGNAL_MASK: {
  2260. struct kvm_signal_mask __user *sigmask_arg = argp;
  2261. struct kvm_signal_mask kvm_sigmask;
  2262. compat_sigset_t csigset;
  2263. sigset_t sigset;
  2264. if (argp) {
  2265. r = -EFAULT;
  2266. if (copy_from_user(&kvm_sigmask, argp,
  2267. sizeof(kvm_sigmask)))
  2268. goto out;
  2269. r = -EINVAL;
  2270. if (kvm_sigmask.len != sizeof(csigset))
  2271. goto out;
  2272. r = -EFAULT;
  2273. if (copy_from_user(&csigset, sigmask_arg->sigset,
  2274. sizeof(csigset)))
  2275. goto out;
  2276. sigset_from_compat(&sigset, &csigset);
  2277. r = kvm_vcpu_ioctl_set_sigmask(vcpu, &sigset);
  2278. } else
  2279. r = kvm_vcpu_ioctl_set_sigmask(vcpu, NULL);
  2280. break;
  2281. }
  2282. default:
  2283. r = kvm_vcpu_ioctl(filp, ioctl, arg);
  2284. }
  2285. out:
  2286. return r;
  2287. }
  2288. #endif
  2289. static int kvm_device_ioctl_attr(struct kvm_device *dev,
  2290. int (*accessor)(struct kvm_device *dev,
  2291. struct kvm_device_attr *attr),
  2292. unsigned long arg)
  2293. {
  2294. struct kvm_device_attr attr;
  2295. if (!accessor)
  2296. return -EPERM;
  2297. if (copy_from_user(&attr, (void __user *)arg, sizeof(attr)))
  2298. return -EFAULT;
  2299. return accessor(dev, &attr);
  2300. }
  2301. static long kvm_device_ioctl(struct file *filp, unsigned int ioctl,
  2302. unsigned long arg)
  2303. {
  2304. struct kvm_device *dev = filp->private_data;
  2305. switch (ioctl) {
  2306. case KVM_SET_DEVICE_ATTR:
  2307. return kvm_device_ioctl_attr(dev, dev->ops->set_attr, arg);
  2308. case KVM_GET_DEVICE_ATTR:
  2309. return kvm_device_ioctl_attr(dev, dev->ops->get_attr, arg);
  2310. case KVM_HAS_DEVICE_ATTR:
  2311. return kvm_device_ioctl_attr(dev, dev->ops->has_attr, arg);
  2312. default:
  2313. if (dev->ops->ioctl)
  2314. return dev->ops->ioctl(dev, ioctl, arg);
  2315. return -ENOTTY;
  2316. }
  2317. }
  2318. static int kvm_device_release(struct inode *inode, struct file *filp)
  2319. {
  2320. struct kvm_device *dev = filp->private_data;
  2321. struct kvm *kvm = dev->kvm;
  2322. kvm_put_kvm(kvm);
  2323. return 0;
  2324. }
  2325. static const struct file_operations kvm_device_fops = {
  2326. .unlocked_ioctl = kvm_device_ioctl,
  2327. #ifdef CONFIG_KVM_COMPAT
  2328. .compat_ioctl = kvm_device_ioctl,
  2329. #endif
  2330. .release = kvm_device_release,
  2331. };
  2332. struct kvm_device *kvm_device_from_filp(struct file *filp)
  2333. {
  2334. if (filp->f_op != &kvm_device_fops)
  2335. return NULL;
  2336. return filp->private_data;
  2337. }
  2338. static struct kvm_device_ops *kvm_device_ops_table[KVM_DEV_TYPE_MAX] = {
  2339. #ifdef CONFIG_KVM_MPIC
  2340. [KVM_DEV_TYPE_FSL_MPIC_20] = &kvm_mpic_ops,
  2341. [KVM_DEV_TYPE_FSL_MPIC_42] = &kvm_mpic_ops,
  2342. #endif
  2343. #ifdef CONFIG_KVM_XICS
  2344. [KVM_DEV_TYPE_XICS] = &kvm_xics_ops,
  2345. #endif
  2346. };
  2347. int kvm_register_device_ops(struct kvm_device_ops *ops, u32 type)
  2348. {
  2349. if (type >= ARRAY_SIZE(kvm_device_ops_table))
  2350. return -ENOSPC;
  2351. if (kvm_device_ops_table[type] != NULL)
  2352. return -EEXIST;
  2353. kvm_device_ops_table[type] = ops;
  2354. return 0;
  2355. }
  2356. void kvm_unregister_device_ops(u32 type)
  2357. {
  2358. if (kvm_device_ops_table[type] != NULL)
  2359. kvm_device_ops_table[type] = NULL;
  2360. }
  2361. static int kvm_ioctl_create_device(struct kvm *kvm,
  2362. struct kvm_create_device *cd)
  2363. {
  2364. struct kvm_device_ops *ops = NULL;
  2365. struct kvm_device *dev;
  2366. bool test = cd->flags & KVM_CREATE_DEVICE_TEST;
  2367. int ret;
  2368. if (cd->type >= ARRAY_SIZE(kvm_device_ops_table))
  2369. return -ENODEV;
  2370. ops = kvm_device_ops_table[cd->type];
  2371. if (ops == NULL)
  2372. return -ENODEV;
  2373. if (test)
  2374. return 0;
  2375. dev = kzalloc(sizeof(*dev), GFP_KERNEL);
  2376. if (!dev)
  2377. return -ENOMEM;
  2378. dev->ops = ops;
  2379. dev->kvm = kvm;
  2380. ret = ops->create(dev, cd->type);
  2381. if (ret < 0) {
  2382. kfree(dev);
  2383. return ret;
  2384. }
  2385. ret = anon_inode_getfd(ops->name, &kvm_device_fops, dev, O_RDWR | O_CLOEXEC);
  2386. if (ret < 0) {
  2387. ops->destroy(dev);
  2388. return ret;
  2389. }
  2390. list_add(&dev->vm_node, &kvm->devices);
  2391. kvm_get_kvm(kvm);
  2392. cd->fd = ret;
  2393. return 0;
  2394. }
  2395. static long kvm_vm_ioctl_check_extension_generic(struct kvm *kvm, long arg)
  2396. {
  2397. switch (arg) {
  2398. case KVM_CAP_USER_MEMORY:
  2399. case KVM_CAP_DESTROY_MEMORY_REGION_WORKS:
  2400. case KVM_CAP_JOIN_MEMORY_REGIONS_WORKS:
  2401. case KVM_CAP_INTERNAL_ERROR_DATA:
  2402. #ifdef CONFIG_HAVE_KVM_MSI
  2403. case KVM_CAP_SIGNAL_MSI:
  2404. #endif
  2405. #ifdef CONFIG_HAVE_KVM_IRQFD
  2406. case KVM_CAP_IRQFD:
  2407. case KVM_CAP_IRQFD_RESAMPLE:
  2408. #endif
  2409. case KVM_CAP_IOEVENTFD_ANY_LENGTH:
  2410. case KVM_CAP_CHECK_EXTENSION_VM:
  2411. return 1;
  2412. #ifdef CONFIG_HAVE_KVM_IRQ_ROUTING
  2413. case KVM_CAP_IRQ_ROUTING:
  2414. return KVM_MAX_IRQ_ROUTES;
  2415. #endif
  2416. #if KVM_ADDRESS_SPACE_NUM > 1
  2417. case KVM_CAP_MULTI_ADDRESS_SPACE:
  2418. return KVM_ADDRESS_SPACE_NUM;
  2419. #endif
  2420. case KVM_CAP_MAX_VCPU_ID:
  2421. return KVM_MAX_VCPU_ID;
  2422. default:
  2423. break;
  2424. }
  2425. return kvm_vm_ioctl_check_extension(kvm, arg);
  2426. }
  2427. static long kvm_vm_ioctl(struct file *filp,
  2428. unsigned int ioctl, unsigned long arg)
  2429. {
  2430. struct kvm *kvm = filp->private_data;
  2431. void __user *argp = (void __user *)arg;
  2432. int r;
  2433. if (kvm->mm != current->mm)
  2434. return -EIO;
  2435. switch (ioctl) {
  2436. case KVM_CREATE_VCPU:
  2437. r = kvm_vm_ioctl_create_vcpu(kvm, arg);
  2438. break;
  2439. case KVM_SET_USER_MEMORY_REGION: {
  2440. struct kvm_userspace_memory_region kvm_userspace_mem;
  2441. r = -EFAULT;
  2442. if (copy_from_user(&kvm_userspace_mem, argp,
  2443. sizeof(kvm_userspace_mem)))
  2444. goto out;
  2445. r = kvm_vm_ioctl_set_memory_region(kvm, &kvm_userspace_mem);
  2446. break;
  2447. }
  2448. case KVM_GET_DIRTY_LOG: {
  2449. struct kvm_dirty_log log;
  2450. r = -EFAULT;
  2451. if (copy_from_user(&log, argp, sizeof(log)))
  2452. goto out;
  2453. r = kvm_vm_ioctl_get_dirty_log(kvm, &log);
  2454. break;
  2455. }
  2456. #ifdef KVM_COALESCED_MMIO_PAGE_OFFSET
  2457. case KVM_REGISTER_COALESCED_MMIO: {
  2458. struct kvm_coalesced_mmio_zone zone;
  2459. r = -EFAULT;
  2460. if (copy_from_user(&zone, argp, sizeof(zone)))
  2461. goto out;
  2462. r = kvm_vm_ioctl_register_coalesced_mmio(kvm, &zone);
  2463. break;
  2464. }
  2465. case KVM_UNREGISTER_COALESCED_MMIO: {
  2466. struct kvm_coalesced_mmio_zone zone;
  2467. r = -EFAULT;
  2468. if (copy_from_user(&zone, argp, sizeof(zone)))
  2469. goto out;
  2470. r = kvm_vm_ioctl_unregister_coalesced_mmio(kvm, &zone);
  2471. break;
  2472. }
  2473. #endif
  2474. case KVM_IRQFD: {
  2475. struct kvm_irqfd data;
  2476. r = -EFAULT;
  2477. if (copy_from_user(&data, argp, sizeof(data)))
  2478. goto out;
  2479. r = kvm_irqfd(kvm, &data);
  2480. break;
  2481. }
  2482. case KVM_IOEVENTFD: {
  2483. struct kvm_ioeventfd data;
  2484. r = -EFAULT;
  2485. if (copy_from_user(&data, argp, sizeof(data)))
  2486. goto out;
  2487. r = kvm_ioeventfd(kvm, &data);
  2488. break;
  2489. }
  2490. #ifdef CONFIG_HAVE_KVM_MSI
  2491. case KVM_SIGNAL_MSI: {
  2492. struct kvm_msi msi;
  2493. r = -EFAULT;
  2494. if (copy_from_user(&msi, argp, sizeof(msi)))
  2495. goto out;
  2496. r = kvm_send_userspace_msi(kvm, &msi);
  2497. break;
  2498. }
  2499. #endif
  2500. #ifdef __KVM_HAVE_IRQ_LINE
  2501. case KVM_IRQ_LINE_STATUS:
  2502. case KVM_IRQ_LINE: {
  2503. struct kvm_irq_level irq_event;
  2504. r = -EFAULT;
  2505. if (copy_from_user(&irq_event, argp, sizeof(irq_event)))
  2506. goto out;
  2507. r = kvm_vm_ioctl_irq_line(kvm, &irq_event,
  2508. ioctl == KVM_IRQ_LINE_STATUS);
  2509. if (r)
  2510. goto out;
  2511. r = -EFAULT;
  2512. if (ioctl == KVM_IRQ_LINE_STATUS) {
  2513. if (copy_to_user(argp, &irq_event, sizeof(irq_event)))
  2514. goto out;
  2515. }
  2516. r = 0;
  2517. break;
  2518. }
  2519. #endif
  2520. #ifdef CONFIG_HAVE_KVM_IRQ_ROUTING
  2521. case KVM_SET_GSI_ROUTING: {
  2522. struct kvm_irq_routing routing;
  2523. struct kvm_irq_routing __user *urouting;
  2524. struct kvm_irq_routing_entry *entries = NULL;
  2525. r = -EFAULT;
  2526. if (copy_from_user(&routing, argp, sizeof(routing)))
  2527. goto out;
  2528. r = -EINVAL;
  2529. if (routing.nr > KVM_MAX_IRQ_ROUTES)
  2530. goto out;
  2531. if (routing.flags)
  2532. goto out;
  2533. if (routing.nr) {
  2534. r = -ENOMEM;
  2535. entries = vmalloc(routing.nr * sizeof(*entries));
  2536. if (!entries)
  2537. goto out;
  2538. r = -EFAULT;
  2539. urouting = argp;
  2540. if (copy_from_user(entries, urouting->entries,
  2541. routing.nr * sizeof(*entries)))
  2542. goto out_free_irq_routing;
  2543. }
  2544. r = kvm_set_irq_routing(kvm, entries, routing.nr,
  2545. routing.flags);
  2546. out_free_irq_routing:
  2547. vfree(entries);
  2548. break;
  2549. }
  2550. #endif /* CONFIG_HAVE_KVM_IRQ_ROUTING */
  2551. case KVM_CREATE_DEVICE: {
  2552. struct kvm_create_device cd;
  2553. r = -EFAULT;
  2554. if (copy_from_user(&cd, argp, sizeof(cd)))
  2555. goto out;
  2556. r = kvm_ioctl_create_device(kvm, &cd);
  2557. if (r)
  2558. goto out;
  2559. r = -EFAULT;
  2560. if (copy_to_user(argp, &cd, sizeof(cd)))
  2561. goto out;
  2562. r = 0;
  2563. break;
  2564. }
  2565. case KVM_CHECK_EXTENSION:
  2566. r = kvm_vm_ioctl_check_extension_generic(kvm, arg);
  2567. break;
  2568. default:
  2569. r = kvm_arch_vm_ioctl(filp, ioctl, arg);
  2570. }
  2571. out:
  2572. return r;
  2573. }
  2574. #ifdef CONFIG_KVM_COMPAT
  2575. struct compat_kvm_dirty_log {
  2576. __u32 slot;
  2577. __u32 padding1;
  2578. union {
  2579. compat_uptr_t dirty_bitmap; /* one bit per page */
  2580. __u64 padding2;
  2581. };
  2582. };
  2583. static long kvm_vm_compat_ioctl(struct file *filp,
  2584. unsigned int ioctl, unsigned long arg)
  2585. {
  2586. struct kvm *kvm = filp->private_data;
  2587. int r;
  2588. if (kvm->mm != current->mm)
  2589. return -EIO;
  2590. switch (ioctl) {
  2591. case KVM_GET_DIRTY_LOG: {
  2592. struct compat_kvm_dirty_log compat_log;
  2593. struct kvm_dirty_log log;
  2594. r = -EFAULT;
  2595. if (copy_from_user(&compat_log, (void __user *)arg,
  2596. sizeof(compat_log)))
  2597. goto out;
  2598. log.slot = compat_log.slot;
  2599. log.padding1 = compat_log.padding1;
  2600. log.padding2 = compat_log.padding2;
  2601. log.dirty_bitmap = compat_ptr(compat_log.dirty_bitmap);
  2602. r = kvm_vm_ioctl_get_dirty_log(kvm, &log);
  2603. break;
  2604. }
  2605. default:
  2606. r = kvm_vm_ioctl(filp, ioctl, arg);
  2607. }
  2608. out:
  2609. return r;
  2610. }
  2611. #endif
  2612. static struct file_operations kvm_vm_fops = {
  2613. .release = kvm_vm_release,
  2614. .unlocked_ioctl = kvm_vm_ioctl,
  2615. #ifdef CONFIG_KVM_COMPAT
  2616. .compat_ioctl = kvm_vm_compat_ioctl,
  2617. #endif
  2618. .llseek = noop_llseek,
  2619. };
  2620. static int kvm_dev_ioctl_create_vm(unsigned long type)
  2621. {
  2622. int r;
  2623. struct kvm *kvm;
  2624. struct file *file;
  2625. kvm = kvm_create_vm(type);
  2626. if (IS_ERR(kvm))
  2627. return PTR_ERR(kvm);
  2628. #ifdef KVM_COALESCED_MMIO_PAGE_OFFSET
  2629. r = kvm_coalesced_mmio_init(kvm);
  2630. if (r < 0) {
  2631. kvm_put_kvm(kvm);
  2632. return r;
  2633. }
  2634. #endif
  2635. r = get_unused_fd_flags(O_CLOEXEC);
  2636. if (r < 0) {
  2637. kvm_put_kvm(kvm);
  2638. return r;
  2639. }
  2640. file = anon_inode_getfile("kvm-vm", &kvm_vm_fops, kvm, O_RDWR);
  2641. if (IS_ERR(file)) {
  2642. put_unused_fd(r);
  2643. kvm_put_kvm(kvm);
  2644. return PTR_ERR(file);
  2645. }
  2646. if (kvm_create_vm_debugfs(kvm, r) < 0) {
  2647. put_unused_fd(r);
  2648. fput(file);
  2649. return -ENOMEM;
  2650. }
  2651. fd_install(r, file);
  2652. return r;
  2653. }
  2654. static long kvm_dev_ioctl(struct file *filp,
  2655. unsigned int ioctl, unsigned long arg)
  2656. {
  2657. long r = -EINVAL;
  2658. switch (ioctl) {
  2659. case KVM_GET_API_VERSION:
  2660. if (arg)
  2661. goto out;
  2662. r = KVM_API_VERSION;
  2663. break;
  2664. case KVM_CREATE_VM:
  2665. r = kvm_dev_ioctl_create_vm(arg);
  2666. break;
  2667. case KVM_CHECK_EXTENSION:
  2668. r = kvm_vm_ioctl_check_extension_generic(NULL, arg);
  2669. break;
  2670. case KVM_GET_VCPU_MMAP_SIZE:
  2671. if (arg)
  2672. goto out;
  2673. r = PAGE_SIZE; /* struct kvm_run */
  2674. #ifdef CONFIG_X86
  2675. r += PAGE_SIZE; /* pio data page */
  2676. #endif
  2677. #ifdef KVM_COALESCED_MMIO_PAGE_OFFSET
  2678. r += PAGE_SIZE; /* coalesced mmio ring page */
  2679. #endif
  2680. break;
  2681. case KVM_TRACE_ENABLE:
  2682. case KVM_TRACE_PAUSE:
  2683. case KVM_TRACE_DISABLE:
  2684. r = -EOPNOTSUPP;
  2685. break;
  2686. default:
  2687. return kvm_arch_dev_ioctl(filp, ioctl, arg);
  2688. }
  2689. out:
  2690. return r;
  2691. }
  2692. static struct file_operations kvm_chardev_ops = {
  2693. .unlocked_ioctl = kvm_dev_ioctl,
  2694. .compat_ioctl = kvm_dev_ioctl,
  2695. .llseek = noop_llseek,
  2696. };
  2697. static struct miscdevice kvm_dev = {
  2698. KVM_MINOR,
  2699. "kvm",
  2700. &kvm_chardev_ops,
  2701. };
  2702. static void hardware_enable_nolock(void *junk)
  2703. {
  2704. int cpu = raw_smp_processor_id();
  2705. int r;
  2706. if (cpumask_test_cpu(cpu, cpus_hardware_enabled))
  2707. return;
  2708. cpumask_set_cpu(cpu, cpus_hardware_enabled);
  2709. r = kvm_arch_hardware_enable();
  2710. if (r) {
  2711. cpumask_clear_cpu(cpu, cpus_hardware_enabled);
  2712. atomic_inc(&hardware_enable_failed);
  2713. pr_info("kvm: enabling virtualization on CPU%d failed\n", cpu);
  2714. }
  2715. }
  2716. static int kvm_starting_cpu(unsigned int cpu)
  2717. {
  2718. raw_spin_lock(&kvm_count_lock);
  2719. if (kvm_usage_count)
  2720. hardware_enable_nolock(NULL);
  2721. raw_spin_unlock(&kvm_count_lock);
  2722. return 0;
  2723. }
  2724. static void hardware_disable_nolock(void *junk)
  2725. {
  2726. int cpu = raw_smp_processor_id();
  2727. if (!cpumask_test_cpu(cpu, cpus_hardware_enabled))
  2728. return;
  2729. cpumask_clear_cpu(cpu, cpus_hardware_enabled);
  2730. kvm_arch_hardware_disable();
  2731. }
  2732. static int kvm_dying_cpu(unsigned int cpu)
  2733. {
  2734. raw_spin_lock(&kvm_count_lock);
  2735. if (kvm_usage_count)
  2736. hardware_disable_nolock(NULL);
  2737. raw_spin_unlock(&kvm_count_lock);
  2738. return 0;
  2739. }
  2740. static void hardware_disable_all_nolock(void)
  2741. {
  2742. BUG_ON(!kvm_usage_count);
  2743. kvm_usage_count--;
  2744. if (!kvm_usage_count)
  2745. on_each_cpu(hardware_disable_nolock, NULL, 1);
  2746. }
  2747. static void hardware_disable_all(void)
  2748. {
  2749. raw_spin_lock(&kvm_count_lock);
  2750. hardware_disable_all_nolock();
  2751. raw_spin_unlock(&kvm_count_lock);
  2752. }
  2753. static int hardware_enable_all(void)
  2754. {
  2755. int r = 0;
  2756. raw_spin_lock(&kvm_count_lock);
  2757. kvm_usage_count++;
  2758. if (kvm_usage_count == 1) {
  2759. atomic_set(&hardware_enable_failed, 0);
  2760. on_each_cpu(hardware_enable_nolock, NULL, 1);
  2761. if (atomic_read(&hardware_enable_failed)) {
  2762. hardware_disable_all_nolock();
  2763. r = -EBUSY;
  2764. }
  2765. }
  2766. raw_spin_unlock(&kvm_count_lock);
  2767. return r;
  2768. }
  2769. static int kvm_reboot(struct notifier_block *notifier, unsigned long val,
  2770. void *v)
  2771. {
  2772. /*
  2773. * Some (well, at least mine) BIOSes hang on reboot if
  2774. * in vmx root mode.
  2775. *
  2776. * And Intel TXT required VMX off for all cpu when system shutdown.
  2777. */
  2778. pr_info("kvm: exiting hardware virtualization\n");
  2779. kvm_rebooting = true;
  2780. on_each_cpu(hardware_disable_nolock, NULL, 1);
  2781. return NOTIFY_OK;
  2782. }
  2783. static struct notifier_block kvm_reboot_notifier = {
  2784. .notifier_call = kvm_reboot,
  2785. .priority = 0,
  2786. };
  2787. static void kvm_io_bus_destroy(struct kvm_io_bus *bus)
  2788. {
  2789. int i;
  2790. for (i = 0; i < bus->dev_count; i++) {
  2791. struct kvm_io_device *pos = bus->range[i].dev;
  2792. kvm_iodevice_destructor(pos);
  2793. }
  2794. kfree(bus);
  2795. }
  2796. static inline int kvm_io_bus_cmp(const struct kvm_io_range *r1,
  2797. const struct kvm_io_range *r2)
  2798. {
  2799. gpa_t addr1 = r1->addr;
  2800. gpa_t addr2 = r2->addr;
  2801. if (addr1 < addr2)
  2802. return -1;
  2803. /* If r2->len == 0, match the exact address. If r2->len != 0,
  2804. * accept any overlapping write. Any order is acceptable for
  2805. * overlapping ranges, because kvm_io_bus_get_first_dev ensures
  2806. * we process all of them.
  2807. */
  2808. if (r2->len) {
  2809. addr1 += r1->len;
  2810. addr2 += r2->len;
  2811. }
  2812. if (addr1 > addr2)
  2813. return 1;
  2814. return 0;
  2815. }
  2816. static int kvm_io_bus_sort_cmp(const void *p1, const void *p2)
  2817. {
  2818. return kvm_io_bus_cmp(p1, p2);
  2819. }
  2820. static int kvm_io_bus_insert_dev(struct kvm_io_bus *bus, struct kvm_io_device *dev,
  2821. gpa_t addr, int len)
  2822. {
  2823. bus->range[bus->dev_count++] = (struct kvm_io_range) {
  2824. .addr = addr,
  2825. .len = len,
  2826. .dev = dev,
  2827. };
  2828. sort(bus->range, bus->dev_count, sizeof(struct kvm_io_range),
  2829. kvm_io_bus_sort_cmp, NULL);
  2830. return 0;
  2831. }
  2832. static int kvm_io_bus_get_first_dev(struct kvm_io_bus *bus,
  2833. gpa_t addr, int len)
  2834. {
  2835. struct kvm_io_range *range, key;
  2836. int off;
  2837. key = (struct kvm_io_range) {
  2838. .addr = addr,
  2839. .len = len,
  2840. };
  2841. range = bsearch(&key, bus->range, bus->dev_count,
  2842. sizeof(struct kvm_io_range), kvm_io_bus_sort_cmp);
  2843. if (range == NULL)
  2844. return -ENOENT;
  2845. off = range - bus->range;
  2846. while (off > 0 && kvm_io_bus_cmp(&key, &bus->range[off-1]) == 0)
  2847. off--;
  2848. return off;
  2849. }
  2850. static int __kvm_io_bus_write(struct kvm_vcpu *vcpu, struct kvm_io_bus *bus,
  2851. struct kvm_io_range *range, const void *val)
  2852. {
  2853. int idx;
  2854. idx = kvm_io_bus_get_first_dev(bus, range->addr, range->len);
  2855. if (idx < 0)
  2856. return -EOPNOTSUPP;
  2857. while (idx < bus->dev_count &&
  2858. kvm_io_bus_cmp(range, &bus->range[idx]) == 0) {
  2859. if (!kvm_iodevice_write(vcpu, bus->range[idx].dev, range->addr,
  2860. range->len, val))
  2861. return idx;
  2862. idx++;
  2863. }
  2864. return -EOPNOTSUPP;
  2865. }
  2866. /* kvm_io_bus_write - called under kvm->slots_lock */
  2867. int kvm_io_bus_write(struct kvm_vcpu *vcpu, enum kvm_bus bus_idx, gpa_t addr,
  2868. int len, const void *val)
  2869. {
  2870. struct kvm_io_bus *bus;
  2871. struct kvm_io_range range;
  2872. int r;
  2873. range = (struct kvm_io_range) {
  2874. .addr = addr,
  2875. .len = len,
  2876. };
  2877. bus = srcu_dereference(vcpu->kvm->buses[bus_idx], &vcpu->kvm->srcu);
  2878. r = __kvm_io_bus_write(vcpu, bus, &range, val);
  2879. return r < 0 ? r : 0;
  2880. }
  2881. /* kvm_io_bus_write_cookie - called under kvm->slots_lock */
  2882. int kvm_io_bus_write_cookie(struct kvm_vcpu *vcpu, enum kvm_bus bus_idx,
  2883. gpa_t addr, int len, const void *val, long cookie)
  2884. {
  2885. struct kvm_io_bus *bus;
  2886. struct kvm_io_range range;
  2887. range = (struct kvm_io_range) {
  2888. .addr = addr,
  2889. .len = len,
  2890. };
  2891. bus = srcu_dereference(vcpu->kvm->buses[bus_idx], &vcpu->kvm->srcu);
  2892. /* First try the device referenced by cookie. */
  2893. if ((cookie >= 0) && (cookie < bus->dev_count) &&
  2894. (kvm_io_bus_cmp(&range, &bus->range[cookie]) == 0))
  2895. if (!kvm_iodevice_write(vcpu, bus->range[cookie].dev, addr, len,
  2896. val))
  2897. return cookie;
  2898. /*
  2899. * cookie contained garbage; fall back to search and return the
  2900. * correct cookie value.
  2901. */
  2902. return __kvm_io_bus_write(vcpu, bus, &range, val);
  2903. }
  2904. static int __kvm_io_bus_read(struct kvm_vcpu *vcpu, struct kvm_io_bus *bus,
  2905. struct kvm_io_range *range, void *val)
  2906. {
  2907. int idx;
  2908. idx = kvm_io_bus_get_first_dev(bus, range->addr, range->len);
  2909. if (idx < 0)
  2910. return -EOPNOTSUPP;
  2911. while (idx < bus->dev_count &&
  2912. kvm_io_bus_cmp(range, &bus->range[idx]) == 0) {
  2913. if (!kvm_iodevice_read(vcpu, bus->range[idx].dev, range->addr,
  2914. range->len, val))
  2915. return idx;
  2916. idx++;
  2917. }
  2918. return -EOPNOTSUPP;
  2919. }
  2920. EXPORT_SYMBOL_GPL(kvm_io_bus_write);
  2921. /* kvm_io_bus_read - called under kvm->slots_lock */
  2922. int kvm_io_bus_read(struct kvm_vcpu *vcpu, enum kvm_bus bus_idx, gpa_t addr,
  2923. int len, void *val)
  2924. {
  2925. struct kvm_io_bus *bus;
  2926. struct kvm_io_range range;
  2927. int r;
  2928. range = (struct kvm_io_range) {
  2929. .addr = addr,
  2930. .len = len,
  2931. };
  2932. bus = srcu_dereference(vcpu->kvm->buses[bus_idx], &vcpu->kvm->srcu);
  2933. r = __kvm_io_bus_read(vcpu, bus, &range, val);
  2934. return r < 0 ? r : 0;
  2935. }
  2936. /* Caller must hold slots_lock. */
  2937. int kvm_io_bus_register_dev(struct kvm *kvm, enum kvm_bus bus_idx, gpa_t addr,
  2938. int len, struct kvm_io_device *dev)
  2939. {
  2940. struct kvm_io_bus *new_bus, *bus;
  2941. bus = kvm->buses[bus_idx];
  2942. /* exclude ioeventfd which is limited by maximum fd */
  2943. if (bus->dev_count - bus->ioeventfd_count > NR_IOBUS_DEVS - 1)
  2944. return -ENOSPC;
  2945. new_bus = kmalloc(sizeof(*bus) + ((bus->dev_count + 1) *
  2946. sizeof(struct kvm_io_range)), GFP_KERNEL);
  2947. if (!new_bus)
  2948. return -ENOMEM;
  2949. memcpy(new_bus, bus, sizeof(*bus) + (bus->dev_count *
  2950. sizeof(struct kvm_io_range)));
  2951. kvm_io_bus_insert_dev(new_bus, dev, addr, len);
  2952. rcu_assign_pointer(kvm->buses[bus_idx], new_bus);
  2953. synchronize_srcu_expedited(&kvm->srcu);
  2954. kfree(bus);
  2955. return 0;
  2956. }
  2957. /* Caller must hold slots_lock. */
  2958. int kvm_io_bus_unregister_dev(struct kvm *kvm, enum kvm_bus bus_idx,
  2959. struct kvm_io_device *dev)
  2960. {
  2961. int i, r;
  2962. struct kvm_io_bus *new_bus, *bus;
  2963. bus = kvm->buses[bus_idx];
  2964. r = -ENOENT;
  2965. for (i = 0; i < bus->dev_count; i++)
  2966. if (bus->range[i].dev == dev) {
  2967. r = 0;
  2968. break;
  2969. }
  2970. if (r)
  2971. return r;
  2972. new_bus = kmalloc(sizeof(*bus) + ((bus->dev_count - 1) *
  2973. sizeof(struct kvm_io_range)), GFP_KERNEL);
  2974. if (!new_bus)
  2975. return -ENOMEM;
  2976. memcpy(new_bus, bus, sizeof(*bus) + i * sizeof(struct kvm_io_range));
  2977. new_bus->dev_count--;
  2978. memcpy(new_bus->range + i, bus->range + i + 1,
  2979. (new_bus->dev_count - i) * sizeof(struct kvm_io_range));
  2980. rcu_assign_pointer(kvm->buses[bus_idx], new_bus);
  2981. synchronize_srcu_expedited(&kvm->srcu);
  2982. kfree(bus);
  2983. return r;
  2984. }
  2985. struct kvm_io_device *kvm_io_bus_get_dev(struct kvm *kvm, enum kvm_bus bus_idx,
  2986. gpa_t addr)
  2987. {
  2988. struct kvm_io_bus *bus;
  2989. int dev_idx, srcu_idx;
  2990. struct kvm_io_device *iodev = NULL;
  2991. srcu_idx = srcu_read_lock(&kvm->srcu);
  2992. bus = srcu_dereference(kvm->buses[bus_idx], &kvm->srcu);
  2993. dev_idx = kvm_io_bus_get_first_dev(bus, addr, 1);
  2994. if (dev_idx < 0)
  2995. goto out_unlock;
  2996. iodev = bus->range[dev_idx].dev;
  2997. out_unlock:
  2998. srcu_read_unlock(&kvm->srcu, srcu_idx);
  2999. return iodev;
  3000. }
  3001. EXPORT_SYMBOL_GPL(kvm_io_bus_get_dev);
  3002. static int kvm_debugfs_open(struct inode *inode, struct file *file,
  3003. int (*get)(void *, u64 *), int (*set)(void *, u64),
  3004. const char *fmt)
  3005. {
  3006. struct kvm_stat_data *stat_data = (struct kvm_stat_data *)
  3007. inode->i_private;
  3008. /* The debugfs files are a reference to the kvm struct which
  3009. * is still valid when kvm_destroy_vm is called.
  3010. * To avoid the race between open and the removal of the debugfs
  3011. * directory we test against the users count.
  3012. */
  3013. if (!atomic_add_unless(&stat_data->kvm->users_count, 1, 0))
  3014. return -ENOENT;
  3015. if (simple_attr_open(inode, file, get, set, fmt)) {
  3016. kvm_put_kvm(stat_data->kvm);
  3017. return -ENOMEM;
  3018. }
  3019. return 0;
  3020. }
  3021. static int kvm_debugfs_release(struct inode *inode, struct file *file)
  3022. {
  3023. struct kvm_stat_data *stat_data = (struct kvm_stat_data *)
  3024. inode->i_private;
  3025. simple_attr_release(inode, file);
  3026. kvm_put_kvm(stat_data->kvm);
  3027. return 0;
  3028. }
  3029. static int vm_stat_get_per_vm(void *data, u64 *val)
  3030. {
  3031. struct kvm_stat_data *stat_data = (struct kvm_stat_data *)data;
  3032. *val = *(u32 *)((void *)stat_data->kvm + stat_data->offset);
  3033. return 0;
  3034. }
  3035. static int vm_stat_get_per_vm_open(struct inode *inode, struct file *file)
  3036. {
  3037. __simple_attr_check_format("%llu\n", 0ull);
  3038. return kvm_debugfs_open(inode, file, vm_stat_get_per_vm,
  3039. NULL, "%llu\n");
  3040. }
  3041. static const struct file_operations vm_stat_get_per_vm_fops = {
  3042. .owner = THIS_MODULE,
  3043. .open = vm_stat_get_per_vm_open,
  3044. .release = kvm_debugfs_release,
  3045. .read = simple_attr_read,
  3046. .write = simple_attr_write,
  3047. .llseek = generic_file_llseek,
  3048. };
  3049. static int vcpu_stat_get_per_vm(void *data, u64 *val)
  3050. {
  3051. int i;
  3052. struct kvm_stat_data *stat_data = (struct kvm_stat_data *)data;
  3053. struct kvm_vcpu *vcpu;
  3054. *val = 0;
  3055. kvm_for_each_vcpu(i, vcpu, stat_data->kvm)
  3056. *val += *(u32 *)((void *)vcpu + stat_data->offset);
  3057. return 0;
  3058. }
  3059. static int vcpu_stat_get_per_vm_open(struct inode *inode, struct file *file)
  3060. {
  3061. __simple_attr_check_format("%llu\n", 0ull);
  3062. return kvm_debugfs_open(inode, file, vcpu_stat_get_per_vm,
  3063. NULL, "%llu\n");
  3064. }
  3065. static const struct file_operations vcpu_stat_get_per_vm_fops = {
  3066. .owner = THIS_MODULE,
  3067. .open = vcpu_stat_get_per_vm_open,
  3068. .release = kvm_debugfs_release,
  3069. .read = simple_attr_read,
  3070. .write = simple_attr_write,
  3071. .llseek = generic_file_llseek,
  3072. };
  3073. static const struct file_operations *stat_fops_per_vm[] = {
  3074. [KVM_STAT_VCPU] = &vcpu_stat_get_per_vm_fops,
  3075. [KVM_STAT_VM] = &vm_stat_get_per_vm_fops,
  3076. };
  3077. static int vm_stat_get(void *_offset, u64 *val)
  3078. {
  3079. unsigned offset = (long)_offset;
  3080. struct kvm *kvm;
  3081. struct kvm_stat_data stat_tmp = {.offset = offset};
  3082. u64 tmp_val;
  3083. *val = 0;
  3084. spin_lock(&kvm_lock);
  3085. list_for_each_entry(kvm, &vm_list, vm_list) {
  3086. stat_tmp.kvm = kvm;
  3087. vm_stat_get_per_vm((void *)&stat_tmp, &tmp_val);
  3088. *val += tmp_val;
  3089. }
  3090. spin_unlock(&kvm_lock);
  3091. return 0;
  3092. }
  3093. DEFINE_SIMPLE_ATTRIBUTE(vm_stat_fops, vm_stat_get, NULL, "%llu\n");
  3094. static int vcpu_stat_get(void *_offset, u64 *val)
  3095. {
  3096. unsigned offset = (long)_offset;
  3097. struct kvm *kvm;
  3098. struct kvm_stat_data stat_tmp = {.offset = offset};
  3099. u64 tmp_val;
  3100. *val = 0;
  3101. spin_lock(&kvm_lock);
  3102. list_for_each_entry(kvm, &vm_list, vm_list) {
  3103. stat_tmp.kvm = kvm;
  3104. vcpu_stat_get_per_vm((void *)&stat_tmp, &tmp_val);
  3105. *val += tmp_val;
  3106. }
  3107. spin_unlock(&kvm_lock);
  3108. return 0;
  3109. }
  3110. DEFINE_SIMPLE_ATTRIBUTE(vcpu_stat_fops, vcpu_stat_get, NULL, "%llu\n");
  3111. static const struct file_operations *stat_fops[] = {
  3112. [KVM_STAT_VCPU] = &vcpu_stat_fops,
  3113. [KVM_STAT_VM] = &vm_stat_fops,
  3114. };
  3115. static int kvm_init_debug(void)
  3116. {
  3117. int r = -EEXIST;
  3118. struct kvm_stats_debugfs_item *p;
  3119. kvm_debugfs_dir = debugfs_create_dir("kvm", NULL);
  3120. if (kvm_debugfs_dir == NULL)
  3121. goto out;
  3122. kvm_debugfs_num_entries = 0;
  3123. for (p = debugfs_entries; p->name; ++p, kvm_debugfs_num_entries++) {
  3124. if (!debugfs_create_file(p->name, 0444, kvm_debugfs_dir,
  3125. (void *)(long)p->offset,
  3126. stat_fops[p->kind]))
  3127. goto out_dir;
  3128. }
  3129. return 0;
  3130. out_dir:
  3131. debugfs_remove_recursive(kvm_debugfs_dir);
  3132. out:
  3133. return r;
  3134. }
  3135. static int kvm_suspend(void)
  3136. {
  3137. if (kvm_usage_count)
  3138. hardware_disable_nolock(NULL);
  3139. return 0;
  3140. }
  3141. static void kvm_resume(void)
  3142. {
  3143. if (kvm_usage_count) {
  3144. WARN_ON(raw_spin_is_locked(&kvm_count_lock));
  3145. hardware_enable_nolock(NULL);
  3146. }
  3147. }
  3148. static struct syscore_ops kvm_syscore_ops = {
  3149. .suspend = kvm_suspend,
  3150. .resume = kvm_resume,
  3151. };
  3152. static inline
  3153. struct kvm_vcpu *preempt_notifier_to_vcpu(struct preempt_notifier *pn)
  3154. {
  3155. return container_of(pn, struct kvm_vcpu, preempt_notifier);
  3156. }
  3157. static void kvm_sched_in(struct preempt_notifier *pn, int cpu)
  3158. {
  3159. struct kvm_vcpu *vcpu = preempt_notifier_to_vcpu(pn);
  3160. if (vcpu->preempted)
  3161. vcpu->preempted = false;
  3162. kvm_arch_sched_in(vcpu, cpu);
  3163. kvm_arch_vcpu_load(vcpu, cpu);
  3164. }
  3165. static void kvm_sched_out(struct preempt_notifier *pn,
  3166. struct task_struct *next)
  3167. {
  3168. struct kvm_vcpu *vcpu = preempt_notifier_to_vcpu(pn);
  3169. if (current->state == TASK_RUNNING)
  3170. vcpu->preempted = true;
  3171. kvm_arch_vcpu_put(vcpu);
  3172. }
  3173. int kvm_init(void *opaque, unsigned vcpu_size, unsigned vcpu_align,
  3174. struct module *module)
  3175. {
  3176. int r;
  3177. int cpu;
  3178. r = kvm_arch_init(opaque);
  3179. if (r)
  3180. goto out_fail;
  3181. /*
  3182. * kvm_arch_init makes sure there's at most one caller
  3183. * for architectures that support multiple implementations,
  3184. * like intel and amd on x86.
  3185. * kvm_arch_init must be called before kvm_irqfd_init to avoid creating
  3186. * conflicts in case kvm is already setup for another implementation.
  3187. */
  3188. r = kvm_irqfd_init();
  3189. if (r)
  3190. goto out_irqfd;
  3191. if (!zalloc_cpumask_var(&cpus_hardware_enabled, GFP_KERNEL)) {
  3192. r = -ENOMEM;
  3193. goto out_free_0;
  3194. }
  3195. r = kvm_arch_hardware_setup();
  3196. if (r < 0)
  3197. goto out_free_0a;
  3198. for_each_online_cpu(cpu) {
  3199. smp_call_function_single(cpu,
  3200. kvm_arch_check_processor_compat,
  3201. &r, 1);
  3202. if (r < 0)
  3203. goto out_free_1;
  3204. }
  3205. r = cpuhp_setup_state_nocalls(CPUHP_AP_KVM_STARTING, "AP_KVM_STARTING",
  3206. kvm_starting_cpu, kvm_dying_cpu);
  3207. if (r)
  3208. goto out_free_2;
  3209. register_reboot_notifier(&kvm_reboot_notifier);
  3210. /* A kmem cache lets us meet the alignment requirements of fx_save. */
  3211. if (!vcpu_align)
  3212. vcpu_align = __alignof__(struct kvm_vcpu);
  3213. kvm_vcpu_cache = kmem_cache_create("kvm_vcpu", vcpu_size, vcpu_align,
  3214. 0, NULL);
  3215. if (!kvm_vcpu_cache) {
  3216. r = -ENOMEM;
  3217. goto out_free_3;
  3218. }
  3219. r = kvm_async_pf_init();
  3220. if (r)
  3221. goto out_free;
  3222. kvm_chardev_ops.owner = module;
  3223. kvm_vm_fops.owner = module;
  3224. kvm_vcpu_fops.owner = module;
  3225. r = misc_register(&kvm_dev);
  3226. if (r) {
  3227. pr_err("kvm: misc device register failed\n");
  3228. goto out_unreg;
  3229. }
  3230. register_syscore_ops(&kvm_syscore_ops);
  3231. kvm_preempt_ops.sched_in = kvm_sched_in;
  3232. kvm_preempt_ops.sched_out = kvm_sched_out;
  3233. r = kvm_init_debug();
  3234. if (r) {
  3235. pr_err("kvm: create debugfs files failed\n");
  3236. goto out_undebugfs;
  3237. }
  3238. r = kvm_vfio_ops_init();
  3239. WARN_ON(r);
  3240. return 0;
  3241. out_undebugfs:
  3242. unregister_syscore_ops(&kvm_syscore_ops);
  3243. misc_deregister(&kvm_dev);
  3244. out_unreg:
  3245. kvm_async_pf_deinit();
  3246. out_free:
  3247. kmem_cache_destroy(kvm_vcpu_cache);
  3248. out_free_3:
  3249. unregister_reboot_notifier(&kvm_reboot_notifier);
  3250. cpuhp_remove_state_nocalls(CPUHP_AP_KVM_STARTING);
  3251. out_free_2:
  3252. out_free_1:
  3253. kvm_arch_hardware_unsetup();
  3254. out_free_0a:
  3255. free_cpumask_var(cpus_hardware_enabled);
  3256. out_free_0:
  3257. kvm_irqfd_exit();
  3258. out_irqfd:
  3259. kvm_arch_exit();
  3260. out_fail:
  3261. return r;
  3262. }
  3263. EXPORT_SYMBOL_GPL(kvm_init);
  3264. void kvm_exit(void)
  3265. {
  3266. debugfs_remove_recursive(kvm_debugfs_dir);
  3267. misc_deregister(&kvm_dev);
  3268. kmem_cache_destroy(kvm_vcpu_cache);
  3269. kvm_async_pf_deinit();
  3270. unregister_syscore_ops(&kvm_syscore_ops);
  3271. unregister_reboot_notifier(&kvm_reboot_notifier);
  3272. cpuhp_remove_state_nocalls(CPUHP_AP_KVM_STARTING);
  3273. on_each_cpu(hardware_disable_nolock, NULL, 1);
  3274. kvm_arch_hardware_unsetup();
  3275. kvm_arch_exit();
  3276. kvm_irqfd_exit();
  3277. free_cpumask_var(cpus_hardware_enabled);
  3278. kvm_vfio_ops_exit();
  3279. }
  3280. EXPORT_SYMBOL_GPL(kvm_exit);