vhost.c 28 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115
  1. /* Copyright (C) 2009 Red Hat, Inc.
  2. * Copyright (C) 2006 Rusty Russell IBM Corporation
  3. *
  4. * Author: Michael S. Tsirkin <mst@redhat.com>
  5. *
  6. * Inspiration, some code, and most witty comments come from
  7. * Documentation/lguest/lguest.c, by Rusty Russell
  8. *
  9. * This work is licensed under the terms of the GNU GPL, version 2.
  10. *
  11. * Generic code for virtio server in host kernel.
  12. */
  13. #include <linux/eventfd.h>
  14. #include <linux/vhost.h>
  15. #include <linux/virtio_net.h>
  16. #include <linux/mm.h>
  17. #include <linux/miscdevice.h>
  18. #include <linux/mutex.h>
  19. #include <linux/workqueue.h>
  20. #include <linux/rcupdate.h>
  21. #include <linux/poll.h>
  22. #include <linux/file.h>
  23. #include <linux/highmem.h>
  24. #include <linux/slab.h>
  25. #include <linux/net.h>
  26. #include <linux/if_packet.h>
  27. #include <linux/if_arp.h>
  28. #include <net/sock.h>
  29. #include "vhost.h"
  30. enum {
  31. VHOST_MEMORY_MAX_NREGIONS = 64,
  32. VHOST_MEMORY_F_LOG = 0x1,
  33. };
  34. static struct workqueue_struct *vhost_workqueue;
  35. static void vhost_poll_func(struct file *file, wait_queue_head_t *wqh,
  36. poll_table *pt)
  37. {
  38. struct vhost_poll *poll;
  39. poll = container_of(pt, struct vhost_poll, table);
  40. poll->wqh = wqh;
  41. add_wait_queue(wqh, &poll->wait);
  42. }
  43. static int vhost_poll_wakeup(wait_queue_t *wait, unsigned mode, int sync,
  44. void *key)
  45. {
  46. struct vhost_poll *poll;
  47. poll = container_of(wait, struct vhost_poll, wait);
  48. if (!((unsigned long)key & poll->mask))
  49. return 0;
  50. queue_work(vhost_workqueue, &poll->work);
  51. return 0;
  52. }
  53. /* Init poll structure */
  54. void vhost_poll_init(struct vhost_poll *poll, work_func_t func,
  55. unsigned long mask)
  56. {
  57. INIT_WORK(&poll->work, func);
  58. init_waitqueue_func_entry(&poll->wait, vhost_poll_wakeup);
  59. init_poll_funcptr(&poll->table, vhost_poll_func);
  60. poll->mask = mask;
  61. }
  62. /* Start polling a file. We add ourselves to file's wait queue. The caller must
  63. * keep a reference to a file until after vhost_poll_stop is called. */
  64. void vhost_poll_start(struct vhost_poll *poll, struct file *file)
  65. {
  66. unsigned long mask;
  67. mask = file->f_op->poll(file, &poll->table);
  68. if (mask)
  69. vhost_poll_wakeup(&poll->wait, 0, 0, (void *)mask);
  70. }
  71. /* Stop polling a file. After this function returns, it becomes safe to drop the
  72. * file reference. You must also flush afterwards. */
  73. void vhost_poll_stop(struct vhost_poll *poll)
  74. {
  75. remove_wait_queue(poll->wqh, &poll->wait);
  76. }
  77. /* Flush any work that has been scheduled. When calling this, don't hold any
  78. * locks that are also used by the callback. */
  79. void vhost_poll_flush(struct vhost_poll *poll)
  80. {
  81. flush_work(&poll->work);
  82. }
  83. void vhost_poll_queue(struct vhost_poll *poll)
  84. {
  85. queue_work(vhost_workqueue, &poll->work);
  86. }
  87. static void vhost_vq_reset(struct vhost_dev *dev,
  88. struct vhost_virtqueue *vq)
  89. {
  90. vq->num = 1;
  91. vq->desc = NULL;
  92. vq->avail = NULL;
  93. vq->used = NULL;
  94. vq->last_avail_idx = 0;
  95. vq->avail_idx = 0;
  96. vq->last_used_idx = 0;
  97. vq->used_flags = 0;
  98. vq->used_flags = 0;
  99. vq->log_used = false;
  100. vq->log_addr = -1ull;
  101. vq->hdr_size = 0;
  102. vq->private_data = NULL;
  103. vq->log_base = NULL;
  104. vq->error_ctx = NULL;
  105. vq->error = NULL;
  106. vq->kick = NULL;
  107. vq->call_ctx = NULL;
  108. vq->call = NULL;
  109. vq->log_ctx = NULL;
  110. }
  111. long vhost_dev_init(struct vhost_dev *dev,
  112. struct vhost_virtqueue *vqs, int nvqs)
  113. {
  114. int i;
  115. dev->vqs = vqs;
  116. dev->nvqs = nvqs;
  117. mutex_init(&dev->mutex);
  118. dev->log_ctx = NULL;
  119. dev->log_file = NULL;
  120. dev->memory = NULL;
  121. dev->mm = NULL;
  122. for (i = 0; i < dev->nvqs; ++i) {
  123. dev->vqs[i].dev = dev;
  124. mutex_init(&dev->vqs[i].mutex);
  125. vhost_vq_reset(dev, dev->vqs + i);
  126. if (dev->vqs[i].handle_kick)
  127. vhost_poll_init(&dev->vqs[i].poll,
  128. dev->vqs[i].handle_kick,
  129. POLLIN);
  130. }
  131. return 0;
  132. }
  133. /* Caller should have device mutex */
  134. long vhost_dev_check_owner(struct vhost_dev *dev)
  135. {
  136. /* Are you the owner? If not, I don't think you mean to do that */
  137. return dev->mm == current->mm ? 0 : -EPERM;
  138. }
  139. /* Caller should have device mutex */
  140. static long vhost_dev_set_owner(struct vhost_dev *dev)
  141. {
  142. /* Is there an owner already? */
  143. if (dev->mm)
  144. return -EBUSY;
  145. /* No owner, become one */
  146. dev->mm = get_task_mm(current);
  147. return 0;
  148. }
  149. /* Caller should have device mutex */
  150. long vhost_dev_reset_owner(struct vhost_dev *dev)
  151. {
  152. struct vhost_memory *memory;
  153. /* Restore memory to default empty mapping. */
  154. memory = kmalloc(offsetof(struct vhost_memory, regions), GFP_KERNEL);
  155. if (!memory)
  156. return -ENOMEM;
  157. vhost_dev_cleanup(dev);
  158. memory->nregions = 0;
  159. dev->memory = memory;
  160. return 0;
  161. }
  162. /* Caller should have device mutex */
  163. void vhost_dev_cleanup(struct vhost_dev *dev)
  164. {
  165. int i;
  166. for (i = 0; i < dev->nvqs; ++i) {
  167. if (dev->vqs[i].kick && dev->vqs[i].handle_kick) {
  168. vhost_poll_stop(&dev->vqs[i].poll);
  169. vhost_poll_flush(&dev->vqs[i].poll);
  170. }
  171. if (dev->vqs[i].error_ctx)
  172. eventfd_ctx_put(dev->vqs[i].error_ctx);
  173. if (dev->vqs[i].error)
  174. fput(dev->vqs[i].error);
  175. if (dev->vqs[i].kick)
  176. fput(dev->vqs[i].kick);
  177. if (dev->vqs[i].call_ctx)
  178. eventfd_ctx_put(dev->vqs[i].call_ctx);
  179. if (dev->vqs[i].call)
  180. fput(dev->vqs[i].call);
  181. vhost_vq_reset(dev, dev->vqs + i);
  182. }
  183. if (dev->log_ctx)
  184. eventfd_ctx_put(dev->log_ctx);
  185. dev->log_ctx = NULL;
  186. if (dev->log_file)
  187. fput(dev->log_file);
  188. dev->log_file = NULL;
  189. /* No one will access memory at this point */
  190. kfree(dev->memory);
  191. dev->memory = NULL;
  192. if (dev->mm)
  193. mmput(dev->mm);
  194. dev->mm = NULL;
  195. }
  196. static int log_access_ok(void __user *log_base, u64 addr, unsigned long sz)
  197. {
  198. u64 a = addr / VHOST_PAGE_SIZE / 8;
  199. /* Make sure 64 bit math will not overflow. */
  200. if (a > ULONG_MAX - (unsigned long)log_base ||
  201. a + (unsigned long)log_base > ULONG_MAX)
  202. return -EFAULT;
  203. return access_ok(VERIFY_WRITE, log_base + a,
  204. (sz + VHOST_PAGE_SIZE * 8 - 1) / VHOST_PAGE_SIZE / 8);
  205. }
  206. /* Caller should have vq mutex and device mutex. */
  207. static int vq_memory_access_ok(void __user *log_base, struct vhost_memory *mem,
  208. int log_all)
  209. {
  210. int i;
  211. if (!mem)
  212. return 0;
  213. for (i = 0; i < mem->nregions; ++i) {
  214. struct vhost_memory_region *m = mem->regions + i;
  215. unsigned long a = m->userspace_addr;
  216. if (m->memory_size > ULONG_MAX)
  217. return 0;
  218. else if (!access_ok(VERIFY_WRITE, (void __user *)a,
  219. m->memory_size))
  220. return 0;
  221. else if (log_all && !log_access_ok(log_base,
  222. m->guest_phys_addr,
  223. m->memory_size))
  224. return 0;
  225. }
  226. return 1;
  227. }
  228. /* Can we switch to this memory table? */
  229. /* Caller should have device mutex but not vq mutex */
  230. static int memory_access_ok(struct vhost_dev *d, struct vhost_memory *mem,
  231. int log_all)
  232. {
  233. int i;
  234. for (i = 0; i < d->nvqs; ++i) {
  235. int ok;
  236. mutex_lock(&d->vqs[i].mutex);
  237. /* If ring is inactive, will check when it's enabled. */
  238. if (d->vqs[i].private_data)
  239. ok = vq_memory_access_ok(d->vqs[i].log_base, mem,
  240. log_all);
  241. else
  242. ok = 1;
  243. mutex_unlock(&d->vqs[i].mutex);
  244. if (!ok)
  245. return 0;
  246. }
  247. return 1;
  248. }
  249. static int vq_access_ok(unsigned int num,
  250. struct vring_desc __user *desc,
  251. struct vring_avail __user *avail,
  252. struct vring_used __user *used)
  253. {
  254. return access_ok(VERIFY_READ, desc, num * sizeof *desc) &&
  255. access_ok(VERIFY_READ, avail,
  256. sizeof *avail + num * sizeof *avail->ring) &&
  257. access_ok(VERIFY_WRITE, used,
  258. sizeof *used + num * sizeof *used->ring);
  259. }
  260. /* Can we log writes? */
  261. /* Caller should have device mutex but not vq mutex */
  262. int vhost_log_access_ok(struct vhost_dev *dev)
  263. {
  264. return memory_access_ok(dev, dev->memory, 1);
  265. }
  266. /* Verify access for write logging. */
  267. /* Caller should have vq mutex and device mutex */
  268. static int vq_log_access_ok(struct vhost_virtqueue *vq, void __user *log_base)
  269. {
  270. return vq_memory_access_ok(log_base, vq->dev->memory,
  271. vhost_has_feature(vq->dev, VHOST_F_LOG_ALL)) &&
  272. (!vq->log_used || log_access_ok(log_base, vq->log_addr,
  273. sizeof *vq->used +
  274. vq->num * sizeof *vq->used->ring));
  275. }
  276. /* Can we start vq? */
  277. /* Caller should have vq mutex and device mutex */
  278. int vhost_vq_access_ok(struct vhost_virtqueue *vq)
  279. {
  280. return vq_access_ok(vq->num, vq->desc, vq->avail, vq->used) &&
  281. vq_log_access_ok(vq, vq->log_base);
  282. }
  283. static long vhost_set_memory(struct vhost_dev *d, struct vhost_memory __user *m)
  284. {
  285. struct vhost_memory mem, *newmem, *oldmem;
  286. unsigned long size = offsetof(struct vhost_memory, regions);
  287. long r;
  288. r = copy_from_user(&mem, m, size);
  289. if (r)
  290. return r;
  291. if (mem.padding)
  292. return -EOPNOTSUPP;
  293. if (mem.nregions > VHOST_MEMORY_MAX_NREGIONS)
  294. return -E2BIG;
  295. newmem = kmalloc(size + mem.nregions * sizeof *m->regions, GFP_KERNEL);
  296. if (!newmem)
  297. return -ENOMEM;
  298. memcpy(newmem, &mem, size);
  299. r = copy_from_user(newmem->regions, m->regions,
  300. mem.nregions * sizeof *m->regions);
  301. if (r) {
  302. kfree(newmem);
  303. return r;
  304. }
  305. if (!memory_access_ok(d, newmem, vhost_has_feature(d, VHOST_F_LOG_ALL)))
  306. return -EFAULT;
  307. oldmem = d->memory;
  308. rcu_assign_pointer(d->memory, newmem);
  309. synchronize_rcu();
  310. kfree(oldmem);
  311. return 0;
  312. }
  313. static int init_used(struct vhost_virtqueue *vq,
  314. struct vring_used __user *used)
  315. {
  316. int r = put_user(vq->used_flags, &used->flags);
  317. if (r)
  318. return r;
  319. return get_user(vq->last_used_idx, &used->idx);
  320. }
  321. static long vhost_set_vring(struct vhost_dev *d, int ioctl, void __user *argp)
  322. {
  323. struct file *eventfp, *filep = NULL,
  324. *pollstart = NULL, *pollstop = NULL;
  325. struct eventfd_ctx *ctx = NULL;
  326. u32 __user *idxp = argp;
  327. struct vhost_virtqueue *vq;
  328. struct vhost_vring_state s;
  329. struct vhost_vring_file f;
  330. struct vhost_vring_addr a;
  331. u32 idx;
  332. long r;
  333. r = get_user(idx, idxp);
  334. if (r < 0)
  335. return r;
  336. if (idx > d->nvqs)
  337. return -ENOBUFS;
  338. vq = d->vqs + idx;
  339. mutex_lock(&vq->mutex);
  340. switch (ioctl) {
  341. case VHOST_SET_VRING_NUM:
  342. /* Resizing ring with an active backend?
  343. * You don't want to do that. */
  344. if (vq->private_data) {
  345. r = -EBUSY;
  346. break;
  347. }
  348. r = copy_from_user(&s, argp, sizeof s);
  349. if (r < 0)
  350. break;
  351. if (!s.num || s.num > 0xffff || (s.num & (s.num - 1))) {
  352. r = -EINVAL;
  353. break;
  354. }
  355. vq->num = s.num;
  356. break;
  357. case VHOST_SET_VRING_BASE:
  358. /* Moving base with an active backend?
  359. * You don't want to do that. */
  360. if (vq->private_data) {
  361. r = -EBUSY;
  362. break;
  363. }
  364. r = copy_from_user(&s, argp, sizeof s);
  365. if (r < 0)
  366. break;
  367. if (s.num > 0xffff) {
  368. r = -EINVAL;
  369. break;
  370. }
  371. vq->last_avail_idx = s.num;
  372. /* Forget the cached index value. */
  373. vq->avail_idx = vq->last_avail_idx;
  374. break;
  375. case VHOST_GET_VRING_BASE:
  376. s.index = idx;
  377. s.num = vq->last_avail_idx;
  378. r = copy_to_user(argp, &s, sizeof s);
  379. break;
  380. case VHOST_SET_VRING_ADDR:
  381. r = copy_from_user(&a, argp, sizeof a);
  382. if (r < 0)
  383. break;
  384. if (a.flags & ~(0x1 << VHOST_VRING_F_LOG)) {
  385. r = -EOPNOTSUPP;
  386. break;
  387. }
  388. /* For 32bit, verify that the top 32bits of the user
  389. data are set to zero. */
  390. if ((u64)(unsigned long)a.desc_user_addr != a.desc_user_addr ||
  391. (u64)(unsigned long)a.used_user_addr != a.used_user_addr ||
  392. (u64)(unsigned long)a.avail_user_addr != a.avail_user_addr) {
  393. r = -EFAULT;
  394. break;
  395. }
  396. if ((a.avail_user_addr & (sizeof *vq->avail->ring - 1)) ||
  397. (a.used_user_addr & (sizeof *vq->used->ring - 1)) ||
  398. (a.log_guest_addr & (sizeof *vq->used->ring - 1))) {
  399. r = -EINVAL;
  400. break;
  401. }
  402. /* We only verify access here if backend is configured.
  403. * If it is not, we don't as size might not have been setup.
  404. * We will verify when backend is configured. */
  405. if (vq->private_data) {
  406. if (!vq_access_ok(vq->num,
  407. (void __user *)(unsigned long)a.desc_user_addr,
  408. (void __user *)(unsigned long)a.avail_user_addr,
  409. (void __user *)(unsigned long)a.used_user_addr)) {
  410. r = -EINVAL;
  411. break;
  412. }
  413. /* Also validate log access for used ring if enabled. */
  414. if ((a.flags & (0x1 << VHOST_VRING_F_LOG)) &&
  415. !log_access_ok(vq->log_base, a.log_guest_addr,
  416. sizeof *vq->used +
  417. vq->num * sizeof *vq->used->ring)) {
  418. r = -EINVAL;
  419. break;
  420. }
  421. }
  422. r = init_used(vq, (struct vring_used __user *)(unsigned long)
  423. a.used_user_addr);
  424. if (r)
  425. break;
  426. vq->log_used = !!(a.flags & (0x1 << VHOST_VRING_F_LOG));
  427. vq->desc = (void __user *)(unsigned long)a.desc_user_addr;
  428. vq->avail = (void __user *)(unsigned long)a.avail_user_addr;
  429. vq->log_addr = a.log_guest_addr;
  430. vq->used = (void __user *)(unsigned long)a.used_user_addr;
  431. break;
  432. case VHOST_SET_VRING_KICK:
  433. r = copy_from_user(&f, argp, sizeof f);
  434. if (r < 0)
  435. break;
  436. eventfp = f.fd == -1 ? NULL : eventfd_fget(f.fd);
  437. if (IS_ERR(eventfp)) {
  438. r = PTR_ERR(eventfp);
  439. break;
  440. }
  441. if (eventfp != vq->kick) {
  442. pollstop = filep = vq->kick;
  443. pollstart = vq->kick = eventfp;
  444. } else
  445. filep = eventfp;
  446. break;
  447. case VHOST_SET_VRING_CALL:
  448. r = copy_from_user(&f, argp, sizeof f);
  449. if (r < 0)
  450. break;
  451. eventfp = f.fd == -1 ? NULL : eventfd_fget(f.fd);
  452. if (IS_ERR(eventfp)) {
  453. r = PTR_ERR(eventfp);
  454. break;
  455. }
  456. if (eventfp != vq->call) {
  457. filep = vq->call;
  458. ctx = vq->call_ctx;
  459. vq->call = eventfp;
  460. vq->call_ctx = eventfp ?
  461. eventfd_ctx_fileget(eventfp) : NULL;
  462. } else
  463. filep = eventfp;
  464. break;
  465. case VHOST_SET_VRING_ERR:
  466. r = copy_from_user(&f, argp, sizeof f);
  467. if (r < 0)
  468. break;
  469. eventfp = f.fd == -1 ? NULL : eventfd_fget(f.fd);
  470. if (IS_ERR(eventfp)) {
  471. r = PTR_ERR(eventfp);
  472. break;
  473. }
  474. if (eventfp != vq->error) {
  475. filep = vq->error;
  476. vq->error = eventfp;
  477. ctx = vq->error_ctx;
  478. vq->error_ctx = eventfp ?
  479. eventfd_ctx_fileget(eventfp) : NULL;
  480. } else
  481. filep = eventfp;
  482. break;
  483. default:
  484. r = -ENOIOCTLCMD;
  485. }
  486. if (pollstop && vq->handle_kick)
  487. vhost_poll_stop(&vq->poll);
  488. if (ctx)
  489. eventfd_ctx_put(ctx);
  490. if (filep)
  491. fput(filep);
  492. if (pollstart && vq->handle_kick)
  493. vhost_poll_start(&vq->poll, vq->kick);
  494. mutex_unlock(&vq->mutex);
  495. if (pollstop && vq->handle_kick)
  496. vhost_poll_flush(&vq->poll);
  497. return r;
  498. }
  499. /* Caller must have device mutex */
  500. long vhost_dev_ioctl(struct vhost_dev *d, unsigned int ioctl, unsigned long arg)
  501. {
  502. void __user *argp = (void __user *)arg;
  503. struct file *eventfp, *filep = NULL;
  504. struct eventfd_ctx *ctx = NULL;
  505. u64 p;
  506. long r;
  507. int i, fd;
  508. /* If you are not the owner, you can become one */
  509. if (ioctl == VHOST_SET_OWNER) {
  510. r = vhost_dev_set_owner(d);
  511. goto done;
  512. }
  513. /* You must be the owner to do anything else */
  514. r = vhost_dev_check_owner(d);
  515. if (r)
  516. goto done;
  517. switch (ioctl) {
  518. case VHOST_SET_MEM_TABLE:
  519. r = vhost_set_memory(d, argp);
  520. break;
  521. case VHOST_SET_LOG_BASE:
  522. r = copy_from_user(&p, argp, sizeof p);
  523. if (r < 0)
  524. break;
  525. if ((u64)(unsigned long)p != p) {
  526. r = -EFAULT;
  527. break;
  528. }
  529. for (i = 0; i < d->nvqs; ++i) {
  530. struct vhost_virtqueue *vq;
  531. void __user *base = (void __user *)(unsigned long)p;
  532. vq = d->vqs + i;
  533. mutex_lock(&vq->mutex);
  534. /* If ring is inactive, will check when it's enabled. */
  535. if (vq->private_data && !vq_log_access_ok(vq, base))
  536. r = -EFAULT;
  537. else
  538. vq->log_base = base;
  539. mutex_unlock(&vq->mutex);
  540. }
  541. break;
  542. case VHOST_SET_LOG_FD:
  543. r = get_user(fd, (int __user *)argp);
  544. if (r < 0)
  545. break;
  546. eventfp = fd == -1 ? NULL : eventfd_fget(fd);
  547. if (IS_ERR(eventfp)) {
  548. r = PTR_ERR(eventfp);
  549. break;
  550. }
  551. if (eventfp != d->log_file) {
  552. filep = d->log_file;
  553. ctx = d->log_ctx;
  554. d->log_ctx = eventfp ?
  555. eventfd_ctx_fileget(eventfp) : NULL;
  556. } else
  557. filep = eventfp;
  558. for (i = 0; i < d->nvqs; ++i) {
  559. mutex_lock(&d->vqs[i].mutex);
  560. d->vqs[i].log_ctx = d->log_ctx;
  561. mutex_unlock(&d->vqs[i].mutex);
  562. }
  563. if (ctx)
  564. eventfd_ctx_put(ctx);
  565. if (filep)
  566. fput(filep);
  567. break;
  568. default:
  569. r = vhost_set_vring(d, ioctl, argp);
  570. break;
  571. }
  572. done:
  573. return r;
  574. }
  575. static const struct vhost_memory_region *find_region(struct vhost_memory *mem,
  576. __u64 addr, __u32 len)
  577. {
  578. struct vhost_memory_region *reg;
  579. int i;
  580. /* linear search is not brilliant, but we really have on the order of 6
  581. * regions in practice */
  582. for (i = 0; i < mem->nregions; ++i) {
  583. reg = mem->regions + i;
  584. if (reg->guest_phys_addr <= addr &&
  585. reg->guest_phys_addr + reg->memory_size - 1 >= addr)
  586. return reg;
  587. }
  588. return NULL;
  589. }
  590. /* TODO: This is really inefficient. We need something like get_user()
  591. * (instruction directly accesses the data, with an exception table entry
  592. * returning -EFAULT). See Documentation/x86/exception-tables.txt.
  593. */
  594. static int set_bit_to_user(int nr, void __user *addr)
  595. {
  596. unsigned long log = (unsigned long)addr;
  597. struct page *page;
  598. void *base;
  599. int bit = nr + (log % PAGE_SIZE) * 8;
  600. int r;
  601. r = get_user_pages_fast(log, 1, 1, &page);
  602. if (r < 0)
  603. return r;
  604. BUG_ON(r != 1);
  605. base = kmap_atomic(page, KM_USER0);
  606. set_bit(bit, base);
  607. kunmap_atomic(base, KM_USER0);
  608. set_page_dirty_lock(page);
  609. put_page(page);
  610. return 0;
  611. }
  612. static int log_write(void __user *log_base,
  613. u64 write_address, u64 write_length)
  614. {
  615. int r;
  616. if (!write_length)
  617. return 0;
  618. write_address /= VHOST_PAGE_SIZE;
  619. for (;;) {
  620. u64 base = (u64)(unsigned long)log_base;
  621. u64 log = base + write_address / 8;
  622. int bit = write_address % 8;
  623. if ((u64)(unsigned long)log != log)
  624. return -EFAULT;
  625. r = set_bit_to_user(bit, (void __user *)(unsigned long)log);
  626. if (r < 0)
  627. return r;
  628. if (write_length <= VHOST_PAGE_SIZE)
  629. break;
  630. write_length -= VHOST_PAGE_SIZE;
  631. write_address += VHOST_PAGE_SIZE;
  632. }
  633. return r;
  634. }
  635. int vhost_log_write(struct vhost_virtqueue *vq, struct vhost_log *log,
  636. unsigned int log_num, u64 len)
  637. {
  638. int i, r;
  639. /* Make sure data written is seen before log. */
  640. smp_wmb();
  641. for (i = 0; i < log_num; ++i) {
  642. u64 l = min(log[i].len, len);
  643. r = log_write(vq->log_base, log[i].addr, l);
  644. if (r < 0)
  645. return r;
  646. len -= l;
  647. if (!len)
  648. return 0;
  649. }
  650. if (vq->log_ctx)
  651. eventfd_signal(vq->log_ctx, 1);
  652. /* Length written exceeds what we have stored. This is a bug. */
  653. BUG();
  654. return 0;
  655. }
  656. int translate_desc(struct vhost_dev *dev, u64 addr, u32 len,
  657. struct iovec iov[], int iov_size)
  658. {
  659. const struct vhost_memory_region *reg;
  660. struct vhost_memory *mem;
  661. struct iovec *_iov;
  662. u64 s = 0;
  663. int ret = 0;
  664. rcu_read_lock();
  665. mem = rcu_dereference(dev->memory);
  666. while ((u64)len > s) {
  667. u64 size;
  668. if (ret >= iov_size) {
  669. ret = -ENOBUFS;
  670. break;
  671. }
  672. reg = find_region(mem, addr, len);
  673. if (!reg) {
  674. ret = -EFAULT;
  675. break;
  676. }
  677. _iov = iov + ret;
  678. size = reg->memory_size - addr + reg->guest_phys_addr;
  679. _iov->iov_len = min((u64)len, size);
  680. _iov->iov_base = (void *)(unsigned long)
  681. (reg->userspace_addr + addr - reg->guest_phys_addr);
  682. s += size;
  683. addr += size;
  684. ++ret;
  685. }
  686. rcu_read_unlock();
  687. return ret;
  688. }
  689. /* Each buffer in the virtqueues is actually a chain of descriptors. This
  690. * function returns the next descriptor in the chain,
  691. * or -1U if we're at the end. */
  692. static unsigned next_desc(struct vring_desc *desc)
  693. {
  694. unsigned int next;
  695. /* If this descriptor says it doesn't chain, we're done. */
  696. if (!(desc->flags & VRING_DESC_F_NEXT))
  697. return -1U;
  698. /* Check they're not leading us off end of descriptors. */
  699. next = desc->next;
  700. /* Make sure compiler knows to grab that: we don't want it changing! */
  701. /* We will use the result as an index in an array, so most
  702. * architectures only need a compiler barrier here. */
  703. read_barrier_depends();
  704. return next;
  705. }
  706. static unsigned get_indirect(struct vhost_dev *dev, struct vhost_virtqueue *vq,
  707. struct iovec iov[], unsigned int iov_size,
  708. unsigned int *out_num, unsigned int *in_num,
  709. struct vhost_log *log, unsigned int *log_num,
  710. struct vring_desc *indirect)
  711. {
  712. struct vring_desc desc;
  713. unsigned int i = 0, count, found = 0;
  714. int ret;
  715. /* Sanity check */
  716. if (indirect->len % sizeof desc) {
  717. vq_err(vq, "Invalid length in indirect descriptor: "
  718. "len 0x%llx not multiple of 0x%zx\n",
  719. (unsigned long long)indirect->len,
  720. sizeof desc);
  721. return -EINVAL;
  722. }
  723. ret = translate_desc(dev, indirect->addr, indirect->len, vq->indirect,
  724. ARRAY_SIZE(vq->indirect));
  725. if (ret < 0) {
  726. vq_err(vq, "Translation failure %d in indirect.\n", ret);
  727. return ret;
  728. }
  729. /* We will use the result as an address to read from, so most
  730. * architectures only need a compiler barrier here. */
  731. read_barrier_depends();
  732. count = indirect->len / sizeof desc;
  733. /* Buffers are chained via a 16 bit next field, so
  734. * we can have at most 2^16 of these. */
  735. if (count > USHORT_MAX + 1) {
  736. vq_err(vq, "Indirect buffer length too big: %d\n",
  737. indirect->len);
  738. return -E2BIG;
  739. }
  740. do {
  741. unsigned iov_count = *in_num + *out_num;
  742. if (++found > count) {
  743. vq_err(vq, "Loop detected: last one at %u "
  744. "indirect size %u\n",
  745. i, count);
  746. return -EINVAL;
  747. }
  748. if (memcpy_fromiovec((unsigned char *)&desc, vq->indirect,
  749. sizeof desc)) {
  750. vq_err(vq, "Failed indirect descriptor: idx %d, %zx\n",
  751. i, (size_t)indirect->addr + i * sizeof desc);
  752. return -EINVAL;
  753. }
  754. if (desc.flags & VRING_DESC_F_INDIRECT) {
  755. vq_err(vq, "Nested indirect descriptor: idx %d, %zx\n",
  756. i, (size_t)indirect->addr + i * sizeof desc);
  757. return -EINVAL;
  758. }
  759. ret = translate_desc(dev, desc.addr, desc.len, iov + iov_count,
  760. iov_size - iov_count);
  761. if (ret < 0) {
  762. vq_err(vq, "Translation failure %d indirect idx %d\n",
  763. ret, i);
  764. return ret;
  765. }
  766. /* If this is an input descriptor, increment that count. */
  767. if (desc.flags & VRING_DESC_F_WRITE) {
  768. *in_num += ret;
  769. if (unlikely(log)) {
  770. log[*log_num].addr = desc.addr;
  771. log[*log_num].len = desc.len;
  772. ++*log_num;
  773. }
  774. } else {
  775. /* If it's an output descriptor, they're all supposed
  776. * to come before any input descriptors. */
  777. if (*in_num) {
  778. vq_err(vq, "Indirect descriptor "
  779. "has out after in: idx %d\n", i);
  780. return -EINVAL;
  781. }
  782. *out_num += ret;
  783. }
  784. } while ((i = next_desc(&desc)) != -1);
  785. return 0;
  786. }
  787. /* This looks in the virtqueue and for the first available buffer, and converts
  788. * it to an iovec for convenient access. Since descriptors consist of some
  789. * number of output then some number of input descriptors, it's actually two
  790. * iovecs, but we pack them into one and note how many of each there were.
  791. *
  792. * This function returns the descriptor number found, or vq->num (which
  793. * is never a valid descriptor number) if none was found. */
  794. unsigned vhost_get_vq_desc(struct vhost_dev *dev, struct vhost_virtqueue *vq,
  795. struct iovec iov[], unsigned int iov_size,
  796. unsigned int *out_num, unsigned int *in_num,
  797. struct vhost_log *log, unsigned int *log_num)
  798. {
  799. struct vring_desc desc;
  800. unsigned int i, head, found = 0;
  801. u16 last_avail_idx;
  802. int ret;
  803. /* Check it isn't doing very strange things with descriptor numbers. */
  804. last_avail_idx = vq->last_avail_idx;
  805. if (get_user(vq->avail_idx, &vq->avail->idx)) {
  806. vq_err(vq, "Failed to access avail idx at %p\n",
  807. &vq->avail->idx);
  808. return vq->num;
  809. }
  810. if ((u16)(vq->avail_idx - last_avail_idx) > vq->num) {
  811. vq_err(vq, "Guest moved used index from %u to %u",
  812. last_avail_idx, vq->avail_idx);
  813. return vq->num;
  814. }
  815. /* If there's nothing new since last we looked, return invalid. */
  816. if (vq->avail_idx == last_avail_idx)
  817. return vq->num;
  818. /* Only get avail ring entries after they have been exposed by guest. */
  819. smp_rmb();
  820. /* Grab the next descriptor number they're advertising, and increment
  821. * the index we've seen. */
  822. if (get_user(head, &vq->avail->ring[last_avail_idx % vq->num])) {
  823. vq_err(vq, "Failed to read head: idx %d address %p\n",
  824. last_avail_idx,
  825. &vq->avail->ring[last_avail_idx % vq->num]);
  826. return vq->num;
  827. }
  828. /* If their number is silly, that's an error. */
  829. if (head >= vq->num) {
  830. vq_err(vq, "Guest says index %u > %u is available",
  831. head, vq->num);
  832. return vq->num;
  833. }
  834. /* When we start there are none of either input nor output. */
  835. *out_num = *in_num = 0;
  836. if (unlikely(log))
  837. *log_num = 0;
  838. i = head;
  839. do {
  840. unsigned iov_count = *in_num + *out_num;
  841. if (i >= vq->num) {
  842. vq_err(vq, "Desc index is %u > %u, head = %u",
  843. i, vq->num, head);
  844. return vq->num;
  845. }
  846. if (++found > vq->num) {
  847. vq_err(vq, "Loop detected: last one at %u "
  848. "vq size %u head %u\n",
  849. i, vq->num, head);
  850. return vq->num;
  851. }
  852. ret = copy_from_user(&desc, vq->desc + i, sizeof desc);
  853. if (ret) {
  854. vq_err(vq, "Failed to get descriptor: idx %d addr %p\n",
  855. i, vq->desc + i);
  856. return vq->num;
  857. }
  858. if (desc.flags & VRING_DESC_F_INDIRECT) {
  859. ret = get_indirect(dev, vq, iov, iov_size,
  860. out_num, in_num,
  861. log, log_num, &desc);
  862. if (ret < 0) {
  863. vq_err(vq, "Failure detected "
  864. "in indirect descriptor at idx %d\n", i);
  865. return vq->num;
  866. }
  867. continue;
  868. }
  869. ret = translate_desc(dev, desc.addr, desc.len, iov + iov_count,
  870. iov_size - iov_count);
  871. if (ret < 0) {
  872. vq_err(vq, "Translation failure %d descriptor idx %d\n",
  873. ret, i);
  874. return vq->num;
  875. }
  876. if (desc.flags & VRING_DESC_F_WRITE) {
  877. /* If this is an input descriptor,
  878. * increment that count. */
  879. *in_num += ret;
  880. if (unlikely(log)) {
  881. log[*log_num].addr = desc.addr;
  882. log[*log_num].len = desc.len;
  883. ++*log_num;
  884. }
  885. } else {
  886. /* If it's an output descriptor, they're all supposed
  887. * to come before any input descriptors. */
  888. if (*in_num) {
  889. vq_err(vq, "Descriptor has out after in: "
  890. "idx %d\n", i);
  891. return vq->num;
  892. }
  893. *out_num += ret;
  894. }
  895. } while ((i = next_desc(&desc)) != -1);
  896. /* On success, increment avail index. */
  897. vq->last_avail_idx++;
  898. return head;
  899. }
  900. /* Reverse the effect of vhost_get_vq_desc. Useful for error handling. */
  901. void vhost_discard_vq_desc(struct vhost_virtqueue *vq)
  902. {
  903. vq->last_avail_idx--;
  904. }
  905. /* After we've used one of their buffers, we tell them about it. We'll then
  906. * want to notify the guest, using eventfd. */
  907. int vhost_add_used(struct vhost_virtqueue *vq, unsigned int head, int len)
  908. {
  909. struct vring_used_elem *used;
  910. /* The virtqueue contains a ring of used buffers. Get a pointer to the
  911. * next entry in that used ring. */
  912. used = &vq->used->ring[vq->last_used_idx % vq->num];
  913. if (put_user(head, &used->id)) {
  914. vq_err(vq, "Failed to write used id");
  915. return -EFAULT;
  916. }
  917. if (put_user(len, &used->len)) {
  918. vq_err(vq, "Failed to write used len");
  919. return -EFAULT;
  920. }
  921. /* Make sure buffer is written before we update index. */
  922. smp_wmb();
  923. if (put_user(vq->last_used_idx + 1, &vq->used->idx)) {
  924. vq_err(vq, "Failed to increment used idx");
  925. return -EFAULT;
  926. }
  927. if (unlikely(vq->log_used)) {
  928. /* Make sure data is seen before log. */
  929. smp_wmb();
  930. /* Log used ring entry write. */
  931. log_write(vq->log_base,
  932. vq->log_addr + ((void *)used - (void *)vq->used),
  933. sizeof *used);
  934. /* Log used index update. */
  935. log_write(vq->log_base,
  936. vq->log_addr + offsetof(struct vring_used, idx),
  937. sizeof vq->used->idx);
  938. if (vq->log_ctx)
  939. eventfd_signal(vq->log_ctx, 1);
  940. }
  941. vq->last_used_idx++;
  942. return 0;
  943. }
  944. /* This actually signals the guest, using eventfd. */
  945. void vhost_signal(struct vhost_dev *dev, struct vhost_virtqueue *vq)
  946. {
  947. __u16 flags = 0;
  948. if (get_user(flags, &vq->avail->flags)) {
  949. vq_err(vq, "Failed to get flags");
  950. return;
  951. }
  952. /* If they don't want an interrupt, don't signal, unless empty. */
  953. if ((flags & VRING_AVAIL_F_NO_INTERRUPT) &&
  954. (vq->avail_idx != vq->last_avail_idx ||
  955. !vhost_has_feature(dev, VIRTIO_F_NOTIFY_ON_EMPTY)))
  956. return;
  957. /* Signal the Guest tell them we used something up. */
  958. if (vq->call_ctx)
  959. eventfd_signal(vq->call_ctx, 1);
  960. }
  961. /* And here's the combo meal deal. Supersize me! */
  962. void vhost_add_used_and_signal(struct vhost_dev *dev,
  963. struct vhost_virtqueue *vq,
  964. unsigned int head, int len)
  965. {
  966. vhost_add_used(vq, head, len);
  967. vhost_signal(dev, vq);
  968. }
  969. /* OK, now we need to know about added descriptors. */
  970. bool vhost_enable_notify(struct vhost_virtqueue *vq)
  971. {
  972. u16 avail_idx;
  973. int r;
  974. if (!(vq->used_flags & VRING_USED_F_NO_NOTIFY))
  975. return false;
  976. vq->used_flags &= ~VRING_USED_F_NO_NOTIFY;
  977. r = put_user(vq->used_flags, &vq->used->flags);
  978. if (r) {
  979. vq_err(vq, "Failed to enable notification at %p: %d\n",
  980. &vq->used->flags, r);
  981. return false;
  982. }
  983. /* They could have slipped one in as we were doing that: make
  984. * sure it's written, then check again. */
  985. smp_mb();
  986. r = get_user(avail_idx, &vq->avail->idx);
  987. if (r) {
  988. vq_err(vq, "Failed to check avail idx at %p: %d\n",
  989. &vq->avail->idx, r);
  990. return false;
  991. }
  992. return avail_idx != vq->last_avail_idx;
  993. }
  994. /* We don't need to be notified again. */
  995. void vhost_disable_notify(struct vhost_virtqueue *vq)
  996. {
  997. int r;
  998. if (vq->used_flags & VRING_USED_F_NO_NOTIFY)
  999. return;
  1000. vq->used_flags |= VRING_USED_F_NO_NOTIFY;
  1001. r = put_user(vq->used_flags, &vq->used->flags);
  1002. if (r)
  1003. vq_err(vq, "Failed to enable notification at %p: %d\n",
  1004. &vq->used->flags, r);
  1005. }
  1006. int vhost_init(void)
  1007. {
  1008. vhost_workqueue = create_singlethread_workqueue("vhost");
  1009. if (!vhost_workqueue)
  1010. return -ENOMEM;
  1011. return 0;
  1012. }
  1013. void vhost_cleanup(void)
  1014. {
  1015. destroy_workqueue(vhost_workqueue);
  1016. }