1 /* Copyright (C) 2009 Red Hat, Inc.
2 * Copyright (C) 2006 Rusty Russell IBM Corporation
6 * Inspiration, some code, and most witty comments come from
7 * Documentation/virtual/lguest/lguest.c, by Rusty Russell
9 * This work is licensed under the terms of the GNU GPL, version 2.
11 * Generic code for virtio server in host kernel.
14 #include <linux/eventfd.h>
15 #include <linux/vhost.h>
16 #include <linux/uio.h>
18 #include <linux/mmu_context.h>
19 #include <linux/miscdevice.h>
20 #include <linux/mutex.h>
21 #include <linux/poll.h>
22 #include <linux/file.h>
23 #include <linux/highmem.h>
24 #include <linux/slab.h>
25 #include <linux/vmalloc.h>
26 #include <linux/kthread.h>
27 #include <linux/cgroup.h>
28 #include <linux/module.h>
29 #include <linux/sort.h>
30 #include <linux/sched/mm.h>
31 #include <linux/sched/signal.h>
32 #include <linux/interval_tree_generic.h>
36 static ushort max_mem_regions = 64;
37 module_param(max_mem_regions, ushort, 0444);
38 MODULE_PARM_DESC(max_mem_regions,
39 "Maximum number of memory regions in memory map. (default: 64)");
40 static int max_iotlb_entries = 2048;
41 module_param(max_iotlb_entries, int, 0444);
42 MODULE_PARM_DESC(max_iotlb_entries,
43 "Maximum number of iotlb entries. (default: 2048)");
46 VHOST_MEMORY_F_LOG = 0x1,
49 #define vhost_used_event(vq) ((__virtio16 __user *)&vq->avail->ring[vq->num])
50 #define vhost_avail_event(vq) ((__virtio16 __user *)&vq->used->ring[vq->num])
52 INTERVAL_TREE_DEFINE(struct vhost_umem_node,
53 rb, __u64, __subtree_last,
54 START, LAST, static inline, vhost_umem_interval_tree);
56 #ifdef CONFIG_VHOST_CROSS_ENDIAN_LEGACY
57 static void vhost_disable_cross_endian(struct vhost_virtqueue *vq)
59 vq->user_be = !virtio_legacy_is_little_endian();
62 static void vhost_enable_cross_endian_big(struct vhost_virtqueue *vq)
67 static void vhost_enable_cross_endian_little(struct vhost_virtqueue *vq)
72 static long vhost_set_vring_endian(struct vhost_virtqueue *vq, int __user *argp)
74 struct vhost_vring_state s;
79 if (copy_from_user(&s, argp, sizeof(s)))
82 if (s.num != VHOST_VRING_LITTLE_ENDIAN &&
83 s.num != VHOST_VRING_BIG_ENDIAN)
86 if (s.num == VHOST_VRING_BIG_ENDIAN)
87 vhost_enable_cross_endian_big(vq);
89 vhost_enable_cross_endian_little(vq);
94 static long vhost_get_vring_endian(struct vhost_virtqueue *vq, u32 idx,
97 struct vhost_vring_state s = {
102 if (copy_to_user(argp, &s, sizeof(s)))
108 static void vhost_init_is_le(struct vhost_virtqueue *vq)
110 /* Note for legacy virtio: user_be is initialized at reset time
111 * according to the host endianness. If userspace does not set an
112 * explicit endianness, the default behavior is native endian, as
113 * expected by legacy virtio.
115 vq->is_le = vhost_has_feature(vq, VIRTIO_F_VERSION_1) || !vq->user_be;
118 static void vhost_disable_cross_endian(struct vhost_virtqueue *vq)
122 static long vhost_set_vring_endian(struct vhost_virtqueue *vq, int __user *argp)
127 static long vhost_get_vring_endian(struct vhost_virtqueue *vq, u32 idx,
133 static void vhost_init_is_le(struct vhost_virtqueue *vq)
135 vq->is_le = vhost_has_feature(vq, VIRTIO_F_VERSION_1)
136 || virtio_legacy_is_little_endian();
138 #endif /* CONFIG_VHOST_CROSS_ENDIAN_LEGACY */
140 static void vhost_reset_is_le(struct vhost_virtqueue *vq)
142 vhost_init_is_le(vq);
145 struct vhost_flush_struct {
146 struct vhost_work work;
147 struct completion wait_event;
150 static void vhost_flush_work(struct vhost_work *work)
152 struct vhost_flush_struct *s;
154 s = container_of(work, struct vhost_flush_struct, work);
155 complete(&s->wait_event);
158 static void vhost_poll_func(struct file *file, wait_queue_head_t *wqh,
161 struct vhost_poll *poll;
163 poll = container_of(pt, struct vhost_poll, table);
165 add_wait_queue(wqh, &poll->wait);
168 static int vhost_poll_wakeup(wait_queue_entry_t *wait, unsigned mode, int sync,
171 struct vhost_poll *poll = container_of(wait, struct vhost_poll, wait);
173 if (!(key_to_poll(key) & poll->mask))
176 vhost_poll_queue(poll);
180 void vhost_work_init(struct vhost_work *work, vhost_work_fn_t fn)
182 clear_bit(VHOST_WORK_QUEUED, &work->flags);
185 EXPORT_SYMBOL_GPL(vhost_work_init);
187 /* Init poll structure */
188 void vhost_poll_init(struct vhost_poll *poll, vhost_work_fn_t fn,
189 __poll_t mask, struct vhost_dev *dev)
191 init_waitqueue_func_entry(&poll->wait, vhost_poll_wakeup);
192 init_poll_funcptr(&poll->table, vhost_poll_func);
197 vhost_work_init(&poll->work, fn);
199 EXPORT_SYMBOL_GPL(vhost_poll_init);
201 /* Start polling a file. We add ourselves to file's wait queue. The caller must
202 * keep a reference to a file until after vhost_poll_stop is called. */
203 int vhost_poll_start(struct vhost_poll *poll, struct file *file)
211 mask = file->f_op->poll(file, &poll->table);
213 vhost_poll_wakeup(&poll->wait, 0, 0, poll_to_key(mask));
214 if (mask & EPOLLERR) {
216 remove_wait_queue(poll->wqh, &poll->wait);
222 EXPORT_SYMBOL_GPL(vhost_poll_start);
224 /* Stop polling a file. After this function returns, it becomes safe to drop the
225 * file reference. You must also flush afterwards. */
226 void vhost_poll_stop(struct vhost_poll *poll)
229 remove_wait_queue(poll->wqh, &poll->wait);
233 EXPORT_SYMBOL_GPL(vhost_poll_stop);
235 void vhost_work_flush(struct vhost_dev *dev, struct vhost_work *work)
237 struct vhost_flush_struct flush;
240 init_completion(&flush.wait_event);
241 vhost_work_init(&flush.work, vhost_flush_work);
243 vhost_work_queue(dev, &flush.work);
244 wait_for_completion(&flush.wait_event);
247 EXPORT_SYMBOL_GPL(vhost_work_flush);
249 /* Flush any work that has been scheduled. When calling this, don't hold any
250 * locks that are also used by the callback. */
251 void vhost_poll_flush(struct vhost_poll *poll)
253 vhost_work_flush(poll->dev, &poll->work);
255 EXPORT_SYMBOL_GPL(vhost_poll_flush);
257 void vhost_work_queue(struct vhost_dev *dev, struct vhost_work *work)
262 if (!test_and_set_bit(VHOST_WORK_QUEUED, &work->flags)) {
263 /* We can only add the work to the list after we're
264 * sure it was not in the list.
265 * test_and_set_bit() implies a memory barrier.
267 llist_add(&work->node, &dev->work_list);
268 wake_up_process(dev->worker);
271 EXPORT_SYMBOL_GPL(vhost_work_queue);
273 /* A lockless hint for busy polling code to exit the loop */
274 bool vhost_has_work(struct vhost_dev *dev)
276 return !llist_empty(&dev->work_list);
278 EXPORT_SYMBOL_GPL(vhost_has_work);
280 void vhost_poll_queue(struct vhost_poll *poll)
282 vhost_work_queue(poll->dev, &poll->work);
284 EXPORT_SYMBOL_GPL(vhost_poll_queue);
286 static void __vhost_vq_meta_reset(struct vhost_virtqueue *vq)
290 for (j = 0; j < VHOST_NUM_ADDRS; j++)
291 vq->meta_iotlb[j] = NULL;
294 static void vhost_vq_meta_reset(struct vhost_dev *d)
298 for (i = 0; i < d->nvqs; ++i)
299 __vhost_vq_meta_reset(d->vqs[i]);
302 static void vhost_vq_reset(struct vhost_dev *dev,
303 struct vhost_virtqueue *vq)
309 vq->last_avail_idx = 0;
311 vq->last_used_idx = 0;
312 vq->signalled_used = 0;
313 vq->signalled_used_valid = false;
315 vq->log_used = false;
316 vq->log_addr = -1ull;
317 vq->private_data = NULL;
318 vq->acked_features = 0;
320 vq->error_ctx = NULL;
324 vhost_reset_is_le(vq);
325 vhost_disable_cross_endian(vq);
326 vq->busyloop_timeout = 0;
329 __vhost_vq_meta_reset(vq);
332 static int vhost_worker(void *data)
334 struct vhost_dev *dev = data;
335 struct vhost_work *work, *work_next;
336 struct llist_node *node;
337 mm_segment_t oldfs = get_fs();
343 /* mb paired w/ kthread_stop */
344 set_current_state(TASK_INTERRUPTIBLE);
346 if (kthread_should_stop()) {
347 __set_current_state(TASK_RUNNING);
351 node = llist_del_all(&dev->work_list);
355 node = llist_reverse_order(node);
356 /* make sure flag is seen after deletion */
358 llist_for_each_entry_safe(work, work_next, node, node) {
359 clear_bit(VHOST_WORK_QUEUED, &work->flags);
360 __set_current_state(TASK_RUNNING);
371 static void vhost_vq_free_iovecs(struct vhost_virtqueue *vq)
381 /* Helper to allocate iovec buffers for all vqs. */
382 static long vhost_dev_alloc_iovecs(struct vhost_dev *dev)
384 struct vhost_virtqueue *vq;
387 for (i = 0; i < dev->nvqs; ++i) {
389 vq->indirect = kmalloc(sizeof *vq->indirect * UIO_MAXIOV,
391 vq->log = kmalloc(sizeof *vq->log * UIO_MAXIOV, GFP_KERNEL);
392 vq->heads = kmalloc(sizeof *vq->heads * UIO_MAXIOV, GFP_KERNEL);
393 if (!vq->indirect || !vq->log || !vq->heads)
400 vhost_vq_free_iovecs(dev->vqs[i]);
404 static void vhost_dev_free_iovecs(struct vhost_dev *dev)
408 for (i = 0; i < dev->nvqs; ++i)
409 vhost_vq_free_iovecs(dev->vqs[i]);
412 void vhost_dev_init(struct vhost_dev *dev,
413 struct vhost_virtqueue **vqs, int nvqs)
415 struct vhost_virtqueue *vq;
420 mutex_init(&dev->mutex);
426 init_llist_head(&dev->work_list);
427 init_waitqueue_head(&dev->wait);
428 INIT_LIST_HEAD(&dev->read_list);
429 INIT_LIST_HEAD(&dev->pending_list);
430 spin_lock_init(&dev->iotlb_lock);
433 for (i = 0; i < dev->nvqs; ++i) {
439 mutex_init(&vq->mutex);
440 vhost_vq_reset(dev, vq);
442 vhost_poll_init(&vq->poll, vq->handle_kick,
446 EXPORT_SYMBOL_GPL(vhost_dev_init);
448 /* Caller should have device mutex */
449 long vhost_dev_check_owner(struct vhost_dev *dev)
451 /* Are you the owner? If not, I don't think you mean to do that */
452 return dev->mm == current->mm ? 0 : -EPERM;
454 EXPORT_SYMBOL_GPL(vhost_dev_check_owner);
456 struct vhost_attach_cgroups_struct {
457 struct vhost_work work;
458 struct task_struct *owner;
462 static void vhost_attach_cgroups_work(struct vhost_work *work)
464 struct vhost_attach_cgroups_struct *s;
466 s = container_of(work, struct vhost_attach_cgroups_struct, work);
467 s->ret = cgroup_attach_task_all(s->owner, current);
470 static int vhost_attach_cgroups(struct vhost_dev *dev)
472 struct vhost_attach_cgroups_struct attach;
474 attach.owner = current;
475 vhost_work_init(&attach.work, vhost_attach_cgroups_work);
476 vhost_work_queue(dev, &attach.work);
477 vhost_work_flush(dev, &attach.work);
481 /* Caller should have device mutex */
482 bool vhost_dev_has_owner(struct vhost_dev *dev)
486 EXPORT_SYMBOL_GPL(vhost_dev_has_owner);
488 /* Caller should have device mutex */
489 long vhost_dev_set_owner(struct vhost_dev *dev)
491 struct task_struct *worker;
494 /* Is there an owner already? */
495 if (vhost_dev_has_owner(dev)) {
500 /* No owner, become one */
501 dev->mm = get_task_mm(current);
502 worker = kthread_create(vhost_worker, dev, "vhost-%d", current->pid);
503 if (IS_ERR(worker)) {
504 err = PTR_ERR(worker);
508 dev->worker = worker;
509 wake_up_process(worker); /* avoid contributing to loadavg */
511 err = vhost_attach_cgroups(dev);
515 err = vhost_dev_alloc_iovecs(dev);
521 kthread_stop(worker);
530 EXPORT_SYMBOL_GPL(vhost_dev_set_owner);
532 struct vhost_umem *vhost_dev_reset_owner_prepare(void)
534 return kvzalloc(sizeof(struct vhost_umem), GFP_KERNEL);
536 EXPORT_SYMBOL_GPL(vhost_dev_reset_owner_prepare);
538 /* Caller should have device mutex */
539 void vhost_dev_reset_owner(struct vhost_dev *dev, struct vhost_umem *umem)
543 vhost_dev_cleanup(dev);
545 /* Restore memory to default empty mapping. */
546 INIT_LIST_HEAD(&umem->umem_list);
548 /* We don't need VQ locks below since vhost_dev_cleanup makes sure
549 * VQs aren't running.
551 for (i = 0; i < dev->nvqs; ++i)
552 dev->vqs[i]->umem = umem;
554 EXPORT_SYMBOL_GPL(vhost_dev_reset_owner);
556 void vhost_dev_stop(struct vhost_dev *dev)
560 for (i = 0; i < dev->nvqs; ++i) {
561 if (dev->vqs[i]->kick && dev->vqs[i]->handle_kick) {
562 vhost_poll_stop(&dev->vqs[i]->poll);
563 vhost_poll_flush(&dev->vqs[i]->poll);
567 EXPORT_SYMBOL_GPL(vhost_dev_stop);
569 static void vhost_umem_free(struct vhost_umem *umem,
570 struct vhost_umem_node *node)
572 vhost_umem_interval_tree_remove(node, &umem->umem_tree);
573 list_del(&node->link);
578 static void vhost_umem_clean(struct vhost_umem *umem)
580 struct vhost_umem_node *node, *tmp;
585 list_for_each_entry_safe(node, tmp, &umem->umem_list, link)
586 vhost_umem_free(umem, node);
591 static void vhost_clear_msg(struct vhost_dev *dev)
593 struct vhost_msg_node *node, *n;
595 spin_lock(&dev->iotlb_lock);
597 list_for_each_entry_safe(node, n, &dev->read_list, node) {
598 list_del(&node->node);
602 list_for_each_entry_safe(node, n, &dev->pending_list, node) {
603 list_del(&node->node);
607 spin_unlock(&dev->iotlb_lock);
610 void vhost_dev_cleanup(struct vhost_dev *dev)
614 for (i = 0; i < dev->nvqs; ++i) {
615 if (dev->vqs[i]->error_ctx)
616 eventfd_ctx_put(dev->vqs[i]->error_ctx);
617 if (dev->vqs[i]->kick)
618 fput(dev->vqs[i]->kick);
619 if (dev->vqs[i]->call_ctx)
620 eventfd_ctx_put(dev->vqs[i]->call_ctx);
621 vhost_vq_reset(dev, dev->vqs[i]);
623 vhost_dev_free_iovecs(dev);
625 eventfd_ctx_put(dev->log_ctx);
627 /* No one will access memory at this point */
628 vhost_umem_clean(dev->umem);
630 vhost_umem_clean(dev->iotlb);
632 vhost_clear_msg(dev);
633 wake_up_interruptible_poll(&dev->wait, EPOLLIN | EPOLLRDNORM);
634 WARN_ON(!llist_empty(&dev->work_list));
636 kthread_stop(dev->worker);
643 EXPORT_SYMBOL_GPL(vhost_dev_cleanup);
645 static int log_access_ok(void __user *log_base, u64 addr, unsigned long sz)
647 u64 a = addr / VHOST_PAGE_SIZE / 8;
649 /* Make sure 64 bit math will not overflow. */
650 if (a > ULONG_MAX - (unsigned long)log_base ||
651 a + (unsigned long)log_base > ULONG_MAX)
654 return access_ok(VERIFY_WRITE, log_base + a,
655 (sz + VHOST_PAGE_SIZE * 8 - 1) / VHOST_PAGE_SIZE / 8);
658 static bool vhost_overflow(u64 uaddr, u64 size)
660 /* Make sure 64 bit math will not overflow. */
661 return uaddr > ULONG_MAX || size > ULONG_MAX || uaddr > ULONG_MAX - size;
664 /* Caller should have vq mutex and device mutex. */
665 static int vq_memory_access_ok(void __user *log_base, struct vhost_umem *umem,
668 struct vhost_umem_node *node;
673 list_for_each_entry(node, &umem->umem_list, link) {
674 unsigned long a = node->userspace_addr;
676 if (vhost_overflow(node->userspace_addr, node->size))
680 if (!access_ok(VERIFY_WRITE, (void __user *)a,
683 else if (log_all && !log_access_ok(log_base,
691 static inline void __user *vhost_vq_meta_fetch(struct vhost_virtqueue *vq,
692 u64 addr, unsigned int size,
695 const struct vhost_umem_node *node = vq->meta_iotlb[type];
700 return (void *)(uintptr_t)(node->userspace_addr + addr - node->start);
703 /* Can we switch to this memory table? */
704 /* Caller should have device mutex but not vq mutex */
705 static int memory_access_ok(struct vhost_dev *d, struct vhost_umem *umem,
710 for (i = 0; i < d->nvqs; ++i) {
714 mutex_lock(&d->vqs[i]->mutex);
715 log = log_all || vhost_has_feature(d->vqs[i], VHOST_F_LOG_ALL);
716 /* If ring is inactive, will check when it's enabled. */
717 if (d->vqs[i]->private_data)
718 ok = vq_memory_access_ok(d->vqs[i]->log_base,
722 mutex_unlock(&d->vqs[i]->mutex);
729 static int translate_desc(struct vhost_virtqueue *vq, u64 addr, u32 len,
730 struct iovec iov[], int iov_size, int access);
732 static int vhost_copy_to_user(struct vhost_virtqueue *vq, void __user *to,
733 const void *from, unsigned size)
738 return __copy_to_user(to, from, size);
740 /* This function should be called after iotlb
741 * prefetch, which means we're sure that all vq
742 * could be access through iotlb. So -EAGAIN should
743 * not happen in this case.
746 void __user *uaddr = vhost_vq_meta_fetch(vq,
747 (u64)(uintptr_t)to, size,
751 return __copy_to_user(uaddr, from, size);
753 ret = translate_desc(vq, (u64)(uintptr_t)to, size, vq->iotlb_iov,
754 ARRAY_SIZE(vq->iotlb_iov),
758 iov_iter_init(&t, WRITE, vq->iotlb_iov, ret, size);
759 ret = copy_to_iter(from, size, &t);
767 static int vhost_copy_from_user(struct vhost_virtqueue *vq, void *to,
768 void __user *from, unsigned size)
773 return __copy_from_user(to, from, size);
775 /* This function should be called after iotlb
776 * prefetch, which means we're sure that vq
777 * could be access through iotlb. So -EAGAIN should
778 * not happen in this case.
780 void __user *uaddr = vhost_vq_meta_fetch(vq,
781 (u64)(uintptr_t)from, size,
786 return __copy_from_user(to, uaddr, size);
788 ret = translate_desc(vq, (u64)(uintptr_t)from, size, vq->iotlb_iov,
789 ARRAY_SIZE(vq->iotlb_iov),
792 vq_err(vq, "IOTLB translation failure: uaddr "
793 "%p size 0x%llx\n", from,
794 (unsigned long long) size);
797 iov_iter_init(&f, READ, vq->iotlb_iov, ret, size);
798 ret = copy_from_iter(to, size, &f);
807 static void __user *__vhost_get_user_slow(struct vhost_virtqueue *vq,
808 void __user *addr, unsigned int size,
813 ret = translate_desc(vq, (u64)(uintptr_t)addr, size, vq->iotlb_iov,
814 ARRAY_SIZE(vq->iotlb_iov),
817 vq_err(vq, "IOTLB translation failure: uaddr "
818 "%p size 0x%llx\n", addr,
819 (unsigned long long) size);
823 if (ret != 1 || vq->iotlb_iov[0].iov_len != size) {
824 vq_err(vq, "Non atomic userspace memory access: uaddr "
825 "%p size 0x%llx\n", addr,
826 (unsigned long long) size);
830 return vq->iotlb_iov[0].iov_base;
833 /* This function should be called after iotlb
834 * prefetch, which means we're sure that vq
835 * could be access through iotlb. So -EAGAIN should
836 * not happen in this case.
838 static inline void __user *__vhost_get_user(struct vhost_virtqueue *vq,
839 void *addr, unsigned int size,
842 void __user *uaddr = vhost_vq_meta_fetch(vq,
843 (u64)(uintptr_t)addr, size, type);
847 return __vhost_get_user_slow(vq, addr, size, type);
850 #define vhost_put_user(vq, x, ptr) \
854 ret = __put_user(x, ptr); \
856 __typeof__(ptr) to = \
857 (__typeof__(ptr)) __vhost_get_user(vq, ptr, \
858 sizeof(*ptr), VHOST_ADDR_USED); \
860 ret = __put_user(x, to); \
867 #define vhost_get_user(vq, x, ptr, type) \
871 ret = __get_user(x, ptr); \
873 __typeof__(ptr) from = \
874 (__typeof__(ptr)) __vhost_get_user(vq, ptr, \
878 ret = __get_user(x, from); \
885 #define vhost_get_avail(vq, x, ptr) \
886 vhost_get_user(vq, x, ptr, VHOST_ADDR_AVAIL)
888 #define vhost_get_used(vq, x, ptr) \
889 vhost_get_user(vq, x, ptr, VHOST_ADDR_USED)
891 static void vhost_dev_lock_vqs(struct vhost_dev *d)
894 for (i = 0; i < d->nvqs; ++i)
895 mutex_lock_nested(&d->vqs[i]->mutex, i);
898 static void vhost_dev_unlock_vqs(struct vhost_dev *d)
901 for (i = 0; i < d->nvqs; ++i)
902 mutex_unlock(&d->vqs[i]->mutex);
905 static int vhost_new_umem_range(struct vhost_umem *umem,
906 u64 start, u64 size, u64 end,
907 u64 userspace_addr, int perm)
909 struct vhost_umem_node *tmp, *node = kmalloc(sizeof(*node), GFP_ATOMIC);
914 if (umem->numem == max_iotlb_entries) {
915 tmp = list_first_entry(&umem->umem_list, typeof(*tmp), link);
916 vhost_umem_free(umem, tmp);
922 node->userspace_addr = userspace_addr;
924 INIT_LIST_HEAD(&node->link);
925 list_add_tail(&node->link, &umem->umem_list);
926 vhost_umem_interval_tree_insert(node, &umem->umem_tree);
932 static void vhost_del_umem_range(struct vhost_umem *umem,
935 struct vhost_umem_node *node;
937 while ((node = vhost_umem_interval_tree_iter_first(&umem->umem_tree,
939 vhost_umem_free(umem, node);
942 static void vhost_iotlb_notify_vq(struct vhost_dev *d,
943 struct vhost_iotlb_msg *msg)
945 struct vhost_msg_node *node, *n;
947 spin_lock(&d->iotlb_lock);
949 list_for_each_entry_safe(node, n, &d->pending_list, node) {
950 struct vhost_iotlb_msg *vq_msg = &node->msg.iotlb;
951 if (msg->iova <= vq_msg->iova &&
952 msg->iova + msg->size - 1 > vq_msg->iova &&
953 vq_msg->type == VHOST_IOTLB_MISS) {
954 vhost_poll_queue(&node->vq->poll);
955 list_del(&node->node);
960 spin_unlock(&d->iotlb_lock);
963 static int umem_access_ok(u64 uaddr, u64 size, int access)
965 unsigned long a = uaddr;
967 /* Make sure 64 bit math will not overflow. */
968 if (vhost_overflow(uaddr, size))
971 if ((access & VHOST_ACCESS_RO) &&
972 !access_ok(VERIFY_READ, (void __user *)a, size))
974 if ((access & VHOST_ACCESS_WO) &&
975 !access_ok(VERIFY_WRITE, (void __user *)a, size))
980 static int vhost_process_iotlb_msg(struct vhost_dev *dev,
981 struct vhost_iotlb_msg *msg)
985 vhost_dev_lock_vqs(dev);
987 case VHOST_IOTLB_UPDATE:
992 if (umem_access_ok(msg->uaddr, msg->size, msg->perm)) {
996 vhost_vq_meta_reset(dev);
997 if (vhost_new_umem_range(dev->iotlb, msg->iova, msg->size,
998 msg->iova + msg->size - 1,
999 msg->uaddr, msg->perm)) {
1003 vhost_iotlb_notify_vq(dev, msg);
1005 case VHOST_IOTLB_INVALIDATE:
1010 vhost_vq_meta_reset(dev);
1011 vhost_del_umem_range(dev->iotlb, msg->iova,
1012 msg->iova + msg->size - 1);
1019 vhost_dev_unlock_vqs(dev);
1022 ssize_t vhost_chr_write_iter(struct vhost_dev *dev,
1023 struct iov_iter *from)
1025 struct vhost_msg_node node;
1026 unsigned size = sizeof(struct vhost_msg);
1030 if (iov_iter_count(from) < size)
1032 ret = copy_from_iter(&node.msg, size, from);
1036 switch (node.msg.type) {
1037 case VHOST_IOTLB_MSG:
1038 err = vhost_process_iotlb_msg(dev, &node.msg.iotlb);
1050 EXPORT_SYMBOL(vhost_chr_write_iter);
1052 __poll_t vhost_chr_poll(struct file *file, struct vhost_dev *dev,
1057 poll_wait(file, &dev->wait, wait);
1059 if (!list_empty(&dev->read_list))
1060 mask |= EPOLLIN | EPOLLRDNORM;
1064 EXPORT_SYMBOL(vhost_chr_poll);
1066 ssize_t vhost_chr_read_iter(struct vhost_dev *dev, struct iov_iter *to,
1070 struct vhost_msg_node *node;
1072 unsigned size = sizeof(struct vhost_msg);
1074 if (iov_iter_count(to) < size)
1079 prepare_to_wait(&dev->wait, &wait,
1080 TASK_INTERRUPTIBLE);
1082 node = vhost_dequeue_msg(dev, &dev->read_list);
1089 if (signal_pending(current)) {
1102 finish_wait(&dev->wait, &wait);
1105 ret = copy_to_iter(&node->msg, size, to);
1107 if (ret != size || node->msg.type != VHOST_IOTLB_MISS) {
1112 vhost_enqueue_msg(dev, &dev->pending_list, node);
1117 EXPORT_SYMBOL_GPL(vhost_chr_read_iter);
1119 static int vhost_iotlb_miss(struct vhost_virtqueue *vq, u64 iova, int access)
1121 struct vhost_dev *dev = vq->dev;
1122 struct vhost_msg_node *node;
1123 struct vhost_iotlb_msg *msg;
1125 node = vhost_new_msg(vq, VHOST_IOTLB_MISS);
1129 msg = &node->msg.iotlb;
1130 msg->type = VHOST_IOTLB_MISS;
1134 vhost_enqueue_msg(dev, &dev->read_list, node);
1139 static int vq_access_ok(struct vhost_virtqueue *vq, unsigned int num,
1140 struct vring_desc __user *desc,
1141 struct vring_avail __user *avail,
1142 struct vring_used __user *used)
1145 size_t s = vhost_has_feature(vq, VIRTIO_RING_F_EVENT_IDX) ? 2 : 0;
1147 return access_ok(VERIFY_READ, desc, num * sizeof *desc) &&
1148 access_ok(VERIFY_READ, avail,
1149 sizeof *avail + num * sizeof *avail->ring + s) &&
1150 access_ok(VERIFY_WRITE, used,
1151 sizeof *used + num * sizeof *used->ring + s);
1154 static void vhost_vq_meta_update(struct vhost_virtqueue *vq,
1155 const struct vhost_umem_node *node,
1158 int access = (type == VHOST_ADDR_USED) ?
1159 VHOST_ACCESS_WO : VHOST_ACCESS_RO;
1161 if (likely(node->perm & access))
1162 vq->meta_iotlb[type] = node;
1165 static int iotlb_access_ok(struct vhost_virtqueue *vq,
1166 int access, u64 addr, u64 len, int type)
1168 const struct vhost_umem_node *node;
1169 struct vhost_umem *umem = vq->iotlb;
1170 u64 s = 0, size, orig_addr = addr, last = addr + len - 1;
1172 if (vhost_vq_meta_fetch(vq, addr, len, type))
1176 node = vhost_umem_interval_tree_iter_first(&umem->umem_tree,
1179 if (node == NULL || node->start > addr) {
1180 vhost_iotlb_miss(vq, addr, access);
1182 } else if (!(node->perm & access)) {
1183 /* Report the possible access violation by
1184 * request another translation from userspace.
1189 size = node->size - addr + node->start;
1191 if (orig_addr == addr && size >= len)
1192 vhost_vq_meta_update(vq, node, type);
1201 int vq_iotlb_prefetch(struct vhost_virtqueue *vq)
1203 size_t s = vhost_has_feature(vq, VIRTIO_RING_F_EVENT_IDX) ? 2 : 0;
1204 unsigned int num = vq->num;
1209 return iotlb_access_ok(vq, VHOST_ACCESS_RO, (u64)(uintptr_t)vq->desc,
1210 num * sizeof(*vq->desc), VHOST_ADDR_DESC) &&
1211 iotlb_access_ok(vq, VHOST_ACCESS_RO, (u64)(uintptr_t)vq->avail,
1213 num * sizeof(*vq->avail->ring) + s,
1214 VHOST_ADDR_AVAIL) &&
1215 iotlb_access_ok(vq, VHOST_ACCESS_WO, (u64)(uintptr_t)vq->used,
1217 num * sizeof(*vq->used->ring) + s,
1220 EXPORT_SYMBOL_GPL(vq_iotlb_prefetch);
1222 /* Can we log writes? */
1223 /* Caller should have device mutex but not vq mutex */
1224 int vhost_log_access_ok(struct vhost_dev *dev)
1226 return memory_access_ok(dev, dev->umem, 1);
1228 EXPORT_SYMBOL_GPL(vhost_log_access_ok);
1230 /* Verify access for write logging. */
1231 /* Caller should have vq mutex and device mutex */
1232 static int vq_log_access_ok(struct vhost_virtqueue *vq,
1233 void __user *log_base)
1235 size_t s = vhost_has_feature(vq, VIRTIO_RING_F_EVENT_IDX) ? 2 : 0;
1237 return vq_memory_access_ok(log_base, vq->umem,
1238 vhost_has_feature(vq, VHOST_F_LOG_ALL)) &&
1239 (!vq->log_used || log_access_ok(log_base, vq->log_addr,
1241 vq->num * sizeof *vq->used->ring + s));
1244 /* Can we start vq? */
1245 /* Caller should have vq mutex and device mutex */
1246 int vhost_vq_access_ok(struct vhost_virtqueue *vq)
1249 /* When device IOTLB was used, the access validation
1250 * will be validated during prefetching.
1254 return vq_access_ok(vq, vq->num, vq->desc, vq->avail, vq->used) &&
1255 vq_log_access_ok(vq, vq->log_base);
1257 EXPORT_SYMBOL_GPL(vhost_vq_access_ok);
1259 static struct vhost_umem *vhost_umem_alloc(void)
1261 struct vhost_umem *umem = kvzalloc(sizeof(*umem), GFP_KERNEL);
1266 umem->umem_tree = RB_ROOT_CACHED;
1268 INIT_LIST_HEAD(&umem->umem_list);
1273 static long vhost_set_memory(struct vhost_dev *d, struct vhost_memory __user *m)
1275 struct vhost_memory mem, *newmem;
1276 struct vhost_memory_region *region;
1277 struct vhost_umem *newumem, *oldumem;
1278 unsigned long size = offsetof(struct vhost_memory, regions);
1281 if (copy_from_user(&mem, m, size))
1285 if (mem.nregions > max_mem_regions)
1287 newmem = kvzalloc(size + mem.nregions * sizeof(*m->regions), GFP_KERNEL);
1291 memcpy(newmem, &mem, size);
1292 if (copy_from_user(newmem->regions, m->regions,
1293 mem.nregions * sizeof *m->regions)) {
1298 newumem = vhost_umem_alloc();
1304 for (region = newmem->regions;
1305 region < newmem->regions + mem.nregions;
1307 if (vhost_new_umem_range(newumem,
1308 region->guest_phys_addr,
1309 region->memory_size,
1310 region->guest_phys_addr +
1311 region->memory_size - 1,
1312 region->userspace_addr,
1317 if (!memory_access_ok(d, newumem, 0))
1323 /* All memory accesses are done under some VQ mutex. */
1324 for (i = 0; i < d->nvqs; ++i) {
1325 mutex_lock(&d->vqs[i]->mutex);
1326 d->vqs[i]->umem = newumem;
1327 mutex_unlock(&d->vqs[i]->mutex);
1331 vhost_umem_clean(oldumem);
1335 vhost_umem_clean(newumem);
1340 long vhost_vring_ioctl(struct vhost_dev *d, int ioctl, void __user *argp)
1342 struct file *eventfp, *filep = NULL;
1343 bool pollstart = false, pollstop = false;
1344 struct eventfd_ctx *ctx = NULL;
1345 u32 __user *idxp = argp;
1346 struct vhost_virtqueue *vq;
1347 struct vhost_vring_state s;
1348 struct vhost_vring_file f;
1349 struct vhost_vring_addr a;
1353 r = get_user(idx, idxp);
1361 mutex_lock(&vq->mutex);
1364 case VHOST_SET_VRING_NUM:
1365 /* Resizing ring with an active backend?
1366 * You don't want to do that. */
1367 if (vq->private_data) {
1371 if (copy_from_user(&s, argp, sizeof s)) {
1375 if (!s.num || s.num > 0xffff || (s.num & (s.num - 1))) {
1381 case VHOST_SET_VRING_BASE:
1382 /* Moving base with an active backend?
1383 * You don't want to do that. */
1384 if (vq->private_data) {
1388 if (copy_from_user(&s, argp, sizeof s)) {
1392 if (s.num > 0xffff) {
1396 vq->last_avail_idx = s.num;
1397 /* Forget the cached index value. */
1398 vq->avail_idx = vq->last_avail_idx;
1400 case VHOST_GET_VRING_BASE:
1402 s.num = vq->last_avail_idx;
1403 if (copy_to_user(argp, &s, sizeof s))
1406 case VHOST_SET_VRING_ADDR:
1407 if (copy_from_user(&a, argp, sizeof a)) {
1411 if (a.flags & ~(0x1 << VHOST_VRING_F_LOG)) {
1415 /* For 32bit, verify that the top 32bits of the user
1416 data are set to zero. */
1417 if ((u64)(unsigned long)a.desc_user_addr != a.desc_user_addr ||
1418 (u64)(unsigned long)a.used_user_addr != a.used_user_addr ||
1419 (u64)(unsigned long)a.avail_user_addr != a.avail_user_addr) {
1424 /* Make sure it's safe to cast pointers to vring types. */
1425 BUILD_BUG_ON(__alignof__ *vq->avail > VRING_AVAIL_ALIGN_SIZE);
1426 BUILD_BUG_ON(__alignof__ *vq->used > VRING_USED_ALIGN_SIZE);
1427 if ((a.avail_user_addr & (VRING_AVAIL_ALIGN_SIZE - 1)) ||
1428 (a.used_user_addr & (VRING_USED_ALIGN_SIZE - 1)) ||
1429 (a.log_guest_addr & (VRING_USED_ALIGN_SIZE - 1))) {
1434 /* We only verify access here if backend is configured.
1435 * If it is not, we don't as size might not have been setup.
1436 * We will verify when backend is configured. */
1437 if (vq->private_data) {
1438 if (!vq_access_ok(vq, vq->num,
1439 (void __user *)(unsigned long)a.desc_user_addr,
1440 (void __user *)(unsigned long)a.avail_user_addr,
1441 (void __user *)(unsigned long)a.used_user_addr)) {
1446 /* Also validate log access for used ring if enabled. */
1447 if ((a.flags & (0x1 << VHOST_VRING_F_LOG)) &&
1448 !log_access_ok(vq->log_base, a.log_guest_addr,
1450 vq->num * sizeof *vq->used->ring)) {
1456 vq->log_used = !!(a.flags & (0x1 << VHOST_VRING_F_LOG));
1457 vq->desc = (void __user *)(unsigned long)a.desc_user_addr;
1458 vq->avail = (void __user *)(unsigned long)a.avail_user_addr;
1459 vq->log_addr = a.log_guest_addr;
1460 vq->used = (void __user *)(unsigned long)a.used_user_addr;
1462 case VHOST_SET_VRING_KICK:
1463 if (copy_from_user(&f, argp, sizeof f)) {
1467 eventfp = f.fd == -1 ? NULL : eventfd_fget(f.fd);
1468 if (IS_ERR(eventfp)) {
1469 r = PTR_ERR(eventfp);
1472 if (eventfp != vq->kick) {
1473 pollstop = (filep = vq->kick) != NULL;
1474 pollstart = (vq->kick = eventfp) != NULL;
1478 case VHOST_SET_VRING_CALL:
1479 if (copy_from_user(&f, argp, sizeof f)) {
1483 ctx = f.fd == -1 ? NULL : eventfd_ctx_fdget(f.fd);
1488 swap(ctx, vq->call_ctx);
1490 case VHOST_SET_VRING_ERR:
1491 if (copy_from_user(&f, argp, sizeof f)) {
1495 ctx = f.fd == -1 ? NULL : eventfd_ctx_fdget(f.fd);
1500 swap(ctx, vq->error_ctx);
1502 case VHOST_SET_VRING_ENDIAN:
1503 r = vhost_set_vring_endian(vq, argp);
1505 case VHOST_GET_VRING_ENDIAN:
1506 r = vhost_get_vring_endian(vq, idx, argp);
1508 case VHOST_SET_VRING_BUSYLOOP_TIMEOUT:
1509 if (copy_from_user(&s, argp, sizeof(s))) {
1513 vq->busyloop_timeout = s.num;
1515 case VHOST_GET_VRING_BUSYLOOP_TIMEOUT:
1517 s.num = vq->busyloop_timeout;
1518 if (copy_to_user(argp, &s, sizeof(s)))
1525 if (pollstop && vq->handle_kick)
1526 vhost_poll_stop(&vq->poll);
1528 if (!IS_ERR_OR_NULL(ctx))
1529 eventfd_ctx_put(ctx);
1533 if (pollstart && vq->handle_kick)
1534 r = vhost_poll_start(&vq->poll, vq->kick);
1536 mutex_unlock(&vq->mutex);
1538 if (pollstop && vq->handle_kick)
1539 vhost_poll_flush(&vq->poll);
1542 EXPORT_SYMBOL_GPL(vhost_vring_ioctl);
1544 int vhost_init_device_iotlb(struct vhost_dev *d, bool enabled)
1546 struct vhost_umem *niotlb, *oiotlb;
1549 niotlb = vhost_umem_alloc();
1556 for (i = 0; i < d->nvqs; ++i) {
1557 mutex_lock(&d->vqs[i]->mutex);
1558 d->vqs[i]->iotlb = niotlb;
1559 mutex_unlock(&d->vqs[i]->mutex);
1562 vhost_umem_clean(oiotlb);
1566 EXPORT_SYMBOL_GPL(vhost_init_device_iotlb);
1568 /* Caller must have device mutex */
1569 long vhost_dev_ioctl(struct vhost_dev *d, unsigned int ioctl, void __user *argp)
1571 struct eventfd_ctx *ctx;
1576 /* If you are not the owner, you can become one */
1577 if (ioctl == VHOST_SET_OWNER) {
1578 r = vhost_dev_set_owner(d);
1582 /* You must be the owner to do anything else */
1583 r = vhost_dev_check_owner(d);
1588 case VHOST_SET_MEM_TABLE:
1589 r = vhost_set_memory(d, argp);
1591 case VHOST_SET_LOG_BASE:
1592 if (copy_from_user(&p, argp, sizeof p)) {
1596 if ((u64)(unsigned long)p != p) {
1600 for (i = 0; i < d->nvqs; ++i) {
1601 struct vhost_virtqueue *vq;
1602 void __user *base = (void __user *)(unsigned long)p;
1604 mutex_lock(&vq->mutex);
1605 /* If ring is inactive, will check when it's enabled. */
1606 if (vq->private_data && !vq_log_access_ok(vq, base))
1609 vq->log_base = base;
1610 mutex_unlock(&vq->mutex);
1613 case VHOST_SET_LOG_FD:
1614 r = get_user(fd, (int __user *)argp);
1617 ctx = fd == -1 ? NULL : eventfd_ctx_fdget(fd);
1622 swap(ctx, d->log_ctx);
1623 for (i = 0; i < d->nvqs; ++i) {
1624 mutex_lock(&d->vqs[i]->mutex);
1625 d->vqs[i]->log_ctx = d->log_ctx;
1626 mutex_unlock(&d->vqs[i]->mutex);
1629 eventfd_ctx_put(ctx);
1638 EXPORT_SYMBOL_GPL(vhost_dev_ioctl);
1640 /* TODO: This is really inefficient. We need something like get_user()
1641 * (instruction directly accesses the data, with an exception table entry
1642 * returning -EFAULT). See Documentation/x86/exception-tables.txt.
1644 static int set_bit_to_user(int nr, void __user *addr)
1646 unsigned long log = (unsigned long)addr;
1649 int bit = nr + (log % PAGE_SIZE) * 8;
1652 r = get_user_pages_fast(log, 1, 1, &page);
1656 base = kmap_atomic(page);
1658 kunmap_atomic(base);
1659 set_page_dirty_lock(page);
1664 static int log_write(void __user *log_base,
1665 u64 write_address, u64 write_length)
1667 u64 write_page = write_address / VHOST_PAGE_SIZE;
1672 write_length += write_address % VHOST_PAGE_SIZE;
1674 u64 base = (u64)(unsigned long)log_base;
1675 u64 log = base + write_page / 8;
1676 int bit = write_page % 8;
1677 if ((u64)(unsigned long)log != log)
1679 r = set_bit_to_user(bit, (void __user *)(unsigned long)log);
1682 if (write_length <= VHOST_PAGE_SIZE)
1684 write_length -= VHOST_PAGE_SIZE;
1690 int vhost_log_write(struct vhost_virtqueue *vq, struct vhost_log *log,
1691 unsigned int log_num, u64 len)
1695 /* Make sure data written is seen before log. */
1697 for (i = 0; i < log_num; ++i) {
1698 u64 l = min(log[i].len, len);
1699 r = log_write(vq->log_base, log[i].addr, l);
1705 eventfd_signal(vq->log_ctx, 1);
1709 /* Length written exceeds what we have stored. This is a bug. */
1713 EXPORT_SYMBOL_GPL(vhost_log_write);
1715 static int vhost_update_used_flags(struct vhost_virtqueue *vq)
1718 if (vhost_put_user(vq, cpu_to_vhost16(vq, vq->used_flags),
1719 &vq->used->flags) < 0)
1721 if (unlikely(vq->log_used)) {
1722 /* Make sure the flag is seen before log. */
1724 /* Log used flag write. */
1725 used = &vq->used->flags;
1726 log_write(vq->log_base, vq->log_addr +
1727 (used - (void __user *)vq->used),
1728 sizeof vq->used->flags);
1730 eventfd_signal(vq->log_ctx, 1);
1735 static int vhost_update_avail_event(struct vhost_virtqueue *vq, u16 avail_event)
1737 if (vhost_put_user(vq, cpu_to_vhost16(vq, vq->avail_idx),
1738 vhost_avail_event(vq)))
1740 if (unlikely(vq->log_used)) {
1742 /* Make sure the event is seen before log. */
1744 /* Log avail event write */
1745 used = vhost_avail_event(vq);
1746 log_write(vq->log_base, vq->log_addr +
1747 (used - (void __user *)vq->used),
1748 sizeof *vhost_avail_event(vq));
1750 eventfd_signal(vq->log_ctx, 1);
1755 int vhost_vq_init_access(struct vhost_virtqueue *vq)
1757 __virtio16 last_used_idx;
1759 bool is_le = vq->is_le;
1761 if (!vq->private_data)
1764 vhost_init_is_le(vq);
1766 r = vhost_update_used_flags(vq);
1769 vq->signalled_used_valid = false;
1771 !access_ok(VERIFY_READ, &vq->used->idx, sizeof vq->used->idx)) {
1775 r = vhost_get_used(vq, last_used_idx, &vq->used->idx);
1777 vq_err(vq, "Can't access used idx at %p\n",
1781 vq->last_used_idx = vhost16_to_cpu(vq, last_used_idx);
1788 EXPORT_SYMBOL_GPL(vhost_vq_init_access);
1790 static int translate_desc(struct vhost_virtqueue *vq, u64 addr, u32 len,
1791 struct iovec iov[], int iov_size, int access)
1793 const struct vhost_umem_node *node;
1794 struct vhost_dev *dev = vq->dev;
1795 struct vhost_umem *umem = dev->iotlb ? dev->iotlb : dev->umem;
1800 while ((u64)len > s) {
1802 if (unlikely(ret >= iov_size)) {
1807 node = vhost_umem_interval_tree_iter_first(&umem->umem_tree,
1808 addr, addr + len - 1);
1809 if (node == NULL || node->start > addr) {
1810 if (umem != dev->iotlb) {
1816 } else if (!(node->perm & access)) {
1822 size = node->size - addr + node->start;
1823 _iov->iov_len = min((u64)len - s, size);
1824 _iov->iov_base = (void __user *)(unsigned long)
1825 (node->userspace_addr + addr - node->start);
1832 vhost_iotlb_miss(vq, addr, access);
1836 /* Each buffer in the virtqueues is actually a chain of descriptors. This
1837 * function returns the next descriptor in the chain,
1838 * or -1U if we're at the end. */
1839 static unsigned next_desc(struct vhost_virtqueue *vq, struct vring_desc *desc)
1843 /* If this descriptor says it doesn't chain, we're done. */
1844 if (!(desc->flags & cpu_to_vhost16(vq, VRING_DESC_F_NEXT)))
1847 /* Check they're not leading us off end of descriptors. */
1848 next = vhost16_to_cpu(vq, READ_ONCE(desc->next));
1852 static int get_indirect(struct vhost_virtqueue *vq,
1853 struct iovec iov[], unsigned int iov_size,
1854 unsigned int *out_num, unsigned int *in_num,
1855 struct vhost_log *log, unsigned int *log_num,
1856 struct vring_desc *indirect)
1858 struct vring_desc desc;
1859 unsigned int i = 0, count, found = 0;
1860 u32 len = vhost32_to_cpu(vq, indirect->len);
1861 struct iov_iter from;
1865 if (unlikely(len % sizeof desc)) {
1866 vq_err(vq, "Invalid length in indirect descriptor: "
1867 "len 0x%llx not multiple of 0x%zx\n",
1868 (unsigned long long)len,
1873 ret = translate_desc(vq, vhost64_to_cpu(vq, indirect->addr), len, vq->indirect,
1874 UIO_MAXIOV, VHOST_ACCESS_RO);
1875 if (unlikely(ret < 0)) {
1877 vq_err(vq, "Translation failure %d in indirect.\n", ret);
1880 iov_iter_init(&from, READ, vq->indirect, ret, len);
1882 /* We will use the result as an address to read from, so most
1883 * architectures only need a compiler barrier here. */
1884 read_barrier_depends();
1886 count = len / sizeof desc;
1887 /* Buffers are chained via a 16 bit next field, so
1888 * we can have at most 2^16 of these. */
1889 if (unlikely(count > USHRT_MAX + 1)) {
1890 vq_err(vq, "Indirect buffer length too big: %d\n",
1896 unsigned iov_count = *in_num + *out_num;
1897 if (unlikely(++found > count)) {
1898 vq_err(vq, "Loop detected: last one at %u "
1899 "indirect size %u\n",
1903 if (unlikely(!copy_from_iter_full(&desc, sizeof(desc), &from))) {
1904 vq_err(vq, "Failed indirect descriptor: idx %d, %zx\n",
1905 i, (size_t)vhost64_to_cpu(vq, indirect->addr) + i * sizeof desc);
1908 if (unlikely(desc.flags & cpu_to_vhost16(vq, VRING_DESC_F_INDIRECT))) {
1909 vq_err(vq, "Nested indirect descriptor: idx %d, %zx\n",
1910 i, (size_t)vhost64_to_cpu(vq, indirect->addr) + i * sizeof desc);
1914 if (desc.flags & cpu_to_vhost16(vq, VRING_DESC_F_WRITE))
1915 access = VHOST_ACCESS_WO;
1917 access = VHOST_ACCESS_RO;
1919 ret = translate_desc(vq, vhost64_to_cpu(vq, desc.addr),
1920 vhost32_to_cpu(vq, desc.len), iov + iov_count,
1921 iov_size - iov_count, access);
1922 if (unlikely(ret < 0)) {
1924 vq_err(vq, "Translation failure %d indirect idx %d\n",
1928 /* If this is an input descriptor, increment that count. */
1929 if (access == VHOST_ACCESS_WO) {
1931 if (unlikely(log)) {
1932 log[*log_num].addr = vhost64_to_cpu(vq, desc.addr);
1933 log[*log_num].len = vhost32_to_cpu(vq, desc.len);
1937 /* If it's an output descriptor, they're all supposed
1938 * to come before any input descriptors. */
1939 if (unlikely(*in_num)) {
1940 vq_err(vq, "Indirect descriptor "
1941 "has out after in: idx %d\n", i);
1946 } while ((i = next_desc(vq, &desc)) != -1);
1950 /* This looks in the virtqueue and for the first available buffer, and converts
1951 * it to an iovec for convenient access. Since descriptors consist of some
1952 * number of output then some number of input descriptors, it's actually two
1953 * iovecs, but we pack them into one and note how many of each there were.
1955 * This function returns the descriptor number found, or vq->num (which is
1956 * never a valid descriptor number) if none was found. A negative code is
1957 * returned on error. */
1958 int vhost_get_vq_desc(struct vhost_virtqueue *vq,
1959 struct iovec iov[], unsigned int iov_size,
1960 unsigned int *out_num, unsigned int *in_num,
1961 struct vhost_log *log, unsigned int *log_num)
1963 struct vring_desc desc;
1964 unsigned int i, head, found = 0;
1966 __virtio16 avail_idx;
1967 __virtio16 ring_head;
1970 /* Check it isn't doing very strange things with descriptor numbers. */
1971 last_avail_idx = vq->last_avail_idx;
1973 if (vq->avail_idx == vq->last_avail_idx) {
1974 if (unlikely(vhost_get_avail(vq, avail_idx, &vq->avail->idx))) {
1975 vq_err(vq, "Failed to access avail idx at %p\n",
1979 vq->avail_idx = vhost16_to_cpu(vq, avail_idx);
1981 if (unlikely((u16)(vq->avail_idx - last_avail_idx) > vq->num)) {
1982 vq_err(vq, "Guest moved used index from %u to %u",
1983 last_avail_idx, vq->avail_idx);
1987 /* If there's nothing new since last we looked, return
1990 if (vq->avail_idx == last_avail_idx)
1993 /* Only get avail ring entries after they have been
1999 /* Grab the next descriptor number they're advertising, and increment
2000 * the index we've seen. */
2001 if (unlikely(vhost_get_avail(vq, ring_head,
2002 &vq->avail->ring[last_avail_idx & (vq->num - 1)]))) {
2003 vq_err(vq, "Failed to read head: idx %d address %p\n",
2005 &vq->avail->ring[last_avail_idx % vq->num]);
2009 head = vhost16_to_cpu(vq, ring_head);
2011 /* If their number is silly, that's an error. */
2012 if (unlikely(head >= vq->num)) {
2013 vq_err(vq, "Guest says index %u > %u is available",
2018 /* When we start there are none of either input nor output. */
2019 *out_num = *in_num = 0;
2025 unsigned iov_count = *in_num + *out_num;
2026 if (unlikely(i >= vq->num)) {
2027 vq_err(vq, "Desc index is %u > %u, head = %u",
2031 if (unlikely(++found > vq->num)) {
2032 vq_err(vq, "Loop detected: last one at %u "
2033 "vq size %u head %u\n",
2037 ret = vhost_copy_from_user(vq, &desc, vq->desc + i,
2039 if (unlikely(ret)) {
2040 vq_err(vq, "Failed to get descriptor: idx %d addr %p\n",
2044 if (desc.flags & cpu_to_vhost16(vq, VRING_DESC_F_INDIRECT)) {
2045 ret = get_indirect(vq, iov, iov_size,
2047 log, log_num, &desc);
2048 if (unlikely(ret < 0)) {
2050 vq_err(vq, "Failure detected "
2051 "in indirect descriptor at idx %d\n", i);
2057 if (desc.flags & cpu_to_vhost16(vq, VRING_DESC_F_WRITE))
2058 access = VHOST_ACCESS_WO;
2060 access = VHOST_ACCESS_RO;
2061 ret = translate_desc(vq, vhost64_to_cpu(vq, desc.addr),
2062 vhost32_to_cpu(vq, desc.len), iov + iov_count,
2063 iov_size - iov_count, access);
2064 if (unlikely(ret < 0)) {
2066 vq_err(vq, "Translation failure %d descriptor idx %d\n",
2070 if (access == VHOST_ACCESS_WO) {
2071 /* If this is an input descriptor,
2072 * increment that count. */
2074 if (unlikely(log)) {
2075 log[*log_num].addr = vhost64_to_cpu(vq, desc.addr);
2076 log[*log_num].len = vhost32_to_cpu(vq, desc.len);
2080 /* If it's an output descriptor, they're all supposed
2081 * to come before any input descriptors. */
2082 if (unlikely(*in_num)) {
2083 vq_err(vq, "Descriptor has out after in: "
2089 } while ((i = next_desc(vq, &desc)) != -1);
2091 /* On success, increment avail index. */
2092 vq->last_avail_idx++;
2094 /* Assume notifications from guest are disabled at this point,
2095 * if they aren't we would need to update avail_event index. */
2096 BUG_ON(!(vq->used_flags & VRING_USED_F_NO_NOTIFY));
2099 EXPORT_SYMBOL_GPL(vhost_get_vq_desc);
2101 /* Reverse the effect of vhost_get_vq_desc. Useful for error handling. */
2102 void vhost_discard_vq_desc(struct vhost_virtqueue *vq, int n)
2104 vq->last_avail_idx -= n;
2106 EXPORT_SYMBOL_GPL(vhost_discard_vq_desc);
2108 /* After we've used one of their buffers, we tell them about it. We'll then
2109 * want to notify the guest, using eventfd. */
2110 int vhost_add_used(struct vhost_virtqueue *vq, unsigned int head, int len)
2112 struct vring_used_elem heads = {
2113 cpu_to_vhost32(vq, head),
2114 cpu_to_vhost32(vq, len)
2117 return vhost_add_used_n(vq, &heads, 1);
2119 EXPORT_SYMBOL_GPL(vhost_add_used);
2121 static int __vhost_add_used_n(struct vhost_virtqueue *vq,
2122 struct vring_used_elem *heads,
2125 struct vring_used_elem __user *used;
2129 start = vq->last_used_idx & (vq->num - 1);
2130 used = vq->used->ring + start;
2132 if (vhost_put_user(vq, heads[0].id, &used->id)) {
2133 vq_err(vq, "Failed to write used id");
2136 if (vhost_put_user(vq, heads[0].len, &used->len)) {
2137 vq_err(vq, "Failed to write used len");
2140 } else if (vhost_copy_to_user(vq, used, heads, count * sizeof *used)) {
2141 vq_err(vq, "Failed to write used");
2144 if (unlikely(vq->log_used)) {
2145 /* Make sure data is seen before log. */
2147 /* Log used ring entry write. */
2148 log_write(vq->log_base,
2150 ((void __user *)used - (void __user *)vq->used),
2151 count * sizeof *used);
2153 old = vq->last_used_idx;
2154 new = (vq->last_used_idx += count);
2155 /* If the driver never bothers to signal in a very long while,
2156 * used index might wrap around. If that happens, invalidate
2157 * signalled_used index we stored. TODO: make sure driver
2158 * signals at least once in 2^16 and remove this. */
2159 if (unlikely((u16)(new - vq->signalled_used) < (u16)(new - old)))
2160 vq->signalled_used_valid = false;
2164 /* After we've used one of their buffers, we tell them about it. We'll then
2165 * want to notify the guest, using eventfd. */
2166 int vhost_add_used_n(struct vhost_virtqueue *vq, struct vring_used_elem *heads,
2171 start = vq->last_used_idx & (vq->num - 1);
2172 n = vq->num - start;
2174 r = __vhost_add_used_n(vq, heads, n);
2180 r = __vhost_add_used_n(vq, heads, count);
2182 /* Make sure buffer is written before we update index. */
2184 if (vhost_put_user(vq, cpu_to_vhost16(vq, vq->last_used_idx),
2186 vq_err(vq, "Failed to increment used idx");
2189 if (unlikely(vq->log_used)) {
2190 /* Log used index update. */
2191 log_write(vq->log_base,
2192 vq->log_addr + offsetof(struct vring_used, idx),
2193 sizeof vq->used->idx);
2195 eventfd_signal(vq->log_ctx, 1);
2199 EXPORT_SYMBOL_GPL(vhost_add_used_n);
2201 static bool vhost_notify(struct vhost_dev *dev, struct vhost_virtqueue *vq)
2206 /* Flush out used index updates. This is paired
2207 * with the barrier that the Guest executes when enabling
2211 if (vhost_has_feature(vq, VIRTIO_F_NOTIFY_ON_EMPTY) &&
2212 unlikely(vq->avail_idx == vq->last_avail_idx))
2215 if (!vhost_has_feature(vq, VIRTIO_RING_F_EVENT_IDX)) {
2217 if (vhost_get_avail(vq, flags, &vq->avail->flags)) {
2218 vq_err(vq, "Failed to get flags");
2221 return !(flags & cpu_to_vhost16(vq, VRING_AVAIL_F_NO_INTERRUPT));
2223 old = vq->signalled_used;
2224 v = vq->signalled_used_valid;
2225 new = vq->signalled_used = vq->last_used_idx;
2226 vq->signalled_used_valid = true;
2231 if (vhost_get_avail(vq, event, vhost_used_event(vq))) {
2232 vq_err(vq, "Failed to get used event idx");
2235 return vring_need_event(vhost16_to_cpu(vq, event), new, old);
2238 /* This actually signals the guest, using eventfd. */
2239 void vhost_signal(struct vhost_dev *dev, struct vhost_virtqueue *vq)
2241 /* Signal the Guest tell them we used something up. */
2242 if (vq->call_ctx && vhost_notify(dev, vq))
2243 eventfd_signal(vq->call_ctx, 1);
2245 EXPORT_SYMBOL_GPL(vhost_signal);
2247 /* And here's the combo meal deal. Supersize me! */
2248 void vhost_add_used_and_signal(struct vhost_dev *dev,
2249 struct vhost_virtqueue *vq,
2250 unsigned int head, int len)
2252 vhost_add_used(vq, head, len);
2253 vhost_signal(dev, vq);
2255 EXPORT_SYMBOL_GPL(vhost_add_used_and_signal);
2257 /* multi-buffer version of vhost_add_used_and_signal */
2258 void vhost_add_used_and_signal_n(struct vhost_dev *dev,
2259 struct vhost_virtqueue *vq,
2260 struct vring_used_elem *heads, unsigned count)
2262 vhost_add_used_n(vq, heads, count);
2263 vhost_signal(dev, vq);
2265 EXPORT_SYMBOL_GPL(vhost_add_used_and_signal_n);
2267 /* return true if we're sure that avaiable ring is empty */
2268 bool vhost_vq_avail_empty(struct vhost_dev *dev, struct vhost_virtqueue *vq)
2270 __virtio16 avail_idx;
2273 if (vq->avail_idx != vq->last_avail_idx)
2276 r = vhost_get_avail(vq, avail_idx, &vq->avail->idx);
2279 vq->avail_idx = vhost16_to_cpu(vq, avail_idx);
2281 return vq->avail_idx == vq->last_avail_idx;
2283 EXPORT_SYMBOL_GPL(vhost_vq_avail_empty);
2285 /* OK, now we need to know about added descriptors. */
2286 bool vhost_enable_notify(struct vhost_dev *dev, struct vhost_virtqueue *vq)
2288 __virtio16 avail_idx;
2291 if (!(vq->used_flags & VRING_USED_F_NO_NOTIFY))
2293 vq->used_flags &= ~VRING_USED_F_NO_NOTIFY;
2294 if (!vhost_has_feature(vq, VIRTIO_RING_F_EVENT_IDX)) {
2295 r = vhost_update_used_flags(vq);
2297 vq_err(vq, "Failed to enable notification at %p: %d\n",
2298 &vq->used->flags, r);
2302 r = vhost_update_avail_event(vq, vq->avail_idx);
2304 vq_err(vq, "Failed to update avail event index at %p: %d\n",
2305 vhost_avail_event(vq), r);
2309 /* They could have slipped one in as we were doing that: make
2310 * sure it's written, then check again. */
2312 r = vhost_get_avail(vq, avail_idx, &vq->avail->idx);
2314 vq_err(vq, "Failed to check avail idx at %p: %d\n",
2315 &vq->avail->idx, r);
2319 return vhost16_to_cpu(vq, avail_idx) != vq->avail_idx;
2321 EXPORT_SYMBOL_GPL(vhost_enable_notify);
2323 /* We don't need to be notified again. */
2324 void vhost_disable_notify(struct vhost_dev *dev, struct vhost_virtqueue *vq)
2328 if (vq->used_flags & VRING_USED_F_NO_NOTIFY)
2330 vq->used_flags |= VRING_USED_F_NO_NOTIFY;
2331 if (!vhost_has_feature(vq, VIRTIO_RING_F_EVENT_IDX)) {
2332 r = vhost_update_used_flags(vq);
2334 vq_err(vq, "Failed to enable notification at %p: %d\n",
2335 &vq->used->flags, r);
2338 EXPORT_SYMBOL_GPL(vhost_disable_notify);
2340 /* Create a new message. */
2341 struct vhost_msg_node *vhost_new_msg(struct vhost_virtqueue *vq, int type)
2343 struct vhost_msg_node *node = kmalloc(sizeof *node, GFP_KERNEL);
2347 node->msg.type = type;
2350 EXPORT_SYMBOL_GPL(vhost_new_msg);
2352 void vhost_enqueue_msg(struct vhost_dev *dev, struct list_head *head,
2353 struct vhost_msg_node *node)
2355 spin_lock(&dev->iotlb_lock);
2356 list_add_tail(&node->node, head);
2357 spin_unlock(&dev->iotlb_lock);
2359 wake_up_interruptible_poll(&dev->wait, EPOLLIN | EPOLLRDNORM);
2361 EXPORT_SYMBOL_GPL(vhost_enqueue_msg);
2363 struct vhost_msg_node *vhost_dequeue_msg(struct vhost_dev *dev,
2364 struct list_head *head)
2366 struct vhost_msg_node *node = NULL;
2368 spin_lock(&dev->iotlb_lock);
2369 if (!list_empty(head)) {
2370 node = list_first_entry(head, struct vhost_msg_node,
2372 list_del(&node->node);
2374 spin_unlock(&dev->iotlb_lock);
2378 EXPORT_SYMBOL_GPL(vhost_dequeue_msg);
2381 static int __init vhost_init(void)
2386 static void __exit vhost_exit(void)
2390 module_init(vhost_init);
2391 module_exit(vhost_exit);
2393 MODULE_VERSION("0.0.1");
2394 MODULE_LICENSE("GPL v2");
2395 MODULE_AUTHOR("Michael S. Tsirkin");
2396 MODULE_DESCRIPTION("Host kernel accelerator for virtio");