2019-05-28 16:57:16 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-only
|
2007-10-23 18:47:31 +00:00
|
|
|
/*
|
2008-10-13 23:45:23 +00:00
|
|
|
* The Virtio 9p transport driver
|
2007-10-23 18:47:31 +00:00
|
|
|
*
|
2008-02-07 01:25:58 +00:00
|
|
|
* This is a block based transport driver based on the lguest block driver
|
|
|
|
* code.
|
2007-10-23 18:47:31 +00:00
|
|
|
*
|
2008-10-13 23:45:23 +00:00
|
|
|
* Copyright (C) 2007, 2008 Eric Van Hensbergen, IBM Corporation
|
2007-10-23 18:47:31 +00:00
|
|
|
*
|
|
|
|
* Based on virtio console driver
|
|
|
|
* Copyright (C) 2006, 2007 Rusty Russell, IBM Corporation
|
|
|
|
*/
|
|
|
|
|
2011-11-28 18:40:46 +00:00
|
|
|
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
|
|
|
|
|
2007-10-23 18:47:31 +00:00
|
|
|
#include <linux/in.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/net.h>
|
|
|
|
#include <linux/ipv6.h>
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/un.h>
|
|
|
|
#include <linux/uaccess.h>
|
|
|
|
#include <linux/inet.h>
|
|
|
|
#include <linux/idr.h>
|
|
|
|
#include <linux/file.h>
|
2012-10-19 13:03:32 +00:00
|
|
|
#include <linux/highmem.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2007-10-23 18:47:31 +00:00
|
|
|
#include <net/9p/9p.h>
|
|
|
|
#include <linux/parser.h>
|
2008-10-13 23:45:25 +00:00
|
|
|
#include <net/9p/client.h>
|
2007-10-23 18:47:31 +00:00
|
|
|
#include <net/9p/transport.h>
|
|
|
|
#include <linux/scatterlist.h>
|
2011-03-18 22:49:48 +00:00
|
|
|
#include <linux/swap.h>
|
2007-10-23 18:47:31 +00:00
|
|
|
#include <linux/virtio.h>
|
|
|
|
#include <linux/virtio_9p.h>
|
2011-01-28 23:22:36 +00:00
|
|
|
#include "trans_common.h"
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2008-02-07 01:25:58 +00:00
|
|
|
#define VIRTQUEUE_NUM 128
|
|
|
|
|
2007-10-23 18:47:31 +00:00
|
|
|
/* a single mutex to manage channel initialization and attachment */
|
2008-03-07 17:39:13 +00:00
|
|
|
static DEFINE_MUTEX(virtio_9p_lock);
|
2011-03-18 22:49:48 +00:00
|
|
|
static DECLARE_WAIT_QUEUE_HEAD(vp_wq);
|
|
|
|
static atomic_t vp_pinned = ATOMIC_INIT(0);
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2008-03-05 13:08:09 +00:00
|
|
|
/**
|
|
|
|
* struct virtio_chan - per-instance transport information
|
|
|
|
* @inuse: whether the channel is in use
|
|
|
|
* @lock: protects multiple elements within this structure
|
2009-07-19 19:41:55 +00:00
|
|
|
* @client: client instance
|
2008-03-05 13:08:09 +00:00
|
|
|
* @vdev: virtio dev associated with this channel
|
|
|
|
* @vq: virtio queue associated with this channel
|
2020-10-31 18:26:55 +00:00
|
|
|
* @ring_bufs_avail: flag to indicate there is some available in the ring buf
|
|
|
|
* @vc_wq: wait queue for waiting for thing to be added to ring buf
|
|
|
|
* @p9_max_pages: maximum number of pinned pages
|
2008-03-05 13:08:09 +00:00
|
|
|
* @sg: scatter gather list which is used to pack a request (protected?)
|
2020-10-31 18:26:55 +00:00
|
|
|
* @chan_list: linked list of channels
|
2008-03-05 13:08:09 +00:00
|
|
|
*
|
|
|
|
* We keep all per-channel information in a structure.
|
2007-10-23 18:47:31 +00:00
|
|
|
* This structure is allocated within the devices dev->mem space.
|
|
|
|
* A pointer to the structure will get put in the transport private.
|
2008-03-05 13:08:09 +00:00
|
|
|
*
|
2007-10-23 18:47:31 +00:00
|
|
|
*/
|
2008-03-05 13:08:09 +00:00
|
|
|
|
2010-02-15 17:27:01 +00:00
|
|
|
struct virtio_chan {
|
2008-03-05 13:08:09 +00:00
|
|
|
bool inuse;
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2008-02-07 01:25:58 +00:00
|
|
|
spinlock_t lock;
|
|
|
|
|
2008-10-13 23:45:23 +00:00
|
|
|
struct p9_client *client;
|
2007-10-23 18:47:31 +00:00
|
|
|
struct virtio_device *vdev;
|
2008-02-07 01:25:58 +00:00
|
|
|
struct virtqueue *vq;
|
2010-09-30 01:33:41 +00:00
|
|
|
int ring_bufs_avail;
|
|
|
|
wait_queue_head_t *vc_wq;
|
2011-03-18 22:49:48 +00:00
|
|
|
/* This is global limit. Since we don't have a global structure,
|
|
|
|
* will be placing it in each channel.
|
|
|
|
*/
|
2013-02-23 00:35:49 +00:00
|
|
|
unsigned long p9_max_pages;
|
2008-02-07 01:25:58 +00:00
|
|
|
/* Scatterlist: can be too big for stack. */
|
|
|
|
struct scatterlist sg[VIRTQUEUE_NUM];
|
2020-10-31 18:26:55 +00:00
|
|
|
/**
|
|
|
|
* @tag: name to identify a mount null terminated
|
2010-03-06 04:44:14 +00:00
|
|
|
*/
|
|
|
|
char *tag;
|
|
|
|
|
2010-02-15 17:27:01 +00:00
|
|
|
struct list_head chan_list;
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct list_head virtio_chan_list;
|
2007-10-23 18:47:31 +00:00
|
|
|
|
|
|
|
/* How many bytes left in this page. */
|
|
|
|
static unsigned int rest_of_page(void *data)
|
|
|
|
{
|
2016-01-02 18:31:21 +00:00
|
|
|
return PAGE_SIZE - offset_in_page(data);
|
2007-10-23 18:47:31 +00:00
|
|
|
}
|
|
|
|
|
2008-03-05 13:08:09 +00:00
|
|
|
/**
|
|
|
|
* p9_virtio_close - reclaim resources of a channel
|
2009-07-19 19:41:55 +00:00
|
|
|
* @client: client instance
|
2008-03-05 13:08:09 +00:00
|
|
|
*
|
|
|
|
* This reclaims a channel by freeing its resources and
|
2021-06-02 06:54:42 +00:00
|
|
|
* resetting its inuse flag.
|
2008-03-05 13:08:09 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2008-10-13 23:45:25 +00:00
|
|
|
static void p9_virtio_close(struct p9_client *client)
|
2008-02-07 01:25:58 +00:00
|
|
|
{
|
2008-10-13 23:45:25 +00:00
|
|
|
struct virtio_chan *chan = client->trans;
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2008-03-07 17:39:13 +00:00
|
|
|
mutex_lock(&virtio_9p_lock);
|
2010-02-08 11:50:32 +00:00
|
|
|
if (chan)
|
|
|
|
chan->inuse = false;
|
2008-03-07 17:39:13 +00:00
|
|
|
mutex_unlock(&virtio_9p_lock);
|
2007-10-23 18:47:31 +00:00
|
|
|
}
|
|
|
|
|
2008-03-05 13:08:09 +00:00
|
|
|
/**
|
|
|
|
* req_done - callback which signals activity from the server
|
|
|
|
* @vq: virtio queue activity was received on
|
|
|
|
*
|
|
|
|
* This notifies us that the server has triggered some activity
|
|
|
|
* on the virtio channel - most likely a response to request we
|
|
|
|
* sent. Figure out which requests now have responses and wake up
|
|
|
|
* those threads.
|
|
|
|
*
|
|
|
|
* Bugs: could do with some additional sanity checking, but appears to work.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2008-02-07 01:25:58 +00:00
|
|
|
static void req_done(struct virtqueue *vq)
|
2007-10-23 18:47:31 +00:00
|
|
|
{
|
2008-02-07 01:25:58 +00:00
|
|
|
struct virtio_chan *chan = vq->vdev->priv;
|
|
|
|
unsigned int len;
|
|
|
|
struct p9_req_t *req;
|
2018-07-19 07:17:00 +00:00
|
|
|
bool need_wakeup = false;
|
2010-09-30 01:06:54 +00:00
|
|
|
unsigned long flags;
|
2008-02-07 01:25:58 +00:00
|
|
|
|
2011-11-28 18:40:46 +00:00
|
|
|
p9_debug(P9_DEBUG_TRANS, ": request done\n");
|
2008-10-13 23:45:21 +00:00
|
|
|
|
2018-07-19 07:17:00 +00:00
|
|
|
spin_lock_irqsave(&chan->lock, flags);
|
|
|
|
while ((req = virtqueue_get_buf(chan->vq, &len)) != NULL) {
|
|
|
|
if (!chan->ring_bufs_avail) {
|
|
|
|
chan->ring_bufs_avail = 1;
|
|
|
|
need_wakeup = true;
|
2011-03-14 21:12:49 +00:00
|
|
|
}
|
2018-07-19 07:17:00 +00:00
|
|
|
|
2018-07-23 15:44:04 +00:00
|
|
|
if (len) {
|
2018-07-30 05:55:19 +00:00
|
|
|
req->rc.size = len;
|
2018-01-22 21:02:05 +00:00
|
|
|
p9_client_cb(chan->client, req, REQ_STATUS_RCVD);
|
2018-07-23 15:44:04 +00:00
|
|
|
}
|
2011-03-14 21:12:49 +00:00
|
|
|
}
|
2018-07-19 07:17:00 +00:00
|
|
|
spin_unlock_irqrestore(&chan->lock, flags);
|
|
|
|
/* Wakeup if anyone waiting for VirtIO ring space. */
|
|
|
|
if (need_wakeup)
|
|
|
|
wake_up(chan->vc_wq);
|
2008-02-07 01:25:58 +00:00
|
|
|
}
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2008-03-05 13:08:09 +00:00
|
|
|
/**
|
|
|
|
* pack_sg_list - pack a scatter gather list from a linear buffer
|
|
|
|
* @sg: scatter/gather list to pack into
|
|
|
|
* @start: which segment of the sg_list to start at
|
|
|
|
* @limit: maximum segment to pack data to
|
|
|
|
* @data: data to pack into scatter/gather list
|
|
|
|
* @count: amount of data to pack into the scatter/gather list
|
|
|
|
*
|
|
|
|
* sg_lists have multiple segments of various sizes. This will pack
|
|
|
|
* arbitrary data into an existing scatter gather list, segmenting the
|
|
|
|
* data as necessary within constraints.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2011-08-16 05:20:10 +00:00
|
|
|
static int pack_sg_list(struct scatterlist *sg, int start,
|
|
|
|
int limit, char *data, int count)
|
2008-02-07 01:25:58 +00:00
|
|
|
{
|
|
|
|
int s;
|
|
|
|
int index = start;
|
|
|
|
|
|
|
|
while (count) {
|
|
|
|
s = rest_of_page(data);
|
|
|
|
if (s > count)
|
|
|
|
s = count;
|
2018-08-03 04:11:34 +00:00
|
|
|
BUG_ON(index >= limit);
|
2013-03-20 05:14:30 +00:00
|
|
|
/* Make sure we don't terminate early. */
|
|
|
|
sg_unmark_end(&sg[index]);
|
2008-02-07 01:25:58 +00:00
|
|
|
sg_set_buf(&sg[index++], data, s);
|
|
|
|
count -= s;
|
|
|
|
data += s;
|
|
|
|
}
|
2013-03-20 05:14:30 +00:00
|
|
|
if (index-start)
|
|
|
|
sg_mark_end(&sg[index - 1]);
|
2008-02-07 01:25:58 +00:00
|
|
|
return index-start;
|
2007-10-23 18:47:31 +00:00
|
|
|
}
|
|
|
|
|
2008-10-13 23:45:21 +00:00
|
|
|
/* We don't currently allow canceling of virtio requests */
|
|
|
|
static int p9_virtio_cancel(struct p9_client *client, struct p9_req_t *req)
|
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2018-08-14 17:43:42 +00:00
|
|
|
/* Reply won't come, so drop req ref */
|
|
|
|
static int p9_virtio_cancelled(struct p9_client *client, struct p9_req_t *req)
|
|
|
|
{
|
2022-07-04 01:08:18 +00:00
|
|
|
p9_req_put(client, req);
|
2018-08-14 17:43:42 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-01-28 23:22:36 +00:00
|
|
|
/**
|
|
|
|
* pack_sg_list_p - Just like pack_sg_list. Instead of taking a buffer,
|
|
|
|
* this takes a list of pages.
|
|
|
|
* @sg: scatter/gather list to pack into
|
|
|
|
* @start: which segment of the sg_list to start at
|
2020-10-31 18:26:55 +00:00
|
|
|
* @limit: maximum number of pages in sg list.
|
2012-07-10 10:55:09 +00:00
|
|
|
* @pdata: a list of pages to add into sg.
|
2011-08-16 05:20:10 +00:00
|
|
|
* @nr_pages: number of pages to pack into the scatter/gather list
|
2015-04-01 23:57:53 +00:00
|
|
|
* @offs: amount of data in the beginning of first page _not_ to pack
|
2011-01-28 23:22:36 +00:00
|
|
|
* @count: amount of data to pack into the scatter/gather list
|
|
|
|
*/
|
|
|
|
static int
|
2011-08-16 05:20:10 +00:00
|
|
|
pack_sg_list_p(struct scatterlist *sg, int start, int limit,
|
2015-04-01 23:57:53 +00:00
|
|
|
struct page **pdata, int nr_pages, size_t offs, int count)
|
2011-01-28 23:22:36 +00:00
|
|
|
{
|
2011-08-16 05:20:10 +00:00
|
|
|
int i = 0, s;
|
2015-04-01 23:57:53 +00:00
|
|
|
int data_off = offs;
|
2011-01-28 23:22:36 +00:00
|
|
|
int index = start;
|
|
|
|
|
2011-08-16 05:20:10 +00:00
|
|
|
BUG_ON(nr_pages > (limit - start));
|
|
|
|
/*
|
|
|
|
* if the first page doesn't start at
|
|
|
|
* page boundary find the offset
|
|
|
|
*/
|
|
|
|
while (nr_pages) {
|
2015-04-01 23:57:53 +00:00
|
|
|
s = PAGE_SIZE - data_off;
|
2011-08-16 05:20:10 +00:00
|
|
|
if (s > count)
|
|
|
|
s = count;
|
2018-08-03 04:11:34 +00:00
|
|
|
BUG_ON(index >= limit);
|
2013-03-20 05:14:30 +00:00
|
|
|
/* Make sure we don't terminate early. */
|
|
|
|
sg_unmark_end(&sg[index]);
|
2011-08-16 05:20:10 +00:00
|
|
|
sg_set_page(&sg[index++], pdata[i++], s, data_off);
|
|
|
|
data_off = 0;
|
2011-01-28 23:22:36 +00:00
|
|
|
count -= s;
|
2011-08-16 05:20:10 +00:00
|
|
|
nr_pages--;
|
2011-01-28 23:22:36 +00:00
|
|
|
}
|
2013-03-20 05:14:30 +00:00
|
|
|
|
|
|
|
if (index-start)
|
|
|
|
sg_mark_end(&sg[index - 1]);
|
2011-08-16 05:20:10 +00:00
|
|
|
return index - start;
|
2011-01-28 23:22:36 +00:00
|
|
|
}
|
|
|
|
|
2008-03-05 13:08:09 +00:00
|
|
|
/**
|
2008-10-13 23:45:21 +00:00
|
|
|
* p9_virtio_request - issue a request
|
2009-07-19 19:41:55 +00:00
|
|
|
* @client: client instance issuing the request
|
|
|
|
* @req: request to be issued
|
2008-03-05 13:08:09 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2008-02-07 01:25:58 +00:00
|
|
|
static int
|
2008-10-13 23:45:21 +00:00
|
|
|
p9_virtio_request(struct p9_client *client, struct p9_req_t *req)
|
2007-10-23 18:47:31 +00:00
|
|
|
{
|
2011-08-16 05:20:10 +00:00
|
|
|
int err;
|
2013-03-20 05:14:30 +00:00
|
|
|
int in, out, out_sgs, in_sgs;
|
2010-09-30 01:06:54 +00:00
|
|
|
unsigned long flags;
|
2011-08-16 05:20:10 +00:00
|
|
|
struct virtio_chan *chan = client->trans;
|
2013-03-20 05:14:30 +00:00
|
|
|
struct scatterlist *sgs[2];
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2011-11-28 18:40:46 +00:00
|
|
|
p9_debug(P9_DEBUG_TRANS, "9p debug: virtio request\n");
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2010-09-30 01:06:54 +00:00
|
|
|
req->status = REQ_STATUS_SENT;
|
2011-08-16 05:20:10 +00:00
|
|
|
req_retry:
|
|
|
|
spin_lock_irqsave(&chan->lock, flags);
|
|
|
|
|
2013-03-20 05:14:30 +00:00
|
|
|
out_sgs = in_sgs = 0;
|
2011-08-16 05:20:10 +00:00
|
|
|
/* Handle out VirtIO ring buffers */
|
|
|
|
out = pack_sg_list(chan->sg, 0,
|
2018-07-30 05:55:19 +00:00
|
|
|
VIRTQUEUE_NUM, req->tc.sdata, req->tc.size);
|
2013-03-20 05:14:30 +00:00
|
|
|
if (out)
|
|
|
|
sgs[out_sgs++] = chan->sg;
|
2010-09-30 01:06:54 +00:00
|
|
|
|
2011-08-16 05:20:10 +00:00
|
|
|
in = pack_sg_list(chan->sg, out,
|
2018-07-30 05:55:19 +00:00
|
|
|
VIRTQUEUE_NUM, req->rc.sdata, req->rc.capacity);
|
2013-03-20 05:14:30 +00:00
|
|
|
if (in)
|
|
|
|
sgs[out_sgs + in_sgs++] = chan->sg + out;
|
2011-01-28 23:22:36 +00:00
|
|
|
|
2015-07-13 01:06:44 +00:00
|
|
|
err = virtqueue_add_sgs(chan->vq, sgs, out_sgs, in_sgs, req,
|
2012-01-12 05:14:42 +00:00
|
|
|
GFP_ATOMIC);
|
2011-08-16 05:20:10 +00:00
|
|
|
if (err < 0) {
|
|
|
|
if (err == -ENOSPC) {
|
|
|
|
chan->ring_bufs_avail = 0;
|
|
|
|
spin_unlock_irqrestore(&chan->lock, flags);
|
2017-09-06 14:59:08 +00:00
|
|
|
err = wait_event_killable(*chan->vc_wq,
|
|
|
|
chan->ring_bufs_avail);
|
2011-03-18 22:49:48 +00:00
|
|
|
if (err == -ERESTARTSYS)
|
|
|
|
return err;
|
|
|
|
|
2011-11-28 18:40:46 +00:00
|
|
|
p9_debug(P9_DEBUG_TRANS, "Retry virtio request\n");
|
2011-08-16 05:20:10 +00:00
|
|
|
goto req_retry;
|
2011-01-28 23:22:36 +00:00
|
|
|
} else {
|
2011-08-16 05:20:10 +00:00
|
|
|
spin_unlock_irqrestore(&chan->lock, flags);
|
2011-11-28 18:40:46 +00:00
|
|
|
p9_debug(P9_DEBUG_TRANS,
|
2013-03-20 05:14:30 +00:00
|
|
|
"virtio rpc add_sgs returned failure\n");
|
2011-08-16 05:20:10 +00:00
|
|
|
return -EIO;
|
2011-01-28 23:22:36 +00:00
|
|
|
}
|
2011-08-16 05:20:10 +00:00
|
|
|
}
|
|
|
|
virtqueue_kick(chan->vq);
|
|
|
|
spin_unlock_irqrestore(&chan->lock, flags);
|
2011-01-28 23:22:36 +00:00
|
|
|
|
2011-11-28 18:40:46 +00:00
|
|
|
p9_debug(P9_DEBUG_TRANS, "virtio request kicked\n");
|
2011-08-16 05:20:10 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int p9_get_mapped_pages(struct virtio_chan *chan,
|
2015-04-01 23:57:53 +00:00
|
|
|
struct page ***pages,
|
|
|
|
struct iov_iter *data,
|
|
|
|
int count,
|
|
|
|
size_t *offs,
|
|
|
|
int *need_drop)
|
2011-08-16 05:20:10 +00:00
|
|
|
{
|
2015-04-01 23:57:53 +00:00
|
|
|
int nr_pages;
|
2011-08-16 05:20:10 +00:00
|
|
|
int err;
|
2015-04-01 23:57:53 +00:00
|
|
|
|
|
|
|
if (!iov_iter_count(data))
|
|
|
|
return 0;
|
|
|
|
|
2018-11-02 17:16:51 +00:00
|
|
|
if (!iov_iter_is_kvec(data)) {
|
2015-04-01 23:57:53 +00:00
|
|
|
int n;
|
2011-08-16 05:20:10 +00:00
|
|
|
/*
|
|
|
|
* We allow only p9_max_pages pinned. We wait for the
|
|
|
|
* Other zc request to finish here
|
|
|
|
*/
|
|
|
|
if (atomic_read(&vp_pinned) >= chan->p9_max_pages) {
|
2017-09-06 14:59:08 +00:00
|
|
|
err = wait_event_killable(vp_wq,
|
2011-08-16 05:20:10 +00:00
|
|
|
(atomic_read(&vp_pinned) < chan->p9_max_pages));
|
|
|
|
if (err == -ERESTARTSYS)
|
|
|
|
return err;
|
|
|
|
}
|
2022-06-10 15:42:02 +00:00
|
|
|
n = iov_iter_get_pages_alloc2(data, pages, count, offs);
|
2015-04-01 23:57:53 +00:00
|
|
|
if (n < 0)
|
|
|
|
return n;
|
|
|
|
*need_drop = 1;
|
|
|
|
nr_pages = DIV_ROUND_UP(n + *offs, PAGE_SIZE);
|
2011-08-16 05:20:10 +00:00
|
|
|
atomic_add(nr_pages, &vp_pinned);
|
2015-04-01 23:57:53 +00:00
|
|
|
return n;
|
2011-08-16 05:20:10 +00:00
|
|
|
} else {
|
|
|
|
/* kernel buffer, no need to pin pages */
|
2015-04-01 23:57:53 +00:00
|
|
|
int index;
|
|
|
|
size_t len;
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
/* we'd already checked that it's non-empty */
|
|
|
|
while (1) {
|
|
|
|
len = iov_iter_single_seg_count(data);
|
|
|
|
if (likely(len)) {
|
|
|
|
p = data->kvec->iov_base + data->iov_offset;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
iov_iter_advance(data, 0);
|
|
|
|
}
|
|
|
|
if (len > count)
|
|
|
|
len = count;
|
|
|
|
|
|
|
|
nr_pages = DIV_ROUND_UP((unsigned long)p + len, PAGE_SIZE) -
|
|
|
|
(unsigned long)p / PAGE_SIZE;
|
|
|
|
|
treewide: kmalloc() -> kmalloc_array()
The kmalloc() function has a 2-factor argument form, kmalloc_array(). This
patch replaces cases of:
kmalloc(a * b, gfp)
with:
kmalloc_array(a * b, gfp)
as well as handling cases of:
kmalloc(a * b * c, gfp)
with:
kmalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kmalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kmalloc(4 * 1024, gfp)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The tools/ directory was manually excluded, since it has its own
implementation of kmalloc().
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kmalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kmalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kmalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kmalloc
+ kmalloc_array
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kmalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
kmalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
kmalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products,
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kmalloc(sizeof(THING) * C2, ...)
|
kmalloc(sizeof(TYPE) * C2, ...)
|
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(C1 * C2, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * E2
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-12 20:55:00 +00:00
|
|
|
*pages = kmalloc_array(nr_pages, sizeof(struct page *),
|
|
|
|
GFP_NOFS);
|
2015-04-01 23:57:53 +00:00
|
|
|
if (!*pages)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
*need_drop = 0;
|
2016-01-02 18:31:21 +00:00
|
|
|
p -= (*offs = offset_in_page(p));
|
2015-04-01 23:57:53 +00:00
|
|
|
for (index = 0; index < nr_pages; index++) {
|
|
|
|
if (is_vmalloc_addr(p))
|
|
|
|
(*pages)[index] = vmalloc_to_page(p);
|
2014-02-09 00:32:01 +00:00
|
|
|
else
|
2015-04-01 23:57:53 +00:00
|
|
|
(*pages)[index] = kmap_to_page(p);
|
|
|
|
p += PAGE_SIZE;
|
2011-01-28 23:22:36 +00:00
|
|
|
}
|
2022-06-10 15:42:02 +00:00
|
|
|
iov_iter_advance(data, len);
|
2015-04-01 23:57:53 +00:00
|
|
|
return len;
|
2011-01-28 23:22:36 +00:00
|
|
|
}
|
2011-08-16 05:20:10 +00:00
|
|
|
}
|
2011-01-28 23:22:36 +00:00
|
|
|
|
9p: handling Rerror without copy_from_iter_full()
p9_client_zc_rpc()/p9_check_zc_errors() are playing fast
and loose with copy_from_iter_full().
Reading from file is done by sending Tread request. Response
consists of fixed-sized header (including the amount of data actually
read) followed by the data itself.
For zero-copy case we arrange the things so that the first
11 bytes of reply go into the fixed-sized buffer, with the rest going
straight into the pages we want to read into.
What makes the things inconvenient is that sglist describing
what should go where has to be set *before* the reply arrives. As
the result, if reply is an error, the things get interesting. On success
we get
size[4] Rread tag[2] count[4] data[count]
For error layout varies depending upon the protocol variant -
in original 9P and 9P2000 it's
size[4] Rerror tag[2] len[2] error[len]
in 9P2000.U
size[4] Rerror tag[2] len[2] error[len] errno[4]
in 9P2000.L
size[4] Rlerror tag[2] errno[4]
The last case is nice and simple - we have an 11-byte response
that fits into the fixed-sized buffer we hoped to get an Rread into.
In other two, though, we get a variable-length string spill into the
pages we'd prepared for the data to be read.
Had that been in fixed-sized buffer (which is actually 4K),
we would've dealt with that the same way we handle non-zerocopy case.
However, for zerocopy it doesn't end up there, so we need to copy it
from those pages.
The trouble is, by the time we get around to that, the
references to pages in question are already dropped. As the result,
p9_zc_check_errors() tries to get the data using copy_from_iter_full().
Unfortunately, the iov_iter it's trying to read from might *NOT* be
capable of that. It is, after all, a data destination, not data source.
In particular, if it's an ITER_PIPE one, copy_from_iter_full() will
simply fail.
In ->zc_request() itself we do have those pages and dealing with
the problem in there would be a simple matter of memcpy_from_page()
into the fixed-sized buffer. Moreover, it isn't hard to recognize
the (rare) case when such copying is needed. That way we get rid of
p9_zc_check_errors() entirely - p9_check_errors() can be used instead
both for zero-copy and non-zero-copy cases.
Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>
2022-06-09 14:01:34 +00:00
|
|
|
static void handle_rerror(struct p9_req_t *req, int in_hdr_len,
|
|
|
|
size_t offs, struct page **pages)
|
|
|
|
{
|
|
|
|
unsigned size, n;
|
|
|
|
void *to = req->rc.sdata + in_hdr_len;
|
|
|
|
|
|
|
|
// Fits entirely into the static data? Nothing to do.
|
|
|
|
if (req->rc.size < in_hdr_len)
|
|
|
|
return;
|
|
|
|
|
|
|
|
// Really long error message? Tough, truncate the reply. Might get
|
|
|
|
// rejected (we can't be arsed to adjust the size encoded in header,
|
|
|
|
// or string size for that matter), but it wouldn't be anything valid
|
|
|
|
// anyway.
|
|
|
|
if (unlikely(req->rc.size > P9_ZC_HDR_SZ))
|
|
|
|
req->rc.size = P9_ZC_HDR_SZ;
|
|
|
|
|
|
|
|
// data won't span more than two pages
|
|
|
|
size = req->rc.size - in_hdr_len;
|
|
|
|
n = PAGE_SIZE - offs;
|
|
|
|
if (size > n) {
|
|
|
|
memcpy_from_page(to, *pages++, offs, n);
|
|
|
|
offs = 0;
|
|
|
|
to += n;
|
|
|
|
size -= n;
|
|
|
|
}
|
|
|
|
memcpy_from_page(to, *pages, offs, size);
|
|
|
|
}
|
|
|
|
|
2011-08-16 05:20:10 +00:00
|
|
|
/**
|
|
|
|
* p9_virtio_zc_request - issue a zero copy request
|
|
|
|
* @client: client instance issuing the request
|
|
|
|
* @req: request to be issued
|
2018-07-18 03:45:29 +00:00
|
|
|
* @uidata: user buffer that should be used for zero copy read
|
|
|
|
* @uodata: user buffer that should be used for zero copy write
|
2011-08-16 05:20:10 +00:00
|
|
|
* @inlen: read buffer size
|
2018-05-08 01:49:38 +00:00
|
|
|
* @outlen: write buffer size
|
|
|
|
* @in_hdr_len: reader header size, This is the size of response protocol data
|
2011-08-16 05:20:10 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
p9_virtio_zc_request(struct p9_client *client, struct p9_req_t *req,
|
2015-04-01 23:57:53 +00:00
|
|
|
struct iov_iter *uidata, struct iov_iter *uodata,
|
|
|
|
int inlen, int outlen, int in_hdr_len)
|
2011-08-16 05:20:10 +00:00
|
|
|
{
|
2013-03-20 05:14:30 +00:00
|
|
|
int in, out, err, out_sgs, in_sgs;
|
2011-08-16 05:20:10 +00:00
|
|
|
unsigned long flags;
|
|
|
|
int in_nr_pages = 0, out_nr_pages = 0;
|
|
|
|
struct page **in_pages = NULL, **out_pages = NULL;
|
|
|
|
struct virtio_chan *chan = client->trans;
|
2013-03-20 05:14:30 +00:00
|
|
|
struct scatterlist *sgs[4];
|
2015-04-01 23:57:53 +00:00
|
|
|
size_t offs;
|
|
|
|
int need_drop = 0;
|
2018-08-14 17:43:42 +00:00
|
|
|
int kicked = 0;
|
2011-01-28 23:22:36 +00:00
|
|
|
|
2011-11-28 18:40:46 +00:00
|
|
|
p9_debug(P9_DEBUG_TRANS, "virtio request\n");
|
2011-08-16 05:20:10 +00:00
|
|
|
|
|
|
|
if (uodata) {
|
2018-07-17 00:35:29 +00:00
|
|
|
__le32 sz;
|
2015-04-01 23:57:53 +00:00
|
|
|
int n = p9_get_mapped_pages(chan, &out_pages, uodata,
|
|
|
|
outlen, &offs, &need_drop);
|
2018-08-14 17:43:42 +00:00
|
|
|
if (n < 0) {
|
|
|
|
err = n;
|
|
|
|
goto err_out;
|
|
|
|
}
|
2015-04-01 23:57:53 +00:00
|
|
|
out_nr_pages = DIV_ROUND_UP(n + offs, PAGE_SIZE);
|
|
|
|
if (n != outlen) {
|
|
|
|
__le32 v = cpu_to_le32(n);
|
2018-07-30 05:55:19 +00:00
|
|
|
memcpy(&req->tc.sdata[req->tc.size - 4], &v, 4);
|
2015-04-01 23:57:53 +00:00
|
|
|
outlen = n;
|
2011-01-28 23:22:36 +00:00
|
|
|
}
|
2018-07-17 00:35:29 +00:00
|
|
|
/* The size field of the message must include the length of the
|
|
|
|
* header and the length of the data. We didn't actually know
|
|
|
|
* the length of the data until this point so add it in now.
|
|
|
|
*/
|
2018-07-30 05:55:19 +00:00
|
|
|
sz = cpu_to_le32(req->tc.size + outlen);
|
|
|
|
memcpy(&req->tc.sdata[0], &sz, sizeof(sz));
|
2015-04-01 23:57:53 +00:00
|
|
|
} else if (uidata) {
|
|
|
|
int n = p9_get_mapped_pages(chan, &in_pages, uidata,
|
|
|
|
inlen, &offs, &need_drop);
|
2018-08-14 17:43:42 +00:00
|
|
|
if (n < 0) {
|
|
|
|
err = n;
|
|
|
|
goto err_out;
|
|
|
|
}
|
2015-04-01 23:57:53 +00:00
|
|
|
in_nr_pages = DIV_ROUND_UP(n + offs, PAGE_SIZE);
|
|
|
|
if (n != inlen) {
|
|
|
|
__le32 v = cpu_to_le32(n);
|
2018-07-30 05:55:19 +00:00
|
|
|
memcpy(&req->tc.sdata[req->tc.size - 4], &v, 4);
|
2015-04-01 23:57:53 +00:00
|
|
|
inlen = n;
|
2011-01-28 23:22:36 +00:00
|
|
|
}
|
|
|
|
}
|
2011-08-16 05:20:10 +00:00
|
|
|
req->status = REQ_STATUS_SENT;
|
|
|
|
req_retry_pinned:
|
|
|
|
spin_lock_irqsave(&chan->lock, flags);
|
2013-03-20 05:14:30 +00:00
|
|
|
|
|
|
|
out_sgs = in_sgs = 0;
|
|
|
|
|
2011-08-16 05:20:10 +00:00
|
|
|
/* out data */
|
|
|
|
out = pack_sg_list(chan->sg, 0,
|
2018-07-30 05:55:19 +00:00
|
|
|
VIRTQUEUE_NUM, req->tc.sdata, req->tc.size);
|
2011-08-16 05:20:10 +00:00
|
|
|
|
2013-03-20 05:14:30 +00:00
|
|
|
if (out)
|
|
|
|
sgs[out_sgs++] = chan->sg;
|
|
|
|
|
|
|
|
if (out_pages) {
|
|
|
|
sgs[out_sgs++] = chan->sg + out;
|
2011-08-16 05:20:10 +00:00
|
|
|
out += pack_sg_list_p(chan->sg, out, VIRTQUEUE_NUM,
|
2015-04-01 23:57:53 +00:00
|
|
|
out_pages, out_nr_pages, offs, outlen);
|
2013-03-20 05:14:30 +00:00
|
|
|
}
|
2018-07-24 19:29:10 +00:00
|
|
|
|
2011-08-16 05:20:10 +00:00
|
|
|
/*
|
|
|
|
* Take care of in data
|
|
|
|
* For example TREAD have 11.
|
|
|
|
* 11 is the read/write header = PDU Header(7) + IO Size (4).
|
|
|
|
* Arrange in such a way that server places header in the
|
2021-06-02 06:54:42 +00:00
|
|
|
* allocated memory and payload onto the user buffer.
|
2011-08-16 05:20:10 +00:00
|
|
|
*/
|
|
|
|
in = pack_sg_list(chan->sg, out,
|
2018-07-30 05:55:19 +00:00
|
|
|
VIRTQUEUE_NUM, req->rc.sdata, in_hdr_len);
|
2013-03-20 05:14:30 +00:00
|
|
|
if (in)
|
|
|
|
sgs[out_sgs + in_sgs++] = chan->sg + out;
|
|
|
|
|
|
|
|
if (in_pages) {
|
|
|
|
sgs[out_sgs + in_sgs++] = chan->sg + out + in;
|
2011-08-16 05:20:10 +00:00
|
|
|
in += pack_sg_list_p(chan->sg, out + in, VIRTQUEUE_NUM,
|
2015-04-01 23:57:53 +00:00
|
|
|
in_pages, in_nr_pages, offs, inlen);
|
2013-03-20 05:14:30 +00:00
|
|
|
}
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2013-03-20 05:14:30 +00:00
|
|
|
BUG_ON(out_sgs + in_sgs > ARRAY_SIZE(sgs));
|
2015-07-13 01:06:44 +00:00
|
|
|
err = virtqueue_add_sgs(chan->vq, sgs, out_sgs, in_sgs, req,
|
2012-01-12 05:14:42 +00:00
|
|
|
GFP_ATOMIC);
|
2010-09-30 01:06:54 +00:00
|
|
|
if (err < 0) {
|
2010-09-30 01:33:41 +00:00
|
|
|
if (err == -ENOSPC) {
|
|
|
|
chan->ring_bufs_avail = 0;
|
|
|
|
spin_unlock_irqrestore(&chan->lock, flags);
|
2017-09-06 14:59:08 +00:00
|
|
|
err = wait_event_killable(*chan->vc_wq,
|
|
|
|
chan->ring_bufs_avail);
|
2010-09-30 01:33:41 +00:00
|
|
|
if (err == -ERESTARTSYS)
|
2011-08-16 05:20:10 +00:00
|
|
|
goto err_out;
|
2010-09-30 01:33:41 +00:00
|
|
|
|
2011-11-28 18:40:46 +00:00
|
|
|
p9_debug(P9_DEBUG_TRANS, "Retry virtio request\n");
|
2011-03-14 21:22:41 +00:00
|
|
|
goto req_retry_pinned;
|
2010-09-30 01:33:41 +00:00
|
|
|
} else {
|
|
|
|
spin_unlock_irqrestore(&chan->lock, flags);
|
2011-11-28 18:40:46 +00:00
|
|
|
p9_debug(P9_DEBUG_TRANS,
|
2013-03-20 05:14:30 +00:00
|
|
|
"virtio rpc add_sgs returned failure\n");
|
2011-08-16 05:20:10 +00:00
|
|
|
err = -EIO;
|
|
|
|
goto err_out;
|
2010-09-30 01:33:41 +00:00
|
|
|
}
|
2008-02-07 01:25:58 +00:00
|
|
|
}
|
2010-04-13 13:11:50 +00:00
|
|
|
virtqueue_kick(chan->vq);
|
2010-09-30 01:06:54 +00:00
|
|
|
spin_unlock_irqrestore(&chan->lock, flags);
|
2018-08-14 17:43:42 +00:00
|
|
|
kicked = 1;
|
2011-11-28 18:40:46 +00:00
|
|
|
p9_debug(P9_DEBUG_TRANS, "virtio request kicked\n");
|
2018-07-11 21:02:23 +00:00
|
|
|
err = wait_event_killable(req->wq, req->status >= REQ_STATUS_RCVD);
|
9p: handling Rerror without copy_from_iter_full()
p9_client_zc_rpc()/p9_check_zc_errors() are playing fast
and loose with copy_from_iter_full().
Reading from file is done by sending Tread request. Response
consists of fixed-sized header (including the amount of data actually
read) followed by the data itself.
For zero-copy case we arrange the things so that the first
11 bytes of reply go into the fixed-sized buffer, with the rest going
straight into the pages we want to read into.
What makes the things inconvenient is that sglist describing
what should go where has to be set *before* the reply arrives. As
the result, if reply is an error, the things get interesting. On success
we get
size[4] Rread tag[2] count[4] data[count]
For error layout varies depending upon the protocol variant -
in original 9P and 9P2000 it's
size[4] Rerror tag[2] len[2] error[len]
in 9P2000.U
size[4] Rerror tag[2] len[2] error[len] errno[4]
in 9P2000.L
size[4] Rlerror tag[2] errno[4]
The last case is nice and simple - we have an 11-byte response
that fits into the fixed-sized buffer we hoped to get an Rread into.
In other two, though, we get a variable-length string spill into the
pages we'd prepared for the data to be read.
Had that been in fixed-sized buffer (which is actually 4K),
we would've dealt with that the same way we handle non-zerocopy case.
However, for zerocopy it doesn't end up there, so we need to copy it
from those pages.
The trouble is, by the time we get around to that, the
references to pages in question are already dropped. As the result,
p9_zc_check_errors() tries to get the data using copy_from_iter_full().
Unfortunately, the iov_iter it's trying to read from might *NOT* be
capable of that. It is, after all, a data destination, not data source.
In particular, if it's an ITER_PIPE one, copy_from_iter_full() will
simply fail.
In ->zc_request() itself we do have those pages and dealing with
the problem in there would be a simple matter of memcpy_from_page()
into the fixed-sized buffer. Moreover, it isn't hard to recognize
the (rare) case when such copying is needed. That way we get rid of
p9_zc_check_errors() entirely - p9_check_errors() can be used instead
both for zero-copy and non-zero-copy cases.
Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>
2022-06-09 14:01:34 +00:00
|
|
|
// RERROR needs reply (== error string) in static data
|
|
|
|
if (req->status == REQ_STATUS_RCVD &&
|
|
|
|
unlikely(req->rc.sdata[4] == P9_RERROR))
|
|
|
|
handle_rerror(req, in_hdr_len, offs, in_pages);
|
|
|
|
|
2011-08-16 05:20:10 +00:00
|
|
|
/*
|
|
|
|
* Non kernel buffers are pinned, unpin them
|
|
|
|
*/
|
|
|
|
err_out:
|
2015-04-01 23:57:53 +00:00
|
|
|
if (need_drop) {
|
2011-08-16 05:20:10 +00:00
|
|
|
if (in_pages) {
|
|
|
|
p9_release_pages(in_pages, in_nr_pages);
|
|
|
|
atomic_sub(in_nr_pages, &vp_pinned);
|
|
|
|
}
|
|
|
|
if (out_pages) {
|
|
|
|
p9_release_pages(out_pages, out_nr_pages);
|
|
|
|
atomic_sub(out_nr_pages, &vp_pinned);
|
|
|
|
}
|
|
|
|
/* wakeup anybody waiting for slots to pin pages */
|
|
|
|
wake_up(&vp_wq);
|
|
|
|
}
|
2016-08-03 16:59:47 +00:00
|
|
|
kvfree(in_pages);
|
|
|
|
kvfree(out_pages);
|
2018-08-14 17:43:42 +00:00
|
|
|
if (!kicked) {
|
|
|
|
/* reply won't come */
|
2022-07-04 01:08:18 +00:00
|
|
|
p9_req_put(client, req);
|
2018-08-14 17:43:42 +00:00
|
|
|
}
|
2011-08-16 05:20:10 +00:00
|
|
|
return err;
|
2007-10-23 18:47:31 +00:00
|
|
|
}
|
|
|
|
|
2010-03-06 04:44:15 +00:00
|
|
|
static ssize_t p9_mount_tag_show(struct device *dev,
|
|
|
|
struct device_attribute *attr, char *buf)
|
|
|
|
{
|
|
|
|
struct virtio_chan *chan;
|
|
|
|
struct virtio_device *vdev;
|
2018-08-03 09:22:20 +00:00
|
|
|
int tag_len;
|
2010-03-06 04:44:15 +00:00
|
|
|
|
|
|
|
vdev = dev_to_virtio(dev);
|
|
|
|
chan = vdev->priv;
|
2018-08-03 09:22:20 +00:00
|
|
|
tag_len = strlen(chan->tag);
|
2010-03-06 04:44:15 +00:00
|
|
|
|
2018-08-03 09:22:20 +00:00
|
|
|
memcpy(buf, chan->tag, tag_len + 1);
|
2015-01-27 13:00:19 +00:00
|
|
|
|
2018-08-03 09:22:20 +00:00
|
|
|
return tag_len + 1;
|
2010-03-06 04:44:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static DEVICE_ATTR(mount_tag, 0444, p9_mount_tag_show, NULL);
|
|
|
|
|
2008-03-05 13:08:09 +00:00
|
|
|
/**
|
|
|
|
* p9_virtio_probe - probe for existence of 9P virtio channels
|
|
|
|
* @vdev: virtio device to probe
|
|
|
|
*
|
2010-02-15 17:27:01 +00:00
|
|
|
* This probes for existing virtio channels.
|
2008-03-05 13:08:09 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2008-02-07 01:25:58 +00:00
|
|
|
static int p9_virtio_probe(struct virtio_device *vdev)
|
2007-10-23 18:47:31 +00:00
|
|
|
{
|
2010-03-06 04:44:14 +00:00
|
|
|
__u16 tag_len;
|
|
|
|
char *tag;
|
2007-10-23 18:47:31 +00:00
|
|
|
int err;
|
|
|
|
struct virtio_chan *chan;
|
|
|
|
|
2015-01-12 14:23:37 +00:00
|
|
|
if (!vdev->config->get) {
|
|
|
|
dev_err(&vdev->dev, "%s failure: config access disabled\n",
|
|
|
|
__func__);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
2010-02-15 17:27:01 +00:00
|
|
|
chan = kmalloc(sizeof(struct virtio_chan), GFP_KERNEL);
|
|
|
|
if (!chan) {
|
2011-11-28 18:40:46 +00:00
|
|
|
pr_err("Failed to allocate virtio 9P channel\n");
|
2007-10-23 18:47:31 +00:00
|
|
|
err = -ENOMEM;
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
2008-02-07 01:25:58 +00:00
|
|
|
chan->vdev = vdev;
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2008-02-07 01:25:58 +00:00
|
|
|
/* We expect one virtqueue, for requests. */
|
2009-06-13 04:16:36 +00:00
|
|
|
chan->vq = virtio_find_single_vq(vdev, req_done, "requests");
|
2008-02-07 01:25:58 +00:00
|
|
|
if (IS_ERR(chan->vq)) {
|
|
|
|
err = PTR_ERR(chan->vq);
|
2018-07-18 02:14:45 +00:00
|
|
|
goto out_free_chan;
|
2007-10-23 18:47:31 +00:00
|
|
|
}
|
2008-02-07 01:25:58 +00:00
|
|
|
chan->vq->vdev->priv = chan;
|
|
|
|
spin_lock_init(&chan->lock);
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2008-02-07 01:25:58 +00:00
|
|
|
sg_init_table(chan->sg, VIRTQUEUE_NUM);
|
2007-10-23 18:47:31 +00:00
|
|
|
|
|
|
|
chan->inuse = false;
|
2010-03-06 04:44:14 +00:00
|
|
|
if (virtio_has_feature(vdev, VIRTIO_9P_MOUNT_TAG)) {
|
2013-10-14 07:41:51 +00:00
|
|
|
virtio_cread(vdev, struct virtio_9p_config, tag_len, &tag_len);
|
2010-03-06 04:44:14 +00:00
|
|
|
} else {
|
|
|
|
err = -EINVAL;
|
|
|
|
goto out_free_vq;
|
|
|
|
}
|
2018-08-03 09:22:20 +00:00
|
|
|
tag = kzalloc(tag_len + 1, GFP_KERNEL);
|
2010-03-06 04:44:14 +00:00
|
|
|
if (!tag) {
|
|
|
|
err = -ENOMEM;
|
|
|
|
goto out_free_vq;
|
|
|
|
}
|
2013-10-14 07:41:51 +00:00
|
|
|
|
|
|
|
virtio_cread_bytes(vdev, offsetof(struct virtio_9p_config, tag),
|
|
|
|
tag, tag_len);
|
2010-03-06 04:44:14 +00:00
|
|
|
chan->tag = tag;
|
2010-03-06 04:44:15 +00:00
|
|
|
err = sysfs_create_file(&(vdev->dev.kobj), &dev_attr_mount_tag.attr);
|
|
|
|
if (err) {
|
2010-09-30 01:33:41 +00:00
|
|
|
goto out_free_tag;
|
2010-03-06 04:44:15 +00:00
|
|
|
}
|
2010-09-30 01:33:41 +00:00
|
|
|
chan->vc_wq = kmalloc(sizeof(wait_queue_head_t), GFP_KERNEL);
|
|
|
|
if (!chan->vc_wq) {
|
|
|
|
err = -ENOMEM;
|
2021-05-17 08:35:57 +00:00
|
|
|
goto out_remove_file;
|
2010-09-30 01:33:41 +00:00
|
|
|
}
|
|
|
|
init_waitqueue_head(chan->vc_wq);
|
|
|
|
chan->ring_bufs_avail = 1;
|
2011-03-18 22:49:48 +00:00
|
|
|
/* Ceiling limit to avoid denial of service attacks */
|
|
|
|
chan->p9_max_pages = nr_free_buffer_pages()/4;
|
2010-09-30 01:33:41 +00:00
|
|
|
|
2014-10-14 23:52:31 +00:00
|
|
|
virtio_device_ready(vdev);
|
|
|
|
|
2010-02-15 17:27:01 +00:00
|
|
|
mutex_lock(&virtio_9p_lock);
|
|
|
|
list_add_tail(&chan->chan_list, &virtio_chan_list);
|
|
|
|
mutex_unlock(&virtio_9p_lock);
|
2013-08-11 04:53:45 +00:00
|
|
|
|
|
|
|
/* Let udev rules use the new mount_tag attribute. */
|
|
|
|
kobject_uevent(&(vdev->dev.kobj), KOBJ_CHANGE);
|
|
|
|
|
2007-10-23 18:47:31 +00:00
|
|
|
return 0;
|
|
|
|
|
2021-05-17 08:35:57 +00:00
|
|
|
out_remove_file:
|
|
|
|
sysfs_remove_file(&vdev->dev.kobj, &dev_attr_mount_tag.attr);
|
2010-09-30 01:33:41 +00:00
|
|
|
out_free_tag:
|
|
|
|
kfree(tag);
|
2008-02-07 01:25:58 +00:00
|
|
|
out_free_vq:
|
2009-06-13 04:16:36 +00:00
|
|
|
vdev->config->del_vqs(vdev);
|
2018-07-18 02:14:45 +00:00
|
|
|
out_free_chan:
|
2010-02-15 17:27:01 +00:00
|
|
|
kfree(chan);
|
2007-10-23 18:47:31 +00:00
|
|
|
fail:
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2008-03-05 13:08:09 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* p9_virtio_create - allocate a new virtio channel
|
2008-10-13 23:45:25 +00:00
|
|
|
* @client: client instance invoking this transport
|
2008-03-05 13:08:09 +00:00
|
|
|
* @devname: string identifying the channel to connect to (unused)
|
|
|
|
* @args: args passed from sys_mount() for per-transport options (unused)
|
|
|
|
*
|
|
|
|
* This sets up a transport channel for 9p communication. Right now
|
2021-12-16 06:14:39 +00:00
|
|
|
* we only match the first available channel, but eventually we could look up
|
2007-10-23 18:47:31 +00:00
|
|
|
* alternate channels by matching devname versus a virtio_config entry.
|
|
|
|
* We use a simple reference count mechanism to ensure that only a single
|
2008-03-05 13:08:09 +00:00
|
|
|
* mount has a channel open at a time.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2008-10-13 23:45:25 +00:00
|
|
|
static int
|
|
|
|
p9_virtio_create(struct p9_client *client, const char *devname, char *args)
|
2007-10-23 18:47:31 +00:00
|
|
|
{
|
2010-02-15 17:27:01 +00:00
|
|
|
struct virtio_chan *chan;
|
2010-02-15 17:27:02 +00:00
|
|
|
int ret = -ENOENT;
|
2010-02-15 17:27:01 +00:00
|
|
|
int found = 0;
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2018-07-27 11:05:58 +00:00
|
|
|
if (devname == NULL)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2008-03-07 17:39:13 +00:00
|
|
|
mutex_lock(&virtio_9p_lock);
|
2010-02-15 17:27:01 +00:00
|
|
|
list_for_each_entry(chan, &virtio_chan_list, chan_list) {
|
2018-08-03 09:22:20 +00:00
|
|
|
if (!strcmp(devname, chan->tag)) {
|
2010-02-15 17:27:00 +00:00
|
|
|
if (!chan->inuse) {
|
|
|
|
chan->inuse = true;
|
2010-02-15 17:27:01 +00:00
|
|
|
found = 1;
|
2010-02-15 17:27:00 +00:00
|
|
|
break;
|
|
|
|
}
|
2010-02-15 17:27:02 +00:00
|
|
|
ret = -EBUSY;
|
2007-10-23 18:47:31 +00:00
|
|
|
}
|
|
|
|
}
|
2008-03-07 17:39:13 +00:00
|
|
|
mutex_unlock(&virtio_9p_lock);
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2010-02-15 17:27:01 +00:00
|
|
|
if (!found) {
|
2015-09-03 08:06:51 +00:00
|
|
|
pr_err("no channels available for device %s\n", devname);
|
2010-02-15 17:27:02 +00:00
|
|
|
return ret;
|
2008-02-07 01:25:58 +00:00
|
|
|
}
|
|
|
|
|
2008-10-13 23:45:25 +00:00
|
|
|
client->trans = (void *)chan;
|
2010-01-16 00:54:03 +00:00
|
|
|
client->status = Connected;
|
2008-10-13 23:45:23 +00:00
|
|
|
chan->client = client;
|
2007-10-23 18:47:31 +00:00
|
|
|
|
2008-10-13 23:45:25 +00:00
|
|
|
return 0;
|
2007-10-23 18:47:31 +00:00
|
|
|
}
|
|
|
|
|
2008-03-05 13:08:09 +00:00
|
|
|
/**
|
|
|
|
* p9_virtio_remove - clean up resources associated with a virtio device
|
|
|
|
* @vdev: virtio device to remove
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2008-02-07 01:25:04 +00:00
|
|
|
static void p9_virtio_remove(struct virtio_device *vdev)
|
|
|
|
{
|
|
|
|
struct virtio_chan *chan = vdev->priv;
|
2015-03-12 01:23:41 +00:00
|
|
|
unsigned long warning_time;
|
2010-02-15 17:27:01 +00:00
|
|
|
|
|
|
|
mutex_lock(&virtio_9p_lock);
|
2015-03-12 01:23:41 +00:00
|
|
|
|
|
|
|
/* Remove self from list so we don't get new users. */
|
2010-02-15 17:27:01 +00:00
|
|
|
list_del(&chan->chan_list);
|
2015-03-12 01:23:41 +00:00
|
|
|
warning_time = jiffies;
|
|
|
|
|
|
|
|
/* Wait for existing users to close. */
|
|
|
|
while (chan->inuse) {
|
|
|
|
mutex_unlock(&virtio_9p_lock);
|
|
|
|
msleep(250);
|
|
|
|
if (time_after(jiffies, warning_time + 10 * HZ)) {
|
|
|
|
dev_emerg(&vdev->dev,
|
|
|
|
"p9_virtio_remove: waiting for device in use.\n");
|
|
|
|
warning_time = jiffies;
|
|
|
|
}
|
|
|
|
mutex_lock(&virtio_9p_lock);
|
|
|
|
}
|
|
|
|
|
2010-02-15 17:27:01 +00:00
|
|
|
mutex_unlock(&virtio_9p_lock);
|
2015-03-12 01:23:41 +00:00
|
|
|
|
2021-10-13 10:55:44 +00:00
|
|
|
virtio_reset_device(vdev);
|
2015-03-12 01:23:41 +00:00
|
|
|
vdev->config->del_vqs(vdev);
|
|
|
|
|
2010-03-06 04:44:15 +00:00
|
|
|
sysfs_remove_file(&(vdev->dev.kobj), &dev_attr_mount_tag.attr);
|
2013-08-11 04:53:45 +00:00
|
|
|
kobject_uevent(&(vdev->dev.kobj), KOBJ_CHANGE);
|
2010-03-06 04:44:14 +00:00
|
|
|
kfree(chan->tag);
|
2010-09-30 01:33:41 +00:00
|
|
|
kfree(chan->vc_wq);
|
2010-02-15 17:27:01 +00:00
|
|
|
kfree(chan);
|
2008-02-07 01:25:04 +00:00
|
|
|
|
|
|
|
}
|
|
|
|
|
2007-10-23 18:47:31 +00:00
|
|
|
static struct virtio_device_id id_table[] = {
|
|
|
|
{ VIRTIO_ID_9P, VIRTIO_DEV_ANY_ID },
|
|
|
|
{ 0 },
|
|
|
|
};
|
|
|
|
|
2010-03-06 04:44:14 +00:00
|
|
|
static unsigned int features[] = {
|
|
|
|
VIRTIO_9P_MOUNT_TAG,
|
|
|
|
};
|
|
|
|
|
2007-10-23 18:47:31 +00:00
|
|
|
/* The standard "struct lguest_driver": */
|
|
|
|
static struct virtio_driver p9_virtio_drv = {
|
2010-03-06 04:44:14 +00:00
|
|
|
.feature_table = features,
|
|
|
|
.feature_table_size = ARRAY_SIZE(features),
|
|
|
|
.driver.name = KBUILD_MODNAME,
|
|
|
|
.driver.owner = THIS_MODULE,
|
|
|
|
.id_table = id_table,
|
|
|
|
.probe = p9_virtio_probe,
|
|
|
|
.remove = p9_virtio_remove,
|
2007-10-23 18:47:31 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct p9_trans_module p9_virtio_trans = {
|
|
|
|
.name = "virtio",
|
|
|
|
.create = p9_virtio_create,
|
2008-10-13 23:45:25 +00:00
|
|
|
.close = p9_virtio_close,
|
2008-10-13 23:45:21 +00:00
|
|
|
.request = p9_virtio_request,
|
2013-03-08 20:43:31 +00:00
|
|
|
.zc_request = p9_virtio_zc_request,
|
2008-10-13 23:45:21 +00:00
|
|
|
.cancel = p9_virtio_cancel,
|
2018-08-14 17:43:42 +00:00
|
|
|
.cancelled = p9_virtio_cancelled,
|
2011-08-17 16:56:04 +00:00
|
|
|
/*
|
|
|
|
* We leave one entry for input and one entry for response
|
2021-06-02 06:54:42 +00:00
|
|
|
* headers. We also skip one more entry to accommodate, address
|
2011-08-17 16:56:04 +00:00
|
|
|
* that are not at page boundary, that can result in an extra
|
|
|
|
* page in zero copy.
|
|
|
|
*/
|
|
|
|
.maxsize = PAGE_SIZE * (VIRTQUEUE_NUM - 3),
|
2022-07-15 21:33:09 +00:00
|
|
|
.pooled_rbuffers = false,
|
2013-11-12 16:20:03 +00:00
|
|
|
.def = 1,
|
2008-09-24 21:22:23 +00:00
|
|
|
.owner = THIS_MODULE,
|
2007-10-23 18:47:31 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/* The standard init function */
|
|
|
|
static int __init p9_virtio_init(void)
|
|
|
|
{
|
2019-04-30 11:59:42 +00:00
|
|
|
int rc;
|
|
|
|
|
2010-02-15 17:27:01 +00:00
|
|
|
INIT_LIST_HEAD(&virtio_chan_list);
|
2007-10-23 18:47:31 +00:00
|
|
|
|
|
|
|
v9fs_register_trans(&p9_virtio_trans);
|
2019-04-30 11:59:42 +00:00
|
|
|
rc = register_virtio_driver(&p9_virtio_drv);
|
|
|
|
if (rc)
|
|
|
|
v9fs_unregister_trans(&p9_virtio_trans);
|
|
|
|
|
|
|
|
return rc;
|
2007-10-23 18:47:31 +00:00
|
|
|
}
|
|
|
|
|
2008-02-07 01:25:04 +00:00
|
|
|
static void __exit p9_virtio_cleanup(void)
|
|
|
|
{
|
|
|
|
unregister_virtio_driver(&p9_virtio_drv);
|
2008-09-24 21:22:23 +00:00
|
|
|
v9fs_unregister_trans(&p9_virtio_trans);
|
2008-02-07 01:25:04 +00:00
|
|
|
}
|
|
|
|
|
2007-10-23 18:47:31 +00:00
|
|
|
module_init(p9_virtio_init);
|
2008-02-07 01:25:04 +00:00
|
|
|
module_exit(p9_virtio_cleanup);
|
2021-10-17 13:46:11 +00:00
|
|
|
MODULE_ALIAS_9P("virtio");
|
2007-10-23 18:47:31 +00:00
|
|
|
|
|
|
|
MODULE_DEVICE_TABLE(virtio, id_table);
|
|
|
|
MODULE_AUTHOR("Eric Van Hensbergen <ericvh@gmail.com>");
|
|
|
|
MODULE_DESCRIPTION("Virtio 9p Transport");
|
|
|
|
MODULE_LICENSE("GPL");
|