eventfd.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954
  1. /*
  2. * kvm eventfd support - use eventfd objects to signal various KVM events
  3. *
  4. * Copyright 2009 Novell. All Rights Reserved.
  5. * Copyright 2010 Red Hat, Inc. and/or its affiliates.
  6. *
  7. * Author:
  8. * Gregory Haskins <ghaskins@novell.com>
  9. *
  10. * This file is free software; you can redistribute it and/or modify
  11. * it under the terms of version 2 of the GNU General Public License
  12. * as published by the Free Software Foundation.
  13. *
  14. * This program is distributed in the hope that it will be useful,
  15. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  17. * GNU General Public License for more details.
  18. *
  19. * You should have received a copy of the GNU General Public License
  20. * along with this program; if not, write to the Free Software Foundation,
  21. * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
  22. */
  23. #include <linux/kvm_host.h>
  24. #include <linux/kvm.h>
  25. #include <linux/kvm_irqfd.h>
  26. #include <linux/workqueue.h>
  27. #include <linux/syscalls.h>
  28. #include <linux/wait.h>
  29. #include <linux/poll.h>
  30. #include <linux/file.h>
  31. #include <linux/list.h>
  32. #include <linux/eventfd.h>
  33. #include <linux/kernel.h>
  34. #include <linux/srcu.h>
  35. #include <linux/slab.h>
  36. #include <linux/seqlock.h>
  37. #include <linux/irqbypass.h>
  38. #include <trace/events/kvm.h>
  39. #include <kvm/iodev.h>
  40. #ifdef CONFIG_HAVE_KVM_IRQFD
  41. static struct workqueue_struct *irqfd_cleanup_wq;
  42. static void
  43. irqfd_inject(struct work_struct *work)
  44. {
  45. struct kvm_kernel_irqfd *irqfd =
  46. container_of(work, struct kvm_kernel_irqfd, inject);
  47. struct kvm *kvm = irqfd->kvm;
  48. if (!irqfd->resampler) {
  49. kvm_set_irq(kvm, KVM_USERSPACE_IRQ_SOURCE_ID, irqfd->gsi, 1,
  50. false);
  51. kvm_set_irq(kvm, KVM_USERSPACE_IRQ_SOURCE_ID, irqfd->gsi, 0,
  52. false);
  53. } else
  54. kvm_set_irq(kvm, KVM_IRQFD_RESAMPLE_IRQ_SOURCE_ID,
  55. irqfd->gsi, 1, false);
  56. }
  57. /*
  58. * Since resampler irqfds share an IRQ source ID, we de-assert once
  59. * then notify all of the resampler irqfds using this GSI. We can't
  60. * do multiple de-asserts or we risk racing with incoming re-asserts.
  61. */
  62. static void
  63. irqfd_resampler_ack(struct kvm_irq_ack_notifier *kian)
  64. {
  65. struct kvm_kernel_irqfd_resampler *resampler;
  66. struct kvm *kvm;
  67. struct kvm_kernel_irqfd *irqfd;
  68. int idx;
  69. resampler = container_of(kian,
  70. struct kvm_kernel_irqfd_resampler, notifier);
  71. kvm = resampler->kvm;
  72. kvm_set_irq(kvm, KVM_IRQFD_RESAMPLE_IRQ_SOURCE_ID,
  73. resampler->notifier.gsi, 0, false);
  74. idx = srcu_read_lock(&kvm->irq_srcu);
  75. list_for_each_entry_rcu(irqfd, &resampler->list, resampler_link)
  76. eventfd_signal(irqfd->resamplefd, 1);
  77. srcu_read_unlock(&kvm->irq_srcu, idx);
  78. }
  79. static void
  80. irqfd_resampler_shutdown(struct kvm_kernel_irqfd *irqfd)
  81. {
  82. struct kvm_kernel_irqfd_resampler *resampler = irqfd->resampler;
  83. struct kvm *kvm = resampler->kvm;
  84. mutex_lock(&kvm->irqfds.resampler_lock);
  85. list_del_rcu(&irqfd->resampler_link);
  86. synchronize_srcu(&kvm->irq_srcu);
  87. if (list_empty(&resampler->list)) {
  88. list_del(&resampler->link);
  89. kvm_unregister_irq_ack_notifier(kvm, &resampler->notifier);
  90. kvm_set_irq(kvm, KVM_IRQFD_RESAMPLE_IRQ_SOURCE_ID,
  91. resampler->notifier.gsi, 0, false);
  92. kfree(resampler);
  93. }
  94. mutex_unlock(&kvm->irqfds.resampler_lock);
  95. }
  96. /*
  97. * Race-free decouple logic (ordering is critical)
  98. */
  99. static void
  100. irqfd_shutdown(struct work_struct *work)
  101. {
  102. struct kvm_kernel_irqfd *irqfd =
  103. container_of(work, struct kvm_kernel_irqfd, shutdown);
  104. u64 cnt;
  105. /*
  106. * Synchronize with the wait-queue and unhook ourselves to prevent
  107. * further events.
  108. */
  109. eventfd_ctx_remove_wait_queue(irqfd->eventfd, &irqfd->wait, &cnt);
  110. /*
  111. * We know no new events will be scheduled at this point, so block
  112. * until all previously outstanding events have completed
  113. */
  114. flush_work(&irqfd->inject);
  115. if (irqfd->resampler) {
  116. irqfd_resampler_shutdown(irqfd);
  117. eventfd_ctx_put(irqfd->resamplefd);
  118. }
  119. /*
  120. * It is now safe to release the object's resources
  121. */
  122. #ifdef CONFIG_HAVE_KVM_IRQ_BYPASS
  123. irq_bypass_unregister_consumer(&irqfd->consumer);
  124. #endif
  125. eventfd_ctx_put(irqfd->eventfd);
  126. kfree(irqfd);
  127. }
  128. /* assumes kvm->irqfds.lock is held */
  129. static bool
  130. irqfd_is_active(struct kvm_kernel_irqfd *irqfd)
  131. {
  132. return list_empty(&irqfd->list) ? false : true;
  133. }
  134. /*
  135. * Mark the irqfd as inactive and schedule it for removal
  136. *
  137. * assumes kvm->irqfds.lock is held
  138. */
  139. static void
  140. irqfd_deactivate(struct kvm_kernel_irqfd *irqfd)
  141. {
  142. BUG_ON(!irqfd_is_active(irqfd));
  143. list_del_init(&irqfd->list);
  144. queue_work(irqfd_cleanup_wq, &irqfd->shutdown);
  145. }
  146. int __attribute__((weak)) kvm_arch_set_irq_inatomic(
  147. struct kvm_kernel_irq_routing_entry *irq,
  148. struct kvm *kvm, int irq_source_id,
  149. int level,
  150. bool line_status)
  151. {
  152. return -EWOULDBLOCK;
  153. }
  154. /*
  155. * Called with wqh->lock held and interrupts disabled
  156. */
  157. static int
  158. irqfd_wakeup(wait_queue_t *wait, unsigned mode, int sync, void *key)
  159. {
  160. struct kvm_kernel_irqfd *irqfd =
  161. container_of(wait, struct kvm_kernel_irqfd, wait);
  162. unsigned long flags = (unsigned long)key;
  163. struct kvm_kernel_irq_routing_entry irq;
  164. struct kvm *kvm = irqfd->kvm;
  165. unsigned seq;
  166. int idx;
  167. if (flags & POLLIN) {
  168. idx = srcu_read_lock(&kvm->irq_srcu);
  169. do {
  170. seq = read_seqcount_begin(&irqfd->irq_entry_sc);
  171. irq = irqfd->irq_entry;
  172. } while (read_seqcount_retry(&irqfd->irq_entry_sc, seq));
  173. /* An event has been signaled, inject an interrupt */
  174. if (kvm_arch_set_irq_inatomic(&irq, kvm,
  175. KVM_USERSPACE_IRQ_SOURCE_ID, 1,
  176. false) == -EWOULDBLOCK)
  177. schedule_work(&irqfd->inject);
  178. srcu_read_unlock(&kvm->irq_srcu, idx);
  179. }
  180. if (flags & POLLHUP) {
  181. /* The eventfd is closing, detach from KVM */
  182. unsigned long flags;
  183. spin_lock_irqsave(&kvm->irqfds.lock, flags);
  184. /*
  185. * We must check if someone deactivated the irqfd before
  186. * we could acquire the irqfds.lock since the item is
  187. * deactivated from the KVM side before it is unhooked from
  188. * the wait-queue. If it is already deactivated, we can
  189. * simply return knowing the other side will cleanup for us.
  190. * We cannot race against the irqfd going away since the
  191. * other side is required to acquire wqh->lock, which we hold
  192. */
  193. if (irqfd_is_active(irqfd))
  194. irqfd_deactivate(irqfd);
  195. spin_unlock_irqrestore(&kvm->irqfds.lock, flags);
  196. }
  197. return 0;
  198. }
  199. static void
  200. irqfd_ptable_queue_proc(struct file *file, wait_queue_head_t *wqh,
  201. poll_table *pt)
  202. {
  203. struct kvm_kernel_irqfd *irqfd =
  204. container_of(pt, struct kvm_kernel_irqfd, pt);
  205. add_wait_queue(wqh, &irqfd->wait);
  206. }
  207. /* Must be called under irqfds.lock */
  208. static void irqfd_update(struct kvm *kvm, struct kvm_kernel_irqfd *irqfd)
  209. {
  210. struct kvm_kernel_irq_routing_entry *e;
  211. struct kvm_kernel_irq_routing_entry entries[KVM_NR_IRQCHIPS];
  212. int n_entries;
  213. n_entries = kvm_irq_map_gsi(kvm, entries, irqfd->gsi);
  214. write_seqcount_begin(&irqfd->irq_entry_sc);
  215. e = entries;
  216. if (n_entries == 1)
  217. irqfd->irq_entry = *e;
  218. else
  219. irqfd->irq_entry.type = 0;
  220. write_seqcount_end(&irqfd->irq_entry_sc);
  221. }
  222. #ifdef CONFIG_HAVE_KVM_IRQ_BYPASS
  223. void __attribute__((weak)) kvm_arch_irq_bypass_stop(
  224. struct irq_bypass_consumer *cons)
  225. {
  226. }
  227. void __attribute__((weak)) kvm_arch_irq_bypass_start(
  228. struct irq_bypass_consumer *cons)
  229. {
  230. }
  231. int __attribute__((weak)) kvm_arch_update_irqfd_routing(
  232. struct kvm *kvm, unsigned int host_irq,
  233. uint32_t guest_irq, bool set)
  234. {
  235. return 0;
  236. }
  237. #endif
  238. static int
  239. kvm_irqfd_assign(struct kvm *kvm, struct kvm_irqfd *args)
  240. {
  241. struct kvm_kernel_irqfd *irqfd, *tmp;
  242. struct fd f;
  243. struct eventfd_ctx *eventfd = NULL, *resamplefd = NULL;
  244. int ret;
  245. unsigned int events;
  246. int idx;
  247. if (!kvm_arch_intc_initialized(kvm))
  248. return -EAGAIN;
  249. irqfd = kzalloc(sizeof(*irqfd), GFP_KERNEL);
  250. if (!irqfd)
  251. return -ENOMEM;
  252. irqfd->kvm = kvm;
  253. irqfd->gsi = args->gsi;
  254. INIT_LIST_HEAD(&irqfd->list);
  255. INIT_WORK(&irqfd->inject, irqfd_inject);
  256. INIT_WORK(&irqfd->shutdown, irqfd_shutdown);
  257. seqcount_init(&irqfd->irq_entry_sc);
  258. f = fdget(args->fd);
  259. if (!f.file) {
  260. ret = -EBADF;
  261. goto out;
  262. }
  263. eventfd = eventfd_ctx_fileget(f.file);
  264. if (IS_ERR(eventfd)) {
  265. ret = PTR_ERR(eventfd);
  266. goto fail;
  267. }
  268. irqfd->eventfd = eventfd;
  269. if (args->flags & KVM_IRQFD_FLAG_RESAMPLE) {
  270. struct kvm_kernel_irqfd_resampler *resampler;
  271. resamplefd = eventfd_ctx_fdget(args->resamplefd);
  272. if (IS_ERR(resamplefd)) {
  273. ret = PTR_ERR(resamplefd);
  274. goto fail;
  275. }
  276. irqfd->resamplefd = resamplefd;
  277. INIT_LIST_HEAD(&irqfd->resampler_link);
  278. mutex_lock(&kvm->irqfds.resampler_lock);
  279. list_for_each_entry(resampler,
  280. &kvm->irqfds.resampler_list, link) {
  281. if (resampler->notifier.gsi == irqfd->gsi) {
  282. irqfd->resampler = resampler;
  283. break;
  284. }
  285. }
  286. if (!irqfd->resampler) {
  287. resampler = kzalloc(sizeof(*resampler), GFP_KERNEL);
  288. if (!resampler) {
  289. ret = -ENOMEM;
  290. mutex_unlock(&kvm->irqfds.resampler_lock);
  291. goto fail;
  292. }
  293. resampler->kvm = kvm;
  294. INIT_LIST_HEAD(&resampler->list);
  295. resampler->notifier.gsi = irqfd->gsi;
  296. resampler->notifier.irq_acked = irqfd_resampler_ack;
  297. INIT_LIST_HEAD(&resampler->link);
  298. list_add(&resampler->link, &kvm->irqfds.resampler_list);
  299. kvm_register_irq_ack_notifier(kvm,
  300. &resampler->notifier);
  301. irqfd->resampler = resampler;
  302. }
  303. list_add_rcu(&irqfd->resampler_link, &irqfd->resampler->list);
  304. synchronize_srcu(&kvm->irq_srcu);
  305. mutex_unlock(&kvm->irqfds.resampler_lock);
  306. }
  307. /*
  308. * Install our own custom wake-up handling so we are notified via
  309. * a callback whenever someone signals the underlying eventfd
  310. */
  311. init_waitqueue_func_entry(&irqfd->wait, irqfd_wakeup);
  312. init_poll_funcptr(&irqfd->pt, irqfd_ptable_queue_proc);
  313. spin_lock_irq(&kvm->irqfds.lock);
  314. ret = 0;
  315. list_for_each_entry(tmp, &kvm->irqfds.items, list) {
  316. if (irqfd->eventfd != tmp->eventfd)
  317. continue;
  318. /* This fd is used for another irq already. */
  319. ret = -EBUSY;
  320. spin_unlock_irq(&kvm->irqfds.lock);
  321. goto fail;
  322. }
  323. idx = srcu_read_lock(&kvm->irq_srcu);
  324. irqfd_update(kvm, irqfd);
  325. srcu_read_unlock(&kvm->irq_srcu, idx);
  326. list_add_tail(&irqfd->list, &kvm->irqfds.items);
  327. spin_unlock_irq(&kvm->irqfds.lock);
  328. /*
  329. * Check if there was an event already pending on the eventfd
  330. * before we registered, and trigger it as if we didn't miss it.
  331. */
  332. events = f.file->f_op->poll(f.file, &irqfd->pt);
  333. if (events & POLLIN)
  334. schedule_work(&irqfd->inject);
  335. /*
  336. * do not drop the file until the irqfd is fully initialized, otherwise
  337. * we might race against the POLLHUP
  338. */
  339. fdput(f);
  340. #ifdef CONFIG_HAVE_KVM_IRQ_BYPASS
  341. irqfd->consumer.token = (void *)irqfd->eventfd;
  342. irqfd->consumer.add_producer = kvm_arch_irq_bypass_add_producer;
  343. irqfd->consumer.del_producer = kvm_arch_irq_bypass_del_producer;
  344. irqfd->consumer.stop = kvm_arch_irq_bypass_stop;
  345. irqfd->consumer.start = kvm_arch_irq_bypass_start;
  346. ret = irq_bypass_register_consumer(&irqfd->consumer);
  347. if (ret)
  348. pr_info("irq bypass consumer (token %p) registration fails: %d\n",
  349. irqfd->consumer.token, ret);
  350. #endif
  351. return 0;
  352. fail:
  353. if (irqfd->resampler)
  354. irqfd_resampler_shutdown(irqfd);
  355. if (resamplefd && !IS_ERR(resamplefd))
  356. eventfd_ctx_put(resamplefd);
  357. if (eventfd && !IS_ERR(eventfd))
  358. eventfd_ctx_put(eventfd);
  359. fdput(f);
  360. out:
  361. kfree(irqfd);
  362. return ret;
  363. }
  364. bool kvm_irq_has_notifier(struct kvm *kvm, unsigned irqchip, unsigned pin)
  365. {
  366. struct kvm_irq_ack_notifier *kian;
  367. int gsi, idx;
  368. idx = srcu_read_lock(&kvm->irq_srcu);
  369. gsi = kvm_irq_map_chip_pin(kvm, irqchip, pin);
  370. if (gsi != -1)
  371. hlist_for_each_entry_rcu(kian, &kvm->irq_ack_notifier_list,
  372. link)
  373. if (kian->gsi == gsi) {
  374. srcu_read_unlock(&kvm->irq_srcu, idx);
  375. return true;
  376. }
  377. srcu_read_unlock(&kvm->irq_srcu, idx);
  378. return false;
  379. }
  380. EXPORT_SYMBOL_GPL(kvm_irq_has_notifier);
  381. void kvm_notify_acked_gsi(struct kvm *kvm, int gsi)
  382. {
  383. struct kvm_irq_ack_notifier *kian;
  384. hlist_for_each_entry_rcu(kian, &kvm->irq_ack_notifier_list,
  385. link)
  386. if (kian->gsi == gsi)
  387. kian->irq_acked(kian);
  388. }
  389. void kvm_notify_acked_irq(struct kvm *kvm, unsigned irqchip, unsigned pin)
  390. {
  391. int gsi, idx;
  392. trace_kvm_ack_irq(irqchip, pin);
  393. idx = srcu_read_lock(&kvm->irq_srcu);
  394. gsi = kvm_irq_map_chip_pin(kvm, irqchip, pin);
  395. if (gsi != -1)
  396. kvm_notify_acked_gsi(kvm, gsi);
  397. srcu_read_unlock(&kvm->irq_srcu, idx);
  398. }
  399. void kvm_register_irq_ack_notifier(struct kvm *kvm,
  400. struct kvm_irq_ack_notifier *kian)
  401. {
  402. mutex_lock(&kvm->irq_lock);
  403. hlist_add_head_rcu(&kian->link, &kvm->irq_ack_notifier_list);
  404. mutex_unlock(&kvm->irq_lock);
  405. kvm_vcpu_request_scan_ioapic(kvm);
  406. }
  407. void kvm_unregister_irq_ack_notifier(struct kvm *kvm,
  408. struct kvm_irq_ack_notifier *kian)
  409. {
  410. mutex_lock(&kvm->irq_lock);
  411. hlist_del_init_rcu(&kian->link);
  412. mutex_unlock(&kvm->irq_lock);
  413. synchronize_srcu(&kvm->irq_srcu);
  414. kvm_vcpu_request_scan_ioapic(kvm);
  415. }
  416. #endif
  417. void
  418. kvm_eventfd_init(struct kvm *kvm)
  419. {
  420. #ifdef CONFIG_HAVE_KVM_IRQFD
  421. spin_lock_init(&kvm->irqfds.lock);
  422. INIT_LIST_HEAD(&kvm->irqfds.items);
  423. INIT_LIST_HEAD(&kvm->irqfds.resampler_list);
  424. mutex_init(&kvm->irqfds.resampler_lock);
  425. #endif
  426. INIT_LIST_HEAD(&kvm->ioeventfds);
  427. }
  428. #ifdef CONFIG_HAVE_KVM_IRQFD
  429. /*
  430. * shutdown any irqfd's that match fd+gsi
  431. */
  432. static int
  433. kvm_irqfd_deassign(struct kvm *kvm, struct kvm_irqfd *args)
  434. {
  435. struct kvm_kernel_irqfd *irqfd, *tmp;
  436. struct eventfd_ctx *eventfd;
  437. eventfd = eventfd_ctx_fdget(args->fd);
  438. if (IS_ERR(eventfd))
  439. return PTR_ERR(eventfd);
  440. spin_lock_irq(&kvm->irqfds.lock);
  441. list_for_each_entry_safe(irqfd, tmp, &kvm->irqfds.items, list) {
  442. if (irqfd->eventfd == eventfd && irqfd->gsi == args->gsi) {
  443. /*
  444. * This clearing of irq_entry.type is needed for when
  445. * another thread calls kvm_irq_routing_update before
  446. * we flush workqueue below (we synchronize with
  447. * kvm_irq_routing_update using irqfds.lock).
  448. */
  449. write_seqcount_begin(&irqfd->irq_entry_sc);
  450. irqfd->irq_entry.type = 0;
  451. write_seqcount_end(&irqfd->irq_entry_sc);
  452. irqfd_deactivate(irqfd);
  453. }
  454. }
  455. spin_unlock_irq(&kvm->irqfds.lock);
  456. eventfd_ctx_put(eventfd);
  457. /*
  458. * Block until we know all outstanding shutdown jobs have completed
  459. * so that we guarantee there will not be any more interrupts on this
  460. * gsi once this deassign function returns.
  461. */
  462. flush_workqueue(irqfd_cleanup_wq);
  463. return 0;
  464. }
  465. int
  466. kvm_irqfd(struct kvm *kvm, struct kvm_irqfd *args)
  467. {
  468. if (args->flags & ~(KVM_IRQFD_FLAG_DEASSIGN | KVM_IRQFD_FLAG_RESAMPLE))
  469. return -EINVAL;
  470. if (args->flags & KVM_IRQFD_FLAG_DEASSIGN)
  471. return kvm_irqfd_deassign(kvm, args);
  472. return kvm_irqfd_assign(kvm, args);
  473. }
  474. /*
  475. * This function is called as the kvm VM fd is being released. Shutdown all
  476. * irqfds that still remain open
  477. */
  478. void
  479. kvm_irqfd_release(struct kvm *kvm)
  480. {
  481. struct kvm_kernel_irqfd *irqfd, *tmp;
  482. spin_lock_irq(&kvm->irqfds.lock);
  483. list_for_each_entry_safe(irqfd, tmp, &kvm->irqfds.items, list)
  484. irqfd_deactivate(irqfd);
  485. spin_unlock_irq(&kvm->irqfds.lock);
  486. /*
  487. * Block until we know all outstanding shutdown jobs have completed
  488. * since we do not take a kvm* reference.
  489. */
  490. flush_workqueue(irqfd_cleanup_wq);
  491. }
  492. /*
  493. * Take note of a change in irq routing.
  494. * Caller must invoke synchronize_srcu(&kvm->irq_srcu) afterwards.
  495. */
  496. void kvm_irq_routing_update(struct kvm *kvm)
  497. {
  498. struct kvm_kernel_irqfd *irqfd;
  499. spin_lock_irq(&kvm->irqfds.lock);
  500. list_for_each_entry(irqfd, &kvm->irqfds.items, list) {
  501. irqfd_update(kvm, irqfd);
  502. #ifdef CONFIG_HAVE_KVM_IRQ_BYPASS
  503. if (irqfd->producer) {
  504. int ret = kvm_arch_update_irqfd_routing(
  505. irqfd->kvm, irqfd->producer->irq,
  506. irqfd->gsi, 1);
  507. WARN_ON(ret);
  508. }
  509. #endif
  510. }
  511. spin_unlock_irq(&kvm->irqfds.lock);
  512. }
  513. /*
  514. * create a host-wide workqueue for issuing deferred shutdown requests
  515. * aggregated from all vm* instances. We need our own isolated single-thread
  516. * queue to prevent deadlock against flushing the normal work-queue.
  517. */
  518. int kvm_irqfd_init(void)
  519. {
  520. irqfd_cleanup_wq = create_singlethread_workqueue("kvm-irqfd-cleanup");
  521. if (!irqfd_cleanup_wq)
  522. return -ENOMEM;
  523. return 0;
  524. }
  525. void kvm_irqfd_exit(void)
  526. {
  527. destroy_workqueue(irqfd_cleanup_wq);
  528. }
  529. #endif
  530. /*
  531. * --------------------------------------------------------------------
  532. * ioeventfd: translate a PIO/MMIO memory write to an eventfd signal.
  533. *
  534. * userspace can register a PIO/MMIO address with an eventfd for receiving
  535. * notification when the memory has been touched.
  536. * --------------------------------------------------------------------
  537. */
  538. struct _ioeventfd {
  539. struct list_head list;
  540. u64 addr;
  541. int length;
  542. struct eventfd_ctx *eventfd;
  543. u64 datamatch;
  544. struct kvm_io_device dev;
  545. u8 bus_idx;
  546. bool wildcard;
  547. };
  548. static inline struct _ioeventfd *
  549. to_ioeventfd(struct kvm_io_device *dev)
  550. {
  551. return container_of(dev, struct _ioeventfd, dev);
  552. }
  553. static void
  554. ioeventfd_release(struct _ioeventfd *p)
  555. {
  556. eventfd_ctx_put(p->eventfd);
  557. list_del(&p->list);
  558. kfree(p);
  559. }
  560. static bool
  561. ioeventfd_in_range(struct _ioeventfd *p, gpa_t addr, int len, const void *val)
  562. {
  563. u64 _val;
  564. if (addr != p->addr)
  565. /* address must be precise for a hit */
  566. return false;
  567. if (!p->length)
  568. /* length = 0 means only look at the address, so always a hit */
  569. return true;
  570. if (len != p->length)
  571. /* address-range must be precise for a hit */
  572. return false;
  573. if (p->wildcard)
  574. /* all else equal, wildcard is always a hit */
  575. return true;
  576. /* otherwise, we have to actually compare the data */
  577. BUG_ON(!IS_ALIGNED((unsigned long)val, len));
  578. switch (len) {
  579. case 1:
  580. _val = *(u8 *)val;
  581. break;
  582. case 2:
  583. _val = *(u16 *)val;
  584. break;
  585. case 4:
  586. _val = *(u32 *)val;
  587. break;
  588. case 8:
  589. _val = *(u64 *)val;
  590. break;
  591. default:
  592. return false;
  593. }
  594. return _val == p->datamatch ? true : false;
  595. }
  596. /* MMIO/PIO writes trigger an event if the addr/val match */
  597. static int
  598. ioeventfd_write(struct kvm_vcpu *vcpu, struct kvm_io_device *this, gpa_t addr,
  599. int len, const void *val)
  600. {
  601. struct _ioeventfd *p = to_ioeventfd(this);
  602. if (!ioeventfd_in_range(p, addr, len, val))
  603. return -EOPNOTSUPP;
  604. eventfd_signal(p->eventfd, 1);
  605. return 0;
  606. }
  607. /*
  608. * This function is called as KVM is completely shutting down. We do not
  609. * need to worry about locking just nuke anything we have as quickly as possible
  610. */
  611. static void
  612. ioeventfd_destructor(struct kvm_io_device *this)
  613. {
  614. struct _ioeventfd *p = to_ioeventfd(this);
  615. ioeventfd_release(p);
  616. }
  617. static const struct kvm_io_device_ops ioeventfd_ops = {
  618. .write = ioeventfd_write,
  619. .destructor = ioeventfd_destructor,
  620. };
  621. /* assumes kvm->slots_lock held */
  622. static bool
  623. ioeventfd_check_collision(struct kvm *kvm, struct _ioeventfd *p)
  624. {
  625. struct _ioeventfd *_p;
  626. list_for_each_entry(_p, &kvm->ioeventfds, list)
  627. if (_p->bus_idx == p->bus_idx &&
  628. _p->addr == p->addr &&
  629. (!_p->length || !p->length ||
  630. (_p->length == p->length &&
  631. (_p->wildcard || p->wildcard ||
  632. _p->datamatch == p->datamatch))))
  633. return true;
  634. return false;
  635. }
  636. static enum kvm_bus ioeventfd_bus_from_flags(__u32 flags)
  637. {
  638. if (flags & KVM_IOEVENTFD_FLAG_PIO)
  639. return KVM_PIO_BUS;
  640. if (flags & KVM_IOEVENTFD_FLAG_VIRTIO_CCW_NOTIFY)
  641. return KVM_VIRTIO_CCW_NOTIFY_BUS;
  642. return KVM_MMIO_BUS;
  643. }
  644. static int kvm_assign_ioeventfd_idx(struct kvm *kvm,
  645. enum kvm_bus bus_idx,
  646. struct kvm_ioeventfd *args)
  647. {
  648. struct eventfd_ctx *eventfd;
  649. struct _ioeventfd *p;
  650. int ret;
  651. eventfd = eventfd_ctx_fdget(args->fd);
  652. if (IS_ERR(eventfd))
  653. return PTR_ERR(eventfd);
  654. p = kzalloc(sizeof(*p), GFP_KERNEL);
  655. if (!p) {
  656. ret = -ENOMEM;
  657. goto fail;
  658. }
  659. INIT_LIST_HEAD(&p->list);
  660. p->addr = args->addr;
  661. p->bus_idx = bus_idx;
  662. p->length = args->len;
  663. p->eventfd = eventfd;
  664. /* The datamatch feature is optional, otherwise this is a wildcard */
  665. if (args->flags & KVM_IOEVENTFD_FLAG_DATAMATCH)
  666. p->datamatch = args->datamatch;
  667. else
  668. p->wildcard = true;
  669. mutex_lock(&kvm->slots_lock);
  670. /* Verify that there isn't a match already */
  671. if (ioeventfd_check_collision(kvm, p)) {
  672. ret = -EEXIST;
  673. goto unlock_fail;
  674. }
  675. kvm_iodevice_init(&p->dev, &ioeventfd_ops);
  676. ret = kvm_io_bus_register_dev(kvm, bus_idx, p->addr, p->length,
  677. &p->dev);
  678. if (ret < 0)
  679. goto unlock_fail;
  680. kvm->buses[bus_idx]->ioeventfd_count++;
  681. list_add_tail(&p->list, &kvm->ioeventfds);
  682. mutex_unlock(&kvm->slots_lock);
  683. return 0;
  684. unlock_fail:
  685. mutex_unlock(&kvm->slots_lock);
  686. fail:
  687. kfree(p);
  688. eventfd_ctx_put(eventfd);
  689. return ret;
  690. }
  691. static int
  692. kvm_deassign_ioeventfd_idx(struct kvm *kvm, enum kvm_bus bus_idx,
  693. struct kvm_ioeventfd *args)
  694. {
  695. struct _ioeventfd *p, *tmp;
  696. struct eventfd_ctx *eventfd;
  697. int ret = -ENOENT;
  698. eventfd = eventfd_ctx_fdget(args->fd);
  699. if (IS_ERR(eventfd))
  700. return PTR_ERR(eventfd);
  701. mutex_lock(&kvm->slots_lock);
  702. list_for_each_entry_safe(p, tmp, &kvm->ioeventfds, list) {
  703. bool wildcard = !(args->flags & KVM_IOEVENTFD_FLAG_DATAMATCH);
  704. if (p->bus_idx != bus_idx ||
  705. p->eventfd != eventfd ||
  706. p->addr != args->addr ||
  707. p->length != args->len ||
  708. p->wildcard != wildcard)
  709. continue;
  710. if (!p->wildcard && p->datamatch != args->datamatch)
  711. continue;
  712. kvm_io_bus_unregister_dev(kvm, bus_idx, &p->dev);
  713. kvm->buses[bus_idx]->ioeventfd_count--;
  714. ioeventfd_release(p);
  715. ret = 0;
  716. break;
  717. }
  718. mutex_unlock(&kvm->slots_lock);
  719. eventfd_ctx_put(eventfd);
  720. return ret;
  721. }
  722. static int kvm_deassign_ioeventfd(struct kvm *kvm, struct kvm_ioeventfd *args)
  723. {
  724. enum kvm_bus bus_idx = ioeventfd_bus_from_flags(args->flags);
  725. int ret = kvm_deassign_ioeventfd_idx(kvm, bus_idx, args);
  726. if (!args->len && bus_idx == KVM_MMIO_BUS)
  727. kvm_deassign_ioeventfd_idx(kvm, KVM_FAST_MMIO_BUS, args);
  728. return ret;
  729. }
  730. static int
  731. kvm_assign_ioeventfd(struct kvm *kvm, struct kvm_ioeventfd *args)
  732. {
  733. enum kvm_bus bus_idx;
  734. int ret;
  735. bus_idx = ioeventfd_bus_from_flags(args->flags);
  736. /* must be natural-word sized, or 0 to ignore length */
  737. switch (args->len) {
  738. case 0:
  739. case 1:
  740. case 2:
  741. case 4:
  742. case 8:
  743. break;
  744. default:
  745. return -EINVAL;
  746. }
  747. /* check for range overflow */
  748. if (args->addr + args->len < args->addr)
  749. return -EINVAL;
  750. /* check for extra flags that we don't understand */
  751. if (args->flags & ~KVM_IOEVENTFD_VALID_FLAG_MASK)
  752. return -EINVAL;
  753. /* ioeventfd with no length can't be combined with DATAMATCH */
  754. if (!args->len && (args->flags & KVM_IOEVENTFD_FLAG_DATAMATCH))
  755. return -EINVAL;
  756. ret = kvm_assign_ioeventfd_idx(kvm, bus_idx, args);
  757. if (ret)
  758. goto fail;
  759. /* When length is ignored, MMIO is also put on a separate bus, for
  760. * faster lookups.
  761. */
  762. if (!args->len && bus_idx == KVM_MMIO_BUS) {
  763. ret = kvm_assign_ioeventfd_idx(kvm, KVM_FAST_MMIO_BUS, args);
  764. if (ret < 0)
  765. goto fast_fail;
  766. }
  767. return 0;
  768. fast_fail:
  769. kvm_deassign_ioeventfd_idx(kvm, bus_idx, args);
  770. fail:
  771. return ret;
  772. }
  773. int
  774. kvm_ioeventfd(struct kvm *kvm, struct kvm_ioeventfd *args)
  775. {
  776. if (args->flags & KVM_IOEVENTFD_FLAG_DEASSIGN)
  777. return kvm_deassign_ioeventfd(kvm, args);
  778. return kvm_assign_ioeventfd(kvm, args);
  779. }